LeetCode 847: Shortest Path Visiting All Nodes
A clear explanation of the Shortest Path Visiting All Nodes problem using multi-source BFS and bitmask state compression.
Tag
Bitmask
8 notes
LeetCode 864: Shortest Path to Get All Keys
A clear explanation of finding the minimum moves to collect all keys in a grid using BFS with key bitmasks.
LeetCode 943: Find the Shortest Superstring
A clear explanation of solving Find the Shortest Superstring using pairwise overlaps and bitmask dynamic programming.
LeetCode 698: Partition to K Equal Sum Subsets
Decide whether an array can be divided into k non-empty subsets with equal sums using backtracking and pruning.
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 526: Beautiful Arrangement
A clear explanation of counting beautiful arrangements using backtracking and divisibility pruning.
LeetCode 473: Matchsticks to Square
A clear explanation of deciding whether matchsticks can form a square using backtracking, sorting, and pruning.
LeetCode 464: Can I Win
A clear explanation of solving the Can I Win game using minimax recursion, bitmask state compression, and memoization.