Software Engineer Interview Questions
Practice 5,054 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."
Solve grid shortest path and robot cleaning
Question LeetCode 1091. Shortest Path in Binary Matrix; LeetCode 489. Robot Room Cleaner https://leetcode.com/problems/shortest-path-in-binary-matrix/...
Verify and modify inorder subsequence
Question Given a binary tree and a sequence of numbers, design an algorithm to check in O(n) time and O( 1) extra space whether the sequence is a subs...
Convert integer to NAF form
Question Convert a given integer into its Non-Adjacent Form (NAF) representation such that no two non-zero digits are adjacent, and prove that the res...
Remove duplicates in linked list
Question Given a linked list, remove all duplicate values so that each value appears only once. Provide solutions for both sorted and unsorted linked ...
Compute max-ons and deletion indices
Question Given a circular array of n computers represented by 0 (off) and 1 (on), determine the maximum possible number of on computers within any con...
Expand algebraic expression with distribution
Question Given an expression of lowercase letters, '+', '', and parentheses with no '+' outside any parentheses, return an equivalent expression conta...
Solve weighted pick and product except self
Question LeetCode 528. Random Pick with Weight LeetCode 238. Product of Array Except Self https://leetcode.com/problems/random-pick-with-weight/descri...
Solve non-repeating show substring
Question LeetCode 3. Longest Substring Without Repeating Characters – variant where the elements are show names instead of numbers. https://leetcode.c...
Compute balances and array queries
Question Given a list of transactions where each transaction has a userId and an amount (positive for credit, negative for debit), compute the final b...
Count uniques in sparse sorted array
Question A sorted array contains many duplicates but only a very small number of distinct values. Design an algorithm that counts how many unique numb...
Implement Connect Four game
Question Design and implement the Connect Four game board, player moves, and winner-detection logic. Discuss time/space complexity and possible follow...
Implement paginated, sortable dynamic table component
Implement paginated, sortable dynamic table component React Table Component: Pagination, Sorting, Dynamic Columns Context You are building a reusable ...
Count interval intersections
Question For a list of n segments, where each segment i has start[i] and end[i], compute for every segment the count of other segments that intersect ...
Implement test failure analytics APIs
Question Design a data structure that supports: log(testId, timestamp, status) — record the status ('pass'/'fail') of a test run; timestamps are stric...
Solve Open the Lock BFS
Question LeetCode 752. Open the Lock – Given an initial lock state "0000", a target combination, and a list of deadend combinations that cannot be use...
Minimize changes for k-periodic palindrome
Question Given a string currentPassword (length N) and an integer k (1 ≤ k < N, N ≤ 2·10^5, lowercase letters, N divisible by k), find the minimum num...
Parse Markdown Links Without Regex
Implement a function that converts simplified link syntax text into an HTML anchor tag <a href="url">text</a> across an entire input string. Constrain...
Design time-versioned KV without timestamp argument
Design a time-versioned key-value store that does not accept a timestamp argument on writes. Support set(key, value) which stores the value with an in...
Implement zigzag level-order traversal
Given the root of a binary tree, return the node values in zigzag level order: visit nodes level by level, reading the first level from left to right,...
Design robot path boundedness with repeats
You are given a 2D grid with a set of blocked cells (obstacles) and a robot starting at (0, 0) facing north. The robot executes a finite instruction s...