Top 60 Coding Problems for Programming Job Interviews

Hello friends, are you preparing for coding interviews and looking for coding problems which are commonly asked on interviews? If Yes, then you have come to the right place.

Earlier, I have shared best System design courses , books , websites , and popular System design questions and today, I am going to share popular coding interview questions you can solve to prepare for your programming job interviews.

By solving these coding problems you will not just gain confidence but also improve your knowledge of data structure and algorithms, and other important topics. These questions cover all essential data structures like array, linked list, string, binary tree, and much more.

I have also included the questions from miscellaneous topics like bitwise operator, coding questions based upon popular programming task like collision detection as well few more system design questions .

Btw, there is no point in attempting these questions if you don't have sufficient knowledge of essential Data Structure and Algorithms or you have not touched them for ages.

In that case, you should take a good introductory course like Master the Coding Interview: Data Structures + Algorithms by Andrei Negaoie to refresh your DS and algorithms skills.

Top 60 Coding Interview Questions for Programmers

Without any further ado, here is my list of some of the most frequently asked coding interview questions from programming job interviews:

1. Array Coding Problems

An array is the most fundamental data structure, which stores elements at a contiguous memory location. It is also one of the darling topics of interviewers and you will hear a lot of questions about an array in any coding interview , like reversing an array, sorting the array, or searching elements on the array.

The key benefit of an array data structure is that it offers fast O(1) search if you know the index, but adding and removing an element from an array is slow because you cannot change the size of the array once it's created.

In order to create a shorter or longer array, you need to create a new array and copy all elements from old to new.

The key to solving array-based questions is having a good knowledge of array data structure as well as basic programming constructors such as loop, recursion, and fundamental operators.

Here are some tips to solve array based coding problems:

1. array index starts at zero
2. You can use loops to iterate over array
3. array elements are stored in contiguous memory location so you can also access them using pointer arithmetic
4. Array provides O(1) performance for search using index
5. Adding or removing elements are slower in array due to re-sizing

Here are some of the popular array-based coding interview questions for your practice:

1. How do you find the missing number in a given integer array of 1 to 100? (solution )
2. How do you find the duplicate number on a given integer array?(solution )
3. How do you find the largest and smallest number in an unsorted integer array? (solution )
4. How do you find all pairs of an integer array whose sum is equal to a given number?(solution )
5. How do you find duplicate numbers in an array if it contains multiple duplicates?(solution )
6. How are duplicates removed from a given array in Java? (solution )
7. How is an integer array sorted in place using the quicksort algorithm? (solution )
8. How do you remove duplicates from an array in place? (solution )
9. How do you reverse an array in place in Java? (solution )
10. How are duplicates removed from an array without using any library? (solution )

These questions will not only help you to develop your problem-solving skills but also improve your knowledge of the array data structure.

If you need more advanced questions based upon array then you can see also see The Coding Interview Bootcamp: Algorithms + Data Structures , a Bootcamp style course on algorithms, especially designed for interview preparation to get a job on technical giants like Google, Microsoft, Apple, Facebook, etc.

And, if you feel 10 is not enough questions and you need more practice, then you can also check out this list of 30 array questions .

2. Linked List Coding Problems from Interviews

A linked list is another common data structure that complements the array data structure. Similar to the array, it is also a linear data structure and stores elements in a linear fashion.

However, unlike the array, it doesn't store them in contiguous locations; instead, they are scattered everywhere in memory, which is connected to each other using nodes.

A linked list is nothing but a list of nodes where each node contains the value stored and the address of the next node.

Because of this structure, it's easy to add and remove elements in a linked list, as you just need to change the link instead of creating the array, but the search is difficult and often requires O(n) time to find an element in the singly linked list.

This article provides more information on the difference between an array and linked list data structures.

It also comes in varieties like a singly linked list, which allows you to traverse in one direction (forward or reverse); a doubly linked list, which allows you to traverse in both directions (forward and backward); and finally, the circular linked list, which forms a circle.

In order to solve linked list-based questions, a good knowledge of recursion is important, because a linked list is a recursive data structure.

If you take one node from a linked list, the remaining data structure is still a linked list, and because of that, many linked list problems have simpler recursive solutions than iterative ones.

Here are few tips to solve linked list based coding problems:

1. Use recursion because linked list is a recursive data structure
2. Use two pointer technique like fast and slow pointers
3. Remember that singly linked list tail points to NULL

Here are some of the most common and popular linked list interview questions and their solutions:

