--
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1184 | Distance Between Bus Stops | Python | O(n) | O(1) | Easy | ||
| 1089 | Duplicate Zeros | Python | O(n) | O(1) | Easy | ||
| 1051 | Height Checker | Python | O(nlogn) | O(n) | Easy | ||
| 1030 | Matrix Cells in Distance Order | Python | O(m * n) | O(1) | Easy | ||
| 1013 | Partition Array Into Three Parts With Equal Sum | Python | O(n) | O(1) | Easy | ||
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | Python | O(n) | O(1) | Easy | ||
| 1002 | Find Common Characters | Python | O(n * l) | O(1) | Easy | ||
| 0026 | Remove Duplicates from Sorted Array | Python | O(n) | O(1) | Easy | Two Pointers | |
| 0066 | Plus One | Python | O(n) | O(1) | Easy | ||
| 0189 | Rotate Array | Python | O(n) | O(1) | Easy |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 0191 | Number of 1 Bits | Python | O(1) | O(1) | Easy | ||
| 0231 | Power of Two | Python | O(1) | O(1) | Easy | LintCode |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 2023 | Number of Pairs of Strings With Concatenation Equal to Target | Python | O(n * l) | O(n) | Medium | variant of Two Sum | |
| 2006 | Count Number of Pairs With Absolute Difference K | Python | O(n) | O(n) | Easy | variant of Two Sum | |
| 0001 | Two Sum | Python | O(n) | O(n) | Easy | ||
| 0003 | Longest Substring Without Repeating Characters | Python | O(n) | O(1) | Medium |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 0021 | Merge Two Sorted Lists | Python | O(n) | O(1) | Easy | ||
| 0024 | Swap Nodes in Pairs | Python | O(n) | O(1) | Easy | ||
| 0160 | Intersection of Two Linked Lists | Python | O(m + n) | O(1) | Easy |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1309 | Decrypt String from Alphabet to Integer Mapping | Python | O(n) | O(1) | Easy | ||
| 1189 | Maximum Number of Balloons | Python | O(n) | O(1) | Easy | Hash | |
| 1108 | Defanging an IP Address | Python | O(n) | O(1) | Easy | ||
| 1078 | Occurrences After Bigram | Python | O(n) | O(1) | Easy | ||
| 1071 | Greatest Common Divisor of Strings | Python | O(m + n) | O(1) | Easy | ||
| 0005 | Longest Palindromic Substring | Python | O(n) | O(n) | Medium | Manacher's Algorithm |
|
| 0014 | Longest Common Prefix | Python | O(n * k) | O(1) | Easy | ||
| 0125 | Valid Palindrome | Python | O(n) | O(1) | Easy |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 2176 | Count Equal and Divisible Pairs in an Array | Python | O(nlogk + n * sqrt(k)) | O(n + sqrt(k)) | Easy | Math |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1122 | Relative Sort Array | Python | O(nlogn) | O(n) | Easy | ||
| 1356 | Sort Integers by The Number of 1 Bits | Python | O(nlogn) | O(1) | Easy | Bit Manipulation |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1022 | Sum of Root To Leaf Binary Numbers | ( Python | O(n) | O(h) | Easy | ||
| 1008 | Construct Binary Search Tree from Preorder Traversal | Python | O(n) | O(h) | Medium | ||
| 2236 | Root Equals Sum of Children | Python | O(1) | O(1) | Easy | Tree |
| # | Title | Solution | Time | Space | Difficulty | Tag | Note |
|---|---|---|---|---|---|---|---|
| 1322 | Ads Performance | MySQL | O(nlogn) | O(n) | Easy | 🔒 | |
| 1050 | Actors and Directors Who Cooperated At Least Three Times | MySQL | O(n) | O(n) | Easy | 🔒 |
| # | Title | Solution |
|---|---|---|
| 1 | SELECT basics | MySQL |
| 2 | SELECT from world | MySQL |
| 3 | SELECT from nobel | MySQL |
| 4 | SELECT in SELECT | MySQL |
| 5 | SUM and COUNT | MySQL |
| 6 | JOIN | MySQL |
| 7 | More JOIN | MySQL |