OA:
- Top K frequent elements (elements sorted inside each frequency),
-Prefix and Suffix sum,
- Break the prison (Naukri code 360)
Interview 1:
- Rotate array by k, where k is a value in another array. And you need to return an array where each index contains the index of the maximum element.
- Similar to Asteroid Collision, but for stones. Where the direction is index dependent. So [1, -1], both stones collide, [-1, 1] stones never collide.

Interview 2:
- Tell me about a time you made a SIGNIFICANT mistake. (With follow ups)
- Least number of unique Integers after K removals

Question

OA: 
- Top K frequent elements (elements sorted inside each frequency), 
 -Prefix and Suffix sum, 
- Break the prison (Naukri code 360)
Interview 1: 
- Rotate array by k, where k is a value in another array. And you need to return an array where each index contains the index of the maximum element.
- Similar to Asteroid Collision, but for stones. Where the direction is index dependent. So [1, -1], both stones collide, [-1, 1] stones never collide.

Interview 2:
- Tell me about a time you made a SIGNIFICANT mistake. (With follow ups)
- Least number of unique Integers after K removals

Qualtrics

Pergunta de entrevista da empresa Qualtrics

Empresas seguidas

Buscas de vagas