id | Problem | Java | Python | Hint | Difficulty |
---|---|---|---|---|---|
1 | two sum | √ | √ | Hashmap | Easy |
2 | Add Two Numbers | √ | √ | Medium | |
3 | Longest Substring Without Repeating Characters | √ | √ | Medium | |
4 | Median of Two Sorted Arrays | √ | √ | Hard | |
5 | Longest Palindromic Substring | √ | √ | Medium | |
8 | String to Integer (atoi) | √ | √ | Medium | |
9 | Palindrome Number | √ | √ | Easy | |
11 | Container With Most Water | √ | √ | Medium | |
14 | Longest Common Prefix | √ | √ | Easy | |
15 | 3Sum | √ | √ | Medium | |
20 | Valid Parentheses | √ | √ | Medium | |
21 | Merge Two Sorted Lists | √ | √ | Easy | |
22 | Generate Parentheses | √ | √ | Medium | |
23 | Merge k Sorted Lists | √ | √ | Hard | |
25 | Reverse Nodes in k-Group | √ | √ | Hard | |
33 | Search in Rotated Sorted Array | √ | √ | Medium | |
42 | Trapping Rain Water | √ | √ | Hard | |
45 | Jump Game II | √ | √ | Hard | |
46 | Permutations | √ | √ | Medium | |
50 | Pow(x, n) | √ | √ | Medium | |
53 | Maximum Subarray | √ | √ | Easy | |
55 | Jump Game | √ | √ | Medium | |
56 | Merge Intervals | √ | √ | Medium | |
67 | Add Binary | √ | √ | Easy | |
69 | Sqrt(x) | √ | √ | Easy | |
70 | Climbing Stairs | √ | √ | Easy | |
72 | Edit Distance | √ | √ | Hard | |
76 | Minimum Window Substring | √ | √ | Hard | |
84 | Largest Rectangle in Histogram | √ | √ | Hard | |
88 | Merge Sorted Array | √ | √ | Easy | |
98 | Validate Binary Search Tree | √ | √ | Medium | |
101 | Symmetric Tree | √ | √ | Easy | |
102 | Binary Tree Level Order Traversal | √ | √ | Medium | |
105 | Construct Binary Tree from Preorder and Inorder Traversal | √ | √ | Medium | |
108 | Convert Sorted Array to Binary Search Tree | √ | Easy | ||
120 | Triangle | √ | Medium | ||
125 | Valid Palindrome | √ | √ | Easy | |
128 | Longest Consecutive Sequence | √ | √ | Hard | |
136 | Single Number | √ | √ | Easy | |
139 | Word Break | √ | √ | Medium | |
146 | LRU Cache | √ | √ | Medium | |
151 | Reverse Words in a String | √ | √ | Medium | |
152 | Maximum Product Subarray | √ | √ | Medium | |
155 | Min Stack | √ | √ | Easy | |
169 | Majority Element | √ | √ | Boyer-Moore Voting Algorithm | Easy |
174 | Dungeon Game | √ | Hard | ||
198 | House Robber | √ | √ | Easy | |
199 | Binary Tree Right Side View | √ | √ | Medium | |
200 | Number of Islands | √ | √ | Hard | |
202 | Happy Number | √ | √ | Easy | |
206 | Reverse Linked List | √ | √ | Easy | |
210 | Course Schedule II | √ | √ | Medium | |
221 | Maximal Square | √ | √ | Medium | |
225 | Implement Stack using Queues | √ | √ | Easy | |
229 | Majority Element II | √ | √ | Medium | |
230 | Kth Smallest Element in a BST | √ | √ | Medium | |
236 | Lowest Common Ancestor of a Binary Tree | √ | √ | Medium | |
238 | Product of Array Except Self | √ | √ | Medium | |
239 | Sliding Window Maximum | √ | √ | Hard | |
242 | Valid Anagram | √ | √ | Easy | |
250 | Count Univalue Subtrees | √ | √ | Medium | |
287 | Find the Duplicate Number | √ | √ | Medium | |
289 | Game of Life | √ | √ | Medium | |
297 | Serialize and Deserialize Binary Tree | √ | Hard | ||
322 | Coin Change | √ | √ | Medium | |
355 | Design Twitter | √ | √ | Medium | |
378 | Kth Smallest Element in a Sorted Matrix | √ | Medium | ||
394 | Decode String | √ | √ | Medium | |
445 | Add Two Numbers II | √ | √ | Medium | |
460 | LFU Cache | √ | Hard | ||
463 | Island Perimeter | √ | √ | Easy | |
466 | Count The Repetitions | √ | √ | Hard | |
516 | Longest Palindromic Subsequence | √ | √ | Medium | |
542 | 01 Matrix | √ | √ | BFS | Medium |
560 | Subarray Sum Equals K | √ | √ | Medium | |
572 | Subtree of Another Tree | √ | √ | Easy | |
680 | Valid Palindrome II | √ | √ | Easy | |
695 | Max Area of Island | √ | √ | DFS | Medium |
733 | Flood Fill | √ | √ | DFS | Easy |
739 | Daily Temperatures | √ | √ | Medium | |
820 | Short Encoding of Words | √ | √ | Trie | Medium |
837 | New 21 Game | √ | √ | Medium | |
876 | Middle of the Linked List | √ | √ | Easy | |
887 | Super Egg Drop | √ | √ | Hard | |
892 | Surface Area of 3D Shapes | √ | √ | Easy | |
912 | Sort an Array | √ | √ | Counting Sort | Medium |
914 | X of a Kind in a Deck of Cards | √ | √ | Easy | |
974 | Subarray Sums Divisible by K | √ | √ | Medium | |
983 | Minimum Cost For Tickets | √ | √ | Medium | |
990 | Satisfiability of Equality Equations | √ | √ | Medium | |
999 | Available Captures for Rook | √ | √ | Easy | |
1013 | Partition Array Into Three Parts With Equal Sum | √ | √ | Easy | |
1014 | Best Sightseeing Pair | √ | Medium | ||
1028 | Recover a Tree From Preorder Traversal | √ | Hard | ||
1034 | Coloring A Border | √ | √ | Medium | |
1071 | Greatest Common Divisor of Strings | √ | √ | Euclidean algorithm | Easy |
1095 | Find in Mountain Array | √ | √ | Hard | |
1111 | Maximum Nesting Depth of Two Valid Parentheses Strings | √ | √ | Medium | |
1162 | As Far from Land as Possible | √ | √ | BFS | Medium |
1248 | Count Number of Nice Subarrays | √ | √ | Medium | |
1313 | Decompress Run-Length Encoded List | √ | √ | Easy | |
1342 | Number of Steps to Reduce a Number to Zero | √ | √ | Bit Operation | Easy |
1371 | Find the Longest Substring Containing Vowels in Even Counts | √ | √ | Medium | |
1431 | Kids With the Greatest Number of Candies | √ | √ | Easy |
id | Problem | Java | Python | Hint | Difficulty |
---|---|---|---|---|---|
13 | 机器人的运动范围 | √ | √ | Medium | |
17 | printNumbers | √ | √ | Easy | |
29 | 顺时针打印矩阵 | √ | √ | Easy | |
40 | getLeastNumbers | √ | √ | Easy | |
46 | 把数字翻译成字符串 | √ | √ | Medium | |
51 | 数组中的逆序对 | √ | √ | Hard | |
56-I | 数组中数字出现的次数 | √ | √ | Medium | |
57-2 | 和为s的连续正数序列 | √ | √ | Easy | |
62 | 圆圈中最后剩下的数字 | √ | √ | Josephus problem | Easy |
64 | 求1+2+…+n | √ | √ | Medium |
id | Problem | Java | Python | Hint | Difficulty |
---|---|---|---|---|---|
01.07 | Rotate Matrix | √ | √ | Medium | |
08.06 | Hanota | √ | √ | Easy | |
08.11 | Coin LCCI | √ | √ | Medium | |
17.16 | The Masseuse | √ | √ | Easy |
id | Problem | Difficulty |
---|---|---|
07 | 传递信息 | Easy |
08 | 剧情触发时间 | Medium |
09 | 最小跳跃次数 | Hard |
id | Problem | Difficulty |
---|---|---|
5195 | Longest Happy String | Medium |
5376 | Minimum Subsequence in Non-Increasing Order | Easy |
5377 | Number of Steps to Reduce a Number in Binary Representation to One | Medium |
5379 | Stone Game III | Hard |
id | Problem | Difficulty |
---|---|---|
5380 | String Matching in an Array | Easy |
5381 | Queries on a Permutation With Key | Medium |
5382 | HTML Entity Parser | Medium |
5383 | Number of Ways to Paint N × 3 Grid | Hard |