
Here is a study plan based on this excellent article "Ace The Coding Interview Everytime".

Do I need one, two or more "indexes" or "pointers" or "boundaries" to keep track of anything such as the positions in an array or the boundaries of a matrix?.

Do I need to use a hash table (or dictionary) to keep track of anything such as frequencies or counts or uniqueness?.Have I seen a problem like this before from practicing?.This article also offers more ideas on what to practice: Questions to Ask Yourself To Help You Solve The Algorithms/Data Structure Problem With these practice methods, during an interview you will be able to solve the problem within the timeframe given and be able to explain clearly to the interviewer how the solution works and why you implemented it that way. The third way to practice is to speak every step of the solution out loud. This means recognizing which algorithm to use and applying it as quickly as possible. The second way to practice is with a timer to be able to answer the question as fast as possible. The first way is to recognize the problem types and then solve them completely, no matter how long it takes. When you practice on one of these sites, you should practice in three ways. HackerRank (site used for conducting interviews, has some great practice questions).

Basic algorithms for interviews software#
In most software and web development and software engineering job interviews, you will be asked questions that involve algorithms.
