First Round (F2F)
1. Calculate angle between hour and minute hand in a clock.
http://www.geeksforgeeks.org/calculate-angle-hour-hand-minute-hand/
2. Given a binary representation of a number, find the longest contiguous sequence of 0s between 2 1.
For example , if binary representation of a number is 1000100, then answer should be 4.
If binary representation of a number is 1000, then it should return 0.
3. Difference between comparable and comparator.
4. What happens internally when we remove a key from HashMap.
1. Calculate angle between hour and minute hand in a clock.
http://www.geeksforgeeks.org/calculate-angle-hour-hand-minute-hand/
2. Given a binary representation of a number, find the longest contiguous sequence of 0s between 2 1.
For example , if binary representation of a number is 1000100, then answer should be 4.
If binary representation of a number is 1000, then it should return 0.
3. Difference between comparable and comparator.
4. What happens internally when we remove a key from HashMap.