2 robots land on a planet that only has x coordinate (a line). The robots can only go either left or right. The planet has nothing on it except the parachute that each robot has used. You're asked to program the robot to meet each other in the shortest amount of time. You're only allowed to use if statement and "Go left" and "Go right". The if statement can only contain: if the robot meet each other, or if the robot see its own parachute.
Reverse all the characters in a string before you encounter an 'x'. abcdxdd - > dcbaxdd
Use C to count the number of set bits in an int.
Not very difficult - logic questions involving a different language.
Find two integers in an unsorted array that produced a certain sum in linear time.
Technical Question. Given a string such as 3 + 2 / 5 - 3 * 4, calculate it.
Given a mathematical expression, what data structure would you use to evaluate the expression? How would you design the above question to use Trees/Graphs.
Compare and Book and a Three Ring Binder using data structures and classes.
What data structure would you use to find the 100 closest stars?
(following the previous one) You got only ONE baby bottle sample. You would like to know the max height you can drop it without breaking the bottle. Let set the unit as 1 foot. And the highest height you can reach is at N feet. So how would you find the (max) safe height?
Viewing 411 - 420 interview questions