coding round- 3questions
1st:- base 2 to base 6
2nd:- minimum number of operations require to convert all 1s to 0s in a string.
3rd:- balloon burst leetcode hard problem slight variations.
Otras evaluaciones sobre las entrevistas para el cargo de SDE-intern en Uber
The OA was really hard. It contained three question,
ALL OF THEM WERE FROM DP.
First one was a variation of knapsack problem, which i solved (medium-hard)
and the remaining two questions were from 2D DP.
I was not selected :((
Good, it was tough, and I didn't get through. There were three questions, two of which were string-based, hashing and slicing were involved, and then there was a greedy question as well.
Dual-round interview format where the first round assessed Data Structures and Algorithms skills along with HR behavioral fit, and the second round covered Low-Level System Design concepts with an additional HR conversation.
Preguntas de entrevista [1]
Pregunta 1
Got a question with like BFS + Binary search kind of like Monsters (CSES)
Had to solved in 45 Min , also got some questions around HR which were normal like challenges, how to handle conflict
