1.
Introduction
2.
Python Data Structures Cheat Sheet
3.
Most Important Problems!
3.1.
Level 1: Interview Tomorrow 😫
3.1.1.
Number of Islands
3.1.2.
Coin Change
3.1.3.
Minimum Window Substring
3.1.4.
Buying and Selling Stock
3.1.5.
Range Sum Query (Deprecated)
3.1.6.
Merge Intervals
3.1.7.
Maximum Subarray
3.2.
Level 2: Week to Prepare 😬
3.2.1.
Range Sum Query Mutable (Deprecated)
3.2.2.
Word Search II (Deprecated)
3.2.3.
Task Scheduler
3.2.4.
Non-overlapping Intervals (Deprecated)
3.2.5.
Preorder Serialization Verification of a Binary Tree (Deprecated)
3.3.
Level 3: Sixth Sense Problems 🧐
3.3.1.
Find the Duplicate Number (Deprecated)
3.3.2.
Construct Binary Tree from Preorder and Inorder Traversal
3.3.3.
Decode Ways (Deprecated)
3.3.4.
Jump Game II (Deprecated)
3.3.5.
Find the Edit Distance Between Two Words (Deprecated)
4.
More Practice Problems
4.1.
String
4.1.1.
Longest Substring Without Repeating Characters
4.1.2.
Longest Repeating Character Replacement
4.1.3.
Valid Anagram
4.1.4.
Group Anagrams
4.1.5.
Valid Parentheses
4.1.6.
Valid Palindrome
4.1.7.
Longest Palindromic Substring
4.1.8.
Palindromic Substrings
4.1.9.
Longest Palindrome
4.1.10.
String to Integer (atoi)
4.1.11.
Find All Anagrams in a String
4.2.
Array
4.2.1.
Two Sum
4.2.2.
Contains Duplicate
4.2.3.
Product of Array Except Self
4.2.4.
Maximum Product Subarray
4.2.5.
Find Minimum in Rotated Sorted Array
4.2.6.
Search in Rotated Sorted Array
4.2.7.
3Sum
4.2.8.
Container With Most Water
4.2.9.
Majority Element
4.2.10.
Sort Colors
4.2.11.
Trapping Rain Water
4.3.
Dynamic Programming
4.3.1.
Climbing Stairs
4.3.2.
Longest Increasing Subsequence
4.3.3.
Longest Common Subsequence
4.3.4.
Word Break Problem
4.3.5.
Combination Sum IV
4.3.6.
House Robber
4.3.7.
House Robber II
4.3.8.
Unique Paths
4.3.9.
Jump Game
4.3.10.
01 Matrix
4.3.11.
Partition Equal Subset Sum
4.3.12.
Combination Sum
4.4.
Interval
4.4.1.
Insert Interval
4.5.
Graph
4.5.1.
Clone Graph
4.5.2.
Course Schedule
4.5.3.
Pacific Atlantic Water Flow
4.5.4.
Flood Fill
4.5.5.
Rotting Oranges
4.5.6.
Accounts Merge
4.5.7.
Minimum Height Trees
4.5.8.
Word Ladder
4.6.
Matrix
4.6.1.
Set Matrix Zeroes
4.6.2.
Spiral Matrix
4.6.3.
Rotate Image
4.6.4.
Word Search
4.7.
Tree
4.7.1.
Maximum Depth of Binary Tree
4.7.2.
Same Tree
4.7.3.
Invert/Flip Binary Tree
4.7.4.
Binary Tree Maximum Path Sum
4.7.5.
Binary Tree Level Order Traversal
4.7.6.
Serialize and Deserialize Binary Tree
4.7.7.
Subtree of Another Tree
4.7.8.
Validate Binary Search Tree
4.7.9.
Kth Smallest Element in a BST
4.7.10.
Lowest Common Ancestor of BST
4.7.11.
Implement Trie (Prefix Tree)
4.7.12.
Add and Search Word
4.8.
Binary Tree
4.8.1.
Diameter of Binary Tree
4.8.2.
Lowest Common Ancestor of a Binary Tree
4.8.3.
Binary Tree Right Side View
4.9.
Binary Search
4.9.1.
Binary Search
4.9.2.
First Bad Version
4.9.3.
Time Based Key-Value Store
4.9.4.
Maximum Profit in Job Scheduling
4.10.
Binary Search Tree
4.10.1.
Balanced Binary Search
4.11.
Recursion
4.11.1.
Permutations
4.11.2.
Subsets
4.11.3.
Letter Combinations of a Phone Number
4.12.
Linked List
4.12.1.
Reverse a Linked List
4.12.2.
Detect Cycle in a Linked List
4.12.3.
Merge Two Sorted Lists
4.12.4.
Remove Nth Node From End Of List
4.12.5.
Reorder List
4.12.6.
Middle of the Linked List
4.12.7.
LRU Cache
4.13.
Hash Table
4.13.1.
Ransom Note
4.14.
Stack
4.14.1.
Implement Queue using Stacks
4.14.2.
Evaluate Reverse Polish Notation
4.14.3.
Min Stack
4.14.4.
Basic Calculator
4.14.5.
Largest Rectangle in Histogram
4.15.
Heap
4.15.1.
Merge K Sorted Lists
4.15.2.
Top K Frequent Elements
4.15.3.
Find Median from Data Stream
4.15.4.
K Closest Points to Origin
4.16.
Binary
4.16.1.
Sum of Two Integers
4.16.2.
Number of 1 Bits
4.16.3.
Counting Bits
4.16.4.
Missing Number
4.16.5.
Reverse Bits
4.16.6.
Add Binary
5.
Meta
5.1.
Valid Word Abbreviation
5.2.
Valid Palindrome II
5.3.
Range Sum of BST
5.4.
Moving Average from Data Stream
5.5.
Diameter of Binary Tree
5.6.
Closest Binary Search Tree Value
5.7.
Binary Tree Vertical Order Traversal
5.8.
Minimum Remove to Make Valid Parentheses
5.9.
Lowest Common Ancestor of a Binary Tree III
5.10.
Nested List Weight Sum
5.11.
Dot Product of Two Sparse Vectors
5.12.
Buildings With an Ocean View
5.13.
Basic Calculator II
5.14.
Random Pick with Weight
5.15.
Kth Largest Element in an Array
5.16.
Simplify Path
5.17.
Convert Binary Search Tree to Sorted Doubly Linked List
5.18.
Lowest Common Ancestor of a Binary Tree
5.19.
Minimum Add to Make Parentheses Valid
5.20.
Pow(x, n)
5.21.
Sum Root to Leaf Numbers
5.22.
K Closest Points to Origin
5.23.
Find Peak Element
5.24.
Insert into a Sorted Circular Linked List
5.25.
Binary Tree Right Side View
5.26.
Interval List Intersections
5.27.
Custom Sort String
5.28.
Shortest Path in Binary Matrix
5.29.
Merge Intervals
5.30.
Group Shifted Strings
5.31.
LRU Cache
5.32.
Exclusive Time of Functions
5.33.
Maximum Swap
5.34.
Random Pick Index
5.35.
Copy List with Random Pointer
5.36.
Subarray Sum Equals K
5.37.
Diagonal Traverse
5.38.
Next Permutation
5.39.
Top K Frequent Elements
5.40.
3Sum
5.41.
Max Consecutive Ones III
5.42.
All Nodes Distance K in Binary Tree
5.43.
Accounts Merge
5.44.
Design Tic-Tac-Toe
5.45.
Product of Two Run-Length Encoded Arrays
5.46.
Number of Islands
5.47.
Clone Graph
5.48.
Continuous Subarray Sum
5.49.
Minimum Insertions to Balance a Parentheses String
5.50.
Binary Search Tree Iterator
5.51.
Find K Closest Elements
5.52.
Count and Say
5.53.
Course Schedule
5.54.
Letter Combinations of a Phone Number
5.55.
Friends Of Appropriate Ages
5.56.
Task Scheduler II
5.57.
Range Sum Query 2D - Immutable
5.58.
Max Area of Island
5.59.
Kth Smallest Element in a Sorted Matrix
5.60.
Minesweeper
5.61.
Stickers to Spell Word
5.62.
Valid Number
5.63.
Making A Large Island
5.64.
Vertical Order Traversal of a Binary Tree
5.65.
Merge k Sorted Lists
6.
Google
6.1.
Odd Even Jump
6.2.
Maximal Rectangle
6.3.
Find Number of Coins to Place in Tree Nodes
6.4.
Smallest Sufficient Team
6.5.
Sum of Distances in Tree
6.6.
Maximum Strictly Increasing Cells in a Matrix
6.7.
Longest String Chain
6.8.
Arithmetic Slices
6.9.
Arithmetic Slices II - Subsequence
6.10.
Constrained Subsequence Sum
Light
Rust
Coal
Navy
Ayu
Interviewing Notes
Heap