Surprisingly, it was really easy. I applied to a posting online.

A recruiter reached out, and we never actually got on a call. They had me fill out a questionnaire with basic information like salary expectations and whether I needed sponsorship.

After that, I got a tech screen scheduled. It was basic LeetCode style with questions at the end. The question was super easy: given two sorted arrays, return a sorted array with all elements.

For this, I initialized an array of size a + b and used pointers at the start of each array. I added the smaller element until one of the pointers passed the array's length, then filled in the remaining elements.

Then, I was notified I passed and moved to another tech screen. It was the same style, but they asked me to do the Max Profit Stock problem. Super easy!

I was prepared for hard tree and graph problems, lol.

The engineers were really friendly. It's been a great experience so far. I'm moving to the final loop next week.

Max profit stock.

Sort 2 sorted arrays into one array.