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."
Solve server updates and grid inconvenience minimization
1) You are given an integer array server of length n, where server[i] is the number of requests the i-th server can process. Over multiple days, you r...
Solve three DSA problems: trie, window, intervals
1) Design and implement an autocomplete service. Support insert(word) to add a word and suggest(prefix) to return up to five existing words that start...
Solve Three Coding Interview Problems
This set of problems evaluates competency in algorithmic problem-solving, including merging sorted arrays with duplicate elimination, reasoning about ...
Compute Top-K word frequencies under a path
Compute Top-K word frequencies under a path Given a filesystem path that may contain nested subdirectories and files, compute the top K most frequent ...
Find Top K Largest Elements
This question evaluates a candidate's skill in algorithmic selection and data-structure usage for extracting top-k elements from large arrays, emphasi...
Implement Layer History and Grid Counting
This question evaluates a candidate's proficiency in mutable state management and reversible operations through implementing an undo/redo layer editor...
Remove Target Values from a Linked List
Given the head of a singly linked list and an integer target, remove every node whose value equals target and return the new head of the list. The tar...
Implement weighted-eviction cache
Question Design and implement a weighted cache supporting get(key) and put(key, value, weight) operations. The cache has a total weight limit; when in...
Maximize Value Under a Budget
This question evaluates combinatorial optimization and algorithm design skills for resource-constrained selection problems, focusing on concepts exemp...
Solve Tree Diameter and Palindromic Counts
This two-problem prompt evaluates proficiency in tree algorithms and recursion for computing longest paths in binary trees, along with string processi...
Implement FizzBuzz
This question evaluates basic programming and algorithmic reasoning, including control flow, modular arithmetic, string handling, and the ability to a...
Can You Place N Objects?
This question evaluates array traversal, adjacency-constraint reasoning, and greedy placement intuition, emphasizing handling of boundary conditions a...
Find the Best Connected Strength for Every Tree Node
Find the Best Connected Strength for Every Tree Node A tree contains n neurons. Each neuron is either strong or weak. Assign weight +1 to a strong neu...
Count Target-Sum Paths in an N-ary Tree
This question evaluates a candidate's competency in tree data structures and traversal algorithms, specifically counting path sums in N-ary trees and ...
Minimize Operations to Balance Shipments
A shop has n item types, where quantity[i] is the positive integer quantity of the i-th item type. The item types must be shipped in two non-empty con...
Design transactional in-memory key-value store
Problem Design and implement an in-memory key–value store that supports basic operations plus transactions. Core API Implement the following operation...
Simulate Monster Team Battles
This question evaluates a candidate's ability to model stateful simulations and implement deterministic battle mechanics with clean data structures an...
Count Connected Components in an Undirected Graph
This question evaluates understanding of graph connectivity and cycle detection, measuring competency in reasoning about connected components and the ...
Find k-th recipient in command propagation order
Chain of Command (k-th Receiver in DFS-by-Child-Id Order) A company org chart forms a rooted tree with n people (nodes), labeled 1..n. You are given a...
Explain C++ vector, unordered_map, and virtual functions
Explain C++ vector, unordered_map, and virtual functions In C++, explain: - The amortized and worst-case time complexity of vector::push_back, and how...