It was a two-interview process: one was a phone interview, and the second was a video call.

Both focused on data structures and algorithms. The problems were LeetCode medium difficulty.

The interviewers were really friendly and helpful; they helped me a lot through the interviews.

Given a sorted array and an integer K, find the number of occurrences of K. There was a follow-up question: what happens if there are m queries with different K values? How can you handle this? (Note: Code for the follow-up was not requested.)

Given an array of positive integers and a variable K, find if there is a subarray that sums up to K. Follow-up: What if the array contains negative numbers?

Given an array of points, find the K closest to the origin.

This was more of a discussion question:

I have a binary tree with positive and negative values. I want to represent it in arrays of integers. You can use one or more arrays to represent it. After that, we want to write a function that takes this representation and constructs the binary tree.