Meta

The technical round hit me with a classic array manipulation problem: moving zeroes to the end without disrupting the order of non-zero elements. As I tackled it, I felt a wave of familiarity wash over me; I had just practiced a similar challenge on

The e-screen was mostly coding challenges (algorithms and data structures) and isn't very hard. The hard part is performing in front of someone, knowing the consequences. Even being prepared with lots of LeetCode practice may not be enough if you're

I spoke with the recruiter by phone, and then with a software engineer for a technical screening. * Reverse a linked list - Done. * Reverse a linked list using recursion - I had to think a little bit, but it's done. * Merge intervals - Done.