Write a function that returns true when number of things (N) can be precisely divided into boxes of 6, 9 and 20 => N = 6x + 9y + 20z
Developer Interview Questions
639,641 developer interview questions shared by candidates
Given a string, find the longest substring T that contains m distinct characters. (need O(n) solution)
what's wrong with the following code : <template type T > T accumulate ( vector<T> in) { T total = in[0]; for (int i =0; i < in.length() ; i++) { total = total + in[i]; } return T }
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)
There are n pots with different # gold coins in them. Two players play a game, where each player can select a pot at either ends. maximize the gold
1. Ausgehend von einem sortieren Array A[1..n] mit n Integer-Zahlen und einem integer t: Finden Sie alle Paare (x,y) von Elementen in A, so dass x+y kleiner ist als t. 2. Lässt es sich besser lösen, wenn man nach (x,y) sucht, für die x+y=t gilt?
You are given an array that represents bills in certain currency (For example 1, 2, 5, 10) and an amount, for example 17. You should output the number of possible combinations of bills that sum to the given amount. For example, {10, 5, 2} is valid combination, {10, 5, 1 ,1} also. I did not ask questions like does the order of bills matter, i.e. is {10, 5, 2} same as {2, 10, 5}.
Questions related to data structures like "What data structure would you use for a browser's BACK & FORWARD ability"
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.
Find all duplicate files by content in your filesystem.
Viewing 301 - 310 interview questions