Leetcode Binary Search Problem Set (2) - Hard

• 410.Split Array Largest Sum

Classic binary search scenarios are find a number, and find boundaries.
Leetcode Binary Search Problem Set (1) - Medium

• 278.First Bad Version
• 33.Search in Rotated Sorted Array
• 1283.Find the Smallest Divisor Given a Threshold
• 875.Koko Eating Bananas
• 1011.Capacity To Ship Packages Within D Days
• 981.Time Based Key-Value Store

Leetcode backtracking problem collection (2) - Hard

• 51.N-Queens
• 37.Sudoku Solver

Backtracking is a general algorithm for finding all (or some) solutions to some computational problems.

Leetcode backtracking problem collection (1)

• 46.Permutations
• 78.Subsets
• 77.Combinations
• 39.Combination Sum
• 22.Generate Parentheses

Leetcode Tree problem collection (3)

• 99.Recover Binary Search Tree
• 94.Binary Tree Inorder Traversal
• 116.Populating Next Right Pointers in Each Node
• 114.Flatten Binary Tree to Linked List
• 654.Maximum Binary Tree
• 106.Construct Binary Tree from Inorder and Postorder Traversal

Basically, there’re two ways to store data strctures: array and linked list.
All other data strctures, such as queue, stack, graph, hashmap, tree, heap, etc, all can be implemented by array and linked list.

Leetcode Stack Problem Collection (1)

• 20.Valid Parentheses
• 1249.Minimum Remove to Make Valid Parentheses
• 394.Decode String
• 1209.Remove All Adjacent Duplicates in String II
• 739.Daily Temperatures
• 1. Simplify Path

Leetcode Dynamic Programming Problem Collection (1)

Green hand in DP problem
The key of Dynamic Programming is to get local result, then get global result.

• 70.Climbing Stairs
• 121.Best Time to Buy and Sell Stock *
• 53.Maximum Subarray
• 198.House Robber
• 746.Min Cost Climbing Stairs
• 42.Trapping Rain Water

Leetcode Sorting Problem Collection (1)

• 56.Merge Intervals
• 253.Meeting Rooms II
• 973.K Closest Points to Origin
• 148.Sort List *
• 88.Merge Sorted Array