The 10 Most Important Concepts For Coding Interviews (algorithms and data structures)

Here are the 10 most important concepts, algorithms, and data structures to know for coding interviews. If you want to ace your coding interviews as a software engineer, make sure to master all of these topics during your coding interview preparation.

[Naaz-]

Summary
1. Logarithm (Complexity Analysis)
2. Graph Traversals (BFS & DFS)
3. Binary Search
4. Sliding Window
5. Recursion
6. 2 Algorithms (Inverting a binary tree & Reverse a Linked List)
7. Suffix Trees
8. Heaps
9. DP
10. Sorting Algorithms (Quick & Merge)

[prakaaashh]

00:00 Intro
1 1:11 Logarithm
2 1:57 Graph Traversal
3 2:36 Binary Search
4 3:38 Sliding Window Techniques
5 4:45 Recursion
6 6:15 2Algorithms
7 8:12 Suffix Tree
8 9:06 Heaps
9 10:11 DP
10 11:01 Sorting

[ravasj]

Hey Clement! If you ever read this, I just wanted to let you know how much your videos have helped me!. As a high school student, I legit didnt know anything up until like a year back. I plan on buying algoexpert next year and finish it before my high school grad. Thank you again!

[alieubaldeh]

1. Logarithm
2. Graph Traversal
a. Depth First Search (DFS)
b. Breadth-first search (BFS)
3. Binary Search
4. Sliding Window Technique
5. Recursion
a. Nth Fib
6. Invert binary tree & reversing LinkedList
7. Suffix Trees (advanced)
8. Heaps
a. Min heaps
b. Max heaps
9. Dynamic Programming
10. Sorting Algorithms
a. Quick Sort
b. Merge Sort

[egorushakov]

When I hear coding interviewers, I hear “so do you want to be a software engineer at Google?”

[nick_jacob]

You've made me feel highly unprepared for my Google front end software engineer interview tomorrow. I don't know like 90% of this stuff. I went through their google tech guide, watched all their data structures videos and did a couple of their problems. The stuff is going to take me a long time to learn...What sucks is, I have a bachelors degree and 6 years of experience. I'm able to solve 99% of the problems i've encountered in my day to day job. I just never had a use for learning these more advanced topics.

[citizendot]

Clement: Pays youtube to show ads on other channels.
YouTube: Shows ads on Clement channel and pays him back.

[em]

Really liked the "I won't teach you, I will just let you know that these things exist". For self taught programmers this is one of the best things to share. Thanks for this video - really valuable content :)

[nekroxxigasmith]

Very cool concepts, literally 0% of which will be used after you get the job. Interview WIN

[arnavsaha]

You have seriously created immense value for a very huge crowd by making this video. Thank you.

[whoisthisAdi]

He literally spilled all the contents of algoexpert.

[usurpercries]

I’ve been having trouble finding sources (outside of books) to learn these more intermediate topics. I always thought learning coding tipis from a book would be difficult however I find it to be a better source of information than any other learning medium if tried so far.

[adennis]

I am a frontend engineer right now and I will be for some time cause I enjoy it. But I cant wait to learn all the complex problems behind algorithms and data structures because its a challenge for me.
I find it incredibly difficult but just for challenging myself, I will study all of that and become proficient.
And maybe one day I will decide to switch from web to SWE where I will definitely need those things.

[GabrielAlmeida-pmyq]

Great video, a small mistake at 9:32, find operations for min (in a min-heap) and max (in a max-heap) are constant, not logarithmic.

[kartik_sinha]

1:07 he finally pronounced his surname.

[akashmishra]

Thanks for pointing out Logarithms, I haven't seen this as a suggestion in many interview preparation videos but it has good application in time and space complexities. I need to revise it too, might have forgotten some concepts which were simple long ago.

[harshbhardwaj]

Logarithm (big - o, Complexity, etc)
Graph traversal, tree traversal, matrix traversal (DFS, BFS), Cyloc graph traversal
Binary search
Sliding window technique
Recursion
Inverting a Binary tree, reversing a linked list
Suffix tree (difficult DS)
Heaps, Binary heaps, min heaps, Max heaps
DP
Sorting - Quick sort and merge sort

[abhishek.rathore]

1:30 Logarithms are very useful. One more topic of math thats comes in handy a lot is combinatorics.

[Hirschischnitte]

Hey Clément, I just had a pretty funny idea to make a video of. You and another coder could record a shared coding session. Each person is allowed to code one line of code - then the other person writes the next line (meaningful line)...
The deal is - no one has any clue what the goal of the code is. So maybe both of you will code in the same direction, or not... This might be fun :)

[ybonda]

You're the best, man! I wish you were my university teacher on each subject 10 years ago when I learned for CS BSc