Company OAsDSA SheetAll ProblemsPlacement DataInterview ExperiencesPremium
OAHelper

Built by students, for students — practice company-specific OAs, DSA sheets, and real interview experiences to land your dream role.

© 2026 OAHelper.in·Terms·Privacy·Refunds·Trust & Safety·Contact·
Ready to crack your next OA?

Practice company-specific questions trusted by thousands of students across India.

Start PracticingGo Premium
OA Practice·DSA·Placements

Disclaimer: OAHelper is an independent educational platform. We (oahelper.in) do not own the images or questions shown. Content is uploaded by users.

Interview Type: On-Campus

Result: Rejected

Difficulty: Medium

College: IIT Guwahati

Interview Date: 7th August 2025

Number of Rounds: 1

Topics Asked: DSA

The interview was 45 minutes long, with two DSA questions. First question was to count non-overlapping intervals. I knew how to approach it sort by end time and pick intervals greedily. Took me about 30 minutes to solve it properly. After that the interviewer asked me to explain my code and tell the time complexity, which was O(n log n) because of the sorting. Then he gave me the second question Network Delay Time. This one needed Dijkstra's algorithm, but I didn't know it at that time. I tried a few other ways to solve it but couldn't get it right. Time ran out and the interview ended there.

Browse All Interview Experiences
All Experiences
RejectedOn-Campus

AmazonInterview Experience — SDE Intern

SDE Intern

7th August 2025

College

IIT Guwahati

Rounds

1

Difficulty

Medium

Posted

09 Jul 2026

Categories

DSA

Interview Logistics

The interview was 45 minutes long, with two DSA questions. First question was to count non-overlapping intervals. I knew how to approach it sort by end time and pick intervals greedily. Took me about 30 minutes to solve it properly. After that the interviewer asked me to explain my code and tell the time complexity, which was O(n log n) because of the sorting. Then he gave me the second question Network Delay Time. This one needed Dijkstra's algorithm, but I didn't know it at that time. I tried a few other ways to solve it but couldn't get it right. Time ran out and the interview ended there.

Ready to share your own story?

Submit ExperienceExplore All