Given n numbers (P1,P2,P3,.....Pn). Divide them in m contiguous partitions such that the sum of the maximum is minimum. For e.g. (5,1,4,2,3) and m =2 then (5,1)(4,2,3)
Engineers Interview Questions
898,759 engineers interview questions shared by candidates
Given a string, find the longest substring T that contains m distinct characters. (need O(n) solution)
n= 20 for (i=0;i<n; i--) print i the question was to change or replace a only one character in for loop to print 20 times.
Write a C function to define strstr(char *haystack, char * needle) to return the first occurrence of needle in haystack. Code must compile and execute.
Given set of coins and each coin has its unique probability to be head up, say double[] probs stores the probability values for all coins, print out all different cases and accordingly probability.
Design a data structure that supports insert, delete min, delete max, get min, and get max, all in log(n) time.
1--a 2--b ... 26--z given a digit , return the count of the possible output eg. '1313' --- 4 acac mac mm acm '101' --1 ja cannot discard any digit .
Print a linked list in reverse recursively and non-destructively.
Questions related to data structures like "What data structure would you use for a browser's BACK & FORWARD ability"
Find all duplicate files by content in your filesystem.
Viewing 411 - 420 interview questions