N-Queens
Learn how to solve the N-Queens coding problem to prepare for your next technical interview! Interviewers love the N-Queens problem because it reveals whether you can reason about constraints and prune aggressively, or whether you reach for brute force and hope for the best.
4 hours ago8 min read
Â
Letter Combinations of a Phone Number
Learn how to solve the Letter Combinations of a Phone Number coding problem to prepare for your next technical interview! This question is a a classic interviewers test for whether you can systematically explore combinations without losing control of the recursion.
1 day ago7 min read
Â
Combination Sum II
Learn how to solve the Combination Sum II problem to prepare for your next technical interview! Combination Sum II has the same goal as Combination Sum, with one crucial difference. Each number can only be used once, and the input may contain duplicates. That single change forces you to be much more deliberate about how you explore the search space. Get the duplicate handling wrong and you'll produce repeated combinations. Get it too aggressive and you'll miss valid ones.
1 day ago7 min read
Â
Combination Sum
Learn how to solve the Combination Sum coding problem to prepare for your next technical interview! Combination Sum is a structured exploration problem where you need to build valid combinations while avoiding duplicates and dead ends. Interviewers use it to test whether you can control a recursive search space with clear rules, and whether you can adapt a familiar pattern (backtracking) to handle a new wrinkle (unlimited reuse).
1 day ago7 min read
Â
Subsets (Power Set)
Learn how to solve the Subsets coding problem to prepare for your next technical interview! The Subsets problem tests whether you understand how to explore a decision tree without missing cases or duplicating work. It's a classic interview question because the same thinking shows up across backtracking, bit manipulation, and combinatorics problems.
2 days ago6 min read
Â
