| 001 |
Two Sum |
num001.py |
Hash Table |
Easy |
O(n) |
O(n) |
32 ms |
98.23% |
| 002 |
Add Two Numbers |
num002.py |
Linked List |
Medium |
O(m+n) |
O(m+n) |
125 ms |
57.29% |
| 002_2 |
Add Two Numbers |
num002_2.py |
Linked List |
Medium |
O(max(m,n)) |
O(max(m,n)) |
106 ms |
99.06% |
| 003 |
Longest Substring Without Repeating Characters |
num003.py |
String |
Medium |
O(n^2) |
O(n) |
99 ms |
60.17% |
| 003_2 |
Longest Substring Without Repeating Characters |
num003_2.py |
Hash Table |
Medium |
O(n) |
O(n) |
92 ms |
71.48% |
| 009 |
Palindrome Number |
num009.py |
Math |
Easy |
O(n) |
O(1) |
188 ms |
96.53% |
| 013 |
Roman to Integer |
num013.py |
Hash Table |
Easy |
O(n) |
O(1) |
118 ms |
96.06% |
| 014 |
Longest Common Prefix |
num014.py |
String |
Easy |
O(m*n) |
O(1) |
38 ms |
83.59% |
| 021 |
Merge Two Sorted Lists |
num021.py |
Linked List |
Easy |
O(m+n) |
O(1) |
42 ms |
92.83% |
| 026 |
Remove Duplicates from Sorted Array |
num026.py |
Array |
Easy |
O(n) |
O(1) |
72 ms |
94.32% |
| 027 |
Remove Element |
num027.py |
Array |
Easy |
O(n) |
O(1) |
35 ms |
90.55% |
| 035 |
Search Insert Position |
num035.py |
Array |
Easy |
O(n) |
O(1) |
32 ms |
88.74% |
| 035_2 |
Search Insert Position |
num035_2.py |
Binary Search |
Easy |
O(log(n)) |
O(1) |
32 ms |
88.74% |
| 058 |
Length of Last Word |
num058.py |
String |
Easy |
O(n) |
O(1) |
29 ms |
93.39% |
| 066 |
Plus One |
num066.py |
Array |
Easy |
O(n) |
O(n) |
33 ms |
91.79% |
| 067 |
Add Binary |
num067.py |
String |
Easy |
O(1) |
O(1) |
35 ms |
95.69% |
| 069 |
Sqrt(x) |
num069.py |
Math |
Easy |
O(1) |
O(1) |
39 ms |
91.25% |
| 070 |
Climbing Stairs |
num070.py |
Dynamic-Programming |
Easy |
O(n) |
O(n) |
29 ms |
82.36% |
| 083 |
Remove Duplicates from Sorted List |
num083.py |
Linked List |
Easy |
O(n) |
O(1) |
46 ms |
96.67% |
| 088 |
Merge Sorted Array |
num088.py |
Array |
Easy |
O(n) |
O(1) |
35 ms |
93.77% |
| 100 |
Same Tree |
num100.py |
Tree |
Easy |
O(n) |
O(1) |
29 ms |
93.98% |
| 101 |
Symmetric Tree |
num101.py |
Tree |
Easy |
O(n) |
O(1) |
36 ms |
95.57% |
| 104 |
Maximum Depth of Binary Tree |
num104.py |
DFS |
Easy |
O(n) |
O(1) |
49 ms |
94.78% |
| 107 |
Binary Tree Level Order Traversal II |
num107.py |
BFS |
Easy |
O(n) |
O(n) |
39 ms |
98.69% |
| 108 |
Convert Sorted Array to Binary Search Tree |
num108.py |
DFS |
Easy |
O(n) |
O(1) |
82 ms |
94.01% |
| 110 |
Convert Sorted Array to Binary Search Tree |
num110.py |
DFS |
Easy |
O(n) |
O(1) |
62 ms |
94.65% |
| 111 |
Minimum Depth of Binary Tree |
num111.py |
BFS |
Easy |
O(n) |
O(n) |
49 ms |
98.19% |
| 118 |
Pascal's Triangle |
num118.py |
Array |
Easy |
O(n^2) |
O(n) |
32 ms |
75.98% |
| 118_2 |
Pascal's Triangle |
num118_2.py |
Array |
Easy |
O(n^2) |
O(n) |
32 ms |
75.98% |
| 119 |
Pascal's Triangle II |
num119.py |
Array |
Easy |
O(n^2) |
O(n) |
26 ms |
99.80% |
| 121 |
Best Time to Buy and Sell Stock |
num121.py |
Array |
Easy |
O(n) |
O(1) |
35 ms |
95.08% |
| 122 |
Best Time to Buy and Sell Stock II |
num122.py |
Array |
Easy |
O(n) |
O(1) |
35 ms |
91.48% |
| 217 |
Contains Duplicate |
num217.py |
Array |
Easy |
O(n) |
O(n) |
46 ms |
79.41% |
| 217_2 |
Contains Duplicate |
num217_2.py |
Array |
Easy |
O(n) |
O(n) |
45 ms |
84.05% |
| 219 |
Contains Duplicate II |
num219.py |
Array |
Easy |
O(n) |
O(n) |
45 ms |
84.81% |
| 268 |
Missing Number |
num268.py |
Array |
Easy |
O(n) |
O(n) |
45 ms |
74.24% |
| 268_2 |
Missing Number |
num268_2.py |
Array |
Easy |
O(n) |
O(1) |
42 ms |
84.06% |
| 268_3 |
Missing Number |
num268_3.py |
Array |
Easy |
O(n) |
O(1) |
39 ms |
94.98% |
| 485 |
Max Consecutive Ones |
num485.py |
Array |
Easy |
O(n) |
O(1) |
69 ms |
93.00% |
| 561 |
Shortest Unsorted Continuous Subarray |
num561.py |
Array |
Easy |
O(nlog(n)) |
O(n) |
108 ms |
97.76% |
| 581 |
Shortest Unsorted Continuous Subarray |
num581.py |
Array |
Easy |
O(nlog(n)) |
O(n) |
82 ms |
81.90% |
| 643 |
Maximum Average Subarray I |
num643.py |
Array |
Easy |
O(n) |
O(1) |
202 ms |
85.21% |
| 665 |
Non-decreasing Array |
num665.py |
Array |
Easy |
O(n) |
O(1) |
52 ms |
90.31% |