Say you use SVN for source control..you have several revisions of a file...R1, r2, r3..etc..Someone checked in a bug and the revision became bad..need t find the first bad revision..gave a function findBadRevision(int goodRevision, int badRevision) so for e.g the revisions were GGBB and function passes in 0,4 so the first bad revision is 2. There exists a function boolean hasBug(int revision) which will tell us if a certain revision has a bug. can assume good revision < bad revision
O(n) time O(1) space to print link list reversely.
One question 3 of the interviewers asked me was "What was the most difficult thing you had to deal with.".
1. Give you a data structure Seq class Sqe { int value; Seq nex; } and give you two Seq object seq., seq., compare two objects, return true if there is only one difference or no difference, false if more than two differences. 2. Giving a array which has zero and no-zero elements, move all zero elements to the end and no-zero elements to the begin.
Given a string 12345 and a alphabet to number mapping like a =1, b =2.., y=25, z=26 write a code to find number of possible alphabet strings from the given string. E.x. string 12345 has possible alphabet strings as {lcde,awde, abcde}.
How do you find sequences of consequtive integers in a list that add to a particular number.
Write a function that finds the minimum and maximum values within an unsorted array using divide-and-conquer.
2. Find top 100 maximum number from a continuous input stream.
Given an array of integers A[1...n], compute the array B[1...n] such that B[k] is the product of all the elements of A, except A[k]. Part ii) Try to do it without division (some mobile devices don't have division). Was asked to write code for part ii.
Asked to implement a function that takes an integer and returns whether or not the number had an odd or even number of 1 bits.
Viewing 441 - 450 interview questions