142 Resources for Mastering Coding Interviews
This software engineering study guide will help you study for your interviews and get any job!

By Ben Rogojan And Shayan
To help you keep track of your progress, we’ve compiled a comprehensive checklist of the same problems listed below; that list can be found here.
Join Our Newsletter
Before scrolling any further, why not join our team’s newsletter to keep up to date on data science, data engineering and tech! Learn more here.
Warm Up With The Classics
How did you do? Take a moment and rate yourself on these classics. We have been asked most of these at some point in the interview process—and often early on as weed-out style questions. They often have less to do with algorithms and data structures, but still require a good understanding of loops and arrays (yes, an array is a data structure).
Algorithms And Data Structures
Pre-Study Problems
Before going through the video content about data structures and algorithms, consider trying out these problems below. See if you can answer them. This will help you know what to focus on.
- 985. Sum of Even Numbers After Queries
- 657. Robot Return to Origin
- 961. N-Repeated Element in Size 2N Array
- 110. Balanced Binary Tree
- 3. Longest Substring Without Repeating Characters
- 19. Remove Nth Node From End of List
- 23. Merge k Sorted Lists
- 31. Next Permutation
Algorithms And Data Structures Videos
Data Structures

- Data Structures & Algorithms #1 — What Are Data Structures? — Video
- Multi-dim — Video
- Dynamic Arrays — Video
- Resizing arrays — Video
- Data Structures: Linked Lists — Video
- Core Linked Lists Vs Arrays — Video
- Pointers to Pointers — Video
- Data Structures: Trees — Video
- Data Structures: Heaps — Video
- Data Structures: Hash Tables — Video
- Phone Book Problem — Video
- Data Structures: Stacks and Queues — Video
- Using Stacks Last-In First-Out — Video
- Data Structures: Crash Course Computer Science #14 — Video
- Data Structures: Tries — Video
Algorithms

- Algorithms: Graph Search, DFS and BFS — Video
- BFS(breadth-first search) and DFS(depth-first search) — Video
- Algorithms: Binary Search — Video
- Binary Search Tree Review — Video
- Python Algorithms for Interviews — Video
- Algorithms: Recursion — Video
- Algorithms: Bubble Sort — Video
- Algorithms: Merge Sort — Video
- Algorithms: Quicksort — Video
Big O Notation
- Introduction to Big O Notation and Time Complexity (Data Structures & Algorithms #7) — Video
- Harvard CS50 — Asymptotic Notation — Video
- A Gentle Introduction to Algorithm Complexity Analysis — Post
- Cheat sheet — Post
Dynamic Programming
- Dynamic Programming (Think Like a Programmer) — Video
- Algorithms: Memoization and Dynamic Programming — Video
- 6.006: Dynamic Programming I: Fibonacci, Shortest Paths — Video
- 6.006: Dynamic Programming II: Text Justification, Blackjack — Video
- Dynamic Programming — Post
String Manipulation
- Coding Interview Question and Answer: Longest Consecutive Characters — Video
- Sedgewick — Substring Search — Video