1. How do you find the middle element of a singly linked list in one pass? (solution )
2. How do you check if a given linked list contains a cycle? How do you find the starting node of the cycle? (solution )
3. How do you reverse a linked list? (solution )
4. How do you reverse a singly linked list without recursion? (solution )
5. How are duplicate nodes removed in an unsorted linked list? (solution )
6. How do you find the length of a singly linked list? (solution )
7. How do you find the third node from the end in a singly linked list? (solution )
8. How do you find the sum of two linked lists using Stack? (solution )

These questions will help you to develop your problem-solving skills as well as improve your knowledge of the linked list data structure.

If you are having trouble solving these linked list coding questions then I suggest you refresh your data structure and algorithms skill by going through Data Structures and Algorithms: Deep Dive Using Java course.

You can also check out this list of30 linked list interview questions for more practice questions.

3. String Coding Problems for Interviews

Along with array and linked list data structures, a string is another popular topic on programming job interviews. I have never participated in a coding interview where no string-based questions were asked.

A good thing about the string is that if you know the array, you can solve string-based questions easily because strings are nothing but a character array.

So all the techniques you learn by solving array-based coding questions can be used to solve string programming questions as well.

Here is my list of frequently asked string coding questions from programming job interviews:

1. How do you print duplicate characters from a string? (solution )
2. How do you check if two strings are anagrams of each other? (solution )
3. How do you print the first non-repeated character from a string? (solution )
4. How can a given string be reversed using recursion? (solution )
5. How do you check if a string contains only digits? (solution )
6. How are duplicate characters found in a string? (solution )
7. How do you count a number of vowels and consonants in a given string? (solution )
8. How do you count the occurrence of a given character in a string? (solution )
9. How do you find all permutations of a string? (solution )
10. How do you reverse words in a given sentence without using any library method? (solution )
11. How do you check if two strings are a rotation of each other? (solution )
12. How do you check if a given string is a palindrome? (solution )

These questions help improve your knowledge of string as a data structure. If you can solve all these String questions without any help then you are in good shape.

For more advanced questions, I suggest you solve problems given in the Algorithm Design Manual by Steven Skiena , a book with the toughest algorithm questions.

If you need more practice, here is another list of 20 string coding questions .

4. Binary Tree Coding Interview Problems

So far, we have looked at only the linear data structure, but all information in the real world cannot be represented in a linear fashion, and that's where tree data structure helps.

The tree data structure is a data structure that allows you to store your data in a hierarchical fashion. Depending on how you store data, there are different types of trees, such as a binary tree , where each node has, at most, two child nodes.

Along with its close cousin binary search tree , it's also one of the most popular tree data structures. Therefore, you will find a lot of questions based on them, such as how to traverse them, count nodes, find depth, and check if they are balanced or not.

A key point to solving binary tree questions is a strong knowledge of theory, like what is the size or depth of the binary tree, what is a leaf, and what is a node, as well as an understanding of the popular traversing algorithms, like pre-, post-, and in-order traversal.

Here are few tips to solve tree based coding problems:

1. Use recursion as binary tree and binary search trees and many other trees are recursive data structure.
2. Know the theory like difference between binary tree and binary search tree
3. Know popular traversing algorithms like pre, post, and inorder traversal as well as breadth first and depth first traversal.
4. Use Stack if recursion is not allowed to convert recursive algorithms to iterative one.

Here is a list of popular binary tree-based coding questions from software engineer or developer job interviews:

1. How is a binary search tree implemented? (solution )
2. How do you perform preorder traversal in a given binary tree?(solution )
3. How do you traverse a given binary tree in preorder without recursion?(solution )
4. How do you perform an inorder traversal in a given binary tree?*(solution )
5. How do you print all nodes of a given binary tree using inorder traversal without recursion? (solution )
6. How do you implement a postorder traversal algorithm? (solution )
7. How do you traverse a binary tree in postorder traversal without recursion?(solution )
8. How are all leaves of a binary search tree printed?(solution )
9. How do you count a number of leaf nodes in a given binary tree?(solution )
10. How do you perform a binary search in a given array?(solution )

If you feel that your understanding of binary tree coding is inadequate and you can't solve these questions on your own, I suggest you go back and pick a good data structure and algorithm course like Master the Coding Interview: Data Structures + Algorithms by Andrei Negaoie

