Please refer to the resources in the sorting section here
Arrays are usually the foremost and thought to be a scoring topic in programming interviews, because array questions are formed around a definitive set of patterns with questions modified only slightly.
Here, we give you an interface to most of the patterns that array questions can take.
The following checklist helps us get started with solving array problems :
If it's a coding round(non-interviewer based), check if the constraints permit a brute force solution. If they do, go with it. Note that this won't work in personal interviews.
If brute force approach doesn't make the cut, read the question in depth for some specific keywords that might hint at one of the approaches being used. For instance, searching for some elements with a certain property in a sorted array with N >= 10^10, usually hint at using binary search. Similarly, the other patterns have similar keywords you should know, that will hint you at the right approach
Make sure you are clear with the concepts - this might sound cliche, but it's very very critical. Most of the problems you'll come across in your practice have been asked before, and won't be repeated as they are. You need to be clear enough with the concept to make tweaks to that logic to suit the problem statement given to you