Interview Preparation

You can crack any Interview if you are preparing yourself in a well organised manner. There are lots of Data Structure and Algorithm problems on internet and it is quite impossible for a person to practice all of them. So it is really important that you practice a list of few problems which are really important and covers almost every concepts.

I have tried my best to sort all those problems for you and ordered them as well. I hope if you follow my list and study in the same order in which i have given, it will surely help you prepare very well for the Job Interview in your 2 months vacation.

Table of Contents

• Data Structures
  • Array
  • LinkedList
  • Stack
  • Queue
  • Binary Tree
  • Binary Search Tree
  • Heap and Priority Queue
• Algorithms
  • Binary Search
  • Dynamic Programming

Data Structures

• [ ] Tutorials:
  • MIT 6.006 Introduction to Algorithms, Fall 2011 (video)
  • mycodeschool (video)
  • UCSanDiegoX's Algorithms and Data Structures

Array

| ID | PROBLEM STATEMENT | PROBLEM LINK | |--------|----------------------------------------------------------|-----------------------------| | 1 | Missing number in array | Leetcode , GFG | | 2 | Subarray with given sum | GFG | | 3 | 2 Sum | LeetCode , InterviewBit, GFG , | | 4 | Majority Element | LeetCode , InterviewBit , GFG | | 5 | Max Consecutive Ones | LeetCode , InterviewBit | | 6 | Sort an array of 0s, 1s and 2s | GFG , LeetCode | | 7 | Spiral Matrix | LeetCode , InterviewBit | | 8 | Find the duplicate number | LeetCode | | 9 | Largest number formed from an array | LeetCode , InterviewBit, GFG | | 10 | Next Permutation | LeetCode , InterviewBit | | 11 | Merge Overlapping Intervals | LeetCode , InterviewBit, GFG | | 12 | First Missing Positive | LeetCode , InterviewBit |

LinkedList

| ID | PROBLEM STATEMENT | PROBLEM LINK | |--------|----------------------------------------------------------|-----------------------------| | 1 | Find middle element in a linked list | LeetCode , GFG | | 2 | Remove n'th node from end of a linked list | LeetCode , InterviewBit | | 3 | Intersection Point in Y shaped linked list | LeetCode , InterviewBit | | 4 | Reverse a linked list | LeetCode , InterviewBit | | 5 | Check if a linked list is Palindrome | LeetCode , InterviewBit | | 6 | Rotate a LinkedList | LeetCode , InterviewBit | | 7 | Reverse linked list in a group of given size k | LeetCode , InterviewBit | | 8 | Detect and Remove Loop in a linked list | LeetCode , InterviewBit | | 9 | Find length of the Loop in a linked list | GFG | | 10 | Segregate even and odd positioned nodes in a linked list | LeetCode , GFG | | 11 | Segregate even and odd valued nodes in a linked list | GFG | | 12 | Clone a linked list with next and random pointer | LeetCode , GFG | | 13 | Reorder List L1->L2->...Ln to L1->Ln->L2->Ln-1.... | LeetCode , InterviewBit | | 14 | Delete N nodes after M nodes of a linked list | GFG | | 15 | Merge K sorted list | LeetCode , InterviewBit , GFG | | 16 | Add two numbers represented by a linked list | LeetCode , InterviewBit |

Stack

| ID | PROBLEM STATEMENT | PROBLEM LINK | |--------|----------------------------------------------------------|------------------------------| | 1 | Valid Parentheses | LeetCode | | 2 | Length of longest valid Parentheses | LeetCode | | 3 | Next Greater Element | GFG , LeetCode | | 4 | Nearest Smaller Element | InterviewBit | | 5 | Trapping Rain Water | LeetCode , InterviewBit | | 6 | Largest Rectangle in a Histogram | LeetCode , InterviewBit | | 7 | Min Stack | LeetCode , InterviewBit