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."
Find Top Errors in Time Window
This question evaluates the ability to parse JSON logs, apply time-window filtering with inclusive/exclusive boundaries, aggregate error frequencies, ...
Solve Bracket Matching and Tree Width
This composite question evaluates proficiency with core data structures and algorithmic reasoning, covering string-based bracket validation (sequence ...
Group Photos and Sort Feed Items
This question evaluates proficiency in list/sequence transformation, detecting consecutive runs, grouping elements, aggregating attributes, and perfor...
Determine if all courses can be completed
This question evaluates graph-theoretic dependency modeling and cycle-detection competency, measuring the ability to represent course prerequisites as...
Implement Event Filtering and Queue Routing
This question evaluates parsing and evaluation of domain-specific filter expressions, JSON traversal and type-aware comparisons, boolean logic handlin...
Implement Employee Management and Expression Evaluation
This question evaluates competency in designing and maintaining hierarchical data structures and in parsing and evaluating nested function-style arith...
Implement an Arithmetic Expression Evaluator
This question evaluates expression parsing, operator precedence, tokenization, integer arithmetic semantics (including truncation), and handling of ne...
Implement Dependency-Aware To-Do List
This question evaluates the ability to design in-memory data structures and algorithms for representing tasks with directed dependencies, manage state...
Maximize Throughput and Count Trigger Components
This question evaluates proficiency in algorithmic optimization under resource constraints (maximizing pipeline throughput within a budget) and in mod...
Analyze Reports in a Nested Org Chart
Analyze a nested organization chart and classify every employee as an individual contributor or manager. Compute direct and total descendant counts in...
Solve Stack and String Shift Problems
This two-part question evaluates proficiency with core data structures and string/array algorithms—specifically stack-based delimiter matching and cum...
Count Pairs with the Minimum Absolute Difference
Count unordered index pairs whose values have the minimum absolute difference in an integer array. Sorting reveals the minimum gap, while duplicate ru...
Traverse an HTTP Maze with Retry Handling
Traverse a simulated HTTP maze with breadth-first search to return the shortest route from a start URL to an exit. Handle links, malformed input, succ...
Implement Refactoring Assessment Features
This question evaluates proficiency in implementing spec-driven algorithms and data structures in Java, covering route reconstruction (directed graph/...
Solve Two Robbery Optimization Variants
This question evaluates competence in dynamic programming for linear optimization and recursion/tree DP for hierarchical structures, as well as the ab...
Solve Matrix Traversal and Pair Sum
This question evaluates proficiency in array and matrix manipulation, including spiral traversal with boundary and edge-case handling, index managemen...
Minimize Circular Redistribution Cost
This question evaluates algorithmic problem-solving skills in array manipulation, circular data structures, load balancing, and cost optimization whil...
Implement a Snapshot Set Iterator
This question evaluates data structure design, versioning, and iterator consistency concepts within the Coding & Algorithms domain, focusing on implem...
Implement an In-Memory Query Engine
This question evaluates skills in data modeling, API design, algorithmic filtering, and implementation of an in-memory query execution engine, includi...
Find LCA With Parent Pointers
This question evaluates understanding of tree data structures and ancestor relationships, focusing on lowest common ancestor reasoning with parent poi...