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."
Compute minimum added stones to balance a tree
This question evaluates competency in tree algorithms, subtree aggregation, and integer resource balancing by requiring reasoning about hierarchical s...
Find Conflicting Events
This question evaluates algorithmic problem-solving in coding and algorithms, focusing on grouping, sorting, and sliding-window techniques applied to ...
Kth Largest Perfect Binary Subtree
This question evaluates a candidate's ability to combine tree traversal with structural validation, requiring recognition of perfect binary subtrees a...
Search Book Titles
You are given a list of book titles and a user query string. Return all titles that are relevant to the query. A title is considered relevant if any t...
Rearrange array to maximize positive prefix sums
This question evaluates array manipulation, prefix-sum reasoning, and greedy/combinatorial optimization skills for maximizing a permutation-based metr...
Design top-K tracker with linked lists
Design top-K tracker with linked lists Design a data structure that tracks the top-K most frequent keys in a stream. Support operations increment(key)...
Extend a Maze Solver
You are given an existing codebase for a maze game and solver. The maze is represented as a 2D grid containing: - S: start cell - T: target cell - .: ...
Find Any Local Minimum with Iterative Binary Search
Find Any Local Minimum with Iterative Binary Search Given a nonempty integer array numbers, return the index of any local minimum. An index i is a loc...
Implement an ASCII Art Printer
Implement an ASCII art printer. A font defines each supported character as a glyph with the same height. A glyph is a list of equal-length text rows. ...
Encode and Rebuild a Binary Tree
Design two functions for a binary tree: - encode(root) -> string - decode(data) -> root Each tree node contains an integer value and has up to two chi...
Implement streaming RLE and bit-packed codec
You are implementing a simple compression scheme for sequences of 32‑bit signed integers. The codec should support two encoding strategies: 1. Run‑Len...
Implement Top-p (Nucleus) Sampling in NumPy
This coding question tests practical implementation of top-p (nucleus) sampling, a core decoding strategy in large language models. It evaluates NumPy...
Compute total wages and partial-hour payments
You are given a list of workers. Each worker has: - id (string) - hourly_rate (non-negative number) - one work shift for a given day: start_time, end_...
Implement a type-based mutex for tasks
This question evaluates understanding of concurrency and synchronization primitives, testing the ability to design a thread-safe type-based mutex that...
Implement Server Number Allocation
This question evaluates the ability to design efficient stateful data structures and algorithms for resource allocation, focusing on management of per...
Find the Kth Largest in Two Sorted Arrays
You are given two arrays sorted in ascending order and an integer k. Return the kth largest element among all elements from both arrays combined. Coun...
Approximate Pi from Random Points
This question evaluates a candidate's ability to implement array-processing logic and apply probabilistic numerical methods, combining basic geometric...
Process exchange prints, volume checks, and client orders
This question evaluates a candidate's ability to implement real-time stream processing, sliding-window aggregation for time-based volume calculations,...
Design a menu manager with enums
Design and implement a console-based restaurant menu management program. Requirements: ( 1) There are exactly three fixed item categories represented ...
Differentiate Java final, finalize, finally
Differentiate Java's final, finalize, and finally. Define what final means for variables, methods, and classes and give examples; explain what finaliz...