Leetcode Catalog
LeetCode 整理
Category
- Arrays & Hashing
- Two Pointers
- Sliding Window
- Stack
- Binary Search
- Linked List
- Trees
- Tries
- Heap
- Backtracking
- Graphs
- Advanced Graphs
- 1D Dynamic Programming
- 2D Dynamic Programming
- Greedy
- Intervals
- Math
- Bit Manipulation
Dynamic Programming
- Fibonacci Numbers
- Climbing Stairs
- House Robber
- Fibonacci Number
- Maximum Alternating Subsequence Sum
一维数组
- Zero / One Knapsack
- Partition Equal Subset Sum
- Target Sum
- Unbounded Knapsack
- Coin Change
- Coin Change II
- Minimum Cost for Tickets
二维数组
- Longest Common Subsequence
- Longest Common Subsequence
- Longest Increasing Subsequence
- Edit Distance
- Distinct Subsequences
- Palindromes
- Longest Palindromic Substring
- Palindromic Substrings
- Longest Palindromic Subsequence
Graph Algorithms
- DFS
- O(n)
- BFS
- O(n)
- Union-Find
- O(nlogn)
- Topological Sort
- Dijkstra's Shortest Path
- ElogV