In Step Internship of Google , After Resume Shortlisting Phone Screening Round conducted for those applicants who applied offcampus . In 10 - 15 minutes the focus areas for the tech phone screening will be coding + data structures/ algorithms.
Questions asked in Phone screening round was quit easy and all questions from theoritical portion of DSA.

1. Time Complexities of heap sort .
2. compare Heap sort and merge sort.
3. Explain Quick sort.
4. In which case bfs is better than Dijkstras? Weighted or unweighted?
5. In STL, what will find function return if element is not found?
6. how Heap sort better then the merge sort ?