| # | 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 |
| 0820-find-eventual-safe-states |
| 0865-smallest-subtree-with-all-the-deepest-nodes |
| 1339-maximum-product-of-splitted-binary-tree |
| 1396-count-servers-that-communicate |
| 0820-find-eventual-safe-states |
| 0865-smallest-subtree-with-all-the-deepest-nodes |
| 1396-count-servers-that-communicate |
| 1396-count-servers-that-communicate |
| 3219-make-lexicographically-smallest-array-by-swapping-elements |
| 1396-count-servers-that-communicate |
| 0820-find-eventual-safe-states |
| 0820-find-eventual-safe-states |
| 1877-minimize-maximum-pair-sum-in-array |
| 1975-maximum-matrix-sum |
| 0865-smallest-subtree-with-all-the-deepest-nodes |
| 1339-maximum-product-of-splitted-binary-tree |
| 0865-smallest-subtree-with-all-the-deepest-nodes |
| 1339-maximum-product-of-splitted-binary-tree |
| 0085-maximal-rectangle |
| 0712-minimum-ascii-delete-sum-for-two-strings |
| 1458-max-dot-product-of-two-subsequences |
| 2977-minimum-cost-to-convert-string-ii |
| 3651-minimum-cost-path-with-teleportations |
| 0712-minimum-ascii-delete-sum-for-two-strings |
| 2976-minimum-cost-to-convert-string-i |
| 2977-minimum-cost-to-convert-string-ii |
| 0084-largest-rectangle-in-histogram |
| 0085-maximal-rectangle |
| 0084-largest-rectangle-in-histogram |
| 0085-maximal-rectangle |
| 1266-minimum-time-visiting-all-points |
| 3047-find-the-largest-area-of-square-inside-two-rectangles |
| 1266-minimum-time-visiting-all-points |
| 3047-find-the-largest-area-of-square-inside-two-rectangles |
| 0744-find-smallest-letter-greater-than-target |
| 1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold |
| 3453-separate-squares-i |
| 3454-separate-squares-ii |
| 3454-separate-squares-ii |
| 3454-separate-squares-ii |
| 2975-maximum-square-area-by-removing-fences-from-a-field |
| 1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold |
| 1895-largest-magic-square |
| 3314-construct-the-minimum-bitwise-array-i |
| 3315-construct-the-minimum-bitwise-array-ii |
| 3507-minimum-pair-removal-to-sort-array-i |
| 3510-minimum-pair-removal-to-sort-array-ii |
| 3507-minimum-pair-removal-to-sort-array-i |
| 3510-minimum-pair-removal-to-sort-array-ii |
| 3507-minimum-pair-removal-to-sort-array-i |
| 3510-minimum-pair-removal-to-sort-array-ii |
| 3507-minimum-pair-removal-to-sort-array-i |
| 3510-minimum-pair-removal-to-sort-array-ii |
| 3507-minimum-pair-removal-to-sort-array-i |
| 3510-minimum-pair-removal-to-sort-array-ii |
| 1877-minimize-maximum-pair-sum-in-array |
| 1984-minimum-difference-between-highest-and-lowest-of-k-scores |
| 2976-minimum-cost-to-convert-string-i |
| 2977-minimum-cost-to-convert-string-ii |
| 2976-minimum-cost-to-convert-string-i |
| 2977-minimum-cost-to-convert-string-ii |
| 2977-minimum-cost-to-convert-string-ii |