Similar Collections

We are trying to list out the most frequently asked interview problems or the problem given in the coding rounds of IT giants.


Given an array A of size N. Find the minimum number of operations needed to convert the given array to Palindromic Array
Given n wines in a row, with integers denoting the cost of each wine respectively. Each year you can sale the first or the last wine in the row
Given a value V, if we want to make change for V cents, and we have infinite supply of each of C = { C1, C2, .. , Cm} valued coins, what is the minimum number of coins to make the change?
You are given N eggs, and building with K floors from 1 to K. Each egg is identical, you drop an egg and if an egg breaks, you cannot drop it again
Given a binary Tree find the maximum path sum. The path may start and end at any node in the tree
Given an array of n integers. Find the minimum number of elements from the array to remove or delete so that when the remaining elements are placed in the same sequence order form a sorted sequence
You are provided an input string S and the string \"includehelp\". You need to figure out all possible subsequences \"includehelp\" in the string S?
Given two positive integer n and m, find how many arrays of size n that can be formed
Shivang is very foodie but he has a diet plan. He has an array of elements indicating the calorie of food he can consume on that day
Imagine you have a special keyboard with four types of keys: Key 1: Prints \'I\' on screen Key 2: Select whatever printed in screen Key 3: Copy selection to buffer Key 4: Append buffer on-screen after what has already been printed
Given a string S, write a program to check if it is possible to construct the given string S by performing any of the below operations any number of times
Given the number of digits n, find the count of total non-decreasing numbers with n digits
You need to display N similar characters on a screen. You are allowed to do three types of operation each time
Weights and values are given for n items along with the maximum capacity allowed W. What is the maximum value we can achieve if we can pick any weights, any number of times for the total allowed capacity of W?
Given 3 strings X, Y and Z, the task is to find the longest common sub-sequence in all three given sequences
Given a rectangular grid of dimension 2 x N find out the maximum sum such that no two chosen numbers are adjacent, vertically, diagonally or horizontally
Given a positive integer N, count all possible distinct binary strings of length N such that there are no consecutive 1\'s. Output your answer mod 10^9 + 7
Given a string str, find the longest palindromic substring. A substring need to be consecutive such that for any xixj i<j must be valid in the parent string too
Given a string str, find total number of possible palindromic sub-sequences. A substring need to be consecutive such that for any xixj i<j must be valid in the parent string too
Given a range 1 to N. Among its different permutations you have to find out those permutations where only one element is greater than its previous element and you have to count that number
total questions: 37





Best Answers