Software Engineer Coding & Algorithms Interview Questions
Practice 2,712 real Coding & Algorithms interview questions for Software Engineer roles. From companies including Meta, Amazon, Google, Uber, Microsoft.

"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 autocomplete with top-K suggestions
Implement an autocomplete component that, given a history of query strings with frequencies, returns the top K suggestions for an input prefix in real...
Compute rooms and verify tree completeness
This question has two independent algorithm problems on a single calendar/tree theme. Treat each Part as a self-contained coding exercise: implement a...
Traverse binary tree by levels with constraints
Given a binary tree and a predicate P(node), perform a level-by-level traversal that collects, for each level, only the nodes whose values satisfy P. ...
Solve three DSA problems: trie, window, intervals
1) Design and implement an autocomplete service. Support insert(word) to add a word and suggest(prefix) to return up to five existing words that start...
Compare heap and stack memory
Compare heap and stack memory. Explain how each is allocated and freed, typical lifetimes of data stored there, access patterns and performance charac...
Check if all substrings are dictionary words
You are given a string s (letters only) and access to an English dictionary dict (a set of valid words). Return true if every contiguous substring of ...
Track Customer Referral Revenue
This question evaluates understanding of dynamic data structure design and algorithms for maintaining aggregated metrics over a referral tree, specifi...
Partition a Target String by Source Substrings
This question evaluates understanding of string algorithms and optimal partitioning, specifically substring matching and minimizing the number of cont...
Find K most frequent elements
This question evaluates a candidate's ability to implement efficient frequency counting and selection logic, demonstrating understanding of data struc...
Implement a balance tracker and interval merger
This screening contained two coding exercises. Part 1: Driver balance tracker You are building an in-memory ledger for a delivery platform. Each updat...
Compute dasher pay from order event logs
You are given a list of delivery-order event records for a single dasher. Each record contains: - order_id - event_type in {CREATED, ACCEPTED, PICKED_...
Find the Best Meeting Point on a Grid
Find the Best Meeting Point on a Grid You are given a rectangular grid containing buildings, empty land, and obstacles: - 1 is a building. - 0 is empt...
Implement Three Research Coding Tasks
This multi-part question evaluates skills in differentiable linear algebra and automatic differentiation safety, memory- and buffer-aware numerical im...
Minimize Branch Merge Conflicts
You are given several feature branches that must all be merged into the main branch. Each branch contains a sequence of commits, and each commit modif...
Implement Memory-Efficient Document Undo/Redo
This question evaluates data structure design and algorithmic reasoning for implementing memory-efficient undo/redo semantics on a key-value document,...
Design compressed vector and compute dot product
This question evaluates understanding of data structure design, sequence compression concepts (such as run-length patterns), and numeric algorithm eff...
Solve three algorithmic optimization and search problems
You are given three independent coding problems. --- Problem 1: Allocate tasks between two workers to maximize reward You have n independent tasks tha...
Count Islands After Land Additions
This question evaluates understanding of dynamic connectivity, incremental graph updates, and algorithmic efficiency when maintaining connected compon...
Build a Searchable Sentence Index
This question evaluates a candidate's ability to design and implement in-memory text indexes and related data structures, covering inverted indexing, ...
Check palindrome number and next palindrome
This question evaluates understanding of numeric and string manipulation along with algorithmic problem-solving for palindrome detection and generatio...