Amazon placement papers, interview questions, placement process, eligibility criteria, and a deeply customized preparation guide for 2025-2026 campus recruitment in India.
Amazon is a global technology leader in e-commerce, cloud computing (AWS), digital streaming, and AI. In India, Amazon is a top recruiter for software engineers, known for its rigorous hiring process, customer obsession, and unique Leadership Principles. Amazon India’s tech teams work on high-impact products like Amazon.in, Alexa, Prime Video, and AWS.
Headquarters: Seattle, USA Employees: 1,500,000+ globally
Industry: E-commerce, Cloud, AI Revenue: $574+ Billion USD (2023)
Minimum Percentage: 60% or 6.5+ CGPA in 10th, 12th, and graduation Degree: B.Tech/B.E./M.Tech/MCA in CS, IT, ECE, or related fields Year of Study: Final year students and recent graduates (within 1 year) Backlogs: No active backlogs at the time of selection
Branch Eligibility
Eligible Branches: CS, IT, ECE, EE, and related engineering streams Programming Focus: Strong skills in Data Structures, Algorithms, and OOP Experience: Freshers and up to 2 years experience (for SDE-1)
Additional Criteria
Coding Skills: Proficiency in at least one language (Java, C++, Python) Gap Years: Maximum 1 year gap allowed Course Type: Full-time degrees only Nationality: Open to Indian and international students (for India roles)
Two Sum Variant
Problem: 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. You can return the answer in any order.
Sliding Window Maximum
Problem: You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position.
Example: nums = [1,3,-1,-3,5,3,6,7], k = 3. Output: [3,3,5,5,6,7]
Code: (Java/C++)
classSolution {
publicint[] maxSlidingWindow(int[] nums, intk) {
intn= nums.length;
if (n ==0|| k ==0) returnnewint[0];
int[] result=newint[n - k +1];
Deque<Integer> deque=new ArrayDeque<>();
for (inti=0; i < n; i++) {
// Remove indices that are out of the current window
if (!deque.isEmpty() && deque.peekFirst() == i - k) {
deque.pollFirst();
}
// Remove indices whose corresponding values are less than nums[i]
// because they will not be the maximum in the current window
while (!deque.isEmpty() && nums[deque.peekLast()] < nums[i]) {
deque.pollLast();
}
deque.offerLast(i);
// The first element in the deque is the maximum for the current window
if (i >= k -1) {
result[i - k +1] = nums[deque.peekFirst()];
}
}
return result;
}
}
String Compression
Problem: Given an array of characters chars, compress it using the following algorithm:
If the character count is 1, append the character. If the character count is greater than 1, append the character followed by the count.
Ready to start your Amazon preparation? Focus on DSA (especially graphs, sliding window, bit manipulation), system design basics, and Amazon Leadership Principles. Practice mock interviews and build strong STAR stories for every principle.
Pro Tip: Consistent practice on LeetCode (Amazon tag) and HackerRank is key. Understand the “why” behind Amazon’s Leadership Principles for behavioral rounds. Every answer should show impact, learning, and ownership.