Giving back to the community
Palindrome removing at most 1 character
Left and Right side view of binary tree
Standard behavioural questions I don't recall any specifics.
Design LeetCode
Return the Top K shops closest to a user. assume a function exists: double dist(lat_1, lat_2, lon_1, lon_2).
grid with obstacles find the minimum path from top left to bottom right and print it. In O(N) space
return the index of the largest element of the array. If there is multiple return them with the same probability. In constant space.
Calculator that does addition and multiplication in constant space from a string that looks like this “3+2*6+4”
Awaiting feedback, overall went well solved all the problems.
Printing the minimum path proved really hard.
The calculator was also tricky.
In both of those I had some help from the interviewer and landed in a optimal but goofy looking solution. I think a Rejection is the most likely outcome but at least I'm holding my head high.
Update: Rejected