Skip to main content
DevEval
LibraryPractice
  1. Problems
  2. Backtracking

Topic

Backtracking problems

32 problems: 2 Easy, 19 Medium, 11 Hard.

Easy (2)

  • Binary Tree Paths
  • Binary Watch

Medium (19)

  • Subsets
  • Permutations
  • Letter Combinations of a Phone Number
  • Generate Parentheses
  • Valid Sudoku
  • Lowest Common Ancestor of a Binary Tree
  • Word Search
  • Combination Sum
  • Partition Equal Subset Sum
  • Palindrome Partitioning
  • Subsets II
  • Combination Sum II
  • Path Sum II
  • Restore IP Addresses
  • Beautiful Arrangement
  • All Paths From Source to Target
  • Combination Sum III
  • Letter Case Permutation
  • Step-By-Step Directions From a Binary Tree Node to Another

Hard (11)

  • N-Queens
  • Sudoku Solver
  • Expression Add Operators
  • Word Search II
  • Palindrome Partitioning II
  • Word Break II
  • Stickers to Spell Word
  • Optimal Account Balancing
  • Zuma Game
  • Maximum Score Words Formed by Letters
  • Count Vowels Permutation

Other topics

  • Array414
  • Math223
  • String204
  • Dynamic Programming142
  • Hash Table125
  • SQL116
  • Tree93
  • Matrix83
  • Sorting83
  • Simulation66
  • Greedy65
  • Binary Search61
  • Machine Learning59
  • Two Pointers57
  • Stack50
  • Graph49
  • Data Engineering48
  • Bit Manipulation47
  • Heap47
  • Sliding Window44
  • Prefix Sum42
  • Aggregation38
  • Design37
  • Linked List32
  • Breadth-First Search30
  • Depth-First Search27
  • Combinatorics25
  • Statistics25
  • Number Theory24
  • Binary Search Tree23
  • Intervals23
  • Joins18
  • Divide and Conquer17
  • Union Find17
  • Geometry16
  • Recursion16
  • Backend Systems12
  • String Matching12
  • Data Integrity11
  • Shortest Path11
  • Queue10
  • Subqueries9
  • Topological Sort9
  • Trie7
  • Game Theory6
  • Window Functions6
  • API3
  • Brainteaser3
  • Probability3
  • Reliability3
Library
Practice
Create free account