Interview Questions
Practice the exact questions companies are asking right now.
"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."
Solve Three Algorithm Variants
You are given three independent coding problems. For each one, describe and implement an efficient solution. 1. Generate queue arrangements - You a...
Find the Next Larger Palindrome
Given a positive integer n, return the smallest integer strictly greater than n whose decimal representation is a palindrome. A palindrome reads the s...
Implement Interval Insert and Dedup
This interview round contained two coding problems: 1. Insert and merge intervals. You are given a list of non-overlapping intervals sorted by start t...
Implement a DAG task graph
Implement a class TaskGraph to represent a directed acyclic graph of tasks. Support these operations: 1. add_task(task_id: str) -> None: Add a task if...
Implement SQL Table and DNA Ordering
Two independent coding exercises were asked. Solve both. Problem A: CSV-backed in-memory table Build a tiny in-memory relational table initialized fro...
Find the Critical Path
You are given a project represented as a directed acyclic graph of tasks. Each task has: - a unique task name - a list of prerequisite task names - a ...
Find Dictionary Matches for a Jammed String
You are given: - a dictionary of lowercase words - an input string jammed_string A keyboard may be stuck, so when typing an original word, any charact...
Assign Pins to Shortest Columns
You are given a list of pins, where each pin has a height, and a fixed number of columns in a masonry-style layout. Process the pins in their original...
Solve power jumps and graph tour
This online assessment contained two coding problems: 1. Minimum operations using signed powers of two Given an integer n, you want to make it equal...
Solve Two Coding Interview Problems
You are asked to solve two independent coding problems. Problem 1: Evaluate Nested Math Expressions Implement a function that evaluates a string expre...
Implement a Timestamped Banking System
Implement an in-memory banking system that processes API calls in nondecreasing timestamp order. Support the following operations: - create_account(ti...
Implement Task Dependencies and Failure
Implement a Python in-memory task manager for an AI workflow system. Each task has a unique task_id and a status. A task may depend on other tasks. If...
Solve Dependency, Prefix, and Cache Problems
Solve the following three coding problems. Problem 1: Determine Whether All Tasks Can Be Completed You are given numTasks, the number of tasks labeled...
Implement KNN from Scratch
Implement a k-nearest neighbors (KNN) classifier from scratch in Python without using scikit-learn's KNN implementation. Given training features X_tra...
Solve Five Coding Problems
The interview included several coding tasks. Solve each of the following and discuss time and space complexity: 1. Given a 2D grid where '1' represent...
Merge Sorted Arrays
You are given two related tasks about sorted integer arrays. 1. Implement a function that takes two arrays sorted in nondecreasing order and returns a...
Design an In-Memory Database
Implement a simple in-memory database with a flexible, schema-less record model. Requirements: - Each record is a mapping from column_name to value. -...
Process Mutable Matrix Sum Queries
You are given a 2D integer matrix and a list of queries. There are two query types: - set r c v: update the value at row r and column c to v - get r1 ...
Compute Inherited Role Privileges
You are given n roles. The array initialPrivileges has length n, where initialPrivileges[i] is the list of privileges directly assigned to role i. You...
Implement a Versioned Key-Value Store
Design and implement an in-memory versioned key-value store. Requirements: - put(key, value, timestamp): store value for key at the given integer time...