| Pascal's Triangle |
LeetCode #118 |
C++ |
Java |
Python |
2025-08-01 |
Binomial Coefficients (nCr) |
| Rearranging Fruits |
LeetCode #2449 |
C++ |
Java |
Python |
2025-08-02 |
Greedy + Multisets/Counting |
| Maximum Fruits Harvested |
LeetCode #2106 |
C++ |
Java |
Python |
2025-08-03 |
Sliding Window + Prefix Sum |
| Fruit Into Baskets |
LeetCode #904 |
C++ |
Java |
Python |
2025-08-04 |
Sliding Window, Max Subarray with 2 Types |
| Fruit Into Baskets 2 |
LeetCode #3477 |
C++ |
Java |
Python |
2025-08-05 |
Simulation |
| Fruit Into Baskets 3 |
LeetCode #3479 |
C++ |
Java |
Python |
2025-08-06 |
Segment Tree |
| Find the Maximum Number of Fruits Collected |
LeetCode #3363 |
C++ |
Java |
Python |
2025-08-07 |
DP on Grid |
| Soup Servings |
LeetCode #808 |
C++ |
Java |
Python |
2025-08-08 |
DP + Memoization, Probability |
| Power of Two |
LeetCode #231 |
C++ |
Java |
Python |
2025-08-09 |
Bit Manipulation, O(1) Check |
| Reordered Power of 2 |
LeetCode #869 |
C++ |
Java |
Python |
2025-08-10 |
Digit Frequency Matching |
| Range Product Queries of Powers |
LeetCode #2438 |
C++ |
Java |
Python |
2025-08-11 |
Decomposition and Direct Calculation |
| Ways to Express Integer as Sum of Powers |
LeetCode #2787 |
C++ |
Java |
Python |
2025-08-12 |
DP + Memoization |
| Power of Three |
LeetCode #326 |
C++ |
Java |
Python |
2025-08-13 |
Loop / Logarithmic Check, O(1) |
| Largest 3-Same-Digit Number in String |
LeetCode #2264 |
C++ |
Java |
Python |
2025-08-14 |
String Traversal, Max Digit Tracking |
| Power of Four |
LeetCode #342 |
C++ |
Java |
Python |
2025-08-15 |
Bit Manipulation, Loop Check |
| Maximum 69 Number |
LeetCode #1323 |
C++ |
Java |
Python |
2025-08-16 |
Greedy – Change First 6 to 9 |
| New 21 Game |
LeetCode #837 |
C++ |
Java |
Python |
2025-08-17 |
DP + Sliding Window Probabilities |
| 24 Game (Custom Variant) |
LeetCode #679 |
C++ |
Java |
Python |
2025-08-18 |
Backtracking / Math Expressions |
| Number of Zero-Filled Subarrays |
LeetCode #2348 |
C++ |
Java |
Python |
2025-08-19 |
Counting Consecutive Zeroes |
| Count Square Submatrices with All Ones |
LeetCode #1277 |
C++ |
Java |
Python |
2025-08-20 |
DP on Matrix |
| Count Submatrices With All Ones |
LeetCode #1504 |
C++ |
Java |
Python |
2025-08-21 |
Histogram + Stack (Row-wise) |
| Minimum Area to Cover All Ones I |
LeetCode #3195 |
C++ |
Java |
Python |
2025-08-22 |
Bounding Rectangle |
| Find the Minimum Area to Cover All Ones II |
LeetCode #3196 |
C++ |
Java |
Python |
2025-08-23 |
Bounding Rectangle + Min Area |
| Longest Subarray of 1’s After Deletion |
LeetCode #1493 |
C++ |
Java |
Python |
2025-08-24 |
Sliding Window |
| Diagonal Traverse |
LeetCode #498 |
C++ |
Java |
Python |
2025-08-25 |
— |
| Maximum Area of Longest Diagonal Rectangle |
LeetCode #3000 |
C++ |
Java |
Python |
2025-08-26 |
Geometry + Sorting |
| Longest V-Shaped Diagonal |
LeetCode#3459 |
C++ |
Java |
Python |
2025-08-27 |
Grid Traversal |
| Sort Matrix by Diagonals |
LeetCode#3446 |
C++ |
Java |
Python |
2025-08-28 |
Diagonal Bucket Sort |
| Alice and Bob Playing Flower Game |
LeetCode#3021 |
C++ |
Java |
Python |
2025-08-29 |
Graph/Simulation (Custom) |
| Valid Sudoku |
LeetCode #36 |
C++ |
Java |
Python |
2025-08-30 |
HashSet Validation |
| Sudoku Solver |
LeetCode #37 |
C++ |
Java |
Python |
2025-08-31 |
Backtracking + Constraint Propagation |
| Maximum Average Pass Ratio |
LeetCode #1792 |
C++ |
Java |
Python |
2025-09-01 |
Greedy + Priority Queue |
| Find the Number of Ways to Place People I |
LeetCode #3025 |
C++ |
Java |
Python |
2025-09-02 |
Sort by x↑, y↓; sweep with running maxY to ensure empty rectangle; O(n²). |
| Find the Number of Ways to Place People II |
LeetCode #3027 |
C++ |
Java |
Python |
2025-09-03 |
Same idea as I (x↑, y↓ + maxY sweep to avoid interior points); O(n²). |
| Find the Closest Person |
LeetCode #1848 |
C++ |
Java |
Python |
2025-09-04 |
Linear Scan: find abs(i - start) where arr[i] == target, track min |
| Minimum Operations to Make Integer Zero |
LeetCode #2749 |
C++ |
Java |
Python |
2025-09-05 |
Try k=1..60, check if num1 - k*num2 ≥ k and popcount(num) ≤ k |