~/lc-grind

Discover how to find the largest square of 1's in a binary matrix using dynamic programming to efficiently calculate its area.

Maximize your stock trading profit with at most `k` buy-sell transactions using dynamic programming to navigate the price fluctuations.

Maximize your stock trading profit with at most two buy-sell transactions using dynamic programming to track the best possible gains from left-to-right and right-to-left sweeps of the price array.

Master the classic dynamic programming challenge of finding the minimum number of insertions, deletions, and replacements needed to transform one string into another.

Determine if a given string can be formed by interleaving two other strings, a classic dynamic programming challenge that tests your ability to manage overlapping subproblems and state transitions.

Navigate a grid with obstacles using dynamic programming to count the number of unique paths a robot can take from the top-left to the bottom-right corner, moving only down or right.

Find the minimum sum path from the top-left to bottom-right corner of a grid, moving only down or right, using dynamic programming to efficiently calculate the optimal route.

Find the smallest possible sum from the top to the bottom of a triangle by moving to adjacent numbers in the row below, using dynamic programming for an efficient solution.

Given an array of points on the X-Y plane, this Hard geometry problem challenges you to find the maximum number of points that can be placed on a single straight line.

Discover the clever math trick to efficiently count the trailing zeroes in a factorial without calculating the massive number itself.