Status: SDE-2, Arista [Reject]
Location: Bengaluru, India
Date: Feb 9, 2024
Coding Round - (1 hr)
Two coding questions were asked - 1. In a given array find the maximum element for every window of size k.
- Construct a BST and then write the logic for deleting a node and restructuring it.
Got the result in evening of rejection as I was not able to complete the code for the second question in time.
Comments (3)