weekly_challenge_for_algorithm/week4_backtrack at master · wkcn/weekly_challenge_for_algorithm

Name		Name	Last commit message	Last commit date
parent directory ..
17.letter-combinations-of-a-phone-number.cpp		17.letter-combinations-of-a-phone-number.cpp
22.generate-parentheses.cpp		22.generate-parentheses.cpp
401.binary-watch.cpp		401.binary-watch.cpp
46.permutations.cpp		46.permutations.cpp
51.n-queens.cpp		51.n-queens.cpp
687.longest-univalue-path.cpp		687.longest-univalue-path.cpp
698.partition-to-k-equal-sum-subsets.cpp		698.partition-to-k-equal-sum-subsets.cpp
726.number-of-atoms.cpp		726.number-of-atoms.cpp
78.subsets.cpp		78.subsets.cpp
93.restore-ip-addresses.cpp		93.restore-ip-addresses.cpp
README.md		README.md
common.h		common.h

README.md

Index	Title	Solution(s)	Acceptance	Difficulty
401	Binary Watch	C++	46.0%	Easy
687	Longest Univalue Path	C++	34.8%	Easy
46	Permutations	C++	58.8%	Medium
22	Generate Parentheses	C++	58.4%	Medium
78	Subsets	C++	56.5%	Medium
698	Partition to K Equal Sum Subsets	C++	44.2%	Medium
17	Letter Combinations of a Phone Number	C++	43.9%	Medium
93	Restore IP Addresses	C++	33.0%	Medium
726	Number of Atoms	C++	46.4%	Hard
51	N-Queens	C++	42.5%	Hard