Interview Rounds:

Technical Screen (TS):

Question: String design-based problem (e.g., Find and Replace but with some twists).

The problem was easy to understand but had multiple edge cases and was open-ended.

Onsite (3 Rounds):

Round 1: String-Based Design Question

• Initially framed as a complex problem, but the interviewer later broke it down into two sub-problems.

• Solved both parts successfully.

Round 2: Graph-Based Problem (Shortest Path Variant)

• The problem was similar to Min Path and could be approached using Dijkstra’s Algorithm.
• Implemented the solution efficiently.

Round 3: Graph-Based Problem (Concept Similar to Alien Dictionary)

• The problem was easy to understand, but the example provided was confusing.
• The interviewer expected a specific approach, possibly due to a hidden follow-up.
• I solved it using DFS, but the interviewer didn’t seem fully convinced.
• Ran out of time while discussing improvements.

Final Verdict: ❌ Rejected