Interview Questions, Answers, Java, Python, Databases, Web, Javascript
Most asked interview questions.
Kadane’s Algorithm Missing number in array Subarray with given sum Sort an array of 0s, 1s and 2s Equilibrium point Maximum sum increasing subsequence Leaders in an array Minimum Platforms Maximum of all subarrays of size k Reverse array in groups K’th smallest element Trapping Rain Water Pythagorean Triplet Chocolate Distribution Problem Stock buy and sell Element with left side smaller and right side greater Convert array into Zig-Zag fashion Find the element that appears once in sorted array Kth largest element in a stream Relative Sorting Spirally traversing a matrix Sorting Elements of an Array by Frequency Largest Number formed from an Array Largest subarray of 0’s and 1’s Solved the above? Go for some more Questions
String :
Parenthesis Checker Reverse words in a given string Permutations of a given string Longest Palindrome in a String Recursively remove all adjacent duplicates Check if string is rotated by two places Roman Number to Integer Anagram Longest Common Substring Remove Duplicates Form a Palindrome Longest Distinct Characters in the string Implement Atoi Implement strstr Longest Common Prefix Subarray with given sum Solved the above? Go for some more Questions
Linked List :
Finding middle element in a linked list Reverse a linked list Rotate a Linked List Reverse a Linked List in groups of given size Detect Loop in linked list Remove loop in Linked List n’th node from end of linked list Flattening a Linked List Merge two sorted linked lists Intersection point of two Linked Lists Pairwise swap of a linked list Add two numbers represented by linked lists Check if Linked List is Palindrome Implement Queue using Linked List Implement Stack using Linked List Given a linked list of 0s, 1s and 2s, sort it Delete without head pointer Stack and Queue :
Next larger element Queue using two Stacks Stack using two queues Get minimum element from stack LRU Cache Circular tour First non-repeating character in a stream Rotten Oranges Tree :
Print Left View of Binary Tree Check for BST Print Bottom View of Binary Tree Print a Binary Tree in Vertical Order Level order traversal in spiral form Connect Nodes at Same Level Lowest Common Ancestor in a BST Convert a given Binary Tree to Doubly Linked List Write Code to Determine if Two Trees are Identical or Not Given a binary tree, check whether it is a mirror of itself Height of Binary Tree Maximum Path Sum Diameter of a Binary Tree Number of leaf nodes Check if given Binary Tree is Height Balanced or Not Serialize and Deserialize a Binary Tree Solved the above? Go for some more Questions
Heap :
Find median in a stream Heap Sort Operations on Binary Min Heap Rearrange characters Kth largest element in a stream Merge K sorted linked lists Recursion :
Flood fill Algorithm Number of paths Combination Sum – Part 2 Special Keyboard Water Overflow Josephus problem Hashing :
Largest subarray with 0 sum Swapping pairs make sum equal Count distinct elements in every window Array Pair Sum Divisibility Problem Longest consecutive subsequence Array Subset of another array Find all pairs with a given sum Find first repeated character Zero Sum Subarrays Minimum indexed character Check if two arrays are equal or not Uncommon characters Smallest window in a string containing all the characters of another string First element to occur k times Check if frequencies can be equal Graph :
Depth First Traversal Breadth First Traversal Detect cycle in a directed graph Topological sort Find the number of islands Implementing Dijkstra Minimum Swaps Strongly Connected Components Shortest Source to Destination Path Find whether path exist Minimum Cost Path Circle of Strings Floyd Warshall Alien Dictionary Snake and Ladder Problem Greedy :
Activity Selection N meetings in one room Coin Piles Minimum number of Coins Maximize Toys Page Faults in LRU Largest number possible Minimize the heights Minimize the sum of product Huffman Decoding Max length chain Minimum Spanning Tree Minimum Operations Shop in Candy Store Geek collects the balls Dynamic Programming :
Longest Increasing Subsequence Longest Common Subsequence 0 – 1 Knapsack Problem Minimum number of jumps Edit Distance Coin Change Problem Subset Sum Problem Box Stacking Rod Cutting Path in Matrix Minimum sum partition Count number of ways to cover a distance Egg Dropping Puzzle Optimal Strategy for a Game Shortest Common Supersequence Divide and Conquer :
Binary Search Quick Sort Merge Sort Find the element that appears once in sorted array K-th element of two sorted Arrays Last index of One Backtracking :
N-Queen Problem Solve the Sudoku Rat in a Maze Problem Word Boggle Generate IP Addresses Bit Magic :
Find first set bit Rightmost different bit Check whether K-th bit is set or not Toggle bits given range Set kth bit Power of 2 Bit Difference Rotate Bits Swap all odd and even bits Count total set bits Longest Consecutive 1’s Sparse Number Alone in a couple Maximum subset XOR Some More Questions on Arrays :
Most frequent word in an array of strings Most frequent word in an array of strings Find Missing And Repeating Maximum Index Search in a Rotated Array Sum of Middle Elements of two sorted arrays Consecutive 1’s not allowed Majority Element Two numbers with sum closest to zero Nuts and Bolts Problem Boolean Matrix Problem K’th smallest element Find all four sum numbers Common elements Smallest Positive missing number Count the triplets Maximum Index Jumping Caterpillars Some More Questions on Strings :
CamelCase Pattern Matching String Ignorance Smallest window in a string containing all the characters of another string Design a tiny URL or URL shortener Permutations of a given string Non Repeating Character Check if strings are rotations of each other or not Save Ironman Repeated Character Remove common characters and concatenate Geek and its Colored Strings Second most repeated string in a sequence Some more Questions on Trees :
Mirror Tree Longest consecutive sequence in Binary tree Bottom View of Binary Tree Lowest Common Ancestor in a Binary Tree