• Breadth First Search
• Topological Sort
• ☆ 207. Course Schedule ☆
• ☆☆☆ 210. Course Schedule II ☆☆☆
• ☆☆ 261. Graph Valid Tree ☆☆
• ☆☆☆ 279 Perfect Squares ☆☆☆
• ☆☆☆ 622 Implement a Queue ☆☆☆
• ☆☆☆ 662 Maximum Width of Binary Tree ☆☆☆
• ☆☆ 752. Open the Lock ☆☆
• ☆☆ 剑指Offer 09. Implement a queue by two stack ☆☆
• ☆☆ 剑指Offer 55. Depth of Binary Tree ☆☆

• Topological Sort
• ☆ 020. Valid Parentheses ☆
• ☆☆☆ 094. Binary Tree Inorder Traversal ☆☆☆
• ☆☆ 125 Valid Palindrome ☆☆
• ☆☆ 144. Binary Tree Preorder Traversal ☆☆
• ☆☆ 145. Binary Tree Postorder Traversal ☆☆
• ☆ 150. Evaluate Reverse Polish Notation ☆
• ☆☆☆ 155. Min Stack (同面试题 03.02) ☆☆☆
• ☆☆☆ 210. Course Schedule II ☆☆☆
• ☆☆☆ 739. Daily Temperatures ☆☆☆
• ☆☆ 剑指Offer 09. Implement a queue by two stack ☆☆

• Prim Algorithm for MST
• Dijkstra Algorithm for SSSP
• ☆☆☆ 253. Meeting Rooms II ☆☆☆
• ☆☆ 743. Network Delay Time ☆☆
• ☆☆☆ 1094. Car Pooling ☆☆☆
• ☆☆☆ 1167. Minimum Cost to Connect Sticks ☆☆☆
• ☆☆☆ 剑指Offer 40. Minimum K ☆☆☆

• ☆☆ 001. Two Sum ☆☆
• ☆☆ 017. Letter Combination of a Phone Number ☆☆
• ☆ 020. Valid Parentheses ☆
• ☆☆☆ 105 Construct Binary Tree from Preorder and Inorder (同剑指Offer 07) ☆☆☆
• ☆☆☆ 146 LRU Cache (同面试题16.25) ☆☆☆
• ☆☆☆ 169. Majority Element ☆☆☆ (同剑指offer 39)
• ☆☆ 242. Valid Anagram ☆☆
• ☆☆☆ 706. Design Hashmap ☆☆☆

• ☆☆☆ 003. Longest Substring ☆☆☆
• ☆☆☆ 128. Longest Consecutive Sequence ☆☆☆
• ☆☆ 349. Intersection of Two Arrays ☆☆
• ☆ 剑指Offer 03. Duplicate Num in Array ☆
• ☆☆☆ 剑指Offer-56-I. The number of occurrences of a number in an array ☆☆☆

• Kruskal Algorithm for MST
• ☆☆ 130. Surrounded Regions ☆☆
• ☆☆☆ 200. Number of Islands ☆☆☆
• ☆☆ 261. Graph Valid Tree ☆☆
• ☆☆ 323. Number of Connected Components in an Undirected Graph ☆☆☆
• ☆☆ 547. Number of Provinces ☆☆
• ☆☆☆ 684. Redundant Connection ☆☆☆
• ☆☆ 721. Accounts Merge ☆☆
• ☆☆☆ 990. Satisfiability of Equality Equations ☆☆☆

• ☆☆ 002. Add Two Numbers ☆☆
• ☆☆ 021. Merge Two Sorted Lists （同剑指Offer 25）☆☆
• ☆☆☆ 146 LRU Cache (同面试题16.25) ☆☆☆
• ☆☆☆ 148. Sort List ☆☆☆
• ☆☆☆ 206. Reverse LinkList (同剑指Offer 24) ☆☆☆
• ☆ 剑指Offer 18. Delete Element in LinkList ☆

