As the placement season is back, GeeksforGeeks is here to help you crack the interview. We have selected some most commonly asked and MUST DO practice problems to crack Product-based Company Interviews.

You can also take part in our *mock placement contests* which will help you learn different topics and practice at the same time, simulating the feeling of a real placement test environment.

If you are looking for Old MUST DO list, please refer **MUST DO Coding Problems for Companies like Amazon, Microsoft, Adobe, …**

In case you are a new user, we strongly recommend you to go through the below Improved list.

**Note: **Now you can track your progress of these questions **Must Do Interview Preparation Course**.

**Topic:**

### Math

**Easy****Medium****Hard**

### Arrays

**Easy****Medium****Hard**

### Searching

**Easy****Medium****Hard**

### Sorting

**Easy****Medium**

### Matrix

**Easy****Medium**

### String

**Easy****Medium**

### Hashing

**Easy****Medium**

### Bit Masking

**Easy****Medium****Hard**

### Linked List

**Easy****Medium****Hard**

### Stack

**Easy****Medium****Hard**

### Queue

### Heap

**Easy****Medium****Hard**

### Binary Tree

**Easy****Medium****Hard**

### Binary Search Tree

**Easy****Medium****Hard**

### Graph

**Medium****Hard**

### Trie

**Medium**

### Greedy

**Medium**__N meetings in one room____Coin Piles____Maximize Toys____Largest number with given sum____Minimize the heights____Fractional Knapsack____Job Sequencing____Police and Thieves____Water the Plants__

### DP

**Easy****Medium**__0 – 1 Knapsack Problem____Number of Coins____Edit distance____Maximize The Cut Segments____Box Stacking____Longest Increasing Subsequence____Longest Palindromic Substring____Longest Common Substring____Longest Common Subsequence____Wildcard Pattern Matching____Total Decoding Messages____Max length chain____Maximum sum increasing subsequence____Minimum number of jumps____Subset Sum Problem____Maximum path sum in matrix____Player with max score____Shortest Common Supersequence____Palindrome Partitioning____Form a Palindrome__

**Hard**

### Recursion

**Easy****Medium**

### Backtracking

**Easy****Medium****Hard**

### Algorithms

**Easy****Medium**

### Design

**Easy****Medium**

You may also check our

to learn DS & Algo is named DSA, which covers everything about Data Structures from Basic to Advanced.**latest online course series**