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."
Find shortest subarray with ≥k distinct integers
This question evaluates understanding of array algorithms, handling of distinct-element counting, and the ability to design time- and space-efficient ...
Answer parity-alternation range queries
This question evaluates a candidate's ability to reason about array properties and design efficient range-query processing for alternating-parity suba...
Find median of merged RLE arrays
The question evaluates understanding of run-length encoding, order-statistics (median) computation, and efficient merging of frequency-annotated seque...
Compute top-N items from log stream
This question evaluates the ability to aggregate frequencies and compute top-N results from logs, covering competencies in frequency counting, top-k a...
Implement solutions to several coding tasks
This multipart prompt evaluates algorithmic problem-solving and data-structure design skills across several areas: finding a minimum in a rotated sort...
Solve counting and frequency coding tasks
This question evaluates algorithmic skills in counting, frequency analysis, constraint-based pair counting, and stream-oriented tokenization and ranki...
Compute shortest path in a 2D grid
Given an m x n grid where: - 0 represents an empty cell you can move through - 1 represents a blocked cell you cannot enter - movement is allowed in 4...
Generate all subsets (handle duplicates)
This question evaluates understanding of power-set generation and handling of duplicate elements, measuring competency in combinatorics, enumeration t...
Compute Fibonacci Numbers
Write a function that returns the nth Fibonacci number. Definitions and requirements: - Use zero-based indexing: fib(0) = 0, fib(1) = 1. - For n >= 2,...
Count Enclosed Islands in a Grid
This question evaluates grid traversal and graph concepts such as connected-component detection, boundary-condition reasoning, and algorithmic time/sp...
Check palindrome and find next larger palindrome
This question evaluates proficiency in string and numeric manipulation, specifically palindrome detection and generation of the next strictly larger n...
Maximize watch time under adjacency constraint
You are given a sequence of videos in a feed. - Input: - An integer array duration[1..n], where duration[i] is the length of video i in seconds. -...
Implement memcpy with misaligned addresses
This question evaluates a candidate's understanding of low-level memory manipulation, pointer alignment, and the implementation of efficient byte-copy...
Assign tasks to workers with types and accounts
This question evaluates algorithmic scheduling and dynamic resource-allocation skills, including priority-queue/heap usage, time-based simulation, and...
Implement a dictionary without built-in Dictionary
This question evaluates understanding of hash tables and low-level data-structure implementation, including hashing, collision resolution, resizing/re...
Determine a one-step string transformation
Given two lowercase strings source and target, determine whether target can be obtained from source using at most one of the following operations, and...
Design a stack with max removal
Design a stack-like data structure for integers that supports the following operations efficiently: - push(x): insert x onto the stack. - pop(): remov...
Print a binary tree as aligned text
Implement a function that prints (or returns) an ASCII layout of a binary tree. Requirements: - Each node has a string value (assume it contains no sp...
Find top-k lottery winners by spending
This question evaluates skills in selection and ordering of numeric-keyed records, covering concepts such as order statistics, deterministic tie-break...
Implement multiple coding round problems
This multi-part question evaluates algorithmic problem-solving skills including efficient lookup/search, stable ordering and priority management, stre...