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."
Compute distinct sums from limited coins
You are given two integer arrays, denom[0..n-1] and count[0..n-1], where denom[i] > 0 is a coin denomination and count[i] >= 0 is the number of availa...
Implement BFS shortest paths with reconstruction
Given an unweighted graph with n vertices and m edges represented as an adjacency list, implement breadth-first search (BFS) from a source vertex s to...
Implement LRU cache with O(1) ops
Implement LRU cache with O(1) ops Design and implement a fixed-capacity cache supporting get(key) -> value and put(key, value) in O( 1) average time. ...
Compute courier pay with peak-hour rules
Implement compute_pay(deliveries) to calculate a delivery driver's daily pay from a list of delivery records. Each record may include times, miles, ba...
Implement distinct islands and sliding maxima
Implement distinct islands and sliding maxima 1) Given a binary grid where 1 represents land and 0 represents water, count how many distinct island sh...
Find users with access to all cameras
Given entities and relationships (user, owns, camera), (user, belongs_to, group), (group, owns, camera), and (group, belongs_to, group) where groups c...
Design Minesweeper and Optimize Click Performance
Design a Minesweeper game. At game start, initialize an m×n board by randomly placing k bombs. Implement: ( 1) printBoard(): return a human-readable s...
Weighted LRU Cache: Capacity Counted by Item Quantity
Design a variant of the classic least-recently-used (LRU) cache. In the classic version, the capacity limits the number of items stored. In this varia...
Compute binary tree diameter
Compute binary tree diameter Given the root of a binary tree, compute the tree's diameter defined as the maximum number of edges on any path between t...
Sort a string by custom order
Sort a string by custom order Given a priority string P of distinct characters and a text string S, reorder S so that all characters appearing in P co...
Check near-palindrome with one deletion
Check near-palindrome with one deletion Given a string s, determine whether it can become a palindrome after deleting at most one character. Return bo...
Determine reachability and minimum jumps
Determine reachability and minimum jumps Given an array of non-negative integers nums of length n, where nums[i] is the maximum number of steps you ca...
Parse logs and query by time
Implement a parser that converts raw log lines into structured records with fields {timestamp, level, message}. Build an API to support: (a) insert(lo...
Implement bank balance operations
Question Design and implement a Bank account class that supports the operations Deposit(amount), Withdraw(amount), and CashBack(percent). Ensure balan...
Solve tree, graph, sliding-window problems
Question LeetCode 103. Binary Tree Zigzag Level Order Traversal – given a binary tree root, return its zigzag level-order traversal. LeetCode 207. Cou...
Perform matrix Candy Crush elimination
Question Implement a function that, given an m × n integer matrix representing colored blocks (same integers = same color), performs one round of "Can...
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...
Solve string match and DashMart BFS
Question Implement a string-matching function that returns the first index of a pattern in a text (akin to LeetCode 28 Implement strStr()). 2) “Dash M...
Delete duplicate files via DFS
Question LeetCode 609. Find Duplicate File in System – Implement an algorithm (using DFS/backtracking) to delete files with duplicate content in a fil...
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...