Back to Topics
Array
36 questions in this topic
| # | Status | Problem | Difficulty | Marks | Save | Notes | Revision |
|---|---|---|---|---|---|---|---|
| 1 |
Reverse the array
|
Easy | 0 | ||||
| 2 |
Find the maximum and minimum element in an array
|
Medium | 0 | ||||
| 3 |
Find the "Kth" max and min element of an array
|
Medium | 0 | ||||
| 4 |
Given an array which consists of only 0, 1 and 2. Sort the array without using any sorting algo
|
Medium | 0 | ||||
| 5 |
Move all the negative elements to one side of the array
|
Medium | 0 | ||||
| 6 |
Find the Union and Intersection of the two sorted arrays.
|
Medium | 0 | ||||
| 7 |
Write a program to cyclically rotate an array by one.
|
Easy | 0 | ||||
| 8 |
find Largest sum contiguous Subarray [V. IMP]
|
Medium | 0 | ||||
| 9 |
Minimise the maximum difference between heights [V.IMP]
|
Medium | 0 | ||||
| 10 |
Minimum no. of Jumps to reach end of an array
|
Medium | 0 | ||||
| 11 |
find duplicate in an array of N+1 Integers
|
Easy | 0 | ||||
| 12 |
Merge 2 sorted arrays without using Extra space.
|
Medium | 0 | ||||
| 13 |
Kadane's Algo [V.V.V.V.V IMP]
|
Medium | 0 | ||||
| 14 |
Merge Intervals
|
Medium | 0 | ||||
| 15 |
Next Permutation
|
Medium | 0 | ||||
| 16 |
Count Inversion
|
Medium | 0 | ||||
| 17 |
Best time to buy and Sell stock
|
Medium | 0 | ||||
| 18 |
find all pairs on integer array whose sum is equal to given number
|
Medium | 0 | ||||
| 19 |
find common elements In 3 sorted arrays
|
Medium | 0 | ||||
| 20 |
Rearrange the array in alternating positive and negative items with O(1) extra space
|
Medium | 0 | ||||
| 21 |
Find if there is any subarray with sum equal to 0
|
Medium | 0 | ||||
| 22 |
Find factorial of a large number
|
Medium | 0 | ||||
| 23 |
find maximum product subarray
|
Easy | 0 | ||||
| 24 |
Find longest consecutive subsequence
|
Medium | 0 | ||||
| 25 |
Given an array of size n and a number k, find all elements that appear more than " n/k " times.
|
Medium | 0 | ||||
| 26 |
Maximum profit by buying and selling a share atmost twice
|
Medium | 0 | ||||
| 27 |
Find whether an array is a subset of another array
|
Medium | 0 | ||||
| 28 |
Find the triplet that sum to a given value
|
Medium | 0 | ||||
| 29 |
Trapping Rain water problem
|
Hard | 0 | ||||
| 30 |
Chocolate Distribution problem
|
Medium | 0 | ||||
| 31 |
Smallest Subarray with sum greater than a given value
|
Medium | 0 | ||||
| 32 |
Three way partitioning of an array around a given value
|
Medium | 0 | ||||
| 33 |
Minimum swaps required bring elements less equal K together
|
Medium | 0 | ||||
| 34 |
Minimum no. of operations required to make an array palindrome
|
Easy | 0 | ||||
| 35 |
Median of 2 sorted arrays of equal size
|
Hard | 0 | ||||
| 36 |
Median of 2 sorted arrays of different size
|
Hard | 0 |