Coding & Algorithms Interview Questions
Practice 3,429 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."
Count Connected Clusters of Two-Dimensional Points
Count Connected Clusters of Two-Dimensional Points Problem Implement count_clusters(points, radius). points is a list of two-dimensional integer coord...
Determine All Players with Fixed Rankings
Determine All Players with Fixed Rankings There are N players and directed match results. A pair [a, b] means player a defeated player b. Results are ...
Return the Lexicographically Smallest Topological Order
Return the Lexicographically Smallest Topological Order Problem Implement topologicalOrder(nodeCount, edges) -> order. The directed graph contains nod...
Build a Constant-Time Snapshot Set Iterator
Build a Constant-Time Snapshot Set Iterator Design SnapshotSet, a set of integers whose iterators observe an immutable logical snapshot without copyin...
Count Completed Jobs in a Serial Single-Worker Pipeline
Count Completed Jobs in a Serial Single-Worker Pipeline An automation pipeline contains stages that execute in order. Each stage is represented as [nu...
Find the K Closest Pairs in a Sorted Array
Implement k_closest_pairs(nums, k) for a strictly increasing sorted array. Consider every pair of indices (i, j) with i < j. Its distance is nums[j] -...
Maintain an Escape-Room Leaderboard
Design and implement an EscapeRoomGame for a fixed set of players and rooms 0 through R. - advance(player_id) moves that player forward by one room in...
Determine Whether an Undirected Graph Is Two-Colorable
Determine Whether an Undirected Graph Is Two-Colorable Given an undirected graph with nodes labeled 0 through n - 1, determine whether every node can ...
Resolve Dependent Addition Equations
Resolve Dependent Addition Equations Problem Implement resolveEquations(equations) -> output. Each input string defines one variable as a sum of nonne...
Count Words in Lexicographic Order
Count Words in Lexicographic Order Implement word_counts(words) for a list of lowercase words. Return a list of (word, count) pairs sorted in ascendin...
Implement Multi-Player Tic-Tac-Toe
Implement Multi-Player Tic-Tac-Toe Implement a game class for an N by N board and K players. Each player has a distinct one-character printable mark. ...
Simulate Constant-Time Random Courier Selection
Simulate Constant-Time Random Courier Selection Problem Implement simulate_random_picker(operations, random_values). The picker maintains a changing s...
Add Dramatic Punctuation to Text
Add Dramatic Punctuation to Text Implement add_drama(text). Preserve all whitespace exactly. For each maximal non-whitespace token, first replace ever...
Minimize Fuel Cost Across Cities
Minimize Fuel Cost Across Cities Problem Hackerland has g_nodes cities numbered from 1 through g_nodes and bidirectional roads. Road i connects g_from...
Evaluate Dependent Variable Assignments
Evaluate Dependent Variable Assignments Problem Implement evaluate_assignments(expressions). Each input string assigns one variable to a sum of intege...
Count Grid Paths Without Three Consecutive Moves
Count Paths Without Three Consecutive Moves A frog starts at (0, 0) and must reach (right_steps, up_steps). Every move is exactly one unit right (R) o...
Search a Pattern Across the Leaf Text of a Binary Tree
Search for a pattern across the left-to-right concatenation of binary-tree leaf strings, including matches that cross leaf boundaries. This algorithm ...
Maximize Revenue With Two Contiguous Delivery Routes
Problem Houses lie in a line. values[i] is the nonnegative payment for delivering to house i. Two delivery robots are available. Robot one can serve a...
Schedule GPU Pods and Drain a Node
Problem Implement schedule_gpu_nodes(nodes, request_gpus, delete_name). Each node is {name, gpus, running_pods} and each pod is {name, required_gpus}....
Sort Every Concentric Matrix Border Clockwise
Sort Every Concentric Matrix Border Clockwise Given a nonempty rectangular integer matrix, process each concentric layer independently. For a layer, l...