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."
Consistent Hashing Ring with Virtual Nodes for Shard Rebalancing
This question evaluates a candidate's ability to design and implement a consistent hashing ring with virtual nodes for distributing keys across shards...
Find the Closest Candidate String by Edit Distance
Find the Closest Candidate String by Edit Distance Problem Implement closestCandidates(candidates, queries) -> results. The edit distance between two ...
Simulate room assignments for scheduled meetings
This question evaluates scheduling and event-simulation skills, including time-ordered processing, resource allocation with tie-breaking, and efficien...
Return Binary Search Tree Values in Ascending Order
Return Serialized BST Values in Ascending Order Implement ascendingBstValues(levelOrder) -> values. levelOrder is a JSON-compatible array containing s...
Solve Three Array and Matrix Path Problems
This set of three problems evaluates algorithm design, complexity analysis, and data-structure reasoning across matrix path traversal, interval covera...
Courier Delivery Cost Tracker
This question evaluates a candidate's ability to design a stateful, multi-part class that combines interval tracking with incremental balance accounti...
Collapsible Code Editor: Brace Matching and Toggle
This question tests stack-based parsing and stateful data structure design through a two-part brace-matching and collapsible editor problem. It evalua...
Filter Repeated Robot Status Messages
Filter Repeated Robot Status Messages Implement filter_messages(events) for a robot status stream. Each event is a pair [timestamp, message]. Return, ...
Solve two coding assessment tasks
The online assessment contained two coding problems: 1. Maximize store revenue You are given an integer array quantity of length n, where quantity[i...
Design a balloon stability tracker
Implement a class BalloonFestival to manage hot-air balloons and wind fields over time, and to report rewarded balloons at inspection times. Methods a...
Solve Five OA Coding Tasks
This is an online-assessment screen consisting of five independent coding tasks. Each task is self-contained — there is no shared state between them —...
Implement an interactive CLI class with tests
Design and implement a command-line interactive application as a single class using OOP principles. The program should support commands: add <key> <va...
Calculate Driver Payments
This question evaluates a candidate's ability to implement interval arithmetic and overlap computation, perform data deduplication and filtering, hand...
Find Unreachable Objects in a Heap Graph
Find Unreachable Objects in a Heap Graph Heap objects now contain references to other addresses. Each object is represented as [address, references], ...
Build a Local URL Shortener
Implement a local URL shortener that runs on a single machine. Design a small library or service with two core operations: - shorten(long_url) -> shor...
Collect Pins from Reachable Boards
Collect Pins from Reachable Boards The interview report names a board-and-pin coding problem whose intended approach was breadth-first search but does...
Find the Minimum Processing Rate to Meet a Deadline
Find the smallest integer processing rate that completes independent workloads before a deadline when unused hourly capacity cannot be shared. The pro...
Solve four algorithmic coding tasks
You are given four independent coding tasks. They may be solved in any order, and partial test-case credit is awarded for each task. The tasks are rou...
Solve three easy algorithm problems
You are given three independent algorithmic tasks. For each one, explain your approach (no need to run code). 1) Merge two sorted lists (integers inst...
Design a robot movement command system
Robot Movement (Pair Programming) You are given an empty starter repository (only a README). Implement a small, testable robot movement module that ca...