Software Engineer Interview Questions
Practice 4,229 real Software Engineer interview questions for 2026 — real questions from actual interviews with detailed solutions to speed your interview preparation. This collection reflects what top tech firms like Meta, Amazon, Google, DoorDash, and TikTok typically evaluate: rigorous coding and algorithmic problem solving, increasing expectations for end-to-end system design (including GenAI/LLM design at some teams), clear complexity analysis, and reliable engineering judgment under constraints. Expect a multi-stage pipeline: recruiter screen, timed or asynchronous coding assessments, one-to-more live coding rounds focused on data structures and correctness, system-design conversations for mid and senior levels, and behavioral/hiring-manager interviews that probe ownership and collaboration. To prepare, prioritize patterned practice (timed mock interviews and implementation + optimization), learn scalable design frameworks, rehearse concise trade-off communication, and tailor examples to company signals like Amazon’s leadership lens or product/latency focus at delivery and media-driven teams. Consistent, feedback-driven practice that combines problem-solving speed, clean code, and measured design reasoning is the quickest path to offers.

"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 product of array except self
Problem Given an integer array nums of length n, return an array ans of length n where: - ans[i] = (nums[0] nums[1] ... nums[i-1] nums[i+1] ... ...
Compress vertices into uniques and indices
You are given an array of vertices (a 2D array). Each vertex may repeat. Implement a simple “compression” that produces: 1. unique_vertices: the list ...
Design a Top-K trending items service
Design a system that returns the Top K items (e.g., videos/posts/products) by popularity. Requirements - API to fetch: GET /topk?window=10m&k=100 retu...
Implement sliding-window rate limiter function
Problem You are implementing a per-user rate limiter. Time is discretized into integer time buckets (e.g., each bucket is 1 second). You are given two...
Design a scalable resume search system
Design a scalable resume search system System Design: Resume Search Platform Context A recruiting company needs a platform where applicants can upload...
Implement toy-language types and generic substitution
Problem: Toy Language Type System (Printing + Generic Resolution) You are implementing a small type system for a custom “Toy Language”. Types can be: ...
Solve two online assessment problems
An online assessment contained two coding problems: 1. Maximize skipped positions You are given an array of length n indexed from 0 to n - 1. Start...
Implement an In-Memory File System
Design an in-memory file system that supports file management, search, user ownership, capacity limits, copying, and compression. Each file has a uniq...
Optimize Autonomy Mapping Components
An autonomy team runs perception and state-estimation code on a resource-constrained embedded computer. Discuss both of the following technical review...
Explain RF/analog IC interview fundamentals
Explain RF/analog IC interview fundamentals You are interviewing for an RF/analog IC design role. Answer the following conceptual questions (no code r...
Determine Redeemable Promotion Offers
You are given predefined objects for promotion offers and user redemption events. A PromotionOffer has: - offer_id - start_time - end_time - max_redee...
Find Shortest Paths to Target Nodes
You are given a weighted directed graph representing distances between nodes. - There are n nodes labeled from 0 to n - 1. - edges[i] = [u, v, w] mean...
Design collaborative document editing backend
You are asked to design the backend for a real-time collaborative document editor similar to Google Docs. The interviewer is specifically interested i...
Propose and Validate a Mobile App Improvement
Assume you are working on a consumer mobile app. Propose one product improvement that could improve user engagement, retention, or conversion. Your an...
Design autocomplete and merchant bulk edits
System Design Prompts 1) Design search engine input suggestions (autocomplete) Design a system that provides real-time query suggestions as a user typ...
Describe common RTL lint warnings and errors
You are writing RTL (e.g., Verilog/SystemVerilog) and run a lint tool on your code. The tool reports items such as: - "Treat as black box" - Combinati...
Find minimum of unknown convex function
You are given access to an unknown univariate convex function \(f(x)\) defined on a closed interval \([L, R]\) on the real line. - You cannot see the ...
Find Smallest Common Row Value
You are given a 2D integer matrix where each row is sorted in strictly increasing order. Return the smallest integer that appears in every row. If no ...
Solve mixed coding tasks from interviews
Solve the following interview-style coding problems (you may choose any programming language unless specified). Provide correct logic and handle edge ...
Solve stock profit and vertical tree traversal
You have a 60-minute coding interview with two algorithm questions: 1) Max profit from one stock trade - Input: an integer array prices, where prices[...