Take a ladder with 5 steps, write a function that gives all the possible combinations of either 1,2, or 3 steps, in any order, to get to the 5th step, and returns the total number of combinations. So some of the possibilities would be [1,1,1,1,1], [1,1,1,2], [1,1,2,1], etc. Then he asked the same question with order not being considered, so [1,1,1,2] and [1,1,2,1] are the same solution.
what was a technical difficulty and how have you overcome it.
What are different types of interrupts?
You have 10 bags that weighs the same except for one that weighs less. With a scale, what's the shortest number of tries to find the bag that weighs less?
Given a string of the form: "{Valery,Jason,Peter} was in {good,bad} mood and he went to the {beach, party, library}"; Print out all the permutations of the string. Eg: Valery was in good mood and he went to the beach.
why should i hire you
In interview, for DS: link list , stack, queues , Quicksort etc, JAVA(core) .
Algorithms question was probably the trickiest thing. Given an array of integers of length N from 1 to N-1, how would you detect a single duplicate in the array?
programming 1) print pattern 2,3,5,7,......
The online test was easy
Viewing 711 - 720 interview questions