Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Learn Greedy + Backtracking #24

Open
3 of 4 tasks
yukisato opened this issue Jan 12, 2020 · 1 comment
Open
3 of 4 tasks

Learn Greedy + Backtracking #24

yukisato opened this issue Jan 12, 2020 · 1 comment

Comments

@yukisato
Copy link
Owner

yukisato commented Jan 12, 2020

  • Permutations (Medium)
  • Subsets (Medium)
  • Combination Sum (Medium)
  • Generate Parentheses (Medium)

Combination Sum

Solved by DFS.
First, I wrote a tree-like graph to think deeply.
Then came across the solution which uses DFS.

@yukisato yukisato added the Study label Jan 12, 2020
@yukisato yukisato changed the title Greedy + Backtracking Learn Greedy + Backtracking Jan 12, 2020
@yukisato
Copy link
Owner Author

yukisato commented Jan 31, 2020

yukisato added a commit that referenced this issue Feb 20, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant