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."
Add Consecutive-Value Bonuses to Grid Paths
Extend the maximum-score grid path with bonuses for equal adjacent values and strictly increasing triples of visited cells. Dynamic programming must r...
Merge Two Sorted Lists
This question evaluates proficiency with linked list data structures, pointer manipulation, in-place merging of sorted sequences, and general algorith...
Find LCA in organization tree
Find LCA in organization tree Given an organizational hierarchy tree, return the lowest common organization (parent node) for two or more employees (≥...
Implement an in-memory DB with TTL backup/restore
This question evaluates implementation and reasoning skills for an in-memory nested key→field→value store with TTL-based expirations, snapshot backup/...
Solve common interview coding problems
This set evaluates algorithmic problem-solving, data structure selection, and time/space complexity analysis across common patterns such as maximum su...
Produce valid student lineup from parent array
This question evaluates understanding of rooted tree hierarchies, parent-before-child ordering constraints, and lexicographic minimality when construc...
Implement toy-language types and generic substitution
Problem: Toy Language Type System (Printing + Generic Resolution) You are implementing a small type system for a custom “Toy Language”. Types can be: ...
Solve Several Algorithm Problems
This collection evaluates proficiency in string processing (longest palindromic substrings), graph connectivity and union‑find style concepts for 2D p...
Find gaps between intervals
You are given a list of integer intervals intervals, where each interval is represented as [start, end] (inclusive), and start <= end. Two intervals m...
Implement polynomial multiplication API in C
This question evaluates proficiency in C programming, API design, low-level data representation for polynomials, and algorithmic competence in perform...
Compute point-to-segment minimum distance
This question evaluates understanding of computational geometry and numerical robustness, testing the ability to compute Euclidean distances between a...
Answer static and streaming Top-K queries
Top-K in static and streaming settings (3 variants) You are given integers and asked to answer Top-K queries under three different scenarios. Variant ...
First Non-Repeating Character in a String
This question evaluates a candidate's ability to work with hash maps and character frequency counting in string processing. It tests practical coding ...
Streaming Points: Remove Any Pair Within a Distance
This question evaluates practical use of ordered data structures for streaming input with proximity-based removal logic. It tests balanced BST or sort...
Find Maximum Candies With Two Types
You are given a row of candies represented by an array candies, where candies[i] is the type of the candy at position i. You may choose any starting p...
Build an Account Transfer Ledger
This question evaluates the ability to implement transaction processing, state management, validation of transfers (including rejects and platform len...
Implement Concurrent Utilities in C++
This question evaluates proficiency in C++ concurrency and generic programming, specifically multithreaded parallel execution, synchronization primiti...
Build a BFS Web Crawler
Implement a web crawler for a single website. You are given: - A starting URL startUrl - A function fetch(url) that returns the HTML content of a page...
Design a Workspace Resource Manager
This question tests a candidate's ability to design and implement a tree-structured data model with efficient CRUD operations in memory. It evaluates ...
Solve three OA coding questions
You are given a 90-minute online assessment containing three coding questions. Implement solutions for all questions. --- Question 1: Group strings th...