• ☆☆☆ 094. Binary Tree Inorder Traversal ☆☆☆
• ☆☆☆ 105. Construct Binary Tree from Preorder and Inorder (同剑指Offer 07) ☆☆☆
• ☆☆ 144. Binary Tree Preorder Traversal ☆☆
• ☆☆ 145. Binary Tree Postorder Traversal ☆☆
• ☆☆☆ 662. Maximum Width of Binary Tree ☆☆☆
• ☆☆ 958. Check Completeness of a Binary Tree ☆☆
• ☆☆ 剑指Offer 55. Depth of Binary Tree ☆☆

• Breadth First Search
• Depth First Search
• Topological Sort
• Strongly Connected Components
• Prim Algorithm for MST
• Kruskal Algorithm for MST
• Dijkstra Algorithm for SSSP
• ☆ 207. Course Schedule ☆
• ☆☆☆ 210. Course Schedule II ☆☆☆
• ☆☆ 261. Graph Valid Tree ☆☆
• ☆☆ 323. Number of Connected Components in an Undirected Graph ☆☆☆
• ☆☆☆ 329. Longest Increasing Path in a Metrix ☆☆☆
• ☆☆ 547. Number of Provinces ☆☆
• ☆☆☆ 684. Redundant Connection ☆☆☆
• ☆☆ 743. Network Delay Time ☆☆

• Breadth First Search
• ☆☆ 261. Graph Valid Tree ☆☆
• ☆☆☆ 279. Perfect Squares ☆☆☆
• ☆☆ 752. Open the Lock ☆☆
• ☆☆☆ 329. Longest Increasing Path in a Metrix ☆☆☆

• Depth First Search
• Strongly Connected Components
• ☆☆ 017. Letter Combination of a Phone Number ☆☆
• ☆☆ 022. Generate Parenthesis ☆☆
• ☆☆☆ 037. Sudoku Solver ☆☆☆
• ☆☆ 039. Combination Sum ☆☆
• ☆☆☆ 040. Combination Sum II ☆☆☆
• ☆☆ 046. Permutations ☆☆
• ☆☆ 047. Permutation II ☆☆
• ☆☆ 051. N-Queens ☆☆
• ☆☆☆ 060. Permutation Sequence ☆☆☆
• ☆☆ 077. Combinations ☆☆
• ☆☆ 078. Subsets ☆☆
• ☆☆☆ 090. Subsets II ☆☆☆
• ☆☆ 093. Restore IP Addresses ☆☆
• ☆☆☆ 200. Number of Islands ☆☆☆
• ☆☆ 261. Graph Valid Tree ☆☆
• ☆☆☆ 329. Longest Increasing Path in a Metrix ☆☆☆
• ☆☆ 463. Island Perimeter ☆☆
• ☆☆ 547. Number of Provinces ☆☆
• ☆☆ 695. Max Area Of Islands ☆☆
• ☆☆ 784. Letter Case Permutation ☆☆
• ☆☆☆ 827. Making A Large Island ☆☆☆

• ☆☆☆ 003. Longest Substring ☆☆☆
• ☆☆ 056. Merge Intervals ☆☆

• ☆☆☆ 004. Median of Two Sorted Arrays ☆☆☆
• ☆☆ 153 Find Minimum in Rotated Sorted Array ☆☆
• ☆☆☆ 154 Find Minimum in Rotated Sorted Array II (同剑指Offer 11) ☆☆☆

• ☆☆☆ 005. Longest Palindromic Substring ☆☆☆
• ☆☆ 015. Three Sum ☆☆
• ☆☆ 021. Merge Two Sorted Lists ☆☆
• ☆☆ 125. Valid Palindrome ☆☆
• ☆☆☆ 148. Sort List ☆☆☆
• ☆☆ 349. Intersection of Two Arrays ☆☆
• ☆☆ 392. Is Subsequence ☆☆
• ☆☆☆ 剑指Offer 24. Reverse LinkedList ☆☆☆
• ☆☆ 面试题 10.09. Sorted Matrix Search ☆☆

