Thought it went well. Spent 3 months preparing.

Round 1:

1. add strings (medium)
2. LCA of tree with N number of children (didn't see this on LC). I knew about the variation for binary tree

Round 2:

1. Closest target value in binary search tree
2. Find Kth largest element

System Design: Design Uber driver matching service
Behavior: Standard questions like conflict resolution, feedback

Timeline: Rejected from hiring committee, coding skills not strong enough for Meta. 12 month cool down.