Round 3 (Technical Round – ll)
Duration: 1 hour: –
This Round was totally based on DSA. First she introduces herself then asked me to do the same. Then she asked me whether I am comfortable with tree and Graph then I said yes, then she asked me two question.
- Mirror Tree – https://www.w3wiki.org/problems/mirror-tree/1
She asked me to First explained the iterative then recursive approach then she told me to write the code from scratch. - Two sum. https://www.w3wiki.org/check-if-pair-with-given-sum-exists-in-array/
At last she gave a positive feedback.
Contact Us