Project l
Part 1
Introduction
Before We Begin
Basic Data Structures
Array and String
Math
Plus One
Move Zeroes
Rotate Matrix
Sorted Array
Intersection of Two Arrays
Merge Two Sorted Arrays
Median of Two Sorted Arrays
3 Sum
Subarray
Maximum Subarray
Minimum Size Subarray Sum
Two Pointers
Reverse String
Valid Palindrome
Minimum Window Substring
Implement strStr()
String Builder
Reverse Words in a String
Hashing
Hash Function
Linked List
Circular Linked List
Plus One Linked List
Insertion Sort List
Sort List
Stack
Increasing Stack
Min Stack
Trapping Rain Water
Queue
Binary Tree
Tree Traversal w\ DFS
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
Priority Queue (Heap)
Merge K Sorted Lists
Merge K Sorted Arrays
Top K Largest Numbers
Ugly Number
Kth Smallest Element in a Sorted Matrix
Part 2
Divide and Conquer
Recurrence
Tree Method
Master Theorem
Binary Search
Search Position
First Bad Version
Search in a Big Sorted Array
Search for a Range
Search a 2D Matrix
Find Trough\/Peak Element
Search in Rotated Sorted Array
Recover RSA
Square Root
Power
Wood Cut
Sorting
Bubble Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Graph Theory
Depth First Search
Subsets
Permutations
Combinations
Combination Sum
N-Queen
Flip Game
Regex Matching
Generate Parentheses
Word Search
Breadth First Search
Number of Islands
Word Ladder
Topological Sort
Strongly Connected Components
Shortest Paths
Bipartite Graph
Greedy Algorithm
Minimum Spanning Tree
Overlapping Intervals
Dynamic Programming
Fibonacci and Manhattan's Map
Longest Common Subsequence
Longest Palindromic Subsequence
Edit Distance
Matrix Multiplication Parenthesization
Knapsack
Biased Coins K heads
Tree Vertex Cover
Part 3
Advanced Topics
Computational Complexity
NP-completeness
Classic NPC Problems
Proving Problems NPC
Linear Programming
Integer Linear Programming
Randomized Algorithms
Machine Learning
Consistency Model
PAC Learning Model
PAC Examples
Unions of Intervals
Part 4
Advanced Data Structures
Trie
Union Find
Segment Tree
Quadtree
Part 5
System Design
Mini Twitter
References
Powered by
GitBook
Permutations
Permutations
Question (
LC.46
)
general dfs approach
insertion iterative approach
swapping approach??
Follow Up Question (
LC.47
)
duplicate input
results matching "
"
No results matching "
"