Closest Dessert Cost
LeetCode problem #1774
Recursion & Backtracking
Master recursive problem solving, backtracking, and exploring all solution possibilities.
All Paths From Source to Target
Find all possible paths from source node to target node in a directed acyclic graph (DAG)
Generate Permutations
Generate all possible permutations of a given string.
Print All Root-to-Leaf Paths
Print all root-to-leaf paths in a binary tree
Word Break
Determine if a string can be segmented into space-separated words from a dictionary.
Word Break II
Return all possible ways to break a string into dictionary words