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 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.
1) Given a array and a sum, find all the pairs in the array which have the given sum. 2) Given a BST you need to identify swapped nodes
Print out, from small to big, of a sequence intergers, without sorting.
Given a 1TB file of serialized 4 byte integers, and 2GB of ram, sort the integers into a resulting 1TB file. My interviewer was very collaborative in entertaining various solution ideas until we came up with a combo that would work performantly and reduce the number of passes over the 1TB file and intermediate files.
After Round 2 I Asked Interviewer How he would Solution for Above mentioned Q1 & Q2 questions of the Round 2 Technical Interview. Very Smartly Interviewer Did not take any effort to answer and also told me find it out by myself :)
Convert a string to an integer
Given a series of words written using a scrambled alphabet, figure out what order the letters of the alphabet are in.
What sort would you use if you required tight max time bounds and wanted highly regular performance.
1) If Child class has parameterized constructor and parent class has default constructor . will it work
Viewing 31 - 40 interview questions