📂
Interview Prep
Ctrlk
  • Introduction
  • Trees
  • Recursion & Backtracking
    • Knight's tour
    • Rat in a Maze
    • Valid Sudoku
    • Sudoku Solver
    • Remove Parenthesis
    • Subset
    • Subsets II
    • Permutations
    • Permutations II
    • Combinations
    • Combination Sum
    • Combination Sum II
    • Letter Combinations of a Phone Number
    • Generate Parentheses
    • Palindrome Partitioning
    • Gray Code
    • Permutation Sequence
    • N-Queens
    • N-Queens II
    • Remove Invalid Parentheses
    • Matchsticks to Square
    • Number of Atoms
  • Maths
  • Binary Searching & Sorting
  • Strings
  • BIT Manipulation
  • Two Pointers
  • Arrays
  • Linked List
  • Stacks & Queues
  • HashMap & HashSet & Sliding Window
  • Priority Queue
  • Dynamic Programming
  • Greedy
  • Graphs, BFS & DFS
  • Geometry
  • Merge Sort
  • Segment Trees
  • Most consistent ways of dealing with the series of stock problems
Powered by GitBook
On this page

Recursion & Backtracking

Knight's tourRat in a MazeValid SudokuSudoku SolverRemove ParenthesisSubsetSubsets IIPermutationsPermutations IICombinationsCombination SumCombination Sum IILetter Combinations of a Phone NumberGenerate ParenthesesPalindrome PartitioningGray CodePermutation SequenceN-QueensN-Queens IIRemove Invalid ParenthesesMatchsticks to SquareNumber of Atoms
PreviousNumber of Good Leaf Nodes PairsNextKnight's tour

Last updated 5 years ago