Panda Guru LogoPanda
Guru

Amazon SDE-1 | Interview Experience | Accepted ✅

Online Assessment (OA)

Questions:

Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.


Round 1: Technical Interview

Questions:

  1. 962. Maximum Width Ramp

    • Solved in ~45 minutes using a monotonic stack
    • Time Complexity: O(N)
    • Space Complexity: O(N)
  2. 210. Course Schedule II

    • Solved in ~7 minutes using topological sort (Kahn's Algorithm)
Candidate's Approach

No approach provided.

Interviewer's Feedback

The interviewer was very kind and provided ample hints for the first question.


Round 2: Technical Interview

Questions:

Follow-up Question:

"Describe a situation where you put in extra effort beyond your assigned work and achieved success."

Candidate's Approach

Successfully wrote the code with helpful guidance from the interviewer.

Interviewer's Feedback

No feedback provided.


Round 3: Technical + Bar Raiser

Questions:

Technical Question:

Problem Statement:
"Two sorted linked lists are given. You need to traverse the lists, starting from any list and ending at any list. You can switch lists at common nodes. Return the maximum sum while traversing the linked lists."

Example:

L1 = 1 -> 5 -> 8 -> 12 L2 = 2 -> 4 -> 5 -> 12 Output: 2 + 4 + 5 + 8 + 12 = 31

Constraints:

Cannot change the data type (i.e., no conversion from linked list to array/vector).

Solution:

Follow-up:

"What if we have K sorted linked lists?"

Candidate's Approach

Wrote working code for the follow-up question as well.

Interviewer's Feedback

No feedback provided.


Final Outcome:

Received a call from the recruiter a week later and was offered the role.