"Catalog" Leetcode

Unknowingly already wrote more than 200 essays, now look for a long time, very inconvenient. So make a directory for yourself ~

Leetcode

1. Dynamic planning

1. Palindrome partitioning II (hard) ☆
2. Distinct subsequences (Hard)
3. Edit Distance (Hard)
4. Interleaving String (Hard)
5. Regular Expression Matching (Hard) ★
6. Wildcard Matching (hard) ★ Big God too Bull
7. Longest Valid parentheses (hard) ★
8. Scramble String (Hard) ★
9. Maximal Rectangle (Hard) ★
10. Unique Binary Search Trees (middle) ☆
11. Minimum Path Sum (Easy)
12. Unique Binary Search Trees II (middle) ☆
13. Unique Binary Search Trees (middle) ☆
14. Unique Path | | (easy)
15. Unique Path (Easy)
16. Triangle (Easy)
17. Decode Ways (Medium)

2. Backtracking

1. Restore IP Addresses (middle)
2. Subsets II (middle) ☆
3. Word Search (middle)

3. Other

1. Atoi (Hard) ★
2. Candy (hard) did it himself, but the others were better.
3. Substring with concatenation of any Words (hard) ★
4. Search a 2D Matrix (easy)
5. 3Sum (Medium)
6. Binary Tree Maximum Path Sum (medium)
7. Convert Sorted Array to Binary Search Tree (Easy)
8. Subsets (Medium) ☆
9. Binary Tree postorder Traversal (hard) ☆
10. Minimum Depth of Binary Tree (easy)
11. Plus One (Easy)
12. Climbing Stairs (Easy)
13. best time to Buy and Sell 3 (hard) I made it myself, but others are better.
14. best time to Buy and Sell 2 (too easy)
15. best time to Buy and Sell (easy)
16. Single number II (medium) ★ Didn't do it yourself ....
17. Single number (Medium) ☆
18. Valid Sudoku (Easy)
19. Both Sum (easy)
20. Length of last word (easy)

"Catalog" Leetcode