Apart from the online assessment (OA), the internship process usually includes two DS & Algo interviews of around one hour each, together with behavioral questions.
Some candidates think if you are not asked any behavioral questions then it means you did not do well and are already rejected. This is not entirely true, one candidate reported that they were not asked any behavioral questions during interview but still ended up receiving the internship offer 15 days later.
Low Level Design questions are generally not asked for internship roles. However one candidate reported an elevator-system LLD question for SDET internship, but those cases appear to be exception rather than the norm.
For the AI-assisted coding round, you choose one repository. Options may include C++, Django, Spring Boot, ReactJS, Node.js, Ruby on Rails, and similar stacks. The interface provides a code editor and an AI assistant for project-related questions. You have 60 minutes to implement the required behavior and pass the test cases, usually around six. The assistant can help you search the project, locate files, and understand the codebase.
This list includes coding-round questions reported for both SDE intern and SDET intern interviews.
Infact one person even reported that their team was eliminated in the very first round of HackOn in May. But in july end he ended up receiving an email stating that he has been shortlisted for an Amazon Online Assessment based on his HackOn performance. Infact he gave his OA got shortlisted for interview, had his interview in september then got waitlisted and finally received SDE intern offer in last week of november.
For the USA and other countries, direct applications through Amazon's jobs portal and employee referrals are the usual routes.
It is important to not loose hope. One person applied for winter internship but they found the OA very hard and struggled through it. However after lots of back and forth they were able to pass all tests. But then winter internship slots were filled and they were moved to summer. They received interview confirmation two months later.
During one of the coding rounds they got a leetcode hard question. They struggled a lot and need help to solve it. But what worked in their favour is that they vocalized their entire thought process the way through along with any edge cases that came to mind. They eventually ended up receiving the offer.
Keep trying, eventually you will see the light at the end of tunnel.
LeetCode Questions
Start with these questions that can be practiced directly on LeetCode.
Merge k Sorted Lists
leetcode.com/problems/merge-k-sorted-listsConstruct Binary Tree from Preorder and Inorder Traversal
leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversalPractice Questions
Use below list to practice for your Amazon internship interview rounds.
Days Until a Warmer Temperature
Given daily temperatures, determine how many days must pass after each day before a warmer temperature occurs. Use 0 when no warmer future day exists.
02Next Greater Element in a Circular List
Find the next greater element for every value in a circular list. After the last element, the search continues from the beginning.
03Adjacent Characters Are Not the Same
Rearrange lowercase letters so no two adjacent characters are the same. Return the lexicographically smallest valid arrangement, or an empty string if impossible.
04Maximum Items from Consecutive Shelves
Some non-overlapping shelf ranges contain items while all other shelves are empty. Select exactly k consecutive shelves with the maximum total items.
05Sorted Fence Heights
Increase consecutive groups of fence sections until their heights are non-decreasing. Minimize the total cost, where increasing a group by x costs x.
06Minimum Letter Sticker Sheet Design
Design a fixed-size letter-sticker sheet whose identical copies can form a given word. Minimize the copies required, then choose the smallest design lexicographically.
07Maximum Training Pair Score
Divide an even number of students into learner-helper pairs. Each pair contributes the learner's ability, and the helper must have equal or greater ability.
08Maximum Usable Cable Length
Cut selected cable rolls into exactly the required number of non-empty segments. The longest half fail inspection; maximize the total length that remains.
09Minimum Cost to Make Stall Prices Equal
Copy one stall's current price to every stall on its left or right. Minimize the total cost needed to make all stall prices equal.
10Minimum Sheet Cutting Time
Lasers cut compatible metal sheets in one second and then cool for one second. Find the minimum time to cut every sheet, or return -1.
11Possible Final Sensor Readings
Repeatedly remove distinct sensor readings from the beginning or end of their recorded sequence. Determine which original readings can become the only remaining reading.
12Longest and Lexicographically Greatest Palindromic Substrings
Find the longest palindromic substring. Implement one method that returns the first longest palindrome and another that resolves ties lexicographically.
13Maximum Stock Profit: At Most K Transactions
Return the maximum stock profit using at most k transactions. Each transaction buys once and sells later, and only one stock may be held.
14Maximum Demolition Profit
Buildings in a row have positive or negative net values. Demolish buildings only from the ends of the remaining row to maximize collected value.
15Maximum Score from Non-Adjacent Tiles
Select non-neighboring tiles to collect their non-negative scores. Determine the maximum score when the tiles form a straight line and when they form a circle.
16Assign Aggressive Cows To Stalls
Place the required cows in distinct stalls so the closest pair is as far apart as possible. Return that maximum possible minimum distance.
17Count Book Line Groups by One Letter Swap
Scrambled book lines contain the same letters in different positions. Count groups connected directly or indirectly when one swap can make two lines equal.
18Count Prime-Numbered Lockers Under Inspection
A warehouse has several inclusive inspection ranges of locker numbers. Count the distinct prime-numbered lockers covered by at least one range.
19Count Ticket Purchase Plans
A cinema sells individual tickets and equal-sized bundles. Count the different combinations that buy exactly the required number of tickets.
20Safe Electrical Wire Configurations
Every electrical wire can direct current either way between its stations. Count the safe direction configurations that contain no directed cycle.
21Search Minimum And Rotation Count In Rotated Sorted Array
Support target search, minimum-value lookup, and rotation counting in a rotated sorted list that may contain duplicate values.
22Remove K Digits to Create Smallest Possible Number
Remove exactly k digits from a non-negative integer while preserving the order of the remaining digits. Return the smallest possible number.
23Use Path Operations To Minimize Tree Diameter
A special operation reconnects every vertex on a chosen tree path directly to its start. Find the fewest operations needed to minimize the diameter.
24Minimum Parcel Transfer Trips
A trolley carries at most two parcels whose combined weight stays within its load limit. Find the minimum trips needed to move every parcel.
25Count Valid Cleanup Plans
Every resident chooses whether to join a neighborhood cleanup or stay home. Count the decision plans satisfying every resident's minimum companion requirement.
26Most Common Lab Tool Pair
School records list the tools used in each science experiment. Find the pair of different tools used together in the greatest number of experiments.
27Calculate Number Power Without Built-In Functions
Given a number and an integer exponent, calculate the number raised to that exponent without using a built-in power function.
28Find Combined Service Tags
Some service tags are made by joining two or more other tags from the same list. Find every tag that can be formed completely this way.
29Maximum Score From Numbered Balls
Tubes contain consecutively numbered balls with the greatest number on top. Remove exactly the required number of balls to maximize the total printed score.
30Most Frequent Tags Across LinkedIn Connections
Starting from a member, find the most frequently used post tags among that member's direct connections and the connections of those people.
31Complete All Baking Batches
Assign batches to ovens with enough heat; each use halves an oven's current heat. Determine whether every batch can be completed in each schedule.
32Earliest Water Tank Target Time
Pumps operate during fixed minute ranges and add one liter per minute. Find the earliest time when the tank reaches its target amount.
33Bus Route Passenger Count Tracker
Store how many passengers boarded at each bus stop. Support corrections to recorded counts and total queries over any continuous range of stops.
34Candy Jar Pickup Score
Always pick from the fullest candy jar. Each turn scores the greatest count plus the smallest positive count before the selected jar decreases.
35Most Frequent Training Partner Pair
Practice records contain comma-separated player IDs. Return the pair of players that attended the greatest number of sessions together.
36Currency Conversion
Convert an amount through directed currency rates, possibly using intermediate currencies. Among all non-cyclic paths, return the maximum converted value.
Thanks for reading.
Wish you the best of luck with your Amazon internship preparation.