I applied online. The process took one week.

I attended a Zoom interview. They asked me to write code for one program, and general interview questions were asked. Bookish questions were asked. If one has seen them before, they will know. It is better to see how one logically thinks (no need for complicated stuff) and what they have worked on for SDE-2 and above, which is what matters.

Find the longest substring without repeating characters.

What is the complexity of concatenating a string object?

Consider Log2 N versus Log3 N to determine which is smaller. If log3 N is smaller, why can't we use log3 N worldwide?