• Count Sort
• Sort Dict by Value
• ☆☆ Get Median of List ☆☆
• ☆☆ 021. Merge Two Sorted Lists (同剑指Offer 25) ☆☆
• ☆☆ 056. Merge Intervals ☆☆
• ☆ 057. Insert Intervals ☆
• ☆☆ 075. Sort Colors (Quick Sort) ☆☆
• ☆☆☆ 148. Sort List (Merge Sort) ☆☆☆
• ☆ 207. Course Schedule (Topological Sort) ☆
• ☆☆☆ 210. Course Schedule II (Topological Sort) ☆☆☆
• ☆☆☆ 215. Kth Largest Element in an Array (Quick Sort) ☆☆☆
• ☆☆ 242. Valid Anagram ☆☆
• ☆ 252. Meeting Rooms ☆
• ☆☆☆ 253. Meeting Rooms II (Heap Sort) ☆☆☆
• ☆☆ 349. Intersection of Two Arrays ☆☆
• ☆ 350. Intersection of Two Arrays II ☆
• ☆☆☆ 912. Sort an Array (Quick Sort) ☆☆☆
• ☆ 976. Largest Perimeter Triangle ☆
• ☆ 1403. Minimum Subsequence in Non-Increasing Order ☆
• ☆☆☆ 剑指Offer 40. Minimum K (同面试题 17.14) (Quick Sort) ☆☆☆
• ☆☆ 剑指Offer 45. Min Num of Array Str ☆☆
• ☆☆☆ 剑指Offer 51. Reverse Num ☆☆☆

• ☆☆ 017. Letter Combination of a Phone Number ☆☆
• ☆☆ 022. Generate Parenthesis ☆☆
• ☆☆☆ 037. Sudoku Solver ☆☆☆
• ☆☆ 039. Combination Sum ☆☆
• ☆☆☆ 040. Combination Sum II ☆☆☆
• ☆☆ 046. Permutations ☆☆
• ☆☆ 047. Permutation II ☆☆
• ☆☆ 051. N-Queens ☆☆
• ☆☆☆ 060. Permutation Sequence ☆☆☆
• ☆☆ 077. Combinations ☆☆
• ☆☆ 078. Subsets ☆☆
• ☆☆☆ 090. Subsets II ☆☆☆
• ☆☆☆ 093. Restore IP Addresses ☆☆☆
• ☆☆☆ 494. Target Sum ☆☆☆
• ☆☆ 784. Letter Case Permutation ☆☆
• ☆☆☆ 剑指Offer 17. Print N-bit Numbers ☆☆☆

It has been concealed due to the recursive category is inessential.
If u want to check out the questions belong to this category, please check the raw data of this markdown file.

• ☆☆ Get Median of List ☆☆
• ☆☆☆ 053. Maximum Contiguous Subarray (同剑指Offer 42) ☆☆☆
• ☆☆☆ 215. Kth Largest Element in an Array ☆☆☆
• ☆☆☆ 912. Sort an Array ☆☆☆
• ☆☆☆ 剑指Offer 40. Minimum K ☆☆☆
• ☆☆☆ 剑指Offer 51. Reverse Num ☆☆☆

• Prim Algorithm for MST
• Dijkstra Algorithm for SSSP
• ☆☆ Fractional Knapsack ☆☆
• ☆ 014. Longest Common Prefix ☆
• ☆☆ 045. Jump Game II ☆☆
• ☆☆ 055. Jump Game ☆☆
• ☆☆ 122. Best Time to Buy and Sell Stock II ☆☆
• ☆☆☆ 253. Meeting Rooms II ☆☆☆
• ☆☆☆ 279. Perfect Squares ☆☆☆
• ☆☆☆ 435. Non-overlapping Intervals (Activity Selection) ☆☆☆
• ☆☆☆ 452. Minimum Number of Arrays to Burst Balloons (Activity Selection) ☆☆☆
• ☆☆ 743. Network Delay Time (Dijkstra) ☆☆
• ☆ 976. Largest Perimeter Triangle ☆
• ☆☆☆ 1167. Minimum Cost to Connect Sticks (Huffman + Priority Queue) ☆☆☆
• ☆ 1403. Minimum Subsequence in Non-Increasing Order ☆
• ☆☆ 剑指Offer 14 - II. Rope Cutting II ☆☆

