← Back to experiences
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/experiences/…$
Onsite Round 1 coding: Moving Average from Data Stream All Nodes Distance K in Binary Tree
Onsite Round 2 coding: Subarray Sum Equals K Boundary of Binary Tree
System Design: Design Facebook search. High focus on DB schema, replication, sharding, and keys.
Behavioral: Standard questions were asked.
Total problems solved: approximately 250 Final outcome: Rejected. The recruiter did not provide feedback on the reason for rejection.