Top 10 Algorithms for the Coding Interview (Part 2)

In this video, Techlead and I cover 5 of the top 10 algorithms to know for coding interviews.

[AmanSingh-flwp]

Since the algorithms are not mentioned in the description of the video, here are those.
1. Depth First Search
2. Breadth-First Search
3. Matching Parenthesis
4.Making use of Hash Tables
5. Knowing how to manipulate multiple variables/Pointers at once
6. Reversing a linked list
7.Sorting fundamentals (time complexity, functioning, etc.)
8. Recursion
9. Custom Data structure (ex. suffix tree )
10.Binary Search

[Rahul-Nalawade]

I've been interviewing with Oracle (5 times), Amazon, Google (2 times), Facebook, Mathworks (2 times), and many tier 2 companies. And every word that these two guys said is true and in the perfect order. While preparing for interviews it's important to know that you need to study, but studying different topics in a priority makes your smarter than rest of the world. And this is where we all need to start our preparation. Great insight guys! Thank you.

[hanzhoutang]

“Even tech lead got struggle with reversing linking list.”
“No, it’s not me. It’s somebody who watching the video”
LOL

[MrRubiksguy]

Great vid! I like how you limit the unnecessary fluff and assumptions of knowledge, since these can sometimes obscure the useful info in vids like this

[somebody]

The nostalgia, back when Clement was a small channel and Techlead wasn't an inside meme...

[skhumbuzocele]

At 2:18....The level of pride between Techlead and Algo-expect. Salute!👐

[dhruvshetty]

Dinesh:You did a linear search on a sorted list?
Richard:*sweats nervously*

[EmmnauelPeace]

Learning algorithms and data structures is a key success to know how to program ..The more you learn and implement them the better codes you can write in real time programming .Game programing with ai, machine learning and others stuff helps in keeping you on track as programmer...The core fundamental principles rest on algorithms and data structures..Thanks

[Justdailylife]

This can be perfect blend algoExpert and techLead, I like the way techLead understand the problem of interviewee .

[GauravSharmaSDE]

"It's great to be here.. this is my place after all!!"

[BlueTreeCode]

Solid advice, Clément and TechLead! A really great way to get good at recursion from my personal experience is to practice Binary Tree and Graph problems. A lot of them have more complex iterative solutions, that they end up teaching you recursion by practicing them and going over the solutions.

[royalfinest]

Recursion is a classic algorithm meant to save space and expressiveness, but not meant for performance. Avoid recursion at all cost. They may look elegant, but they don't perform elegant in terms of resources and speed. But ofc, it's still a must-know algorithm for every CS people out there

[zhxiaol]

This cross promotion is brilliant! I got here from part 1 in Techlead and find Clement an awesome dude.

[carlzk]

pretty creative way to promote each other

[Wael]

When I will nail my interview I will absolutely remember your voice and, shake your hands in my mind. you're the InterveiwLead :)

[KyleMcClay]

Haskell solution with recursion
Reverse [] = []
Reverse (x:xs) = reverse xs ++ [x]

[CardinalHijack]

Its so funny how almost all of these algorithms are met with “oh I’ve never had to implement it, I’ve just had people ask questions who are interviewing”. It seems like knowing this stuff is just for passing an interview - why do tech companies test you on it if you never have to do it in the actual job lol.

[tattvabodhaka]

The thing about recursion elegance is vital for pre and post interview scenarios ! Engineers inside the industry do it (and improvise on it) while coding to reduce Cyclic complexity of the production code which plays a significant role in boosting code quality !

[niranjannanda]

I think every time you have to parse something (JSON/XML etc) for a generic use case recursion is the first thing that comes to mind and to be honest it is unavoidable. :)

[fyaa]

If you do not remember to reverse the list with three pointers, just transform it into an array (thanks to parallel programming), reverse it and transform it back to a linked list. Has the same runtime complexity.