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."
Return the Lexicographically Smallest Two-Sum Index Pair
Return the Lexicographically Smallest Two-Sum Index Pair Problem Implement twoSumSmallestPair(nums, target) -> pair. Return the lexicographically smal...
Compare Complete and Partial Poker Hands
This question evaluates algorithmic problem-solving, combinatorial reasoning about incomplete information, and the ability to encode domain-specific r...
Find K Nearest Points
This question evaluates proficiency with Euclidean distance metrics, selection algorithms, and efficient data structures for partial sorting, while re...
Optimize assembly-line scheduling with changeovers
You are scheduling a simplified car-assembly line with two parallel stations S1 and S2. Each job must be processed on exactly one station, processing ...
Fix failing tests and refactor code
You're given a small Python repo. After creating and activating a clean virtual environment, installing requirements, and running "pytest -q", two tes...
Implement a Dependency-Aware Task Scheduler
Implement a TaskManager class with two methods: - AddTasks(tasks): add one or more tasks into the system. - ConsumeTask(): return and remove the execu...
Design an elevator control system
Design the software for a multi-elevator control system in a high-rise building. Specify classes, scheduling algorithms for car assignments, handling ...
Implement menu parser and serializer
Menu parser and serializer You are given a restaurant menu stored as plain text, where indentation represents a hierarchy of categories and items. Imp...
Assign Meetings and Find the Most-Used Room
Assign Meetings and Find the Most-Used Room There are n rooms numbered from 0 through n - 1 and meetings [start, end] with distinct start times. Proce...
Return the Most Frequent Values in an Array
Given a non-empty integer array, return the k values that appear most frequently. Ties are broken by smaller value first. Implement: `python def top_k...
Drone Circular Route — Minimum Total Travel Cost
This question tests a candidate's ability to apply dynamic programming to combinatorial optimization, specifically the Traveling Salesman Problem (TSP...
Generate all strings by expanding wildcards
Problem Given a string s consisting only of characters '0', '1', and '', replace every '' with either '0' or '1' and return all possible resulting bin...
Render Overlapping Rectangles on an ASCII Canvas
Render Overlapping Rectangles on an ASCII Canvas Implement render_canvas(width, height, rectangles). The canvas initially contains spaces and is retur...
Implement concurrent structures and debug queue code
The coding rounds covered several implementation and debugging tasks: 1. Implement an LRU cache that supports get(key) and put(key, value) in constant...
Count Complete Tic-Tac-Toe Game Sequences
Count Complete Tic-Tac-Toe Game Sequences Two players play on a standard 3 x 3 board. X moves first and the players alternate. A game ends immediately...
Find a Maximum-Sum Window in a Sparse Array
Find a Maximum-Sum Window in a Sparse Array An integer array is represented by constant-value segments instead of individual elements. Each segment [s...
Product of Array Except Self Without Division
Product of Array Except Self Without Division Given an integer array, return an array in which output[i] is the product of every input element except ...
Implement IPv4 iterators and CIDR expansion
Problem: IPv4 Iterators and CIDR Expansion You are implementing utilities to iterate over IPv4 addresses. An IPv4 address is in dotted-decimal form: A...
Minimum Moves on a Grid with k-Cell Jumps
You are given an m x n grid. Each cell is either open or blocked: - grid[i][j] = 0 means the cell is open. - grid[i][j] = 1 means the cell is blocked....
Solve listed algorithm problems
This set of problems evaluates algorithmic problem-solving skills across selection and order-statistics, graph algorithms and traversals, connected-co...