Recruiter Outreach: Via Instahyre
Role: Backend Engineer E3
Location : India
Status: ❌ Rejected

Round 1: Online Assessment (Coderbyte)

Don't remember questions.

Round 2: DSA Pair Programming (Coderbyte)

Live coding + discussions:

1. BFS on a grid → Similar to Rotting Oranges

2. Find longest path in a graph (Similar to https://leetcode.com/problems/binary-tree-maximum-path-sum/description/ ) but here it was a graph instead of binary tree.

Also required to print the path

Round 3: Machine Coding (LLD)

Implement stoi (string to int conversion)
Seemed like a DSA problem but still tried to do the following:
✔ Followed proper OOD
✔ Covered edge cases clearly
✔ Finished in ~35 minutes
✔ Added extensibility via Strategy Pattern (e.g., future parsing rules)

Interviewer mentioned that:

✅ All requirements were fulfilled
✅ Round wrapped up early

Still ended with a rejection.

Final Outcome

❌ Rejected after LLD
No detailed feedback shared