Round 1: Online Assessment (OA)
Questions:
- JSON Parser (Easy) - Implement a function to parse a JSON object in JavaScript.
- Longest Palindromic Substring (Medium) - Given a string
s
, return the longest palindromic substring. - Parse the URL (Easy) - Parse a given URL and extract its components like protocol, hostname, and path.
- Outcome: Solved all 3 questions within 20 minutes (LeetCode practice helped a lot).
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Technical Interview
Questions:
-
DSA:
- 2Sum (Easy) - Solved using 3 approaches: brute force, hash map, and two-pointer technique.
- 3Sum (Medium) - Used a similar concept as 2Sum. After some hints, applied the two-pointer approach.
-
JavaScript Basics:
- Questions related to hoisting and Node.js basics.
-
Outcome: Cleared the technical round.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3: Hiring Manager Interview (Engineering Manager)
Questions:
- What is an array?
- What is a linked list?
- Difference between array and linked list
- Find the middle element of a linked list (Medium) - Initially gave one approach but later remembered the fast and slow pointer technique.
- Difference between Set and Map
- How to handle collisions in a hash table? - Couldn't recall the answer.
- SQL vs NoSQL
- Outcome: The interview was short, and the interviewer seemed okay with most answers.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Final Result
- After two days, I followed up with HR multiple times. Eventually, I received feedback that my performance in the last round was not strong, and they would not be moving forward.
Lessons Learned
- Regular practice on platforms like LeetCode can help solve technical questions quickly.
- Be prepared for all types of interviews, including those that may be shorter or less in-depth topics than expected.