Btw, you would need a ZTM membership to watch this course which costs around $39 per month but also provides access to many super engaging and useful courses like this one. You can also use code FRIENDS10 to get a 10% discount on any subscription you choose.

If you need some more recommendations, here is my list of useful data structure algorithm books and courses to start with.

5. Miscellaneous Coding Problems for Tech Interviews

Apart from data structure-based questions, most of the programming job interviews also ask algorithms , software design , bit manipulation, and general logic-based questions, which I'll describe in this section.

It's important that you practice these concepts because sometimes they become tricky to solve in the actual interview. Having practiced them before not only makes you familiar with them but also gives you more confidence in explaining the solution to the interviewer.

1. How is a bubble sort algorithm implemented? (solution )
2. How is an iterative quicksort algorithm implemented? (solution )
3. How do you implement an insertion sort algorithm? (solution )
4. How is a merge sort algorithm implemented? (solution )
5. How do you implement a bucket sort algorithm?(solution )
6. How do you implement a counting sort algorithm?(solution )
7. How is a radix sort algorithm implemented?(solution )
8. How do you swap two numbers without using the third variable? (solution )
9. How do you check if two rectangles overlap with each other? (solution )
10. How do you design a vending machine? (solution )

If you need more such coding questions you can take help from books like Cracking The Code Interview , by Gayle Laakmann McDowell which presents 189+ Programming questions and solution. A good book to prepare for programming job interviews in a short time.

By the way, the more questions you solve in practice, the better your preparation will be. So, if you think 50 is not enough and you need more, then check out these additional 50 programming questions for telephone interviews and these books and courses for more thorough preparation.

6. System Design and OOP Coding Problems

Nowadays, System design and OOP Design based coding problems are also popular on interviews, hence it make sense that you also practice them. Unlike data structures and algorithms, these kind of coding questions require more effort and time as you need to solve a complete problem.

It's also important that you have good knowledge of essential system design concepts and patters before you attempt these questions.

And, if you are new to System design, I recommend building your knowledge first by joining a system design course on ByteByteGo , Design Guru , Exponent , Educative or, Udemy , they are the best platforms to learn system design.

Once you have good understanding of system design and OOP design concepts you can attempt to solve these questions.

Here are the 10 System design and OOP Design Questions you can practice

1. How to design YouTube or Netflix? (solution )
2. How to design a Chat System like WhatsApp? (solution )
3. How to design a URL Shortner like TinyURL or bit.ly? (solution )
4. How to design a Parking Lot System? (solution )
5. How to design Instagram or Facebook like System? (solution )
6. How to design a Vending Machine in Java? (solution )
7. How to design a trade position calculator or portfolio management system? (solution )
8. How to design a Bounded Buffer in Java? (solution )
9. How to create a Thread Pool in Java? (solution )
10. How to design a Library Management System? (solution )

If you need more such coding questions you can "Grokking the System Design" and "Grokking the Advanced System Design courses" on DesignGuru.io, a great place to prepare for tech interviews

And, if you like these Grokking interview courses from DesignGuru, you can get all of them for a big discount by purchasing their All course bundle . This bundle include their most popular Grokking courses like Grokking System Design Interview, OOP Design, Coding Patterns, as well Grokking Dynamic programming interview. You can also use code GURU to get 30% discount.

That's all about the top 60 coding problems for interviews. These are some of the most common coding questions on data structure and algorithms that help you to do really well in your interview.

These common coding problems and data structure, and algorithm questions are the ones you need to know to successfully interview with any company, big or small, for any level of programming job.

If you are looking for a programming or software development job, you can start your preparation with this list of coding questions.

This list provides good topics to prepare and also helps assess your preparation to find out your areas of strength and weakness.

Good knowledge of data structure and algorithms is important for success in coding interviews and that's where you should focus most of your attention.

Recommended Coding Interview Resources

• Data Structures and Algorithms: Deep Dive Using Java
• Master the Coding Interview: Data Structures + Algorithms by Andrei Negaoie
• Grokking the Coding Interview: Patterns for Coding Questions
• Algorithms and Data Structures - Part 1 and 2
• 10 Books to Prepare Technical Programming/Coding Job Interviews
• 10 Algorithm Books Every Programmer Should Read
• Top 5 Data Structure and Algorithm Books for Java Developers
• From 0 to 1: Data Structures & Algorithms in Java
• Data Structure and Algorithms Analysis?---?Job Interview

P.S.?---?If you need some FREE resources, you can check out this list of free data structure and algorithm courses to start your preparation.