notes/OJ notes/pages/Leetcode Combinations.md
2022-07-19 23:20:25 +08:00

44 lines
795 B
Markdown

# Leetcode Combinations
#### 2022-07-19 20:09
> ##### Algorithms:
> #algorithm #backtrack
> ##### Difficulty:
> #coding_problem #difficulty-medium
> ##### Additional tags:
> #leetcode #CS_list_need_understanding
> ##### Revisions:
> N/A
##### Related topics:
```expander
tag:#backtrack
```
##### Links:
- [Link to problem](https://leetcode.com/problems/combinations/)
- [Explanation](https://leetcode.com/problems/combinations/discuss/844096/Backtracking-cheatsheet-%2B-simple-solution)
___
### Problem
#### Examples
#### Constraints
### Thoughts
> [!summary]
> This is a #backtrack problem
The link I mentioned on the links section already have a good
explanation on the topic.
In my eyes, backtracking means DFS-like recursion and searching in solving problems.
### Solution