Automated archive tracking algorithm practice, solutions, and benchmarks.
| π’ Easy | π‘ Medium | π΄ Hard | π Total Solved |
|---|---|---|---|
| 27 | 45 | 4 | 76 |
7 problems revisited more than 48 hours later. A resubmission is a new 48-hour version window; submissions within the same window update that version.
| # | Title | Solution | Language | Difficulty | Runtime | Memory | Date Solved | Resubmission |
|---|---|---|---|---|---|---|---|---|
| 0001 | Two Sum | v1 | Python3 | Easy |
0 ms (100.0%) | 20.9 MB (7.6%) | 2026-08-16 14:39 UTC | 0 |
| 0002 | Add Two Numbers | v1 | Python3 | Medium |
3 ms (65.6%) | 19.2 MB (96.1%) | 2026-10-13 17:07 UTC | 0 |
| 0003 | Longest Substring Without Repeating Characters | v1 | Python3 | Medium |
155 ms (95.9%) | 20 MB (37.0%) | 2026-08-15 14:05 UTC | 0 |
| 0004 | Median of Two Sorted Arrays | v1 | C | Hard |
0 ms (100.0%) | 11.2 MB (100.0%) | 2025-11-03 11:42 UTC | 0 |
| 0007 | Reverse Integer | v1 | Python3 | Medium |
0 ms (100.0%) | 19.4 MB (17.4%) | 2026-10-14 13:46 UTC | 0 |
| 0009 | Palindrome Number | v1 | Python3 | Easy |
0 ms (100.0%) | 19.4 MB (19.3%) | 2026-10-02 12:14 UTC | 0 |
| 0011 | Container With Most Water | v2 | Python3 | Medium |
44 ms (94.1%) | 29.7 MB (15.3%) | 2026-09-25 21:27 UTC | 1 |
| 0013 | Roman to Integer | v2 | Python | Easy |
12 ms (37.3%) | 12.4 MB (58.9%) | 2026-10-11 20:40 UTC | 1 |
| 0014 | Longest Common Prefix | v1 | Python3 | Easy |
1 ms (30.0%) | 19.4 MB (33.1%) | 2026-10-11 20:53 UTC | 0 |
| 0015 | 3Sum | v1 | Python3 | Medium |
1026 ms (15.7%) | 24.4 MB (5.3%) | 2026-08-16 17:14 UTC | 0 |
| 0020 | Valid Parentheses | v1 | Python3 | Easy |
0 ms (100.0%) | 19.3 MB (24.8%) | 2026-09-25 21:40 UTC | 0 |
| 0022 | Generate Parentheses | v1 | Python3 | Medium |
3 ms (30.5%) | 19.4 MB (37.0%) | 2026-10-02 11:18 UTC | 0 |
| 0026 | Remove Duplicates from Sorted Array | v1 | Python3 | Easy |
1 ms (57.1%) | 20.5 MB (80.1%) | 2026-09-25 19:16 UTC | 0 |
| 0033 | Search in Rotated Sorted Array | v2 | Python3 | Medium |
0 ms (100.0%) | 19.4 MB (39.5%) | 2026-10-24 18:14 UTC | 1 |
| 0042 | Trapping Rain Water | v1 | Python3 | Hard |
7 ms (72.4%) | 21.2 MB (12.0%) | 2026-08-16 11:01 UTC | 0 |
| 0056 | Merge Intervals | v2 | Python3 | Medium |
10 ms (28.6%) | 22.6 MB (63.2%) | 2026-10-29 11:21 UTC | 1 |
| 0069 | Sqrt(x) | v1 | Python3 | Easy |
5 ms (40.6%) | 19.2 MB (51.2%) | 2026-10-24 17:24 UTC | 0 |
| 0070 | Climbing Stairs | v1 | Python3 | Easy |
0 ms (100.0%) | 19.5 MB (18.5%) | 2026-09-02 14:12 UTC | 0 |
| 0080 | Remove Duplicates from Sorted Array II | v1 | Python3 | Medium |
6 ms (86.7%) | 21 MB (98.2%) | 2026-09-25 19:32 UTC | 0 |
| 0094 | Binary Tree Inorder Traversal | v1 | Python3 | Easy |
0 ms (100.0%) | 19.3 MB (26.3%) | 2026-10-17 14:44 UTC | 0 |
| 0098 | Validate Binary Search Tree | v1 | Python3 | Medium |
0 ms (100.0%) | 20.9 MB (47.2%) | 2026-10-16 18:51 UTC | 0 |
| 0104 | Maximum Depth of Binary Tree | v1 | Python3 | Easy |
2 ms (55.4%) | 22.7 MB (24.6%) | 2026-10-04 20:02 UTC | 0 |
| 0112 | Path Sum | v1 | Python3 | Easy |
3 ms (28.0%) | 20.4 MB (5.1%) | 2026-10-03 19:59 UTC | 0 |
| 0121 | Best Time to Buy and Sell Stock | v2 | Python3 | Easy |
21 ms (93.4%) | 28.6 MB (77.3%) | 2026-10-11 20:40 UTC | 1 |
| 0122 | Best Time to Buy and Sell Stock II | v1 | Python3 | Medium |
3 ms (60.4%) | 20.1 MB (98.0%) | 2026-09-24 10:42 UTC | 0 |
| 0123 | Best Time to Buy and Sell Stock III | v1 | Python3 | Hard |
120 ms (52.3%) | 31.2 MB (41.8%) | 2026-09-24 14:05 UTC | 0 |
| 0138 | Copy List with Random Pointer | v1 | Python3 | Medium |
49 ms (46.8%) | 19.9 MB (98.5%) | 2026-09-24 14:55 UTC | 0 |
| 0151 | Reverse Words in a String | v1 | Python3 | Medium |
90 ms (6.4%) | 19.5 MB (10.3%) | 2026-10-27 11:39 UTC | 0 |
| 0153 | Find Minimum in Rotated Sorted Array | v1 | Python3 | Medium |
0 ms (100.0%) | 19.2 MB (96.5%) | 2026-11-01 09:55 UTC | 0 |
| 0199 | Binary Tree Right Side View | v1 | Python3 | Medium |
0 ms (100.0%) | 19.2 MB (67.5%) | 2026-10-20 08:36 UTC | 0 |
| 0200 | Number of Islands | v2 | Python3 | Medium |
230 ms (87.6%) | 21.5 MB (92.5%) | 2026-09-25 16:46 UTC | 1 |
| 0207 | Course Schedule | v1 | Python3 | Medium |
7 ms (44.3%) | 21.3 MB (25.9%) | 2026-09-26 21:41 UTC | 0 |
| 0226 | Invert Binary Tree | v1 | Python3 | Easy |
0 ms (100.0%) | 19.1 MB (87.6%) | 2026-10-24 09:05 UTC | 0 |
| 0230 | Kth Smallest Element in a BST | v1 | Python3 | Medium |
0 ms (100.0%) | 22.3 MB (25.3%) | 2026-10-26 09:58 UTC | 0 |
| 0238 | Product of Array Except Self | v1 | Python3 | Medium |
29 ms (35.6%) | 25.2 MB (82.9%) | 2026-10-29 11:13 UTC | 0 |
| 0274 | H-Index | v1 | Python3 | Medium |
0 ms (100.0%) | 19.7 MB (6.5%) | 2026-10-09 14:37 UTC | 0 |
| 0374 | Guess Number Higher or Lower | v1 | C | Easy |
1 ms (54.5%) | 8.4 MB (81.2%) | 2026-10-24 17:40 UTC | 0 |
| 0380 | Insert Delete GetRandom O(1) | v1 | Python3 | Medium |
84 ms (89.6%) | 57 MB (45.3%) | 2026-10-10 20:21 UTC | 0 |
| 0399 | Evaluate Division | v1 | Python3 | Medium |
0 ms (100.0%) | 19.3 MB (88.1%) | 2026-10-30 17:58 UTC | 0 |
| 0424 | Longest Repeating Character Replacement | v1 | Python3 | Medium |
91 ms (51.3%) | 19.4 MB (98.3%) | 2026-10-31 17:49 UTC | 0 |
| 0560 | Subarray Sum Equals K | v2 | Python3 | Medium |
36 ms (36.7%) | 21.5 MB (97.2%) | 2026-10-29 11:01 UTC | 1 |
| 0678 | Valid Parenthesis String | v1 | Python3 | Medium |
0 ms (100.0%) | 19.1 MB (90.0%) | 2026-10-04 21:02 UTC | 0 |
| 0704 | Binary Search | v1 | Python3 | Easy |
0 ms (100.0%) | 20.4 MB (93.4%) | 2026-10-24 10:52 UTC | 0 |
| 0768 | Max Chunks To Make Sorted II | v1 | Python3 | Hard |
4 ms (49.6%) | 19.3 MB (92.4%) | 2026-10-28 14:29 UTC | 0 |
| 0769 | Max Chunks To Make Sorted | v1 | Python3 | Medium |
0 ms (100.0%) | 19.1 MB (92.8%) | 2026-10-28 13:37 UTC | 0 |
| 0856 | Score of Parentheses | v1 | Python3 | Medium |
0 ms (100.0%) | 19.2 MB (84.4%) | 2026-10-05 21:03 UTC | 0 |
| 0875 | Koko Eating Bananas | v1 | Python3 | Medium |
255 ms (5.1%) | 20.8 MB (13.7%) | 2026-08-15 11:30 UTC | 0 |
| 0877 | Stone Game | v1 | Python3 | Medium |
0 ms (100.0%) | 19.2 MB (68.4%) | 2026-08-24 19:27 UTC | 0 |
| 0921 | Minimum Add to Make Parentheses Valid | v1 | Python3 | Medium |
0 ms (100.0%) | 19.3 MB (49.5%) | 2026-10-06 07:15 UTC | 0 |
| 0951 | Flip Equivalent Binary Trees | v1 | Python3 | Medium |
0 ms (100.0%) | 19.2 MB (72.9%) | 2026-10-24 09:13 UTC | 0 |
| 0994 | Rotting Oranges | v1 | Python3 | Medium |
4 ms (35.4%) | 19.2 MB (79.5%) | 2026-10-16 16:54 UTC | 0 |
| 0997 | Find the Town Judge | v1 | C | Easy |
0 ms (100.0%) | 19.6 MB (100.0%) | 2025-06-13 19:14 UTC | 0 |
| 1200 | Minimum Absolute Difference | v1 | Python | Easy |
63 ms (91.7%) | 21.6 MB (44.9%) | 2026-01-26 11:15 UTC | 0 |
| 1461 | Check If a String Contains All Binary Codes of Size K | v1 | Python | Medium |
229 ms (94.6%) | 63.2 MB (67.9%) | 2026-02-23 12:44 UTC | 0 |
| 1488 | Avoid Flood in The City | v1 | Python3 | Medium |
160 ms (92.0%) | 35.1 MB (48.7%) | 2025-11-03 07:45 UTC | 0 |
| 1658 | Minimum Operations to Reduce X to Zero | v1 | Python3 | Medium |
67 ms (71.8%) | 30.9 MB (65.5%) | 2026-09-23 14:33 UTC | 0 |
| 1984 | Minimum Difference Between Highest and Lowest of K Scores | v1 | C++ | Easy |
0 ms (100.0%) | 17.1 MB (90.7%) | 2026-01-26 00:11 UTC | 0 |
| 2058 | Find the Minimum and Maximum Number of Nodes Between Critical Points | v1 | Python3 | Medium |
67 ms (82.7%) | 63.3 MB (20.5%) | 2026-08-31 15:03 UTC | 0 |
| 2144 | Minimum Cost of Buying Candies With Discount | v1 | Python3 | Easy |
0 ms (100.0%) | 19.2 MB (88.5%) | 2026-06-01 09:45 UTC | 0 |
| 2271 | Maximum White Tiles Covered by a Carpet | v1 | Python3 | Medium |
75 ms (99.8%) | 38.2 MB (55.3%) | 2026-11-01 14:08 UTC | 0 |
| 2839 | Check if Strings Can be Made Equal With Operations I | v1 | Python3 | Easy |
0 ms (100.0%) | 19.2 MB (90.9%) | 2026-08-25 11:31 UTC | 0 |
| 2840 | Check if Strings Can be Made Equal With Operations II | v1 | Python3 | Medium |
48 ms (92.1%) | 20.1 MB (78.7%) | 2026-08-25 12:00 UTC | 0 |
| 3015 | Count the Number of Houses at a Certain Distance I | v1 | Python3 | Medium |
644 ms (21.6%) | 19.2 MB (94.1%) | 2026-10-15 16:16 UTC | 0 |
| 3069 | Distribute Elements Into Two Arrays I | v1 | Python3 | Easy |
1 ms (27.9%) | 19.2 MB (64.5%) | 2026-08-20 14:24 UTC | 0 |
| 3121 | Count the Number of Special Characters II | v1 | Python3 | Medium |
492 ms (8.9%) | 21.7 MB (10.7%) | 2026-05-27 17:31 UTC | 0 |
| 3296 | Minimum Number of Seconds to Make Mountain Height Zero | v1 | Python | Medium |
903 ms (45.5%) | 17.2 MB (3.0%) | 2026-03-13 08:41 UTC | 0 |
| 3300 | Minimum Element After Replacement With Digit Sum | v1 | Python3 | Easy |
6 ms (32.9%) | 19.1 MB (91.5%) | 2026-05-29 15:01 UTC | 0 |
| 3471 | Find the Largest Almost Missing Integer | v1 | Python3 | Easy |
0 ms (100.0%) | 19.2 MB (94.0%) | 2026-08-18 14:57 UTC | 0 |
| 3550 | Smallest Index With Digit Sum Equal to Index | v1 | Python3 | Easy |
7 ms (12.0%) | 19.2 MB (90.3%) | 2026-09-24 08:25 UTC | 0 |
| 3612 | Process String with Special Operations I | v1 | Python3 | Medium |
0 ms (100.0%) | 23.3 MB (85.1%) | 2026-06-16 16:38 UTC | 0 |
| 3622 | Check Divisibility by Digit Sum and Product | v1 | Python3 | Easy |
0 ms (100.0%) | 19.4 MB (25.5%) | 2026-08-22 08:59 UTC | 0 |
| 3718 | Smallest Missing Multiple of K | v1 | Python3 | Easy |
0 ms (100.0%) | 19.2 MB (90.5%) | 2026-08-25 06:44 UTC | 0 |
| 3751 | Total Waviness of Numbers in Range I | v1 | Python3 | Medium |
328 ms (40.0%) | 19.3 MB (39.3%) | 2026-06-04 14:52 UTC | 0 |
| 3875 | Construct Uniform Parity Array I | v1 | Python3 | Easy |
0 ms (100.0%) | 19.2 MB (86.7%) | 2026-09-02 14:28 UTC | 0 |
| 3876 | Construct Uniform Parity Array II | v1 | Python3 | Medium |
66 ms (38.6%) | 35 MB (91.8%) | 2026-09-03 10:22 UTC | 0 |
| 3882 | Minimum XOR Path in a Grid | v1 | Python3 | Medium |
9225 ms (5.0%) | 165.3 MB (5.0%) | 2026-10-28 15:53 UTC | 0 |
Automatically synced and updated via custom GitHub Actions engine.