• ☆☆ 0-1 Knapsack ☆☆
• ☆☆ Rod Cutting ☆☆
• ☆☆ Matrix Multiplication ☆☆
• ☆☆ Longest Common Subsequence ☆☆
• ☆☆ Longest Common Substring ☆☆
• ☆☆ Edit Distance ☆☆
• ☆☆ Optimal Binary Search Tree ☆☆
• ☆☆ Weighted Activity Selection ☆☆
• ☆☆ NC. Num Split ☆☆
• ☆☆☆ 005. Longest Palindromic Substring ☆☆☆
• ☆☆☆ 032. Longest Valid Parentheses ☆☆☆
• ☆☆☆ 053. Maximum Contiguous Subarray (同剑指Offer 42) (同面试题 16.17) ☆☆☆
• ☆☆ 070. Climbing Stairs (同剑指Offer 10-II) ☆☆
• ☆☆ 072. Edit Distance ☆☆
• ☆☆ 121. Best Time to Buy and Sell Stock (剑指Offer 63) ☆☆
• ☆☆ 122. Best Time to Buy and Sell Stock II ☆☆
• ☆☆ 135. Candy ☆☆
• ☆☆☆ 279. Perfect Squares ☆☆☆
• ☆☆ 300. Longest Increasing Subsequence ☆☆
• ☆☆ 322. Coin Change ☆☆
• ☆☆ 343. Integer Break (同剑指Offer 14-I) ☆☆
• ☆☆☆ 416. Partition Equal Subset Sum (0-1 Knapsack) ☆☆☆
• ☆☆☆ 474. Ones and Zeroes (0-1 Knapsack) ☆☆☆
• ☆☆☆ 494. Target Sum ☆☆☆
• ☆☆ 518. Coin Change 2 (0-1 Complete Knapsack) ☆☆
• ☆☆☆ 1143. Longest Common Subsequence ☆☆☆
• ☆☆ 剑指Offer 10 - I. Fibonacci ☆☆
• ☆☆ 剑指Offer 47. Maximum Value of Presents ☆☆
• ☆ 面试题 01.05. One Way ☆☆
• ☆☆ 面试题 08.01. Three Steps Problem ☆☆
• ☆☆ 面试题 08.02. Robot in a Grid ☆☆
• ☆☆ 面试题 17.16. The Masseuse ☆☆

• ☆☆ 136. Single Number ☆☆
• ☆☆☆ 169. Majority Element ☆☆☆ (同剑指Offer 39)
• ☆☆ 292. Nim Game ☆☆
• ☆☆☆ 343. Integer Break ☆☆☆ (同剑指Offer 14-I)
• ☆☆ 剑指Offer 14-II. Cutting Rope II ☆☆
• ☆☆☆ 剑指Offer 56-I. The number of occurrences of a number in an array ☆☆☆

