Important Array Problems for interview Preparation

Here is the list of Some interview questions related to array Data Structure which you might face up in your upcoming interview

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