Sorting is enabled. Please click on the title to sort by specific column
| Problem | Classification | Method |
|---|---|---|
| Evaluate Reverse Polish Notation | Math | Stack |
| Max Points on a Line | Count | Map |
| Sort List | List, BST, Graph | Merge Sort |
| LRU Cache | Design | Map, List |
| Binary Tree Postorder Traversal | List, BST, Graph | Stack |
| Binary Tree Preorder Traversal | List, BST, Graph | Stack |
| Reorder List | List, BST, Graph | Divide |
| Linked List Cycle II | List, BST, Graph | Two Pointers |
| Linked List Cycle | List, BST, Graph | Two Pointers |
| Word Break II | List, BST, Graph | DP |
| Word Break | List, BST, Graph | DP |
| Copy List with Random Pointer | List, BST, Graph | MAP, Copy&Break |
| Single Number II | Math | Bit |
| Single Number | Math | Bit |
| Candy | Math | Stack |
| Gas Station | Math | DP |
| Clone Graph | List, BST, Graph | Map |
| Palindrome Partitioning II | String | DP |
| Palindrome Partitioning | String | DP |
| Surrounded Regions | List, BST, Graph | BST |
| Sum Root to Leaf Numbers | List, BST, Graph | DSF |
| Longest Consecutive Sequence | Math | Set |
| Word Ladder II | List, BST, Graph | BST |
| Word Ladder | List, BST, Graph | BST |
| Valid Palindrome | String | Two Pointers |
| Binary Tree Maximum Path Sum | List, BST, Graph | DFS |
| Best Time to Buy and Sell Stock III | Array | Stack, DP |
| Best Time to Buy and Sell Stock II | Array | |
| Best Time to Buy and Sell Stock | Array | |
| Triangle | Math | DP |
| Pascal's Triangle II | Math | DP |
| Pascal's Triangle | Math | DP |
| Populating Next Right Pointers in Each Node II | List, BST, Graph | Two Pointers |
| Populating Next Right Pointers in Each Node | List, BST, Graph | Two Pointers |
| Distinct Subsequences | String | DP |
| Flatten Binary Tree to Linked List | List, BST, Graph | DFS, Wrapper |
| Path Sum II | List, BST, Graph | DFS |
| Path Sum | List, BST, Graph | DFS |
| Minimum Depth of Binary Tree | List, BST, Graph | DFS |
| Balanced Binary Tree | List, BST, Graph | DFS |
| Convert Sorted List to Binary Search Tree | List, BST, Graph | Divide and Conquer |
| Convert Sorted Array to Binary Search Tree | List, BST, Graph | Divide and Conquer |
| Binary Tree Level Order Traversal II | List, BST, Graph | List |
| Construct Binary Tree from Inorder and Postorder Traversal | List, BST, Graph | Divide and Conquer |
| Construct Binary Tree from Preorder and Inorder Traversal | List, BST, Graph | Divide and Conquer |
| Maximum Depth of Binary Tree | List, BST, Graph | DFS |
| Binary Tree Zigzag Level Order Traversal | List, BST, Graph | BSF, List |
| Binary Tree Level Order Traversal | List, BST, Graph | BSF, List |
| Symmetric Tree | List, BST, Graph | DFS, Divide & Conquer |
| Same Tree | List, BST, Graph | DFS, Divide & Conquer |
| Recover Binary Search Tree | List, BST, Graph | DFS, In-Order, Store |
| Recover Binary Search Tree | List, BST, Graph | DFS, In-Order, Store |
| Validate Binary Search Tree | List, BST, Graph | DFS, In-Order, Store |
| Interleaving String | String | DP |
| Unique Binary Search Trees II | String | DP |
| Unique Binary Search Trees | String | DFS, Divide & Conquer |
| Binary Tree Inorder Traversal | String | DFS, Divide & Conquer |
| Restore IP Addresses | String | DFS |
| Reverse Linked List II | List, BST, Graph | Two Pointers |
| Subsets II | List, BST, Graph | DFS |
| Decode Ways | String, List, BST, Graph | DFS |
| Gray Code | Math, String, List, BST, Graph | DFS, Math |
| Merge Sorted Array | Sort | Merge Sort |
| Scramble String | String, List, BST, Graph | DFS |
| Partition List | List, BST, Graph | Two Pointers |
| Maximal Rectangle | List, BST, Graph | DP |
| Largest Rectangle in Histogram | List, BST, Graph | DP |
| Remove Duplicates from Sorted List II | List, BST, Graph | Two Pointers |
| Remove Duplicates from Sorted List | List, BST, Graph | Two Pointers |
| Search in Rotated Sorted Array II | List, BST, Graph | Divided & Conquer, Binary Search |
| Remove Duplicates from Sorted Array II | List, BST, Graph | Two Pointers |
| Word Search | List, BST, Graph | DFS |
| Subsets | List, BST, Graph | DFS |
| Combinations | List, BST, Graph | DFS |
| Minimum Window Substring | String, List, BST, Graph | Count |
| Sort Colors | Sort, List, BST, Graph | Two Pointers |
| Search a 2D Matrix | List, BST, Graph | Binary Search, Transformation |
| Set Matrix Zeroes | other | other |
| Edit Distance | String, List, BST, Graph | DP |
| Simplify Path | String, List, BST, Graph | DP, Stack |
| Climbing Stairs | List, BST, Graph | DP |
| Sqrt(x) | Math | Binary Search, Bit Manipulation |
| Text Justification | String | Other |
| Plus One | Math | Other |
| Valid Number | String | Other |
| Merge Two Sorted Lists | List, BST, Graph | Merge Sort |
| Minimum Path Sum | List, BST, Graph | DFS |
| Unique Paths II | List, BST, Graph | DP |
| Unique Paths | List, BST, Graph | DP |
| Rotate List | List, BST, Graph | Two Pointers |
| Permutation Sequence | Math | Bit Manipulation |
| Spiral Matrix II | Other | Other |
| Length of Last Word | String | Other |
| Insert Interval | Other | Other |
| Merge Intervals | Other | Other |
| Jump Game | List, BST, Graph | DP |
| Spiral Matrix | Other | Other |
| Maximum Subarray | List, BST, Graph | DP |
| N-Queens II | List, BST, Graph | DFS |
| N-Queens | List, BST, Graph | DFS |
| Pow(x, n) | Math | Bit Manipulation |
| Anagrams | String | Count |
| Rotate Image | Other | Other |
| Permutations II | Math | Other |
| Permutations | Math | Other |
| Jump Game II | List, BST, Graph | DP |
| Wildcard Matching | String, Pattern | Greedy |
| Multiply Strings | Math | Other |
| Trapping Rain Water | Math | DP |
| First Missing Positive | Math | Two Pointers |
| Combination Sum II | Math | DP |
| Combination Sum | Math | DP |
| Count and Say | String | DP |
| Sudoku Solver | List, BST, Graph | Other |
| Valid Sudoku | List, BST, Graph | DFS |
| Search Insert Position | List, BST, Graph | Binary Search |
| Search for a Range | List, BST, Graph | Binary Search |
| Search in Rotated Sorted Array | List, BST, Graph | Binary Search |
| Longest Valid Parentheses | String, List, BST, Graph | DP |
| Next Permutation | Math | Other |
| Substring with Concatenation of All Words | String, List, BST, Graph | DFS |
| Divide Two Integers | Math | Bit Manipulation |
| Implement strStr() | String, Pattern | Brute Force, KMP |
| Remove Element | List, BST, Graph | Two Pointers |
| Remove Duplicates from Sorted Array | List, BST, Graph | Two Pointers |
| Reverse Nodes in k-Group | List, BST, Graph | Two Pointers |
| Swap Nodes in Pairs | List, BST, Graph | Two Pointers |
| Merge k Sorted Lists | List, BST, Graph | Heap, Compare |
| Generate Parentheses | String, List, BST, Graph | DP |
| Valid Parentheses | String, List, BST, Graph | Stack |
| Remove Nth Node From End of List | List, BST, Graph | Two Pointers |
| Letter Combinations of a Phone Number | String, List, BST, Graph | DFS, Backtrace |
| Letter Combinations of a Phone Number | String, List, BST, Graph | DFS, Backtrace |
| 4 Sum | Math, Combination | Two Pointers |
| 3 Sum Closest | Math, Combination | Two Pointers |
| 3 Sum | Math, Combination | Two Pointers |
| Longest Common Prefix | String, List, BST, Graph | |
| Roman to Integer | String | Other, Pattern |
| Integer to Roman | String | Other, Pattern |
| Container With Most Water | List, BST, Graph | Two Pointers, Other |
| Regular Expression Matching | String, List, BST, Graph | DFS, Greedy |
| Palindrome Number | String, List, BST, Graph | Two Pointers |
| String to Integer (atoi) | String | Other |
| Reverse Integer | Math | Overflow |
| ZigZag Conversion | Other | Other |
| Longest Palindromic Substring | String | DP, Manacher's Algorithm |
| Add Two Numbers | Other | Other |
| Longest Substring Without Repeating Characters | String | Two Pointers |
| Median of Two Sorted Arrays | Math | Divide & Conquer |
| 2 Sum | Math | Two Pointers |
No comments:
Post a Comment