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."
Design a voting counter for restaurants
This question evaluates familiarity with hash-table–based counting, efficient update and lookup operations, handling of ties with a deterministic tie-...
Implement np.random.choice
This question evaluates understanding of random sampling algorithms, probability distributions (uniform and weighted), handling of weights and edge-ca...
Implement sampling, subarray scan, and percentile estimate
This multi-part problem evaluates skills in random sampling and geometric probability for uniform 2D sampling, algorithmic array processing for findin...
Find the First Working Version
This question evaluates understanding of search algorithms, version normalization, and monotonic predicates, along with competency in parsing and orde...
Implement a Datacenter Request Router
This question evaluates command parsing, stateful data structure management, input validation, geospatial computation using the Haversine formula, det...
Implement JavaScript utility and API functions
This question evaluates JavaScript fundamentals including string and numeric operations, array transformation and grouping, functional concepts such a...
Implement a recent-use eviction cache
This question evaluates a candidate's ability to design and implement a fixed-capacity key-value cache with a recent-use eviction policy, emphasizing ...
Generate Instructions for a Blind Maze Robot
You are given a known 2D maze grid with m rows and n columns. Each cell is one of: - #: wall - .: empty cell - E: the exit, which appears exactly once...
Maximize palindromic strings after character swaps
You are given an integer n and an array of n lowercase strings arr. Operation (can be performed any number of times): choose two different strings arr...
Solve Prime Jumps and Pipeline Scaling
An online assessment contains two independent coding problems. Solve both. Problem 1: Prime-Constrained Score Jump You are given an integer array scor...
Find Maximum Path Sum in N-ary Tree
You are given the root of an N-ary tree. Each node contains an integer value and a list of zero or more children. A path is a sequence of nodes where ...
Implement Popular and Ranked Voting
You are given ranked ballots in aggregated form. Each key is an ordered tuple of candidate names representing one voter's preference from highest to l...
Implement three whiteboard coding tasks
The interview report described several coding questions in the same category: 1. Binary search: Given a sorted array of integers and a target value, r...
Move zeros to the front
This question evaluates array manipulation and in-place algorithm competencies, including handling space-time trade-offs and preserving relative order...
Implement a String Deque
Implement a double-ended queue (Deque) that stores strings. Your implementation must support the following operations: - addFirst(data): Insert data a...
Solve scheduling and collision problems
This question evaluates a candidate's understanding of algorithm design and data structures for resource allocation and dynamic interaction problems, ...
Implement store, evaluator, and parser
This question evaluates implementation skills in data structures and algorithms, covering time-based versioning and TTL in an in-memory key-value stor...
Compute Sliding Window Averages
This question evaluates proficiency in array manipulation, sliding-window techniques, and algorithmic efficiency including time and space complexity. ...
Return a Package Build Order
You are given an API: `python get_dependencies(package) -> list[str] ` It returns the direct dependencies of a given package. If package A depends on ...
Implement File Tail and Sensor Health
This question evaluates skills in large-file streaming and buffer/pointer manipulation for tailing files, along with data-structure and time-window re...