---
title: 'Backtracking'
description: 'A backtracking algorithm is used to construct a solution recursively by starting with an empty solution and adding solution one by one.'
hide_table_of_contents: true
sidebar_position: 40
keywords:
  - leetcode
  - study plan
  - roadmap
  - backtracking
---


export const problems = [
  {
    "problemName": "0077. Combinations",
    "difficulty": "Medium",
    "leetCodeLink": "https://leetcode.com/problems/combinations",
    "solutionLink": "../../solutions/0000-0099/combinations-medium"
  },
  {
    "problemName": "0046. Permutations",
    "difficulty": "Medium",
    "leetCodeLink": "https://leetcode.com/problems/permutations",
    "solutionLink": "../../solutions/0000-0099/permutations-medium"
  },
  {
    "problemName": "0017. Letter Combinations of a Phone Number",
    "difficulty": "Medium",
    "leetCodeLink": "https://leetcode.com/problems/letter-combinations-of-a-phone-number",
    "solutionLink": "../../solutions/0000-0099/letter-combinations-of-a-phone-number-medium"
  },
]

<Table 
    title=""
    data={problems}
    isSorted={false}
    collectionLink=""
/>