DSA-200: FAANG Interview Prep

Course syllabus

1. Arrays & Hashing
   1. Contains Duplicate
   2. Encode and Decode Strings
   3. Find All Duplicates in an Array
   4. First Missing Positive
   5. Group Anagrams
   6. Longest Consecutive Sequence
   7. Majority Element
   8. Product of Array Except Self
   9. Subarray Sum Equals K
   10. Top K Frequent Elements
   11. Two Sum II
   12. Two Sum
   13. Valid Anagram
   14. Valid Sudoku
2. Two Pointers
   1. 3Sum
   2. Boats to Save People
   3. Container With Most Water
   4. Merge Sorted Array
   5. Move Zeroes
   6. Next Permutation
   7. Remove Duplicates from Sorted Array
   8. Sort Colors (Dutch National Flag)
   9. Trapping Rain Water
   10. Valid Palindrome
3. Sliding Window
   1. Best Time to Buy and Sell Stock
   2. Fruit Into Baskets
   3. Longest Repeating Character Replacement
   4. Longest Substring Without Repeating Characters
   5. Max Consecutive Ones III
   6. Minimum Size Subarray Sum
   7. Minimum Window Substring
   8. Permutation in String
   9. Sliding Window Maximum
   10. Subarrays with K Different Integers
4. Stack
   1. Asteroid Collision
   2. Car Fleet
   3. Daily Temperatures
   4. Decode String
   5. Evaluate Reverse Polish Notation
   6. Generate Parentheses
   7. Largest Rectangle in Histogram
   8. Longest Valid Parentheses
   9. Maximal Rectangle
   10. Min Stack
   11. Next Greater Element I
   12. Valid Parentheses
5. Binary Search
   1. Binary Search
   2. Capacity To Ship Packages Within D Days
   3. Find First and Last Position of Element
   4. Find Minimum in Rotated Sorted Array
   5. Find Peak Element
   6. Koko Eating Bananas
   7. Median of Two Sorted Arrays
   8. Search a 2D Matrix
   9. Search in Rotated Sorted Array II
   10. Search in Rotated Sorted Array
   11. Split Array Largest Sum
   12. Time Based Key-Value Store
6. Linked List
   1. Add Two Numbers
   2. Copy List with Random Pointer
   3. Linked List Cycle II
   4. Linked List Cycle
   5. LRU Cache
   6. Merge k Sorted Lists
   7. Merge Two Sorted Lists
   8. Remove Nth Node From End of List
   9. Reorder List
   10. Reverse Linked List
7. Trees
   1. All Nodes Distance K in Binary Tree
   2. Balanced Binary Tree
   3. Binary Tree Level Order Traversal
   4. Binary Tree Maximum Path Sum
   5. Construct Tree from Preorder and Inorder
   6. Count Good Nodes in Binary Tree
   7. Diameter of Binary Tree
   8. Invert Binary Tree
   9. Kth Smallest Element in a BST
   10. LCA of Binary Search Tree
   11. Maximum Depth of Binary Tree
   12. Binary Tree Right Side View
   13. Same Tree
   14. Serialize and Deserialize Binary Tree
   15. Subtree of Another Tree
   16. Validate Binary Search Tree
8. Tries
   1. Design Add and Search Words Data Structure
   2. Implement Trie (Prefix Tree)
   3. Longest Word in Dictionary
   4. Replace Words
   5. Word Search II
9. Heap / PQ
   1. Design Twitter
   2. Find Median from Data Stream
   3. IPO
   4. K Closest Points to Origin
   5. Kth Largest Element in an Array
   6. Kth Largest Element in a Stream
   7. Last Stone Weight
   8. Reorganize String
   9. Smallest Range Covering Elements from K Lists
   10. Task Scheduler
10. Backtracking
    1. Combination Sum
    2. Combinations
    3. Letter Combinations of a Phone Number
    4. N-Queens
    5. Palindrome Partitioning
    6. Permutations
    7. Restore IP Addresses
    8. Subsets
    9. Sudoku Solver
    10. Word Search
11. Graphs
    1. 01 Matrix
    2. Clone Graph
    3. Evaluate Division
    4. Graph Valid Tree
    5. Max Area of Island
    6. Number of Connected Components in Undirected Graph
    7. Number of Distinct Islands
    8. Number of Islands
    9. Pacific Atlantic Water Flow
    10. Redundant Connection
    11. Rotting Oranges
    12. Shortest Bridge
    13. Shortest Path in Binary Matrix
    14. Sliding Puzzle
    15. Surrounded Regions
    16. Walls and Gates
    17. Word Ladder
12. Advanced Graphs
    1. Alien Dictionary
    2. Cheapest Flights Within K Stops
    3. Critical Connections in a Network
    4. Find the City With the Smallest Number of Neighbors
    5. Minimum Cost For Tickets
    6. Min Cost to Connect All Points
    7. Minimum Knight Moves
    8. Network Delay Time
    9. Reconstruct Itinerary
    10. Swim in Rising Water
    11. Trapping Rain Water II
13. 1-D DP
    1. Climbing Stairs
    2. Coin Change
    3. Decode Ways
    4. House Robber II
    5. House Robber
    6. Maximum Subarray (Kadane's)
    7. Longest Increasing Subsequence
    8. Longest Palindromic Substring
    9. Maximum Product Subarray
    10. Min Cost Climbing Stairs
    11. Palindromic Substrings
    12. Partition Equal Subset Sum
    13. Perfect Squares
    14. Word Break
14. 2-D DP
    1. Burst Balloons
    2. Cherry Pickup II
    3. Distinct Subsequences
    4. Dungeon Game
    5. Edit Distance
    6. Interleaving String
    7. Longest Common Subsequence
    8. Longest Increasing Path in a Matrix
    9. Longest Palindromic Subsequence
    10. Minimum Cost to Cut a Stick
    11. Ones and Zeroes
    12. Palindrome Partitioning II
    13. Regular Expression Matching
    14. Target Sum
    15. Unique Paths
    16. Wildcard Matching
15. Greedy
    1. Candy
    2. Gas Station
    3. Hand of Straights
    4. Jump Game II
    5. Jump Game
    6. Merge Triplets to Form Target Triplet
    7. Partition Labels
    8. Queue Reconstruction by Height
    9. Task Scheduler (Greedy formulation)
    10. Valid Parenthesis String
16. Intervals
    1. Employee Free Time
    2. Insert Interval
    3. Interval List Intersections
    4. Meeting Rooms II
    5. Meeting Rooms
    6. Merge Intervals
    7. Minimum Interval to Include Each Query
    8. Non-overlapping Intervals
17. Math / Bit
    1. Happy Number
    2. Missing Number
    3. Number of 1 Bits
    4. Pow(x, n)
    5. Rotate Image
    6. Set Matrix Zeroes
    7. Single Number
    8. Spiral Matrix
18. Design / LLD
    1. Design HashMap
    2. Design Tic-Tac-Toe
    3. Design Hit Counter
    4. Insert Delete GetRandom O(1)
    5. LFU Cache

Questions about this course

Is it really free?

Yes. There is no fee and no card is needed. You join with a free site account so your progress is saved.

How long does it take?

It is self-paced, so it depends on you. There are 198 problems across 18 modules, one problem per step.

Is there a certificate?

No. This course doesn't award a certificate.