Dynamic Programming

DP optimization problems

Best Time to Buy and Sell Stock

Climbing Stairs

Maximum Subarray

Array · Divide and Conquer ·

Pascal's Triangle

Divide and Conquer ·

Distinct Subsequences

Longest Increasing Path in a Matrix

Graph · Matrix

Longest Valid Parentheses

Stack · String

Split Array Largest Sum

Binary Search · Greedy

Trapping Rain Water

Array · Stack · Two Pointers

Best Time to Buy and Sell Stock II

Array · Breadth-First Search ·

Count Palindromic Substrings

House Robber II

Longest Common Subsequence

Longest Increasing Subsequence

Array · Binary Search ·

Longest Palindromic Substring

String · Two Pointers

Maximum Product Subarray

Minimum Path Sum

Array · Matrix

Perfect Squares

Backtracking ·

Hash Table · String