Moderate difficulty. I gave 2 rounds first for data structures questions and second named AA round having both Hr and data structures questions. Data structures questions based on arrays dp and recursion.
Interview questions [1]
Question 1
1. Maximum sum of array having non adjacent elements.
2. Frequency of element in sorted array
I applied online. The process took 3 months. I interviewed at Microsoft
Interview
Cada una de las entrevistas fue muy divertida, disfruté cada una de ellas, y los entrevistadores siempre se portaron amables y abiertos a responder cualquier pregunta. En general, excelente experiencia
Video call interview. I was asked personal questions about myself and was finally asked to answer a riddle. The interviewer was nice and explained to me about the continuation of the process
Interview questions [1]
Question 1
There are three boxes, one contains only apples, one contains only oranges, and one contains both apples and oranges. The boxes have been incorrectly labeled such that no label identifies the actual contents of the box it labels. Opening just one box, and without looking inside the box, you take out one piece of fruit. By looking at the fruit, how can you immediately label all of the boxes correctly?