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.

questions

Title
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
Let N be a positive odd number. There are N coins, numbered 1, 2 , ... , N. For each i (1≤i≤N), when Coin i is tossed, it comes up heads with probability pi and tails with probability 1-pi
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path
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? Find out the number of ways in which the subsequence \"includehelp\" can be formed from 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
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. In each step
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
Given an integer, S represented as a string, get the sum of all possible substrings of this string
Given an array of N positive integers a1, a2, ..., an. The value of each contiguous subarray of a given array is the maximum element present in that subarray
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 number n, count minimum steps to minimize it to 1
Given a string str, find total number of possible palindromic sub-sequences. A sub-sequence does not need to be consecutive, but for any xixj i<j must be valid in the parent string too
You are given a bag of size W kg and you are provided costs of packets different weights of oranges in array cost[] where cost[i] is basically cost of i kg packet of oranges
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
total questions: 87

Questions

87

Views

932

Best Answers

299

Points

5