The Algorithms and Data Structures Interview Crash Course

Takeaway Skills

Master the art of writing bug-free binary search

Understand the inner workings of recursion and depth-first search

Learn how to solve any combinatorial problems with backtracking

Understand how breadth-first search works and how to apply the template to solve tree and graph problems

Understand the two pointer technique and apply it to different scenarios

Gain a deep understanding of how heap and priority queue works and can be used to solve interview problems

Understand and practice the most common interview questions such as interval problems and LRU cache

Learn to implement the algorithms quickly and bug-free using our templates

Most importantly, you will learn the generalized thinking process to solve any interview problem

Master the art of writing bug-free binary search

Understand the inner workings of recursion and depth-first search

Learn how to solve any combinatorial problems with backtracking

Understand how breadth-first search works and how to apply the template to solve tree and graph problems

Understand the two pointer technique and apply it to different scenarios

Gain a deep understanding of how heap and priority queue works and can be used to solve interview problems

Understand and practice the most common interview questions such as interval problems and LRU cache

Learn to implement the algorithms quickly and bug-free using our templates

Most importantly, you will learn the generalized thinking process to solve any interview problem

Course Overview

Algorithms and data structures are the standard software engineering interview topics today, and the questions are rapidly getting harder. This course helps you master the algorithms and data structures interview. We have gone through hundreds of interview questions and distilled them... See More

How You'll Learn

Hands-on coding environments

You don’t get better at swimming by watching others. Coding is no different. Practice as you learn with live code environments inside your browser.

Faster than videos

Videos are holding you back. The average video tutorial is spoken at 150 words per minute, while you can read at 250. That‘s why our courses are text-based.

No set-up required

Start learning immediately instead of fiddling with SDKs and IDEs. It‘s all on the cloud.

Progress you can show

Built in assessments let you test your skills. Completion certificates let you show them off.

Hands-on coding environments

You don’t get better at swimming by watching others. Coding is no different. Practice as you learn with live code environments inside your browser.

Faster than videos

Videos are holding you back. The average video tutorial is spoken at 150 words per minute, while you can read at 250. That‘s why our courses are text-based.

No set-up required

Start learning immediately instead of fiddling with SDKs and IDEs. It‘s all on the cloud.

Progress you can show

Built in assessments let you test your skills. Completion certificates let you show them off.

Course Contents

Hide All

Hide All Lessons

1. Getting Started

Who Should Take This Course?

How to Study the Course Material?

2. Binary Search

Binary Search Basics

Finding the Boundary

First Element Not Smaller Than Target

First Occurrence

Square Root

Find Minimum in Rotated Sorted Array

The Peak of a Mountain Array

Quiz

3. Depth-first Search

Recursion

DFS Fundamentals

DFS on a Tree: Introduction

The Max Depth of Binary Tree

Visible Tree Node

Valid Binary Search Tree

Serializing and Deserializing Binary Tree

Lowest Common Ancestor

Quiz

4. Backtracking

Combinatorial Search: DFS with States

Backtracking Fundamentals

Permutations

Phone Number Letter Permutations

Memoization

Word Break

Decode String

Quiz

5. Breadth-first Search on Trees

BFS Fundamentals

Binary Tree Level Order Traversal

Binary Tree ZigZag Level Order Traversal

Binary Tree Right Side View

Binary Tree Min Depth

Binary Tree Distance K from Target Node

Quiz

6. Depth-first Search and Breadth-first Search on Graphs

Graph Fundamentals

BFS on Graphs

DFS on Graphs

BFS or DFS

Matrix as Graph

Shortest Path [BFS]

Word Ladder

Flood Fill

Number of Islands

Knight Minimum Moves

Course Schedule

Quiz

7. Two Pointers

Remove Duplicates [Same Direction]

Middle of Linked List

Move Zeros [Same Direction]

Two Sum Sorted [Opposite Direction]

Valid Palindrome [Opposite Direction]

Trapping Rain Water [Opposite Direction]

Longest Substring without Repeating Characters [Sliding Window]

Subarray Sum [Prefix Sum]

Subarray Sum Divisible by K [Prefix Sum]

Quiz

8. Priority Queue/Heap

Priority Queue and Heap

Implementing Heap

K Closest Points

Merge K Sorted Lists

Median of Data Stream [Advanced]

Quiz

9. Other

Sliding Window Maximum

Interval Problems

Merge Intervals

Insert Interval

Meeting Room

LRU Cache

10. Conclusion

Where to Go from Here