Basic Algorithm Overview - MUST Know For Coding Interviews (2020)

In this 5-minute coding interview bootcamp, Caelan walks you through the basic sorting algorithms and data structures that are important to know for any technical interview in software development.

***************************************

***************************************
ADDITIONAL RESOURCES:

6 Python Tips and Tricks YOU Should Know ►

How to NAIL LeetCode Questions– Valid Parentheses ►

Sqlite 3 Python Tutorial in 5 minutes - Creating Database, Tables and Querying►

***************************************
Don’t forget to subscribe :)

STAY TUNED:

[karthikbandi]

I have watched many videos made by abroad youtubers, I experienced from those less information although it is 20 to 30 mins but also vocals were unclear for understanding repeatedly watching the streamline. But this video has made my day. We are expecting more crisp videos such from you keep going.

Didn't know Ryan Gosling is good in algorithms

[aakashjana]

How many algorithms will I mug man.
I do understand them yet if you forget just a single line it could take hours to debug a single error.
I just don't find any point in mugging these algos .

[aidenbooksmith]

Fantastic video! Thank you for this!
I love what you are doing on this channel

[maxwellhunt]

I'm confused. You implied that the fact that binary search needs a sorted list as input doesn't matter because we can sort the list using a method such as merge sort as mentioned earlier. The thing is, using an efficient sorting algorithm followed by a binary search would take O(n * log(n) ) time. Where as doing a simple linear scan takes O(n) time. Why wouldn't you just use the linear scan if the list was unsorted?

[ioohebt]

When I tried to reproduce your code from DFS algorithm, i found that it gives different outputs: (A, B, D, E, C, F, G), (A, B, E, D, C, G, F) and (A, C, F, G, B, E, D). Why is that happens?

[mikashaw]

Great video! Could you please explain why you did right_edge-1 in the binary search algorithm

[gkirts]

The binary search will not work if the search value is 1. The middle will become -1 and return -1 as a result.

[maxfan]

Dude, were you reading a script while recording this video?

[aleksandrteplyuk]

When I tried to reproduce your code from DFS algorithm, i found that it gives different outputs: (A, B, D, E, C, F, G), (A, B, E, D, C, G, F) and (A, C, F, G, B, E, D). Why is that happens?