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."
Determine if chasing points will meet
You are given N points in 2D, indexed 0..N-1, forming a cycle. - At time t = 0, point i is at coordinates (xi, yi). - All points move simultaneously a...
Implement feedback for word guessing game
You are implementing the core logic for a simple word-guessing game. There is: - A dictionary of valid words: a list of distinct lowercase strings, al...
Solve LeetCode stack and tree problems
Question LeetCode 1249. Minimum Remove to Make Valid Parentheses LeetCode 863. All Nodes Distance K in Binary Tree https://leetcode.com/problems/minim...
Remove elements to avoid k-prefix duplicates
Question Given two lists listA and listB and an integer k, delete elements from listB so that the first k elements of the new listB share no value wit...
Compute sliding window sums by tag
Question Given a list of datapoints where each datapoint has tags, a timestamp, and a value, write a function that, for a specified tag t and window s...
Design LRU cache and pick k closest points
Design LRU cache and pick k closest points 1) Design a fixed-capacity in-memory cache that evicts the least recently used key when full. Support get(k...
Implement Journey Counter and Speeder Detector
This question evaluates parsing, time-series processing, and algorithmic reasoning for detecting complete journeys and speed violations from structure...
Find Shortest Knight Path
This question evaluates a candidate's ability to model grid-based movement as a graph and apply shortest-path traversal techniques, testing algorithmi...
Solve array-sum and city-community problems
This question evaluates array-processing and grid/graph connectivity skills, covering counting subarrays with a target sum and identifying connected b...
Compute nearest-exit distances in a grid
Compute nearest-exit distances in a grid You are given a 2D grid representing a building floor with three cell types: -1 for walls, 0 for exits, and a...
Find next greater element for subset
You are given two integer arrays query and nums. - All elements in nums are distinct. - Every element in query also appears in nums. For each value x ...
Implement K-Means and Explain Convergence
Implement K-means clustering in Python and explain convergence. Covers assignment and update steps, stopping criteria, empty clusters, objective funct...
Compute Variance from a Python List
Given a Python list of numeric values, write a function to compute the variance without using external libraries such as NumPy or pandas. Clarify any ...
Implement Euclidean distance and k-nearest neighbors
You are working with points in an n-dimensional Euclidean space, where each point is represented as a list (or array) of numeric coordinates. Assume: ...
Compute minimum-cost service cover
You are given: ( 1) a list of rental service packages, where each package contains a set of services (strings) and a non-negative price, e.g., [(["wif...
Simulate pouring water onto a 1D terrain
You are given a 1D terrain represented by an integer array heights, where heights[i] is the height of the column at index i. Part 1 — Render terrain W...
Build a validated add-sub calculator
Given a string expression, write a function that validates and evaluates it. The expression represents arithmetic using only non-negative integers and...
Generate uniform 0–6 from biased coin
You are given a function: - int getRandom01Biased() returns 0 with probability p and 1 with probability 1-p, where p is unknown and may be any value i...
Simulate robot moves on a grid
You are given an m x n grid and a robot that starts at position (r, c) (0-indexed). You are also given a string commands consisting of characters 'U',...
Evaluate IP Access Rules
You are given a list of IPv4 access-control rules. Each rule consists of: - an action: allow or deny - a CIDR block such as 192.168.0.0/16 You are als...