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.
Note: Now you can track your progress and learn from video editorials of these questions Must Do Interview Preparation Course.
|Missing Number in Array||Link||Link|
|Trailing Zeros in Factorial||Link||Link|
|A Simple Fraction||Link||Link|
|Nth Natural Number||Link||Link|
|Smallest Positive Integer that can not be represented as Sum||Link||Link|
An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together.
|Search insert position of K in a sorted array||Link||Link|
|Left most and right most index||Link||Link|
|Bitonic Point ||Link||Link|
|Search an element in sorted and rotated array||Link||Link|
|Square root of a number||Link||Link|
|Find missing in second array||Link||Link|
|Painter’s Partition Problem||Link||Link|
|Median of 2 sorted arrays of Different sizes||Link||Link|
|Allocate minimum number of pages||Link||Link|
A matrix represents a collection of numbers arranged in an order of rows and columns. It is necessary to enclose the elements of a matrix in parentheses or brackets.
Strings are defined as an array of characters. The difference between a character array and a string is the string is terminated with a special character ‘\0’.
|Reverse words in a given string||Link||Link|
|Longest Common Prefix||Link||Link|
|Roman Number to Integer||Link||Link|
|Next higher palindrome number using the same set of digits||Link||Link|
|Length of longest prefix suffix||Link||Link|
|Smallest window in string containing all characters||Link||Link|
|Validate an IP address||Link||Link|
|Look and say Pattern||Link||Link|
|Longest K unique characters substring||Link||Link|
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations.
|Merge Two Sorted Linked Lists||Link||Link|
|Reverse a Linked List||Link||Link|
|Delete a Node without Head Pointer||Link||Link|
|Add two Numbers represented by linked lists||Link||Link|
|Finding middle element in a linked list||Link||Link|
|Check if linked list is palindrome||Link||Link|
|Rearrange a linked list||Link||Link|
|Detect and Remove a loop In Linked List||Link||Link|
|Merge Sort for Linked List||Link||Link|
|Intersection of Linked List||Link||Link|
|Rotate Linked List by K places||Link||Link|
|Flattening a Linked List||Link||Link|
|Reverse a linked list in groups of given size||Link||Link|
|Partition a linked list around a given value||Link||Link|
|Clone a linked list with next and random pointers||Link||Link|
A stack is a linear data structure in which elements can be inserted and deleted only from one side of the list, called the top. A stack follows the LIFO (Last In First Out) principle.
A queue is a linear data structure in which elements can be inserted only from one side of the list called rear, and the elements can be deleted only from the other side called the front. The queue data structure follows the FIFO (First In First Out) principle.
|Maximum of all subarrays of size K||Link||Link|
|Circular tour (Sliding Window)||Link||Link|
A Heap is a special Tree-based data structure in which the tree is a complete binary tree.
A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.
Binary Search Tree
Binary Search Tree is a node-based binary tree data structure which has the following properties:
- The left subtree of a node contains only nodes with keys lesser than the node’s key.
- The right subtree of a node contains only nodes with keys greater than the node’s key.
- The left and right subtree each must also be a binary search tree.
A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph.
Trie is an efficient information retrieval data structure. Using Trie, search complexities can be brought to optimal limit (key length).
Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate benefit.
Dynamic Programming is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for same inputs, we can optimize it using Dynamic Programming.
The process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called as recursive function.
Backtracking is an algorithmic-technique for solving problems recursively by trying to build a solution incrementally, one piece at a time, removing those solutions that fail to satisfy the constraints of the problem at any point of time (by time, here, is referred to the time elapsed till reaching any level of the search tree).
You may also check our latest online course series to learn DS & Algo is named DSA, which covers everything about Data Structures from Basic to Advanced.
Luck favours the prepared, start practising now! This Must Do Coding Questions – Self Paced will help you become a top coder by practising the Must Do Coding Questions curated by the leading industry experts. Prepare and practice for your next coding interview with over 250+ practice problems on topics like Arrays, Searching, Sorting, Linked List, Matrix, String, Graphs, and much more.
We often ask ourselves, why are we not able to crack our interviews? Where are we lacking exactly? How do we do it? If you are also having these questions, then don’t worry. We are here to help you with your interview preparation. Beginning with learning concepts like OOP, DSA, and Aptitude to working on projects with resume building. Everything at one place. Don’t wait and get yourself enrolled in our Complete Interview Preparation now.