Ace the Coding Interview

In my experience in interviewing over 150 engineers in big tech companies and startups, I noticed that most questions were only a variation of a small subset of questions and concepts. The goal of this class is to give candidates a guide and a list of questions to study to set them up for success in the coding and system design interviews.

How do you find the missing number in a given integer array of 1 to 100?

How do you find the duplicate number on a given integer array?

How do you find the largest and smallest number in an unsorted integer array?

How do you find all pairs of an integer array whose sum is equal to a given number?

How do you find duplicate numbers in an array if it contains multiple duplicates?

How are duplicates removed from a given array in Java?

How is an integer array sorted in place using the quicksort algorithm?

How do you remove duplicates from an array in place?

How do you reverse an array in place in Java?

How are duplicates removed from an array without using any library?

These are the types of questions you will learn to solve in minutes!