First Round: Write a pattern 1: Should accept only odd numbers numbers only except 2: Pattern should be fully Dynamic for n =1 @@@@@ * ** *** **** ***** ****** ***** **** *** ** * @@@@@ Second Round:n=6 * ** *** **** ****** ****** ***** **** *** ** *
1--a 2--b ... 26--z given a digit , return the count of the possible output eg. '1313' --- 4 acac mac mm acm '101' --1 ja cannot discard any digit .
Given set of coins and each coin has its unique probability to be head up, say double[] probs stores the probability values for all coins, print out all different cases and accordingly probability.
Rand(7) from Rand(5)
Write a function that divides one number by another, without using the division operator, and make it better than O(n).
The question was pretty basic and involved some data collection and analysis. I also needed to write the time complexity of my solution. In addition write several uni tests for the solution.
What is the main class in java?
In a binary integer value tree, find the lowest level common ancestor of two values.
The questions in the initial round were about the topics learnt in college about networking, cloud computing basics and some java programming question.
Given 1000 bottles of wine, 1 has poison, how many rats would it take to find the poison if you only get one timestep. I.E. You can only run your experiment once and check the rats once.
Viewing 311 - 320 interview questions