A binary search question where it's tricky to find whether it indeed is binary search. but it is. you have to binary search on the final answer (low= 0 and high = 1e9 guessed as per the variable constraints) and the final answer is calculated in n log n
describe past internship or project experiences
The interview has Leetcode type of questions.
What is your approach when looking for another person's code and fixing a bug?
A problem I faced in a project and how I tackled it
There were questions about cryptography. For instance, what is asymmetric cryptography?
Online Test - one tough one medium question Phone interview - easy level questions, time complexity, space complexity
A string manipulation question
Problem to be solved with general data stractures and some logic
All they asked was the technical coding question
Viewing 1001 - 1010 interview questions