YOE: 6.7

Q1 : https://leetcode.com/problems/diameter-of-binary-tree
Q2: https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses

I was able to solve both questions within 20 minutes, including a code walkthrough using test cases.

I used to follow a 7-step rule to excel in DSA rounds. Sharing it with the community as it might be useful for others.

1. Understand the Problem Statement

   Read the problem carefully.
   Ask for sample test cases to clarify input-output expectations.

2. Clarify Requirements

   Ask relevant questions to remove ambiguities.
   Ensure both you and the interviewer have the same understanding of the problem.

3. Start with the Brute Force Approach

   Even if you know an optimized solution, always begin with the simplest approach.
   Analyze and communicate its time and space complexity.

4. Optimize Your Approach

   Identify inefficiencies in the brute force solution.
   Propose and explain a more optimized approach, justifying improvements in time and space complexity.

5. Implement the Solution

   Write clean, readable, and well-structured code.
   Use meaningful variable names and follow coding best practices.

6. Test with Sample Cases

   Walk through your code using the test cases discussed in Step 1.
   Debug and verify correctness.

7. Handle Edge Cases

   Consider boundary conditions, empty inputs, large inputs, and special cases.
   Ensure robustness by addressing potential edge cases.

By following this U.C.B.O.I.T.H. method (Understand, Clarify, Brute force, Optimize, Implement, Test, Handle edge cases), you can systematically tackle DSA problems and improve your coding interview performance.