Professional Documents
Culture Documents
hashing
partition
partition
partition
two arrays
prefix sum
sliding window
other
tough
tough
another method hash
easy
inversion
binary sea
xor
Majority Element
Leaders in an array
A Product Array Puzzle
Find the smallest and second smallest elements in an array
Find duplicates in O(n) time and O(1) extra space | Set 1
Check if array elements are consecutive | Added Method 3
Find the minimum distance between two numbers
Find the smallest positive number missing from an unsorted
Set 1
Arrange given numbers to form the biggest number
Merge Overlapping Intervals
Find the maximum repeating number in O(n) time and O(1
space
Count all possible groups of size 2 or 3 that have sum as mu
3
Given a binary string, count number of substrings that start a
with 1
Count frequencies of all elements in array in O(1) extra spa
O(n) time
Convert array into Zig-Zag fashion
Count Inversions of size three in a given array
Merge two sorted arrays with O(1) extra space
Count Strictly Increasing Subarrays
Rearrange an array in maximum minimum form | Set 1
Minimize the maximum difference between the heights
Maximum product of a triplet (subsequnece of size 3) in array
Find Surpasser Count of each element in array
Find if array can be divided into two subarrays of equal sum
Find Two Missing Numbers | Set 1 (An Interesting Linea
Solution)