GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Patterns
  3. /Backtracking - Combinations
←All Patterns
BacktrackingEvidence Contributing

Backtracking - Combinations

Build fixed- or variable-length combinations by choosing the next element from a remaining candidate pool.

Practice Problems: 5
Difficulty: 0 Easy·5 Medium·0 Hard

Core technique

Review the technique, then try the mapped problems below. The right approach depends on each problem's constraints.

  • Core Strategy: Build fixed- or variable-length combinations by choosing the next element from a remaining candidate pool.

Canonical Practice Problems

5 problems
1.Combination SumMedium
Solve on LeetCode↗
2.Combination Sum IIMedium
Solve on LeetCode↗
3.CombinationsMedium
Solve on LeetCode↗
4.Generate ParenthesesMedium
Solve on LeetCode↗
5.Letter Combinations of a Phone NumberMedium
Solve on LeetCode↗

Curated Sheets Containing This Pattern

NeetCode All

5 problems

→

LeetCode Top Interview 150

4 problems

→

NeetCode 150

4 problems

→

Striver A2Z

4 problems

→

Striver SDE Sheet

2 problems

→

Related Algorithmic Patterns

Backtracking

Backtracking - Grid Path Search

Backtracking

Backtracking - Partition/Cut Points

Backtracking

Backtracking - Permutations

Backtracking

Backtracking - Subsets (Include/Exclude)

Backtracking

N-Queens Style Constraint Backtracking

GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy