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.

⭐ Kite is a free AI-powered coding assistant that will help you code faster and smarter. The Kite plugin integrates with all the top editors and IDEs to give you smart completions and documentation while you’re typing. We made this YouTube channel and Kite to help you be more productive:

Level up your developer skills by joining Kite’s Developer Community on Facebook ►

Python Technical Interviews Video ►

Bigosheet ►

SUBSCRIBE for more Python tips, tutorials, and project breakdowns! ►

FOLLOW US on Twitter ►


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 🙂

Kite ►
Twitter ►
YouTube ►


Avatar of Kite

By Kite

13 thoughts on “Basic Algorithm Overview – MUST Know For Coding Interviews (2020)”
  1. 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?

  2. 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 .

Leave a Reply

Your email address will not be published.

Captcha loading...