• Unique Paths II (Problem #63) — Maze with Obstacles
  • Minimum Path Sum (Problem #64)

I followed Raj Vikramaditya (Striver)'s playlist and focused on strengthening my understanding of 2-D Dynamic Programming on grids.

Both problems helped me recognize a common DP pattern where each cell depends on previously computed states (top/left). As usual, I implemented every approach step-by-step:

  • Recursion
  • Memoization
  • Tabulation
  • Space Optimization

Practicing all four methods really deepened my intuition about how we move from brute force to efficient solutions. These grid-based problems also improved my ability to visualize state transitions clearly.

Each day, I'm getting more comfortable with DP patterns and problem-solving.

Consistency over perfection. On to the next day.

None