Divide and conquer, backtrack
◉ Most elements
◉ parenthesis generation problem (using backtracking)
◉ Island number
◉ pow
◉ substr subset
◉ multielement
◉ Combination of phone numbers
◉ N queen
BFS & DFS
◎ Binary tree sequence traversal
◎ Minimal genetic change
◎ Parenthesis generation (using DFS or BFS)
◎ Find the maximum value in each tree line
◎ Solitaire
◎ Solitaire II
◎ Number of islands
◎ Mine Sweeping
Greedy
◎ Change
Lemonade change
◎ Buying and selling stocks
◎ Distributing cookies
◎ Simulated walking robot
◎ Jumping Game
◎ Jump Game II
DP wike
Binary search
◎ The square root of x
◎ The complete square root of efficiency
◎ Search rotation sort array
◎ Search a two-dimensional matrix
Find the minimum value in the rotation sort array
The title
◉ Most elements
◉ Lemonade change
◉ The best time to buy and sell stocks 2
◉ Give out cookies
◉ Simulated walking robot
◉ Pow (x, y)
◉ subset
◉ The alphabetic combination of the phone number
◎ Solitaire
◉ Number of islands
◎ Mine Sweeping
◎ Jumping Game
◎ Search rotation sort array
◉ Search two-dimensional matrix
◉ Finds the minimum value in the rotation sort array
◉ N queen
◎ Solitaire 2
◎ Jump Game 2