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."
Design a text editor with undo/redo
Design and implement a text document editor that maintains a single string of content and supports undo/redo of edits. Model each edit using the Comma...
Compute max events in any 60-second window
Design a function that, given a non-decreasing list of integer timestamps (seconds), returns the maximum number of events occurring within any contigu...
Solve set equality and ad log top‑K
Problem Set (Coding) 1) Check whether two sets are equal You are given two integer arrays A and B that represent sets, except they may contain duplica...
Find users with at least one valid session
You are given: - A list of log entries logs, where each entry is a string in the format: ` "userId action timestamp" ` - userId is a non...
Compute Balances and Minimize Settlements
This question evaluates transactional data aggregation and net-balance computation skills alongside combinatorial optimization for minimizing settleme...
Solve Tree Views, Columns, and Calculator
This multi-part question evaluates skills in binary tree traversal and view extraction, vertical column grouping and ordering of tree nodes, and parsi...
Implement an LRU cache
This question evaluates competency in designing efficient key-value caching mechanisms, enforcing capacity constraints and eviction policies while mai...
Design a subscription email scheduler with changes and renewals
Implement an email notification scheduler for subscription accounts. Inputs: - send_schedule: a mapping whose keys include: • "start": label to send...
Design a referral leaderboard with chain-based counts
Design and implement a function that generates a referral leaderboard for a platform, given two equal-length arrays rh_users and new_users representin...
Implement a sliding-window rate limiter
Problem Design and implement an in-memory rate limiter using a sliding time window. You are given a stream of requests. Each request has: - key (e.g.,...
Count Referral Descendants
You are building a referral analytics feature. Each referral relationship is represented as a directed pair (referrer, referredUser), meaning referrer...
Solve classic backend coding problems
This multi-part question evaluates algorithmic problem solving and implementation skills, including string parsing and segmentation, combinatorial rea...
Implement merge sort and largest 1-rectangle
The coding round included two algorithm questions: 1. Implement merge sort for an array of integers. Return the sorted array and explain its time and ...
Implement XML tokenizer and parser with operations
Implement XML tokenizer and parser with operations You are given either (a) a raw XML-like string such as <catalog><book><author>Gambardella, Matthew<...
Design a CreditTracker with expirations
Design a CreditTracker class with three methods: ( 1) add_credit(start_time, end_time, credit), ( 2) subtract_credit(time, credit), and ( 3) check_cre...
Design an IR for test workflows
Design an IR for test workflows Design an intermediate representation (IR) for a graphics testing workflow as a DAG. Define node/edge types, metadata,...
Serialize Expression Tree Minimizing Parentheses
This question evaluates proficiency with binary expression trees, operator precedence and associativity, and the ability to serialize an abstract synt...
Implement an Integer Hash Map
Design a data structure MyHashMap that stores integer keys and integer values without using any built-in hash table library. Implement the following o...
Find largest subset sharing a common digit
You are given an array nums of length N (1 ≤ N ≤ 100). Every element is a two-digit integer between 10 and 99 (inclusive). Select as many elements as ...
Explain AtomicInteger and ABA problem
Explain AtomicInteger and ABA problem How does AtomicInteger implement atomic updates (e.g., via CAS using Unsafe or VarHandles)? What is the ABA prob...