You work in a factory that manufactures balls. One day one of the balls manufactured in a group of eight is slightly heavier than the rest. You have a standard scale with which you can weigh the balls. How would you go about finding the defective ball in the least amount of weighing attempts possible (maximum of 2 attempts).
Merge 2 sorted lists
- They say they are language agnostic but well... - Java shop! Know your Java and patterns in and out! - Basic basic data structure implementation - Mostly Java questions and Java design questions - No algorithms unlike other mainstream companies. - Little bit of database in the phone screen.
Write a function that: given a 1 row 2^n column matrix containing integers 1 to 2^n, divide the matrix in two, and place the right half of the matrix below the left half. Repeat this process until the matrix is 2^n rows and 1 column and return the result.
They will ask you technical problems but it's not that difficult you only need to be confident and honest with your answers
If there are 256 players in a lawn tennis knockout tournament,how many minimum number of matches should be played to reach the finals?
Asked me few technical questions on Java.
There is an array of 100 elements where one element is repeated. What is the complexity of finding the element?
Use single loop instead of two loops to print a K-shaped pattern.
can we find the end of circular linked list?
Viewing 21 - 30 interview questions