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."
Reach a Target Using Each Number At Most Once
Reach a Target Using Each Number At Most Once You are given an array of integers nums and an integer target. Decide whether you can build an arithmeti...
Evaluate a Tokenized Arithmetic Expression
Evaluate a Tokenized Arithmetic Expression You are given an arithmetic expression that has already been tokenized for you — you do not need to write a...
Determine Whether One Point Can Reach Another
Determine Whether One Point Can Reach Another You start at a point (sx, sy) with positive integer coordinates. From (x, y), one move may transform the...
Count Substrings with No Repeated Characters
Count Substrings with No Repeated Characters Given a lowercase English string s, return the number of nonempty contiguous substrings whose characters ...
Find the K Closest Points to the Origin
Find the K Closest Points to the Origin Given points, a list of distinct integer coordinate pairs [x, y], and an integer k, return the k points closes...
Merge Two Sorted Arrays
Merge Two Sorted Arrays Given two integer arrays sorted in nondecreasing order, return a new array containing every value from both inputs in nondecre...
Remove All Adjacent Duplicate Pairs
Remove All Adjacent Duplicate Pairs Given a string s, repeatedly remove pairs of equal adjacent characters. A removal can make a new equal pair adjace...
Implement Adjacent-Line Uniq
Implement Adjacent-Line Uniq Implement the core behavior of the Unix-style uniq utility: combine consecutive equal lines into one run. The interview r...
Simulate a TTL Cache with LRU Eviction
Simulate a TTL Cache with LRU Eviction Implement a deterministic simulator for a cache that combines per-key expiration with a fixed-capacity least-re...
Build a Progressive Banking System
Build a Progressive Banking System The source reports progressive account, activity-ranking, expiring-transfer, and merge features but not exact retur...
Find Heap Objects Not Referenced by the Stack
Find Heap Objects Not Referenced by the Stack Each heap object has a unique integer address. In this first version, heap objects do not reference one ...
Group Strings By Anagram Signature
Given a list of strings, group the strings so that each group contains words that are anagrams of each other. Discuss both a sorting-based signature a...
Choose the Cheapest Round Trip
Choose the Cheapest Round Trip You are given two arrays of equal length. departure[i] is the cost of departing on day i, and return_cost[j] is the cos...
Solve Subset Sum And Return All Matching Subsets
Given an array of non-negative integers and a target, first determine whether any subset sums to the target using dynamic programming with O(target) s...
Summarize Transcript Events in a Sliding Window
Summarize Transcript Events in a Sliding Window Implement transcript_window_summaries(events, window_size). events is an arrival-ordered list of (user...
Report Where a Value Appears
Report Where a Value Appears Given a target and an even-length integer list, return four binary flags describing whether the target occurs: 1. at an e...
Remove Duplicate Integers While Preserving Order
Remove Duplicate Integers While Preserving Order Return the distinct integers from an input list in the order of their first appearance. Function Sign...
Compute a Point Set's Bounding Rectangle
Compute a Point Set's Bounding Rectangle Given two-dimensional integer points, return the smallest axis-aligned rectangle containing every point. Repr...
Find Two-Word Compound Words
Given a list of unique lowercase words, return every word that can be formed by concatenating exactly two other words from the same list. For each com...
Implement Regular Expression Matching
Implement Regular Expression Matching Determine whether an entire input string matches a pattern containing lowercase letters and two special symbols:...