Amazon Interview Questions

Deepak K. - "When I did't reach my expected deadline and if my work is unfinished after the deadline is arrived, I started rectifying the areas where I leg behind why i did't meet the expected deadline and i complete the work as soon as possible by working double and hard . And next time i will make sure that the problems which i faced earlier should not arrived again , and I mus match the deadline."See full answer

Namu - "Provided an example from my work history where I asked to move the Go-live date to prevent launch date failure."See full answer

Shashikant A. - "I followed STAR format"See full answer

James W. - "I've recently worked closely with a product that had both the best and worst performing teams. The situation is that one team is struggling to deliver within a reasonable timeframe, a few stronger members of the team are carrying the weaker. Work is taking a long time. They aren't listening to each other. They aren't helping each other to get work over the line. They are getting stuck down rabbit holes. They aren't continually improving their processes. They are getting frustrated and at risk o"See full answer

Ilnur I. - "I really appreciate how he clearly explains every term he uses!"See full answer

Amparo L. - "One time at Lifetime Fitness 2019, One student was throwing a lot of towels in the counter which made things very disorganized, then I made a compromise with my coworker to put 2 towels at a time and then it worked well because it made the workspace very organized."See full answer

Mohammed H. - "First i will collect relevant data,Actual problem,Necessary input and raw material then i will start design drawing,modeling,Callibration and finally handing over my work."See full answer

Avon T. - "Initialize left pointer: Set a left pointer left to 0. Iterate through the array: Iterate through the array from left to right. If the current element is not 0, swap it with the element at the left pointer and increment left. Time complexity: O(n). The loop iterates through the entire array once, making it linear time. Space complexity: O(1). The algorithm operates in-place, modifying the input array directly without using additional data structures. "See full answer

Snehangsu B. - "In a recent implementation of a large core banking project where we were breaking away from monolithic architecture to microservice based one we faced a situation where customer wanted to have a single repository of user and role management. Since Micro service based architecture talks about individual entities for multiple product suite it was mandatory to maintain individual user base. Based on the customer feedback, we had to come up with an unique design of single user base and replicating"See full answer

Anonymous Stork - "Roadblocks or obstacles are common when working on projects. It's essential to navigate them and quickly find solutions to ensure timely delivery and success of your projects. Steps to handle roadblocks or obstacles: Gauge the potential imapct and decide if it's something that needs immediate solution or something that can be handled later. If it needs urgent solutions, try to understand the rootcause of the roadblock or obstacle and dig deep. If it's a already seen problem before, try"See full answer

Srini K. - "performance issues and sudden spikes on input requests by scaling techniques and optimization."See full answer

Khushbu R. - "General Approach (using Max-Heap) Use a max-heap (priority queue) of size k. For each point: Compute the distance to P. Push it into the heap. If heap size > k, remove the farthest point. The heap will contain the k closest points to P. import java.util.*; public class KClosestPoints { static class Point { int x, y; public Point(int x, int y) { this.x = x; this.y = y; } // Euclidean distance squared (no need to take square root) p"See full answer

Scott S. - " The Situation A few months ago, our trading platform started experiencing significant latency issues during peak trading hours. This latency was affecting our ability to process real-time market data and execute trades efficiently, potentially leading to substantial financial losses and missed opportunities. Identifying the Problem The first step was to identify the root cause of the latency. I organized a team meeting with our data engineers, DevOps, and network specialists to gather"See full answer

Gabriele G. - "DFS with check of an already seen node in the graph would work from collections import deque, defaultdict from typing import List def iscourseloopdfs(idcourse: int, graph: defaultdict[list]) -> bool: stack = deque([(id_course)]) seen_courses = set() while stack: print(stack) curr_course = stack.pop() if currcourse in seencourses: return True seencourses.add(currcourse) for dependency in graph[curr_course]: "See full answer

Akshay J. - "Started by asking clarification questions regarding design constraints and desired features. Break down the into re-usable components - HeroImg and Carousel (with 3 images rendered) Code the components and managed the state for both in the parent component."See full answer

Sam T. - "demonstrate your ability to recognize and nurture talent, provide growth opportunities, and create an environment that supports and challenges high-performing individuals. Use a real-life example to illustrate your approach and showcase your leadership skills. Managing high performers is an exciting and rewarding aspect of being an engineering manager. These individuals are often the driving force behind innovation, productivity, and success within a team. As a manager, it's crucial to recogni"See full answer

Hayatu H. - "How do you find consecutive days for login (MySQL, SQL, date, subquery, MySQL 5.7, development)? 1 Follow Request Answer More All related (34) Recommended 📷 Trausti Thor Johannsson · Follow Been using MySQL for more than 16 yearsDec 27 There are functions like DATEDIFF but there are also BETWE"See full answer

Basil A. - " import java.util.*; public class MostCommonWords { public static String mostCommonWords(String text) { // your code goes here Map map = new HashMap(); for(String s : text.replaceAll("[\\p{Punct}]", "").toLowerCase().split(" ")) { if(!s.isEmpty()) { map.merge(s, 1, Integer::sum); } } return map.entrySet().stream().sorted( (e1, e2) -> { "See full answer

Personal W. - "Payment system requirement assumption: Need to be ACID Amount limitation - some validation for max input size can be done at client level/ API level. Need to store historic info - GDPR The information to be stored for database assumed can be structured so RDBMS like mysql or Postgres Notification requirement - if fail or success need to be text or email to user and or caller Scalable - Assumption that it deals with critical transaction so Availability and Scalability requirement i"See full answer