Piggy Bank of Cooooooode

Extend from Leetcode 15class Solution { public int threeSumClosest(int[] nums, int target) { int minDis=0; int res=0; if (nums == null || nums.length < 3) return res; ...

Extend from 3Sum. Add another for loop.Slow Versionclass Solution { public List<List<Integer>> fourSum(int[] nums, int target) { List<List<Integer>> r

class Solution { public int removeElement(int[] nums, int val) { int left=0; int right=nums.length-1; if(right<0){ return nums.length; } whil...

Two pointersleft points to the position that 0 endsright points to the position that 2 beginsclass Solution: def sortColors(self, nums): """ :type nums: List[int] :rtype...

2 methodsclass Solution(object): def removeDuplicates(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return 0 newT...