Online Assessment
Questions:
- Longest Path between any two nodes in an undirected graph.
- Sliding Window + Binary Search question.
The level of questions was Medium.
Round 1 (1hr): DSA Round
Questions:
- Perform some string manipulation, which was reduced to a directed graph problem requiring a DFS traversal.
- Follow-up question similar to finding the Lowest Common Ancestor (LCA) of given two nodes (LC 236).
Candidate's Approach
The candidate performed string manipulation and transitioned to a DFS traversal for the directed graph problem. For the LCA question, they applied relevant concepts but did not provide specific details on the approach.
Interviewer's Feedback
No feedback provided.
Round 2 (1.5hr): DSA Round
Questions:
- Given a string of valid bracket sequence, find the longest depth of opening brackets (LC 1614).
- Implementation-heavy question related to merging intervals (LC 56).
- Given a sequence of characters and brackets, find the longest valid sequence that has a valid bracket sequence (LC 32).
Candidate's Approach
The candidate found the longest depth of opening brackets and proposed an approach for merging intervals. They struggled to relate the second question to the first and had difficulty coding the third question due to time constraints but explained their approach satisfactorily.
Interviewer's Feedback
No feedback provided.
Round 3 (1hr): Hiring Manager Round
Questions:
- Why did you use MySQL?
- Differentiate Primary Key and Foreign Key.
- Explain different Normal Forms.
- OOP concepts.
- What optimizations can be done on the projects, and what was the most challenging part of the project?
- Describe your intern project and your approach to the problem statement.
- General questions about group projects, conflict resolution, and future aspirations.
Candidate's Approach
The candidate discussed their projects and internships, explaining their choices and approaches to problem statements. They were prepared for questions about optimization and teamwork.
Interviewer's Feedback
No feedback provided.
Some Tips:
- Make sure to ask clarifying questions.
- State the Time and Space complexity after your approach.
- If you are stuck, do ask the interviewer for hints.
- Start with the brute force approach and then try optimizing it.
- When asked "Any Questions for me?", inquire about company culture, work, tech stack, etc.
- Trust the process; rejections may happen, but persistence is key.
Cheers and Good Luck!!