amazon logo
Amazon· programmer analyst

Amazon Interview Questions for Programmer Analyst

Result
Offer
Posted
13 Oct 2021
343 reads

Summary

I recently interviewed at Amazon for a Programmer Analyst role, undergoing multiple technical and behavioral rounds, and successfully received an offer.

How it went

My interview journey at Amazon for the Programmer Analyst position involved several stages. It kicked off with an Online Assessment on HackerEarth, where I tackled 3 programming questions within a 2-hour window. Following this, I proceeded to two separate 1-hour technical interview rounds, each focusing on coding challenges. The fourth round was a blend of technical and behavioral questions, with no coding involved. Finally, I had my fifth and final interview, which again combined technical discussions with behavioral aspects. I'm delighted to share that I was extended an offer.

Questions asked (5)

  1. 01

    Next Greater Element with Index Tweak

    Data Structures & Algorithms · Medium

    Given an array, for each element, find the index of the next greater element. If no greater element is present, return -1. For example, if arr = [72,73,74,70,69,70,75,76,73,72], the expected output is [1, 1, 4, 3, 1, 1, 1, -1, -1, -1].

    Open the problem
  2. 02

    Two Sum

    Data Structures & Algorithms · Easy

    Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice.

    Open the problem
  3. 03

    Validate Binary Search Tree

    Data Structures & Algorithms · Medium

    Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Both the left and right subtrees must also be binary search trees.

    Open the problem
  4. 04

    Remove Nth Node From End of List

    Data Structures & Algorithms · Medium

    Given the head of a linked list, remove the n-th node from the end of the list and return its head.

    Open the problem
  5. 05

    Symmetric Tree

    Data Structures & Algorithms · Easy

    Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Amazon recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!