Grokking Oracle Coding Interview
Vote
0% completed
Hidden Document
Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content Hidden Document Content
.....
.....
.....
Like the course? Get enrolled and start learning!
F
focusssspro
· 3 months ago
You have test case:
[2,3,5]
0
But in constrains it is said: 1 <= target <= 40
M
makarand.h
· 2 years ago
It is not accepting correct results.
[[7], [2, 2, 3]] and [[2, 2, 3], [7]] both should be accepted but it doesn't.
Mohammed Dh Abbas
· 2 years ago
class Solution: def combinationSum(self, candidates, target): def backtrack(result, index, path, add): if add > target: return if add == target: result.append(path[:]) for i in range(index, len(candidates)): path.append(candidates[i]) add += candidates[i] backtrack(result, i, path, add) add -= candidates[i] path.pop() result = [] backtrack(result, 0, [], 0) return result
S
Reading Progress
0%