~/lc-grind

Master the classic backtracking challenge of generating all possible orderings of a distinct integer array.

Master the classic combinatorial generation problem by exploring efficient backtracking techniques to find all unique combinations of `k` numbers from `1` to `n`.

Generate all valid combinations of `n` pairs of parentheses using backtracking to ensure proper balance and order.

Generate all possible letter combinations from a phone number's digits using backtracking, just like old-school texting.

Design a Trie-based dictionary that supports adding words and searching with wildcard '.' characters for flexible pattern matching.

Find the shortest path to morph one word into another by changing one letter at a time, using a given word list as stepping stones.

Navigate the shortest mutation path from a start gene to an end gene using a valid gene bank, employing BFS to find the minimum number of single-character changes.

Navigate a Boustrophedon-style game board using dice rolls, snakes, and ladders to find the minimum moves required to reach the end with this classic BFS problem.

Master the topological sort algorithm to find a valid course sequence—or detect an impossible schedule—in this classic graph traversal problem.

Solve division queries between variables by modeling given equations as a weighted graph and traversing to find the product of ratios between any two nodes.