Sharechat | Google Meet Interview | Furthest Building You Can Reach
Anonymous User
1348

Sharechat SDE-Intern

After clearing OA

In first round, I was asked the variant of question of Priority Queue
https://leetcode.com/problems/furthest-building-you-can-reach/
I haven't solved this type of question previously so I tried and shared different approaches using DP, and at the end I was able to solve it using sorting and binary search
You can checkout my solution here:
https://leetcode.com/problems/furthest-building-you-can-reach/discuss/1628623/C%2B%2B-Solution-using-sorting-and-binary-search
The key point that everyone should follow is a good discussion with interviewers

In second round, I was asked to print the permutations of String, and one more easy problem
The other questions were related to your field like I applied for Android so I was asked recyclerview and its internal working and questions like that

I hope this will help you

Comments (4)