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."
Compute product of array except self
Given an integer array nums, return an array out where out[i] equals the product of all elements in nums except nums[i]. Do it in O(n) time using cons...
Implement bank account with cashback
Implement a bank account processor. Given an initial non-negative integer balance B and a list of operations (n up to 1e 5), apply each operation in o...
Format messages with paginated suffixes
You are given a message string s and an integer width w. Split s into multiple chunks, preserving character order, and append a suffix "i/n" to each c...
Reconstruct tree from inorder and postorder
Given two arrays representing the inorder and postorder traversals of a binary tree with unique values, reconstruct the original binary tree and retur...
Implement a match-3 board resolver
Question Implement a match-3 board resolver (the core loop of a "candy crush"-style game). You are given an m×n grid of cells. Each cell holds a value...
Detect runs and answer suffix queries
Given an array of comparable elements a[0..m-1] and an integer N: 1) Write a function that returns the maximum length of any run of consecutive equal ...
Find max distance between alive tree nodes
Find max distance between alive tree nodes Given a binary tree, define alive nodes. Base case: alive nodes are the leaves. Find the maximum distance (...
Design a hierarchical path registry
Design a hierarchical path registry Implement an in-memory hierarchical path registry. Support: create(path, value) to create a new path with an integ...
Find posts with >60s unconnected viewing time
Context You work on a social app where users can view posts. A view can be from a connected user (viewer is friends/connected with the post author) or...
Deduplicate a Linked List
Given a singly linked list, remove duplicate values in-place. Variant A (sorted list): delete repeated nodes so each value appears once using O( 1) ex...
Discuss project experience and teamwork
Discuss project experience and teamwork Behavioral & Leadership: Project Experience and Teamwork (Software Engineer, Onsite) Context: Provide concise,...
Compute nearest-exit distances in a grid
Compute nearest-exit distances in a grid You are given a 2D grid representing a building floor with three cell types: -1 for walls, 0 for exits, and a...
Implement cluster status tracker
Implement a cluster status tracker. Design a class with methods: update(nodeId, status, timestamp) to record node status updates that may arrive out o...
Solve constrained monster traversal
Solve constrained monster traversal You are given a directed graph with n rooms labeled 0..n-1; each room i contains a monster with health hp[i] ≥ 0. ...
Implement two-pointer unique-pair sum search
Implement two-pointer unique-pair sum search Given a nondecreasing integer array nums and an integer target, return all unique value pairs [a, b] with...
Evaluate expression without stack, constant space
Evaluate expression without stack, constant space Given a string s representing a valid arithmetic expression of non-negative integers, the operators ...
Find k most frequent elements, discuss O(n)
Find k most frequent elements, discuss O(n) Given an integer array nums of length n and an integer k (where 1 ≤ k ≤ the number of distinct values in n...
Compute longest increasing path in a matrix
Compute longest increasing path in a matrix Given an m × n integer matrix, return the length of the longest path of strictly increasing values, where ...
Design a constrained in-memory file system
Design an in-memory hierarchical file system. Implement: 1) addFile(String path): Given a UNIX-style absolute path like "/path/to/somewhere/file.txt",...
Traverse levels selecting nodes meeting a predicate
Traverse levels selecting nodes meeting a predicate Given the root of a binary tree and a predicate P(value) that returns true for certain node values...