Back to Topics
Array
Your Progress
Progress
0%
Total Problems
36
Completed
0
Status | Problem | Bookmark | Notes | Actions |
---|---|---|---|---|
Reverse the array | ||||
Find the maximum and minimum element in an array | ||||
Find the "Kth" max and min element of an array | ||||
Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo | ||||
Move all the negative elements to one side of the array | ||||
Find the Union and Intersection of the two sorted arrays. | ||||
Write a program to cyclically rotate an array by one. | ||||
find Largest sum contiguous Subarray [V. IMP] | ||||
Minimise the maximum difference between heights [V.IMP] | ||||
Minimum no. of Jumps to reach end of an array | ||||
find duplicate in an array of N+1 Integers | ||||
Merge 2 sorted arrays without using Extra space. | ||||
Kadane's Algo [V.V.V.V.V IMP] | ||||
Merge Intervals | ||||
Next Permutation | ||||
Count Inversion | ||||
Best time to buy and Sell stock | ||||
find all pairs on integer array whose sum is equal to given number | ||||
find common elements In 3 sorted arrays | ||||
Rearrange the array in alternating positive and negative items with O(1) extra space | ||||
Find if there is any subarray with sum equal to 0 | ||||
Find factorial of a large number | ||||
find maximum product subarray | ||||
Find longest coinsecutive subsequence | ||||
Given an array of size n and a number k, fin all elements that appear more than " n/k " times. | ||||
Maximum profit by buying and selling a share atmost twice | ||||
Find whether an array is a subset of another array | ||||
Find the triplet that sum to a given value | ||||
Trapping Rain water problem | ||||
Chocolate Distribution problem | ||||
Smallest Subarray with sum greater than a given value | ||||
Three way partitioning of an array around a given value | ||||
Minimum swaps required bring elements less equal K together | ||||
Minimum no. of operations required to make an array palindrome | ||||
Median of 2 sorted arrays of equal size | ||||
Median of 2 sorted arrays of different size |