Piggy Bank of Cooooooode

class Solution { public List<String> letterCombinations(String digits) { String[] phone = new String[]{"","","abc","def","ghi","jkl","mno","pqrs&q

class Solution { public List<String> generateParenthesis(int n) { List<String> res=new ArrayList<String>(); generate(res,"",n,0,0); return res; } ...

Combination Sum Iclass Solution: def combinationSum(self, candidates, target): """ :type candidates: List[int] :type target: int :rtype: List[List[int]] ""...

BacktrackingPermutations Iclass Solution: def permute(self, nums): """ :type nums: List[int] :rtype: List[List[int]] """ res=[] tmp=[] sel...

Unique Binary Search Trees IGiven n, how many structurally unique BST’s (binary search trees) that store values 1 … n?Example:Input: 3Output: 5class Solution(object): def numTrees(self, n)...