Open Khandagale-Saurabh opened 2 years ago
Faulty Keyboard
Range addition if(end+1< length) { res[end+1]=-inc }
Water with most container
Square Of Sorted Array
Majority Of Elements
Product with self
Set Matrix-zero https://leetcode.com/problems/set-matrix-zeroes/solution/
Number of Sub-arrays With Odd Sum
All Duplicate
Word Search
Top K Frequent Elements || Leetcode
2sum if wali condition helpkrti hai unique elements ko print krne mai
Partion label:
Partition Array Disjoint o(1)
Wiggle Sort( a[o]<=a[1]>=a[2])
https://leetcode.com/problems/car-fleet/discuss/2017277/Java-short-easy-and-clean-with-comments
Max area
Island perimert i>0 && grid[i-1][j]==1 j>0 && grid[i][j-1]==1
Minimum no of Platform
Merge Interval
Max Sum Subarray || Dp
Max Subarray product
Frinds Paring
Paint House:
LinkedList: odd even
Cycle Node
Remove outermost
Partition Array Disjoint
Max Product of three number 1]min1,min2, [-min1,-min2]=+ (if any -) 2]max1,max2,max3 (if all +)
Sort Array by paritory [even followed by odd]
wiggel sort 2
Faulty Keyboard
Range addition if(end+1< length) { res[end+1]=-inc }
Water with most container
Square Of Sorted Array
Majority Of Elements
Product with self
Set Matrix-zero https://leetcode.com/problems/set-matrix-zeroes/solution/
Number of Sub-arrays With Odd Sum
All Duplicate
Word Search
Top K Frequent Elements || Leetcode
2sum if wali condition helpkrti hai unique elements ko print krne mai
Partion label:
Partition Array Disjoint o(1)
Wiggle Sort( a[o]<=a[1]>=a[2])
https://leetcode.com/problems/car-fleet/discuss/2017277/Java-short-easy-and-clean-with-comments
Max area
Island perimert i>0 && grid[i-1][j]==1 j>0 && grid[i][j-1]==1
Minimum no of Platform
Merge Interval
Max Sum Subarray || Dp
Max Subarray product
Frinds Paring
Paint House:
LinkedList: odd even
Cycle Node
Remove outermost
Partition Array Disjoint
Max Product of three number 1]min1,min2, [-min1,-min2]=+ (if any -) 2]max1,max2,max3 (if all +)
Sort Array by paritory [even followed by odd]