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."
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...
Define and compare smart pointers
What is a smart pointer? How do smart pointers manage ownership and lifetimes compared with raw pointers? Describe common types (unique, shared, weak)...
Count Ordered Sequences That Sum to a Target
Count Ordered Sequences That Sum to a Target Given a positive target n and a set of unique positive order sizes, count the distinct ordered sequences ...
Generate Data Labeling Schedules
A data labeling platform manages tasks, AI models, and human annotators. Each entity has a 1-indexed string ID. You are given four integers: totalTask...
Find hotel pairs to cover a split stay
You are implementing a simplified “split stay” feature. Problem You are given: - n hotels (or listings), indexed 0..n-1. - For each hotel i, an unsort...
Answer Repeated Lookup Queries Efficiently
Implement batched lookups over a sorted integer array, returning the first index of each queried value while preserving query order. Account for dupli...
In-Memory URL Shortener: Encode and Decode
This question evaluates a candidate's ability to design a class-based data structure with paired encode and decode operations that maintain a consiste...
Compare common data structures and uses
Compare common data structures and uses Compare common data structures and select appropriate ones for specific tasks. For arrays, linked lists, stack...
Merge two sorted lists
This question evaluates a candidate's competency in array manipulation and merging algorithms, emphasizing understanding of ordered data and time comp...
Build a Trust-Aware BIN Database
Build a Trust-Aware BIN Database Implement process_bin_operations(operations) for an in-memory database of card-number prefixes. A prefix identifies a...
Solve unique triplets summing to target
Solve unique triplets summing to target Implement a function that, given an integer array nums and an integer target T, returns all unique triplets [x...
Validate Nested Configuration Objects
You are given a set of custom descriptor objects that define the expected schema of a configuration object. Implement a validator that checks whether ...
Build a concurrent site crawler
Implement a small crawler in Python for a single target website. Requirements: - Input: a start URL, a maximum crawl depth, and an output CSV path. - ...
Solve common string/DP/stack problems
This set of four coding tasks evaluates proficiency in string algorithms, dynamic programming, sliding-window techniques, monotonic stack usage, and t...
Solve graph and linked list tasks
This question evaluates competencies in dependency graph modeling and reachability, shortest-path computation in weighted directed graphs, and space-e...
Parse code into operation triads IR
Problem: Operation-Triads Parsing (Mini Language) You are given a small, line-based programming language consisting of assignment statements and non-n...
Implement frequency + distance top‑K queries
You will implement solutions for two coding interview questions. Question 1: Return the top‑K points by frequency (with distance tie‑break) You are gi...
Implement spreadsheet cells with formulas
Design an in-memory spreadsheet that supports these operations on cells such as A1, B2, and ranges such as A1:B2: - Set(cell, value): assign an intege...
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...