• ☆☆ NC. Num Split ☆☆
• ☆☆ 001. Two Sum ☆☆
• ☆☆ 002. Add Two Numbers ☆☆
• ☆☆☆ 003. Longest Substring ☆☆☆
• ☆☆☆ 004. Median of Two Sorted Arrays ☆☆☆
• ☆☆☆ 005. Longest Palindromic Substring ☆☆☆
• ☆☆ 015. Three Sum ☆☆
• ☆ 014. Longest Common Prefix ☆
• ☆☆ 017. Letter Combination of a Phone Number ☆☆
• ☆ 020. Valid Parentheses ☆
• ☆☆ 021. Merge Two Sorted Lists （同剑指Offer 25）☆☆
• ☆☆ 022. Generate Parenthesis ☆☆
• ☆☆☆ 032. Longest Valid Parentheses ☆☆☆
• ☆☆☆ 037. Sudoku Solver ☆☆☆
• ☆☆ 039. Combination Sum ☆☆
• ☆☆☆ 040. Combination Sum II ☆☆☆
• ☆☆ 045. Jump Game II ☆☆
• ☆☆ 046. Permutations ☆☆
• ☆☆ 047. Permutation II ☆☆
• ☆☆ 051. N-Queens ☆☆
• ☆☆☆ 053. Maximum Contiguous Subarray (同剑指Offer 42) ☆☆☆
• ☆☆ 055. Jump Game ☆☆
• ☆☆ 056. Merge Intervals ☆☆
• ☆ 057. Insert Intervals ☆
• ☆☆☆ 060. Permutation Sequence ☆☆☆
• ☆☆ 070. Climbing Stairs ☆☆
• ☆☆☆ 072. Edit Distance ☆☆☆
• ☆☆ 075. Sort Colors ☆☆
• ☆☆ 077. Combinations ☆☆
• ☆☆ 078. Subsets ☆☆
• ☆☆☆ 090. Subsets II ☆☆☆
• ☆☆ 093. Restore IP Addresses ☆☆
• ☆☆☆ 094. Binary Tree Inorder Traversal ☆☆☆
• ☆☆☆ 105 Construct Binary Tree from Preorder and Inorder (同剑指Offer 07) ☆☆☆
• ☆☆ 121. Best Time to Buy and Sell Stock ☆☆
• ☆☆ 125 Valid Palindrome ☆☆
• ☆☆☆ 128. Longest Consecutive Sequence ☆☆☆
• ☆☆ 130. Surrounded Regions ☆☆
• ☆☆ 135. Candy ☆☆
• ☆☆ 136. Single Number ☆☆
• ☆☆ 144. Binary Tree Preorder Traversal ☆☆
• ☆☆ 145. Binary Tree Postorder Traversal ☆☆
• ☆☆☆ 146 LRU Cache (同面试题16.25) ☆☆☆
• ☆☆☆ 148. Sort List ☆☆☆
• ☆ 150. Evaluate Reverse Polish Notation ☆
• ☆☆ 153 Find Minimum in Rotated Sorted Array ☆☆
• ☆☆☆ 154 Find Minimum in Rotated Sorted Array II ☆☆☆
• ☆☆☆ 155. Min Stack ☆☆☆ (同面试题 03.02)
• ☆☆☆ 169. Majority Element ☆☆☆ (同剑指offer 39)
• ☆☆☆ 200. Number of Islands ☆☆☆
• ☆☆☆ 206. Reverse LinkList ☆☆☆ (同剑指offer-24)
• ☆ 207. Course Schedule ☆
• ☆☆☆ 210. Course Schedule II ☆☆☆
• ☆☆☆ 215. Kth Largest Element in an Array ☆☆☆
• ☆☆ 242. Valid Anagram ☆☆
• ☆ 252. Meeting Rooms ☆
• ☆☆☆ 253. Meeting Rooms II ☆☆☆
• ☆☆ 261. Graph Valid Tree ☆☆
• ☆☆☆ 279. Perfect Squares ☆☆☆
• ☆☆ 292. Nim Game ☆☆
• ☆☆ 300. Longest Increasing Subsequence ☆☆
• ☆☆ 322. Coin Change ☆☆
• ☆☆ 323. Number of Connected Components in an Undirected Graph ☆☆☆
• ☆☆☆ 329. Longest Increasing Path in a Metrix ☆☆☆
• ☆☆ 343. Integer Break ☆☆ (同剑指offer 14)
• ☆☆ 349. Intersection of Two Arrays ☆☆
• ☆ 350. Intersection of Two Arrays II ☆
• ☆☆ 392. Is Subsequence ☆☆
• ☆☆☆ 416. Partition Equal Subset Sum ☆☆☆
• ☆☆☆ 435. Non-overlapping Intervals ☆☆☆
• ☆☆☆ 452. Minimum Number of Arrays to Burst Balloons ☆☆☆
• ☆☆ 463. Island Perimeter ☆☆
• ☆☆☆ 474. Ones and Zeroes ☆☆☆
• ☆☆☆ 494. Target Sum ☆☆☆
• ☆☆ 518. Coin Change 2 ☆☆
• ☆ 537. Complex Number Multiplication ☆
• ☆☆ 547. Number of Provinces ☆☆
• ☆☆☆ 622 Implement a Queue ☆☆☆
• ☆☆☆ 662 Maximum Width of Binary Tree ☆☆☆
• ☆☆☆ 684. Redundant Connection ☆☆☆
• ☆☆ 695. Max Area Of Islands ☆☆
• ☆☆☆ 706. Design Hashmap ☆☆☆
• ☆☆ 721. Accounts Merge ☆☆
• ☆☆☆ 739. Daily Temperatures ☆☆☆
• ☆☆ 743. Network Delay Time ☆☆
• ☆☆ 752. Open the Lock ☆☆
• ☆☆ 784. Letter Case Permutation ☆☆
• ☆☆☆ 827. Making A Large Island ☆☆☆
• ☆☆☆ 912. Sort an Array ☆☆☆
• ☆☆ 958. Check Completeness of a Binary Tree ☆☆
• ☆ 976. Largest Perimeter Triangle ☆
• ☆☆☆ 990. Satisfiability of Equality Equations ☆☆☆
• ☆☆☆ 1094. Car Pooling ☆☆☆
• ☆☆☆ 1143. Longest Common Subsequence ☆☆☆
• ☆☆☆ 1167. Minimum Cost to Connect Sticks ☆☆☆
• ☆ 1403. Minimum Subsequence in Non-Increasing Order ☆
• ☆ 剑指Offer 03. Duplicate Num in Array ☆
• ☆☆☆ 剑指Offer 07. Construct Binary Tree from Preorder and Inorder ☆☆☆ (同105)
• ☆☆ 剑指Offer 09. Implement a queue by two stack ☆☆
• ☆☆ 剑指Offer 10 - I. Fibonacci ☆☆
• ☆☆ 剑指Offer 10 - II. Frog Jump Stairs ☆☆ (同070)
• ☆☆☆ 剑指Offer 11. Find Minimum in Rotated Sorted Array ☆☆☆ (同154)
• ☆☆ 剑指Offer 14 - I. Rope Cutting I ☆☆
• ☆☆ 剑指Offer 14 - II. Rope Cutting II ☆☆
• ☆☆☆ 剑指Offer 17. Print N-bit Numbers ☆☆☆
• ☆ 剑指Offer 18. Delete Element in LinkList ☆
• ☆☆☆ 剑指Offer 24. Reverse LinkList ☆☆☆
• ☆☆ 剑指Offer 25. Merge Two Sorted Lists ☆☆ (同021)
• ☆☆☆ 剑指Offer 39. Majority Element ☆☆☆
• ☆☆☆ 剑指Offer 40. Minimum K ☆☆☆
• ☆☆☆ 剑指Offer 42. Maximum Contiguous Subarray ☆☆☆ (同053)
• ☆☆ 剑指Offer 45. Min Num of Array Str ☆☆
• ☆☆ 剑指Offer 47. Maximum Value of Presents ☆☆
• ☆☆☆ 剑指Offer 51. Reverse Num ☆☆☆ (Merge Sort)
• ☆☆ 剑指Offer 55. Depth of Binary Tree ☆☆
• ☆☆☆ 剑指Offer-56-I. The number of occurrences of a number in an array ☆☆☆
• ☆☆☆ 剑指Offer 63. Maximum Profit of Stock ☆☆☆ (同121)
• ☆ 面试题 01.05. One Way ☆☆
• ☆☆ 面试题 08.01. Three Steps Problem ☆☆
• ☆☆ 面试题 08.02. Robot in a Grid ☆☆
• ☆☆ 面试题 08.11. Coin ☆☆ (同518)
• ☆☆ 面试题 10.09. Sorted Matrix Search ☆☆
• ☆☆☆ 面试题 16.17. Contiguous Sequence ☆☆☆ (同053)
• ☆☆☆ 面试题 16.25. LRU Cache ☆☆☆
• ☆☆☆ 面试题 17.14. Smallest K ☆☆☆ (同剑指offer-40)
• ☆☆ 面试题 17.16. The Masseuse ☆☆