A array : 1 3 0 2 4 9 input: dest-node: A0 output: all the source nodes: (A1, A3, A4) Each element in this array means the steps it can take. Each element can go left or right. So A[1] and A[4] can reach A[0]. A[1] can reach A[4], A[4] can reach A[0], so A[1] can reach A[0]. Output the index of element which can reach A[0].
Write a code that show all possible permutation from a given String.
Q: List all comments in the given segment of codes.
My processor is consuming too much power, write a program to reduce processor power consumption.
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
Viewing 1871 - 1880 interview questions