Applied online for the internship and received an email in February about an online assessment (OA).

After completing the OA, I was invited for an onsite interview, which was subsequently converted to a virtual format. The interview lasted three hours and involved multiple interviewers.

Having millions of points with coordinates (x,y), how would you find points that are at a distance of at most d from a given point (X,Y) for every query?

Reorder elements of a linked list such that no two consecutive elements have the same parity. You have to reorder pointers, not just the values.

Diameter of a binary tree.