# 2026 Daily LeetCode Problems

All original 2026 daily problem statements and solution write-ups have been preserved in the standard LeetCode platform structure, grouped by difficulty and problem ID. Each problem folder contains the original statement as `README.md` and the original solution write-up as `solution.md`.

## Complete migration index

| Daily challenge | Problem folder | Difficulty |
|---|---|---|
| January 01 | [66. Plus One](./easy/0066-plus-one/) | Easy |
| January 02 | [961. N-Repeated Element in Size 2N Array](./easy/0961-n-repeated-element-in-size-2n-array/) | Easy |
| January 03 | [1411. Number of Ways to Paint N × 3 Grid](./hard/1411-number-of-ways-to-paint-n-3-grid/) | Hard |
| January 04 | [1390. Four Divisors](./medium/1390-four-divisors/) | Medium |
| January 05 | [1975. Maximum Matrix Sum](./medium/1975-maximum-matrix-sum/) | Medium |
| January 06 | [1161. Maximum Level Sum of a Binary Tree](./medium/1161-maximum-level-sum-of-a-binary-tree/) | Medium |
| January 07 | [1339. Maximum Product of Splitted Binary Tree](./medium/1339-maximum-product-of-splitted-binary-tree/) | Medium |
| January 08 | [1458. Max Dot Product of Two Subsequences](./hard/1458-max-dot-product-of-two-subsequences/) | Hard |
| January 09 | [865. Smallest Subtree with all the Deepest Nodes](./medium/0865-smallest-subtree-with-all-the-deepest-nodes/) | Medium |
| January 10 | [712. Minimum ASCII Delete Sum for Two Strings](./medium/0712-minimum-ascii-delete-sum-for-two-strings/) | Medium |
| January 11 | [85. Maximal Rectangle](./hard/0085-maximal-rectangle/) | Hard |
| January 12 | [1266. Minimum Time Visiting All Points](./easy/1266-minimum-time-visiting-all-points/) | Easy |
| January 13 | [3453. Separate Squares I](./medium/3453-separate-squares-i/) | Medium |
| January 14 | [3454. Separate Squares II](./hard/3454-separate-squares-ii/) | Hard |
| January 15 | [2943. Maximize Area of Square Hole in Grid](./medium/2943-maximize-area-of-square-hole-in-grid/) | Medium |
| January 16 | [2975. Maximum Square Area by Removing Fences From a Field](./medium/2975-maximum-square-area-by-removing-fences-from-a-field/) | Medium |
| January 17 | [3047. Find the Largest Area of Square Inside Two Rectangles](./medium/3047-find-the-largest-area-of-square-inside-two-rectangles/) | Medium |
| January 18 | [1895. Largest Magic Square](./medium/1895-largest-magic-square/) | Medium |
| January 19 | [1292. Maximum Side Length of a Square with Sum less than or Equal to Threshold](./medium/1292-maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/) | Medium |
| January 20 | [3314. Construct the Minimum Bitwise Array I](./easy/3314-construct-the-minimum-bitwise-array-i/) | Easy |
| January 21 | [3315. Construct the Minimum Bitwise Array II](./medium/3315-construct-the-minimum-bitwise-array-ii/) | Medium |
| January 22 | [3507. Minimum Pair Removal to Sort Array I](./easy/3507-minimum-pair-removal-to-sort-array-i/) | Easy |
| January 23 | [3510. Minimum Pair Removal to Sort Array II](./hard/3510-minimum-pair-removal-to-sort-array-ii/) | Hard |
| January 24 | [1877. Minimize Maximum Pair Sum in Array](./medium/1877-minimize-maximum-pair-sum-in-array/) | Medium |
| January 25 | [1984. Minimum Difference Between Highest and Lowest of K Scores](./easy/1984-minimum-difference-between-highest-and-lowest-of-k-scores/) | Easy |
| January 26 | [1200. Minimum Absolute Difference](./easy/1200-minimum-absolute-difference/) | Easy |
| January 27 | [3650. Minimum Cost Path with Edge Reversals](./medium/3650-minimum-cost-path-with-edge-reversals/) | Medium |
| January 28 | [3651. Minimum Cost Path with Teleportations](./hard/3651-minimum-cost-path-with-teleportations/) | Hard |
| January 29 | [2976. Minimum Cost to Convert String I](./medium/2976-minimum-cost-to-convert-string-i/) | Medium |
| January 30 | [2977. Minimum Cost to Convert String II](./hard/2977-minimum-cost-to-convert-string-ii/) | Hard |
| January 31 | [744. Find Smallest Letter Greater Than Target](./easy/0744-find-smallest-letter-greater-than-target/) | Easy |
| February 01 | [3010. Divide an Array Into Subarrays With Minimum Cost I](./easy/3010-divide-an-array-into-subarrays-with-minimum-cost-i/) | Easy |
| February 02 | [3013. Divide an Array Into Subarrays With Minimum Cost II](./hard/3013-divide-an-array-into-subarrays-with-minimum-cost-ii/) | Hard |
| February 03 | [3637. Trionic Array I](./easy/3637-trionic-array-i/) | Easy |
| February 04 | [3640. Trionic Array II](./hard/3640-trionic-array-ii/) | Hard |

## Preservation notes

- 35 problem statements and 35 matching solution write-ups were moved.
- The original Markdown content is retained; filenames are standardized to `README.md` and `solution.md` inside each problem folder.
- The old month/date-based archive layout has been retired; this index preserves the date-based navigation without duplicating problem statements or solutions.
- Future daily problems should be added directly under `solutions/platforms/leetcode/{easy,medium,hard}/` and linked here.