Codeforces
CF Step
Youtube Linkedin Discord Toggle Dark/Light/Auto mode Toggle Dark/Light/Auto mode Toggle Dark/Light/Auto mode Back to homepage

Uncategorized : Secret - LeetCode

This list is used to train students. Do not use it without supervision.

Level

Level

Level

  • 64. Minimum Path Sum : Classical Grid DP for beginners.

Level

  • 3282. Reach End of Array With Max Score : Deriving optimal solution from Exchange Argument. DP is deadend.
  • 3320. Count The Number of Winning Sequences : Good problem for learning 2D DP. Partitions. Equivalence classes. Negative Indices for Array. Modulo in DP.

Level

  • 3321. Find X-Sum of All K-Long Subarrays II : 2 Heap trick.

Level

Level

  • 3266. Final Array State After K Multiplication Operations II : Divison chops off the number in O(log(n)) steps. Fast Exponentiation. Dynamically changing minimas after each operation. Euclid’s Divison Lemma.

Level

  • 940. Distinct Subsequences II : New Perspective for Subsequence DP.

Level

  • 3276. Select Cells in Grid With Maximum Score : Avoiding duplicates in Bitmask DP. Prerequisite for SOS DP.

Level

  • 546. Remove Boxes : Range DP.