40 MCQ, 2 coding questions in 1.5 hrs. (134 for MCQ, 100 + 50 for coding) MCQ were challenging and tricky. Better to do 1 coding question fully and then focus on MCQs since they had negative marking too. either +3/-1 or +4/-1
Domande di colloquio [1]
Domanda 1
1. lengthy question. Concept - many modifications to be made to a seg tree (100)
2. find the minimum size subarray whose MEX > K . MEX of a set of integers is the minimum non-negative integer that doesn’t exist in it. (50)
