Coding & Algorithms Interview Questions
Practice 3,469 real coding and algorithms interview questions reported from interviews at Meta, Amazon, Google, Uber and Microsoft. The mix follows what these loops actually ask: arrays and strings, hash maps, two pointers and sliding windows, binary search, linked lists, trees and graphs, BFS and DFS, recursion and backtracking, dynamic programming, heaps and priority queues, and the occasional design-a-data-structure round. Roughly four in five are rated medium, which is where most technical screens sit; 477 are hard and cluster in onsite loops. 3,033 of them open in a console where you can run your solution against the test cases in Python, Java, C++ or JavaScript. 2,712 come from Software Engineer interviews, with the rest from Machine Learning Engineer, Data Scientist and Data Engineer loops, and 404 were set as take-home projects rather than live sessions.

"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 a parallelized sort
This question evaluates understanding of parallel algorithms, shared-memory concurrency primitives, synchronization, workload partitioning, and perfor...
Solve two grid problems (islands + min-cost path)
This pair of problems evaluates grid-based algorithm competencies, specifically connected-component detection and translation-invariant shape recognit...
Implement array merge, round-robin scheduler, and trading simulator
This multipart problem evaluates algorithmic problem solving and systems-design competencies including in-place array manipulation, queue-based schedu...
Compute balances with transaction fees and rejections
This question evaluates transaction processing, ledger state management, handling of edge cases like insufficient funds and fixed fees, and efficient ...
Implement a rate limiter at scale
This question evaluates understanding of algorithmic and system-level design for per-key rate limiting, including data structures, time/space complexi...
Compute bus-on-time and dice-sum probabilities
This question evaluates understanding of probability concepts including a continuous uniform waiting-time model for bus arrivals and discrete outcome ...
Print all odd numbers from an integer list
This question evaluates proficiency with array/list manipulation, parity checking, and handling edge cases such as negative values and integers outsid...
Merge overlapping intervals
This question evaluates understanding of interval manipulation, array processing, and algorithmic efficiency by requiring reasoning about overlapping ...
Design a rating aggregator that returns totals and averages
This question evaluates a candidate's competency in designing and implementing data structures and algorithms for maintaining dynamic aggregates (tota...
Check if one string is a subsequence of another
This question evaluates understanding of string algorithms and subsequence detection, focusing on sequence traversal, edge-case handling, and time/spa...
Design O(1) cache and moving average
This question evaluates proficiency in data structures and streaming algorithms by combining an O(1) cache design with an eviction policy and a fixed-...
Count business days excluding holidays
This question evaluates proficiency in date and calendar arithmetic, handling set-based exclusions (holiday lists), and reasoning about algorithmic ef...
Maximize the minimum value along a grid path
This question evaluates a candidate's competence in graph traversal and path-optimization concepts, emphasizing reasoning about path scores and handli...
Compute distance-sum from every tree node
This question evaluates understanding of tree and graph algorithms, including computation of pairwise distances and techniques for aggregating path le...
Find path between nodes in Fibonacci tree
This question evaluates understanding of recursive tree structures, preorder indexing, implicit tree representations, algorithmic reasoning about node...
Return sorted values after quadratic transform
This question evaluates understanding of mathematical transformations and array manipulation, specifically how applying a quadratic function affects t...
Implement cursor-based query pagination
You are building a small in-memory database that stores rows with the following fields: - id (string, unique) - score (integer) - payload (string) You...
Design an autocomplete suggestions API
This question evaluates understanding of string-oriented data structures (e.g., prefix trees/tries), ranked retrieval and dynamic updates, testing ski...
Find longest run of identical consecutive shows
This question evaluates array-manipulation skills and the ability to identify contiguous runs of equal values, emphasizing algorithmic efficiency and ...
Maximize sum with no adjacent tree nodes
This question evaluates understanding of tree-based dynamic programming and stateful optimization for selecting non-adjacent nodes, testing algorithmi...