I applied through an employee referral.

After two weeks, I received an email from my campus recruiter to schedule a 45-minute phone screen.

The phone screen was pretty much only technical, with the opportunity to ask the engineer questions at the end. There were two LeetCode medium-like questions.

The next day, I received an email saying I had moved on to the second and final round, also a phone screen.

The second interview was identical to the first. Two questions: one was LeetCode easy, and the other was LeetCode hard. I managed to solve the easy question and almost solved the hard one.

After the second round, it took two weeks for the recruiter to respond with an offer.

Given a string and a smaller string, find the start index of the first instance of an anagram of the smaller string in the larger string (anagrammed index of).

LeetCode Binary Tree Vertical Order Traversal (print out the nodes from left to right by column).

LeetCode Valid Palindrome II: Given a string, find whether you can make it a palindrome by removing at most one character.

LeetCode Binary Tree Max Path Sum: Find the path in a binary tree (not necessarily through the root) with the maximum sum.