Dynamic Programming

LeetCode problem #1130

LeetCode problem #1774

Master dynamic programming patterns and optimization techniques.

Find shortest paths from a source vertex to all other vertices in a weighted graph, capable of handling negative edge weights

Find the maximum profit from buying and selling stock with at most one transaction

Find the minimum number of operations (insert, delete, replace) required to transform one string into another.

Find shortest paths between all pairs of vertices in a weighted graph using dynamic programming

Determine if you can reach the last index of an array where each element represents the maximum jump length from that position

Given an array where each element represents the maximum jump length, find the minimum number of jumps to reach the last index

Find the longest palindromic substring in a given string

Find the maximum path sum in a binary tree.

Find the contiguous subarray with maximum sum using Kadane's algorithm

Find minimum refueling stops to reach target using greedy max-heap approach

Implement regular expression matching with support for '.' and '*'

Calculate how much rainwater can be trapped between bars of different heights

What is an ugly number? Solve n-th ugly number (2,3,5) with PriorityQueue + HashSet dedupe. O(n log n). Step-by-step—practice now.

Determine if a string can be segmented into space-separated words from a dictionary.