Google Bangalore Interview Experience
Last Updated :
26 Feb, 2020
Initial HR Discussion:
Some recruiter from Singapore contacts through my google mail.
She asked basic questions related to sorting algorithms.
- Â Which is better heap sort or merge sort ? Why ?.
-  In which data structures log n time search is guaranteed [Binary tree, Hash Map,  BST, Arrays]
- What is the lower bound for number of comparisons while sorting ?
- Â What is worst case of quicksort ?
- What is space complexity for heap sort ?
- If there are 1000 computers and 99% are not connected to internet and 5% have defective CPU.Find number of computers defective as well as disconnected.
Telephonic Phone Screen
1. How to check if a number is a fibonacci ?
bool function(int n) {}
https://www.geeksforgeeks.org/check-number-fibonacci-number/
2. Find minimum number of fibonacci number whose sum is equal to given sum K;
Share your thoughts in the comments
Please Login to comment...