leetcode : Combination Sum II
runtime 0 ms, beats 100% of cpp submissions
O(2^n) solution with explanation
tags: backtracking
runtime 0 ms, beats 100% of cpp submissions
O(2^n) solution with explanation
tags: backtracking
runtime 3 ms, beats 98.16% of cpp submissions
O(2^k) solution with explanation
tags: backtracking
runtime 0 ms, beats 100% of cpp submissions
O(4^(n/3)) solution with explanation
tags: simulation
runtime 15 ms, beats 98.64% of cpp submissions
O(n^2) solution with explanation
tags: none
runtime 0 ms, beats 100% of cpp submissions
O(log(n)) solution with explanation
tags: binary search
runtime 4 ms, beats 97.07% of cpp submissions
O(log(n)) solution with explanation
tags: binary search
runtime 0 ms, beats 100% of cpp submissions
O(n) solution with explanation
tags: stack
runtime 0 ms, beats 100% of cpp submissions
O(mn) solution with explanation
tags: recursion, dp
runtime 93 ms, beats 86.55% of cpp submissions
O(a+nb) solution with explanation
tags: sliding window, hash table