Reach Out
- reached out by recruiter
Screening: DSA
- Diameter of a binary tree
- All O(1) Data Structure
Round 1: DSA
- Closest Binary Search Tree Value II (follow up: logn solution)
- Find K Pairs with Smallest Sums variation
Round 2: DSA
- Number of Islands variation (follow up: BFS, diagonal traversal)
- Insert Delete GetRandom O(1) (with Duplicates follow up)
Round 3: HLD
- Design Google Calendar
Round 4: HM
- Behavioural; context switching, on call, frontend backend, conflict resolution, sdk integration, domain knowledge, end to end lifecycle of solution with code, documentation processes for product and tech, collaboration with big team
Conclusion
- Rejected; due to below average rating in design
Comments (4)