Software Engineer Interview Questions
Practice 4,429 real software engineer interview questions for 2026. Covers top employers like Google, Amazon, OpenAI, and Uber — real questions from actual onsites with detailed solutions — and is built for focused interview preparation. This collection emphasizes coding and algorithms first, then system design, performance, and role-specific domains so you can train the exact skills interviewers test. What’s distinctive: coding rounds still dominate at every company, Google often emphasizes algorithms and distributed-systems thinking, Amazon commonly probes scalable-services design and operational tradeoffs, OpenAI leans toward ML systems, model deployment and inference-scaling problems, and Uber typically asks real-time routing, geospatial and consistency challenges. Expect live coding, pair-programming, and whiteboard/system-design sketches. To prepare efficiently, drill medium-to-hard algorithm problems with time limits, practice end-to-end system design sketches focused on capacity and reliability, and rehearse concise behavioral stories that show ownership and impact.
"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"
"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"
"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."
"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."
"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."
"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."
"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."
"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."
"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."
"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."
"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."
"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."
"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."
"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Find Largest Adjacent Sorted Difference
Given an unsorted array of integers nums, compute the largest difference between two consecutive elements after the array is sorted in ascending order...
Implement anagram check and odd-even linked list
You are given two independent coding tasks. Task 1: Check if two strings are anagrams Implement a function that determines whether two given strings a...
Count clusters covered by dashers
Count clusters covered by dashers You are given two m×n binary matrices of equal size: D for dasher availability and U for user presence. A cell value...
Determine if robot path is bounded
Determine if robot path is bounded A robot starts at (0, 0) facing North on an infinite grid. It executes a string s consisting of 'G' (move forward 1...
Describe deadline pressure, challenges, and decision changes
Describe deadline pressure, challenges, and decision changes Behavioral and Leadership Prompts — Software Engineer (Technical Screen) Answer the follo...
Design a meeting scheduler with cancellations
Design a meeting scheduler with cancellations System Design: Meeting Scheduling Platform (Onsite) Context Design a multi-tenant meeting scheduling sys...
Process time intervals and detect overlaps/gaps
You are given n time intervals representing debug log segments. Each interval has a start time, an end time, and an associated text message. - Each in...
Maximize 1D deliveries within distance and minimize total distance
You are given positions on a 1D line: - people: an array of N integers (positions of people) - shops: an array of M integers (positions of milk-tea sh...
Find Path Between Fibonacci Tree Nodes
You are given a special family of binary trees called Fibonacci trees. Define the tree T(k) recursively: - T(1) is a single node. - T(2) is a single n...
Maximize coins collected by tokens jumping +3
You are given a single-player board game represented by a string board of length N (1 ≤ N ≤ 100). Each character is one of: - '.': empty cell - 'T': a...
Find missing value in sorted consecutive array
Given a sorted array nums of distinct integers. The numbers are supposed to form a consecutive sequence starting from some unknown integer start: - If...
Compute Nearest Destination Distances
You are given an m x n grid representing a city map. Each cell contains one of the following characters: - D: a destination - X: an obstacle - .: an o...
Compute minimum servers for cyclic tasks
You are given a list of tasks running on servers. Each task is represented as a pair (start, duration): - start is the start time in minutes from the ...
Find cheapest common ancestor in a tree
Coding You are given a rooted tree where each node has: - an integer price - a pointer to its parent (root has parent = null) - a list of children Giv...
Find smallest permutation under constraints
Given a non-negative integer n, consider its decimal digits as a multiset (digits can repeat). 1) Return the smallest possible integer that can be for...
Deep-dive a cross-team technical project you led
Pick one technically challenging project that required cross-team collaboration. Be prepared to go deep on: - Your role and what you personally owned ...
Implement Plurality and Runoff Voting
You are given a list of ballots for an election. Each ballot is an ordered list of distinct candidate names, from highest preference to lowest prefere...
Implement bitmap font render/compress/invert
Bitmap Character to Image Conversion (3 phases) You are given a bitmap lookup table (a dictionary/map) that represents a tiny “font”. - Key: a charact...
Implement a debounce function
Problem: Implement debounce(fn, wait) Implement a debounce utility function. Behavior Given a function fn and a delay wait (milliseconds), debounce(fn...
Find shortest relationship path using BFS
Problem You are given a set of pairwise relationships between entities (people/services/etc.). Treat each relationship as an undirected edge in a grap...