Software Engineer Interview Questions
Practice 4,824 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."
Implement 64-bit modular exponentiation safely
Implement a function to compute (a^b) mod m where 0 ≤ a,b < 2^61−1 and 1 ≤ m < 2^61−1 using only 64-bit operations without overflow. Provide implement...
Design an Animal Chess OOP simulation
Design and implement a simplified Animal Chess (Dou Shou Qi) game using object-oriented principles. Include: 1) Piece classes Elephant, Lion, Tiger, L...
Describe a previous project and outcomes
Describe a previous project and outcomes Behavioral: End-to-End Project Deep Dive (Software Engineer — Technical Screen) Provide a 5–7 minute narrativ...
Compute shortest path to collect all keys
You are given an m×n grid containing walls (#), open cells (.), a single start cell (@), up to six keys labeled 'a'–'f', and matching doors 'A'–'F' th...
Implement island counting with BFS and DFS
Question You are given an m x n grid of characters where '1' represents land and '0' represents water. Count the number of distinct islands (connected...
Implement version string comparator with extensions
Implement a function compareVersions(a, b) that compares two software version strings. Each version consists of dot-separated numeric components (e.g....
Optimize file reads for password validation
Given a multi-gigabyte credentials file on disk with one record per line in the format user_id,salt,password_hash (hex), implement validate(user_id, p...
Parse and evaluate nested expressions with validation
Design and implement a parser/evaluator for a parenthesized expression language where the input string may be invalid. The language uses spaces as tok...
Compute and optimize average wait time
You are given n pickup orders for a grocery delivery counter. Each order i is described by orders[i] = [arrival_i, service_i] in minutes, where arriva...
Find substring from dictionary concatenation
Given a string s and a dictionary of words dict, determine whether s contains a substring that is exactly a concatenation of one or more words from di...
Implement Connect Four with win detection
Implement a Connect Four game engine. Support a general m×n board (default 6× 7) and a win condition of k in a row (default 4). Provide an API: Connec...
Find palindrome-forming string pairs
Given an array of distinct lowercase strings words, return all index pairs (i, j) with i != j such that the concatenation words[i] + words[j] is a pal...
Design duplicate-file detection using size
You are given a large POSIX-like filesystem containing millions of files across nested directories. Design an algorithm to find groups of duplicate fi...
Solve array and list algorithms
Question LeetCode 315. Count of Smaller Numbers After Self LeetCode 23. Merge k Sorted Lists Design algorithm for Amazon Locker getPackage (retrieve p...
Explain strings, moves, and concurrency
Question What is a string in programming languages? What fields are stored in a typical struct string and how would you implement one yourself? What i...
Minimize cost & recommend movies
Question Given arrays size[] and cost[] where size[i] is the size of the i-th product and cost[i] is the cost to increase size[i] by one unit, compute...
Implement right side view and local minimum search
Question LeetCode 199. Binary Tree Right Side View — Given the root of a binary tree, return the values of the nodes you can see ordered from top to b...
Solve vertical order & diameter variants
Question LeetCode 314. Binary Tree Vertical Order Traversal LeetCode 543. Diameter of Binary Tree – modified to return the number of nodes (edges + 1)...
Randomly partition array into k segments
Question Given a list of integers and an integer k representing the number of segments, write a function that randomly partitions the list into k non-...
Solve diverse LeetCode algorithm problems
Question LeetCode 695. Max Area of Island LeetCode 380. Insert Delete GetRandom O( 1) LeetCode 19. Remove Nth Node From End of List LeetCode 1004. Max...