Software Engineer Interview Questions

Laksitha R. - "public static int maxProfitGreedy(int[] stockPrices) { int maxProfit = 0; for(int i = 1; i todayPrice) { maxProfit += tomorrowPrice - todayPrice; } } return maxProfit; } "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

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

Malay K. - "While answering such a question, it is important to focus on personal growth, learning, and how the experience improved your teamwork. You want to demonstrate self-awareness, humility, and an ability to adapt. I had this experience while working on a cross-functional project that involved collaboration between the engineering and marketing teams. In the interview, I shared a story when I misjudged someone and showed unconscious bias towards due their gender, ethnicity or age. It was embarrassin"See full answer

Unicorn 2. - "I would like to ask a few clarifying questions Lyft for kids: Does this mean we want to design a ride sharing app for kids? (Assuming yes) Do we have any existing features catered to kids? (Assuming no) Lyft has a lot of features. I am going to assume basic table stake features which Lyft already has as: Ability to call for a ride Ride tracking Are there any goals that we would like to achieve with this feature? If we look at current market conditions, Lyft has biggest threat f"See full answer

Sachin R. - "If 0's aren't a concern, couldn't we just multiply all numbers. and then divide product by each number in the list ? if there's more than one zero, then we just return an array of 0s if there's one zero, then we just replace 0 with product and rest 0s. what am i missing?"See full answer

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

Kurt K. - "Why skip defining the data model? Or did I just miss it?"See full answer

Aswath B. - "basic drew the diagram"See full answer

Krish M. - "Situation: I led a critical initiative to re-architect the high volume customer data platform. The system handled over 90 PB of records handling around 70 billion customer records daily and was foundational to customer data capabilities across multiple enterprise products. The existing architecture faced significant challenges around latency, accuracy, and scalability, and any disruption would directly impact global customers and downstream systems. Task: I was responsible for leading t"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

דניאל ר. - "Implemented a recursive function which returns the length of the list so far. when the returned value equals k + 1 , assign current.next = current.next.next. If I made it back to the head return root.next as the new head of the linked list."See full answer

David P. - "delete"See full answer

Soumya S. - "In 2019, I was given a very important problem to solve. In a team of 3 we had to build a mobility assist device. The customer segment we would go for was something we could decide. The project was very close to me as I had lost someone I loved because of cancer and I saw how reduced mobility was a huge pain point in not being able to do physical activities. My team could only think of elderly people as the main target market. As the Head of Product what I did was: 1) I helped them dive even d"See full answer