SDE - 1

• I used tree traversal approach to solve the question and check the left and right children of the node if they both are NULL then just print that node. It passed all test cases.

• I tried solving it using Dp approach but not able to pass test cases.

• Firstly I told the interviewer brute force approach. Search every 3*3 cell. To optimize it I gave the DFS approach and push all the coordinates of 1s in a vector as a connected component and using simple if and else tests, one can check if the connected component is H or I or T. He was pretty much satisfied by my approach.

• I used the approach based on using two stacks. We can use one stack for printing from left to right and another stack for printing from right to left. In every iteration, we have nodes of one level in one of the stacks. We print the nodes and push nodes of the next level in another stack.

• For sorting I explained the interviewer merge sort in linked list which divides the linked list into two halves and then merge them.  wrote a fully commented code for him in good handwriting. I calculated mid point through slow and fast pointer approach as well.

• I explained him simple brute force approach through the loop but the interviewer was expecting a more efficient solution that I couldn‘t crack up.

Just gave the interviewer a basic introduction about me with the CGPA and other internship experiences.

• I explained the basic working of my projects and technology stack on which my projects were developed. Then he asked me for flow chart for one of my projects and I explained to him properly, the flow chart of, my project with all the necessary details.