I applied online and received a recruiter call within a week to discuss my experience and role fit.

Next, I completed two technical phone screens, each approximately 45 minutes long, focusing on coding Data Structures and Algorithms (DSA) problems, similar to LeetCode medium difficulty.

After passing those, I proceeded to a virtual onsite interview, which consisted of five one-hour rounds:

• Three coding interviews focusing on medium-hard algorithms, arrays, and trees.
• One system design interview on scalable file storage.
• One behavioral round assessing teamwork and "Googleyness."

The coding interviews were conducted in a whiteboard style using a shared document.

The hiring committee reviewed all feedback, followed by a team-matching call before an offer was extended.

The entire process took approximately six weeks. It was intense but well-organized.

Write a function to find the longest increasing subsequence in an integer array, optimizing for time complexity better than O(n^2).