Extremely simple questions. First-round had a question like, given an object array, combine objects with one more matching fields and return the resulting array. The second round was behavioural and one question on removing trailing spaces. They don't ask any in-depth technical quesions.
Standard algorithms and data structures questions.
How to process a big number that cannot be stored in any data structure. How you would represent it.
Only one programming questions. Input a string, including numbers, operands, and brackets. Calculate the result. Test case: input: "(+ 3 3)": Output: 6 input "(* 3 3)" Output: 9 input: "(+ 1 12 (- 17 3) 5 (* 2 8 (/ 120 4)) 46)", Output: 1 + 12 + (17 - 3) + 5 + (2 * 8 * (120 / 4)) + 46 = 558
Given a message "one two three four five six seven eight nine", chop it in chunks(no exceed the give buffer size) and print out to the screen. Need to maintain the word and do not chop it off. I.E.: buffer size is 15 one two three (1/4) four five six (2/4) seven eight (3/4) nine (4/4)
java
If V is a vector with n items and subroutine Exchange swaps its arguments, then the following code fragment sorts V in descending order. for( j = 0; j < n - 1; j++ ) for( k = 0; k < n - j - 1; k++ ) if( V[k] < V[k+1] ) Exchange( V[k], V[k+1] ); How many calls to Exchange are made if initially, V[i]=i, for i = 0, 1, 2, ..., n - 1 ? a. n-1 b. n c. n(n-1)/2 d. (n-1)(n-2) e. n(n-1)
Buddy bitmap clear bit and event handler
One of the questions was reverse a string and capitalize the front and end letter of the word .
A string for example: AAAAABBBCCCCDD has to be converted into A5B3C4D2.
Viewing 2211 - 2220 interview questions