LeetCode

Usage

Step 1

First, try to solve a problem by yourself. If you can't solve it in 5 minutes, look at the answer. If you understand the answer, hide the answer and write the code by yourself. If you can't write the code in 5 minutes, look at the answer again. If you look at the answer, delete all the code and start over. If you submit the answer and it is accepted, you have completed the first step.

Step 2

Next, make the code as readable as possible. If you submit the answer and it is accepted, you have completed the second step.

Step 3

Next, delete all the code and start over. This time, measure the time and write the code again. If you submit the answer and it is accepted, delete all the code and start over. If you can write the code without any errors within 10 minutes for 3 times in a row, you have completed the third step.

Arai60 Check List

---

• 1. Two Sum
• 2. Add Two Numbers
• 3. Longest Substring Without Repeating Characters
• 4. Zigzag Conversion
• 5. String to Integer (atoi)
• 6. Valid Parentheses
• 7. Generate Parentheses
• 8. Next Permutation
• 9. Search in Rotated Sorted Array
• 10. Search Insert Position
• 11. Combination Sum
• 12. Permutations
• 13. Group Anagrams
• 14. Pow(x, n)
• 15. Maximum Subarray
• 16. Unique Paths
• 17. Unique Paths II
• 18. Subsets
• 19. Remove Duplicates from Sorted List II
• 20. Remove Duplicates from Sorted List
• 21. Validate Binary Search Tree
• 22. Binary Tree Level Order Traversal
• 23. Binary Tree Zigzag Level Order Traversal
• 24. Maximum Depth of Binary Tree
• 25. Construct Binary Tree from Preorder and Inorder Traversal
• 26. Convert Sorted Array to Binary Search Tree
• 27. Minimum Depth of Binary Tree
• 28. Path Sum
• 29. Best Time to Buy and Sell Stock
• 30. Best Time to Buy and Sell Stock II
• 31. Word Ladder
• 32. Word Break
• 33. Linked List Cycle
• 34. Linked List Cycle II
• 35. Find Minimum in Rotated Sorted Array
• 36. House Robber
• 37. Number of Islands
• 38. Reverse Linked List
• 39. Minimum Size Subarray Sum
• 40. House Robber II
• 41. Meeting Rooms
• 42. Meeting Rooms II
• 43. Paint Fence
• 44. Move Zeroes
• 45. Longest Increasing Subsequence
• 46. Coin Change
• 47. Number of Connected Components in an Undirected Graph
• 48. Top K Frequent Elements
• 49. Intersection of Two Arrays
• 50. Find K Pairs with Smallest Sums
• 51. First Unique Character in a String
• 52. Is Subsequence
• 53. Subarray Sum Equals K
• 54. Merge Two Binary Trees
• 55. Max Area of Island
• 56. Kth Largest Element in a Stream
• 57. Split BST
• 58. K-th Symbol in Grammar
• 59. Unique Email Addresses
• 60. Capacity To Ship Packages Within D Days

Blind75 Check List

---

• 1. Two Sum
• 2. Longest Substring Without Repeating Characters
• 3. Longest Palindromic Substring
• 4. Container With Most Water
• 5. 3Sum
• 6. Remove Nth Node From End of List
• 7. Valid Parentheses
• 8. Merge Two Sorted Lists
• 9. Merge k Sorted Lists
• 10. Search in Rotated Sorted Array
• 11. Combination Sum
• 12. Rotate Image
• 13. Group Anagrams
• 14. Maximum Subarray
• 15. Spiral Matrix
• 16. Jump Game
• 17. Merge Intervals
• 18. Insert Interval
• 19. Unique Paths
• 20. Climbing Stairs
• 21. Set Matrix Zeroes
• 22. Minimum Window Substring
• 23. Word Search
• 24. Decode Ways
• 25. Validate Binary Search Tree
• 26. Same Tree
• 27. Binary Tree Level Order Traversal
• 28. Maximum Depth of Binary Tree
• 29. Construct Binary Tree from Preorder and Inorder Traversal
• 30. Best Time to Buy and Sell Stock
• 31. Binary Tree Maximum Path Sum
• 32. Valid Palindrome
• 33. Longest Consecutive Sequence
• 34. Clone Graph
• 35. Word Break
• 36. Linked List Cycle
• 37. Reorder List
• 38. Maximum Product Subarray
• 39. Find Minimum in Rotated Sorted Array
• 40. Reverse Bits
• 41. Number of 1 Bits
• 42. House Robber
• 43. Number of Islands
• 44. Reverse Linked List
• 45. Course Schedule
• 46. Implement Trie (Prefix Tree)
• 47. Design Add and Search Words Data Structure
• 48. Word Search II
• 49. House Robber II
• 50. Contains Duplicate
• 51. Invert Binary Tree
• 52. Kth Smallest Element in a BST
• 53. Lowest Common Ancestor of a Binary Search Tree
• 54. Product of Array Except Self
• 55. Valid Anagram
• 56. Meeting Rooms
• 57. Meeting Rooms II
• 58. Graph Valid Tree
• 59. Missing Number
• 60. Alien Dictionary
• 61. Encode and Decode Strings
• 62. Find Median from Data Stream
• 63. Serialize and Deserialize Binary Tree
• 64. Longest Increasing Subsequence
• 65. Coin Change
• 66. Number of Connected Components in an Undirected Graph
• 67. Counting Bits
• 68. Top K Frequent Elements
• 69. Sum of Two Integers
• 70. Pacific Atlantic Water Flow
• 71. Longest Repeating Character Replacement
• 72. Non-overlapping Intervals
• 73. Subtree of Another Tree
• 74. Palindromic Substrings
• 75. Longest Common Subsequence