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."
Implement an In-Memory File System
Implement an In-Memory File System The source reports an in-memory file-system exercise but not its exact error serialization or current-directory rem...
Compute Jaccard Similarity for Lists
Implement a Python function to compute the Jaccard similarity between two lists of strings. `python def jaccard_similarity(a: list[str], b: list[str])...
Implement a Worker Hours Register
This question evaluates data structures and algorithms skills for temporal event tracking, interval arithmetic, stateful session management, ranking, ...
Evaluate an arithmetic expression
This question evaluates parsing and expression-evaluation skills, specifically handling operator precedence, integer division truncation, multi-digit ...
Process document edit events
Implement a line-based document editor. You are given: - an initial document represented as an array of strings, where each string is one line - a lis...
Recommend top-K movies from similarity graph
Movie Recommendation: Top K You are building a simple movie recommendation feature. Input - A set of movies 0..(M-1). - An undirected similarity graph...
Implement plurality and majority voting
You are given an array votes of length n, where each element is a candidate identifier (string or integer). Implement two voting systems: 1) Plurality...
Implement an in-memory SQL-like table
Problem Implement a simple in-memory database for one table. All values are strings. Each row is identified by a rowKey (string). Each row contains co...
Implement credit ledger with out-of-order timestamps
Problem You are implementing a GPU credit ledger that supports adding credits, charging credits, and querying balances. Requests can arrive in any tim...
Maximize profit from non-overlapping jobs
You are given up to N = 200,000 jobs; each job i has a start time s_i, end time e_i (s_i < e_i), and reward w_i. Select a subset of non-overlapping jo...
Maximize coins collected by tokens jumping +3
You are given a single-player board game represented by a string board of length N (1 ≤ N ≤ 100). Each character is one of: - '.': empty cell - 'T': a...
Build a Trust-Aware BIN Database
Build a Trust-Aware BIN Database Implement process_bin_operations(operations) for an in-memory database of card-number prefixes. A prefix identifies a...
Solve Two Backtracking Array Problems
You will solve two independent coding problems. For each problem, first discuss edge cases, then implement a correct solution, and finally explain how...
Implement phrase search and JSON path
This question evaluates the ability to build an inverted index for in-memory exact phrase search and to implement JSON path traversal with wildcard ma...
Find shortest relationship path using BFS
This question evaluates proficiency in graph representations and traversal algorithms—specifically BFS and adjacency-structure construction—for comput...
Build span trees from unordered trace spans
This question evaluates skill in reconstructing hierarchical relationships from unordered span records, testing understanding of tree structure assemb...
Process pod logs with global increments and pop-min
This question evaluates understanding of data structures—particularly priority queues/heaps—and techniques for efficiently handling global/bulk update...
Detect cycles and break them in pod dependencies
You are given dependencies between software pods. Each dependency is a directed edge u -> v meaning pod u must be built/installed before pod v. Part 1...
Count islands in a binary grid
Problem You are given an m x n grid of characters where each cell is either '1' (land) or '0' (water). An island is formed by connecting adjacent land...
Format words into wrapped/justified lines
This question evaluates practical programming skills in string processing, greedy packing, and careful handling of spacing and edge cases, and falls u...