The first round had two medium difficulty DSA problems.
Where I had to start with brute force and end with an optimal solution. Complete C++ code was expected to be written on paper.
Domande di colloquio [1]
Domanda 1
Q1. Find longest subarray of a binary array with equal number of ones and zeros.
Q2. Flaten a binary tree inplaces such that left nodes occur before right nodes.
