Coding & Algorithms Interview Questions
Practice 3,469 real Coding & Algorithms interview questions for 2026. Covers companies like Meta, Amazon, Google, Uber, and Microsoft. Real questions from actual interviews with detailed solutions — ideal for focused interview preparation. Coding & Algorithms interview questions are the single most common technical gate for software engineering roles and are used to evaluate problem framing, algorithm selection, complexity trade-offs, correctness, edge-case reasoning, and clear communication under time pressure. Expect this category to appear in early technical screens and repeatedly across onsite loops at companies that weight it heavily (notably Meta, Google, and Amazon). Interviews will test arrays and strings, trees and graphs, dynamic programming, hashing and two‑pointer techniques, and the candidate’s ability to test and optimize code in a shared editor. Prepare with timed mock interviews, practice in the same editor you’ll use live, and build a progressive schedule that moves from fundamentals to medium/hard problems; typical candidates invest several weeks to a few months of focused practice depending on seniority and target company.
"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 Tree Columns And Maze Variants
This question evaluates tree traversal and column-based grouping skills along with grid-based graph search, state modeling, and handling dynamic maze ...
Implement Persistent KV Store Serialization
Implement a persistent in-memory key-value store. Requirements: - Keys and values are arbitrary byte strings or UTF-8 strings; do not rely on delimite...
Implement Prefix Match Filter
Design a data structure that stores a collection of prefix strings. Then, given a list of input strings, return every string that begins with at least...
Thread-Safe Stock Inventory: Buy and Sell Without Overselling
Thread-Safe Stock Inventory: Buy and Sell Without Overselling You are implementing the inventory-management core of a small brokerage service. The ser...
Implement logger and card ranking
This coding round contains two independent implementation tasks. Task A: Implement a configurable logger Implement a Logger component that accepts tex...
Solve 15 common Apple coding questions
The post summarizes high-frequency coding problems reported for Apple Software Engineer interviews. Practice the following algorithm and data-structur...
Maximize Boxes Stored Through One Entrance
This question evaluates array manipulation, constraint reasoning, and optimization skills, touching on greedy and combinatorial allocation concepts un...
Fix a Corrupted Bootloader Instruction
This question evaluates the ability to simulate instruction-level program execution, reason about control flow and mutable program state (instruction ...
Detect robot state after movements
Detect robot state after movements Implement an algorithm to determine whether a robot following a given set of movement instructions ends in a valid ...
Count anagram-based replacements per phrase
Problem You are given: - phrases: a list of strings, where each string is a phrase containing words separated by single spaces. - words: a list of str...
Minimize exact layover bookings
This question evaluates algorithmic problem-solving and numeric precision handling, specifically the ability to model exact-duration sums and minimize...
Design server allocation for multi-type nodes
Design a service to manage a large pool (about 100, 000) of server nodes. Each node can satisfy multiple instance types; clients call getServer(reqNum...
In-Memory Key-Value Store with Nested Transactions
This question evaluates a candidate's ability to design an in-memory data structure that supports layered, nested transactional state with commit and ...
Compute Remaining GPUs With Switching Limits
Suppose you manage n GPU clusters with fixed daily capacities capacity[i]. Each day starts fresh with the full capacity, because all GPUs are returned...
Find Minimum Processing Rate
This question evaluates algorithmic problem-solving skills, discrete mathematics involving integer division and ceiling operations, and complexity ana...
Return Top Department Suggestions
This question evaluates proficiency in prefix-based search and top-k ranking, familiarity with in-memory data structures and preprocessing strategies,...
Highest Salary Using Java Streams
This question tests a software engineer's practical proficiency with the Java Stream API, specifically the ability to perform aggregate operations on ...
Implement Expiring LRU Cache
Implement an in-memory key-value cache with least-recently-used eviction and per-entry expiration. The cache has a fixed positive capacity. Each inser...
Design a Versioned Social Follow Graph with Friend Recommendations
Design a Versioned Social Follow Graph with Friend Recommendations Build an in-memory service that maintains a directed follow graph between users and...
Find Shortest Square-Sum Path
This question evaluates algorithmic problem-solving skills with number-theoretic reasoning about perfect squares and the ability to reconstruct a mini...