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."
Determine If One Binary Tree Is a Substructure of Another
This question evaluates practical tree traversal skills and the ability to implement structural matching between two binary trees. It tests recursive ...
Detect and Break a Cycle in a Singly Linked List
This question tests practical knowledge of linked list traversal and pointer manipulation, specifically the ability to detect and resolve cycles using...
Minimum Bills and Coins to Make Change
This question tests a candidate's grasp of greedy algorithms applied to a classic coin-change problem with fixed denominations. It evaluates practical...
Minimum Drone Delivery Time on a Ring of Hubs
This question tests a candidate's grasp of circular graph traversal and greedy distance minimization on ring-structured topologies. It evaluates algor...
Determine Whether a Word Exists in a Graph
This question evaluates proficiency in graph algorithms and backtracking techniques, including traversal strategies, cycle avoidance, and state manage...
Solve order-statistics and XOR-triplet problems
This multi-part question evaluates skills in order-statistics and efficient counting for array inversion-like problems, alongside bitwise manipulation...
Return the longest contiguous subarray with all distinct values
This question evaluates a candidate's understanding of array-processing algorithms, duplicate detection, and maintaining state to identify the longest...
Join tables to map userId to name
Problem You are given three tables represented as 2D string arrays (each row is a record, no headers). You need to produce a mapping from userId → cus...
Implement a single-producer multi-consumer ring buffer
Implement a fixed-capacity ring buffer in C++ for a setting with one producer and multiple consumers. Design a class that stores integers in a preallo...
Compute Top-K word frequencies under a path
Compute Top-K word frequencies under a path Given a filesystem path that may contain nested subdirectories and files, compute the top K most frequent ...
Evaluate an Arithmetic Expression
This question evaluates proficiency in parsing arithmetic expressions, handling unary and binary operators, parentheses, whitespace, numeric tokenizat...
Implement Checksums and Feature Rollout Evaluation
Complete the following two coding tasks in a 90-minute online assessment. An AI coding assistant may be available, but the submitted code must pass th...
Generate constrained NFT metadata
Generate constrained NFT metadata Given a set of trait types (e.g., background, eyes, hat), each with a list of allowed values, and a target count N, ...
Find valid split-stay listing combinations
You are building a feature that suggests a split stay: a guest stays in one home for the first part of a trip, then switches to a second home for the ...
Validate transactions with risk rules and reporting
This question evaluates skills in CSV parsing and input validation, numerical and timestamp parsing, rule-based fraud detection and behavioral feature...
Assign Reviewers from Changed Files
Write a Java program that helps automatically assign a code reviewer after a pull request is opened. You are given: 1. A local Git repository path. 2....
Implement a Coin-Constrained Jump Strategy
This question evaluates a candidate's ability to design a stateful decision-making strategy combining physics-based motion reasoning, resource-constra...
Count and Rank Words in a Paragraph
Count case-insensitive ASCII words in a paragraph and return deterministic frequency rankings. Tokenize maximal letter runs, normalize to lowercase, s...
Implement Composable Range Iterators
Implement an iterator library: range(start, end, step= 1) supporting forward/backward iteration, inclusive/exclusive endpoints, negative steps, and ov...
Design document layer with undo/redo
Design a document layer that supports applying edits and undo/redo. Implement apply(op) to mutate the document, undo() to revert the most recent commi...