Project L
Part 1
Introduction
Before We Begin
Basic Data Structures
Array and String
Math
Plus One
Move Zeroes
Rotate Matrix
Missing Numbers
Find All Numbers Disappeared in an Array
Sorted Array
Median of Two Sorted Arrays
Two to K Sum
Unsorted Array
Partition Array
Kth Largest Element
Sort Colors
Subarray
Maximum Subarray
Two Pointers
L/R Pointers
Reverse String
Valid Palindrome
Implement strStr()
F/S Pointers
P1/P2 Pointers
Intersection of Two Arrays
Merge Two Sorted Arrays
Window
Window Sum
Minimum Size Subarray Sum
Longest Substring Without Repeating Characters
Minimum Window Substring
Longest Substring with At Most K Distinct Characters
String Builder
Reverse Words in a String
Rotated Array
Hashing
Hash Function
Hash Set
Hash Table
Rolling Hash
LSH
Hash Heap
Linked List
Circular Linked List
Doubly Linked List
Plus One Linked List
Insertion Sort List
Sort List
Rotate List
Singly Linked List
Stack
Increasing Stack
Min Stack
Trapping Rain Water
Valid Parenthesis
Queue
Moving Average from Data Stream
Double-ended Queue
Sliding Window Maximum
Binary Tree
Tree Traversal w DFS
Binary Tree Level Order Traversal
Binary Tree Vertical Order Traversal
Binary Tree Serialization
Subtree w\/ Max Avg
Max\/Min Depth of Binary Tree
Balanced Binary Tree
Lowest Common Ancestor
Binary Search Tree
Delete Node in BST
LCA in BST
Search Range in Binary Search Tree
Validate BST
Kth Smallest Element in a BST
Binary Search Tree Iterator
Priority Queue
Merge K Sorted Lists
Merge K Sorted Arrays
Top K Largest Numbers
Ugly Number
Kth Smallest Element in a Sorted Matrix
Sliding Window Median
Part 2
Divide and Conquer
Recursion
Recurrence
Binary Search
Search First/Last Position
Search Insert Position
First Bad Version
Search in a Big Sorted Array
Search for a Range
Search a 2D Matrix
Search a 2D Matrix II
Find Trough/Peak Element
Search in Rotated Sorted Array
Recover RSA
Square Root
Search Insert Position
Copy Book
Sorting
Bubble Sort
Selection Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Graph Theory
Depth First Search
Combinations
Combination Sum
Subsets
Permutations
N-Queen
Flip Game
Regex Matching
Generate Parentheses
Word Search
Factor Combinations
Nested List Weight Sum
Copy List with Random Pointer
The Maze
Breadth First Search
Check Graph Is a Valid Tree
Clone Graph
Number of Islands
Word Ladder
Shortest Path in a Changing Maze
Topological Sort
Course Schedule
Alien Dictionary
Strongly Connected Components
Shortest Paths
Bipartite Graph
Subgraph Matching
Greedy Algorithm
Minimum Spanning Tree
Overlapping Intervals
Teemo Attacking
Dynamic Programming
Coordinate DP
Fibonacci Numbers
Climbing Stairs
House Robber
Unique Paths
Longest Increasing Subsequence
Minimum Path Sum
Manhattan's Map
Maximal Square
Jump Game
Frog Jump
Sequence DP
Paint Fence
Wood Cut
Rod Cutting
Word Break
Longest Common Subsequence
Edit Distance
Interleaving String
Longest Palindromic Subsequence
Distinct Subsequences
Partition DP
Best Time to Buy and Sell Stock
Word Break
Text Justification
Decode Ways
Substring DP
Matrix Multiplication Parenthesization
Scramble String
Burst Balloons
Knapsack
Two Even Sized Sets
Combination Sum IV
K Sum
Game DP
Blackjack
Biased Coins K heads
Coins in a Line
Stone Game
Tree DP
Tree Vertex Cover
K Edit Distance
Part 3
Advanced Topics
Scientific Computing
Computer Arithmetic
Solving Nonlinear Equations
Computational Complexity
Asymptotic Analysis
NP-completeness
Classic NPC Problems
Proving Problems NPC
Linear Programming
Integer Linear Programming
Randomized Algorithms
Machine Learning
Learning Theory
Consistency Model
PAC Learning Model
PAC Examples
Unions of Intervals
Part 4
Advanced Data Structures
Set Data
Union Find
Multidimensional Data
Binary Tree
K-dimensional Tree
Segment Tree
Interval Sum
Range Sum Query
Range Sum Query 2D
The Skyline Problem
Count of Smaller Numbers After Self
Quadtree
Point Quadtree
Matrix Quadtree
Point-Region Quadtree
B-tree
R-Tree
Text Data
Prefix Tree
Suffix Tree
Graph Data
Union Find
Cache Replacement
LRU Cache
LFU Cache
Part 5
System Design
Mini Twitter
Design TinyURL
Object Oriented Design
References
Powered by
GitBook
Hashing
Hash
Hashing requires space. Hash is fast. Like really fast.
results matching "
"
No results matching "
"