LeetCode 964: Least Operators to Express Number
A clear explanation of expressing a target using the fewest operators with repeated uses of x.
Tag
Memoization
19 notes
LeetCode 894: All Possible Full Binary Trees
A clear explanation of generating all full binary trees with n nodes using recursion and memoization.
LeetCode 851: Loud and Rich
A clear explanation of Loud and Rich using graph traversal, DFS, and memoization.
LeetCode 808: Soup Servings
A probability dynamic programming solution for computing whether soup A empties before soup B, with an early return for large input.
LeetCode 756: Pyramid Transition Matrix
A clear explanation of solving Pyramid Transition Matrix using backtracking and memoization over pyramid rows.
LeetCode 691: Stickers to Spell Word
Find the minimum number of stickers needed to form a target string using top-down dynamic programming with memoization.
LeetCode 638: Shopping Offers
A DFS and memoization solution for finding the minimum cost to satisfy item needs using individual prices and reusable special offers.
LeetCode 241: Different Ways to Add Parentheses
A clear explanation of generating all possible results from different parenthesizations using divide and conquer recursion.
LeetCode 576: Out of Boundary Paths
A clear dynamic programming solution for counting paths that move a ball out of a grid boundary.
LeetCode 546: Remove Boxes
A clear explanation of maximizing remove-box scores using interval dynamic programming with memoization.
LeetCode 514: Freedom Trail
A clear explanation of finding the minimum steps to spell a key on a circular ring using dynamic programming and memoized DFS.
LeetCode 488: Zuma Game
A clear explanation of solving Zuma Game with DFS, memoization, and chain-removal simulation.
LeetCode 464: Can I Win
A clear explanation of solving the Can I Win game using minimax recursion, bitmask state compression, and memoization.
LeetCode 403: Frog Jump
A clear explanation of the Frog Jump problem using dynamic programming with reachable jump sizes.
LeetCode 329: Longest Increasing Path in a Matrix
A clear explanation of Longest Increasing Path in a Matrix using DFS with memoization.
LeetCode 294: Flip Game II
A recursive game theory solution with memoization for deciding whether the starting player can force a win.
LeetCode 87: Scramble String
A detailed guide to solving Scramble String with recursive dynamic programming and memoization.
LeetCode 140: Word Break II
Return all valid sentences formed by inserting spaces into a string so every word belongs to the dictionary, using DFS with memoization.
LeetCode 10: Regular Expression Matching
A detailed explanation of matching a full string against a simplified regular expression with dot and star using dynamic programming.