Round 1: DSA
Questions:
- Triplet with sum 0 in a BST:
- Approach: In-order traversal → Sorted array → 3Sum algorithm.
- Row with max 1's in a row-wise sorted matrix (m, n = 100,000):
- Brute force → Optimized with a two-pointer approach.
Candidate's Approach
For the first question, I utilized an in-order traversal to create a sorted array from the BST, which allowed me to implement the 3Sum algorithm efficiently. For the second question, I initially considered a brute force solution but then optimized it using a two-pointer technique to improve performance given the constraints.
Interviewer's Feedback
The interviewer noted my strong SDE fundamentals and inquired why I wasn’t pursuing SDE roles.
Round 2: Frontend
Questions:
- Task: Recreate a given UI live using HTML and CSS.
- I used React.js + Tailwind CSS (my comfort zone) but also attempted HTML/CSS.
Candidate's Approach
I focused on using React.js and Tailwind CSS to recreate the UI, as I am more comfortable with these technologies. I also made an effort to implement the design using plain HTML and CSS to demonstrate versatility.
Interviewer's Feedback
The interviewer provided positive feedback on my approach and noted my strong fundamentals in software development.