HR called me and asked some data structure-related questions. The data structure questions included Heap and Tree.
The second question was about how to calculate 2^24. You have to describe how you would calculate 2^24 to the interviewer.
The third question was about the time complexity and space complexity of sorting algorithms.
What is a heap?
What kinds of algorithms are normally used in a heap?
The application of a heap.
The following metrics were computed from 65 interview experiences for the Google Software Engineer role in Australia.
Google's interview process for their Software Engineer roles in Australia is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Google's Software Engineer interview process in Australia.