| # | Title | Solution | Runtime |
|---|---|---|---|
| 2 | Add Two Numbers | C++ | 12 ms |
| 4 | Median of Two Sorted Arrays | C++ | 72 ms |
| 33 | Search in Rotated Sorted Array | Java | 0 ms |
| 74 | Search a 2D Matrix | C++ | 0 ms |
| 121 | Best Time to Buy and Sell Stock | C++ | N/A |
| 123 | Best Time to Buy and Sell Stock III | C++ | 120 ms |
| 287 | Find the Duplicate Number | C++ | 4 ms |
| 686 | Repeated String Match | C++ | 4 ms |
| 1356 | Sort Integers by The Number of 1 Bits | C++ | 8 ms |
| 0001-two-sum |
| 1396-count-servers-that-communicate |
| 3219-make-lexicographically-smallest-array-by-swapping-elements |
| 0001-two-sum |
| 0820-find-eventual-safe-states |
| 1396-count-servers-that-communicate |
| 0820-find-eventual-safe-states |
| 1396-count-servers-that-communicate |
| 1396-count-servers-that-communicate |
| 3219-make-lexicographically-smallest-array-by-swapping-elements |
| 1396-count-servers-that-communicate |
| 1396-count-servers-that-communicate |
| 0820-find-eventual-safe-states |
| 0820-find-eventual-safe-states |
| 3219-make-lexicographically-smallest-array-by-swapping-elements |