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."
Merge Multiple Sorted Arrays
This question evaluates a candidate's competency in array manipulation, merging techniques, and algorithmic complexity analysis, including handling ed...
Find Common Prefix Across Strings
This question evaluates proficiency in string manipulation and array processing, focusing on identifying common prefixes, handling edge cases such as ...
Implement a TTL LRU Cache
This question evaluates understanding of in-memory cache design, including per-entry TTL expiration, LRU eviction, and the data structure and complexi...
Count All-One Square Submatrices
This question evaluates dynamic programming, matrix traversal, and algorithmic optimization skills for identifying and counting structured patterns in...
Check Whether a String Is Built by Repetition
This question evaluates string manipulation and pattern recognition skills, focusing on detection of repeated substring patterns, string periodicity, ...
Implement an LFU Cache
This question evaluates understanding of algorithmic design and data structure management for cache eviction policies, focusing on frequency- and rece...
Minimize Boys Needed Beside Girls
This question evaluates string and array manipulation skills, the ability to model adjacency-based constraints, and optimization reasoning for minimiz...
Maximize a Product After a Shared XOR
Maximize a Product After a Shared XOR Given positive integers a and b and a bit width n, choose an integer x with 0 <= x < 2**n that maximizes: `text ...
Count Subsequences That Move Between Positions
Practice a Visa coding interview problem focused on count subsequences that move between positions. The prompt emphasizes edge cases, clean implementa...
Connect Points With Minimum Total Distance
This question evaluates a candidate's competency in graph modeling, geometric distance metrics, and algorithmic complexity analysis for optimizing tot...
Find the Unique Element in Pairs
This question evaluates a candidate's ability to design time- and space-efficient algorithms for sorted array problems, focusing on identifying a sing...
Determine Balloon Popping Time
This question evaluates understanding of grid-to-graph modeling, reachability and propagation dynamics, and handling heterogeneous spread times within...
Return the K Smallest Integers
Return the K Smallest Integers Given an unsorted list of integers and an integer k, return the k smallest values in ascending order. Preserve duplicat...
Determine Whether Two Integers Sum to a Target
Determine Whether Two Integers Sum to a Target Given a list of integers and a target integer, return whether two elements at distinct indices add up t...
Deduplicate an Array in Linear Time
This question evaluates a candidate's ability to implement linear-time deduplication of primitive arrays, understand hash-based membership tracking, a...
Find Earliest Column With One
This question evaluates algorithmic problem-solving and optimization skills for working with a row-wise sorted binary matrix accessed via an API, focu...
Solve Multiple Coding Interview Problems
This multi-part question evaluates skills in graph traversal and shortest-path reasoning (minimum transit routes), precise string and numeric manipula...
Solve a Key-Door Corridor Maze
This question evaluates graph search and state-space reasoning by requiring shortest-path computation in a constrained one-dimensional maze with colle...
Detect a Reachable Negative Cycle
Detect a Reachable Negative Cycle Given a directed weighted graph, determine whether a negative-weight cycle is reachable from a specified start verte...
Track the Median of a Stream
Track the Median of a Stream Design a data structure that accepts integers one at a time and returns the median of all values seen so far. The capture...