Meta Coding & Algorithms Interview Questions
Preparing for Meta Coding & Algorithms interview questions requires focusing on algorithmic problem solving, writing production-minded code, and communicating tradeoffs under time
"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 PTO window and sparse unique counting
Solve PTO window and sparse unique counting Design algorithms for two problems: A) Longest vacation with limited PTO: Given an array A of characters w...
Design weighted random index picker
Design and implement a data structure that, given an array of positive integer weights w[0..n−1], supports pick() that returns index i with probabilit...
Design LCA and find K closest points
Part A — LCA with parent pointers: You are given two nodes a and b in a rooted tree where each node has a parent pointer (you may or may not have dire...
Optimize flight costs and find grid path
1) Given two integer arrays D and R of equal length n, where D[i] is the cost to depart on day i and R[j] is the cost to return on day j, choose indic...
Implement BST vertical traversal and list conversion
Given the root of a binary search tree (BST): 1) Implement vertical order traversal: assign the root column 0, left child column −1, right child colum...
Solve sliding window and tree BFS problems
1) Sliding window: Given an array of positive integers nums and an integer target, return the minimal length of a contiguous subarray whose sum is at ...
Implement power and balance-parentheses algorithms
Design and implement two algorithms: 1) Fast exponentiation: Implement a function pow(x, n) that returns a real number x raised to an integer exponent...
Design an in-memory database with TTL and history
Design and implement an in-memory key–field–value store with monotonic timestamps. Keys and fields are strings; values are integers. Provide these API...
Solve BST range average and merge intervals
1) Given a binary search tree and an inclusive range [L, R], compute both the sum and the average of all node values where L <= val <= R. Use the BST ...
Solve parsing, counting, ranges, and window problems
Solve the following four algorithm problems: 1) Expression evaluator with + and : Given a string s containing non-negative integers, '+' and '' operat...
Find kth smallest in sorted matrix
Given an n x n matrix where each row and each column is sorted in nondecreasing order, and an integer k (1 ≤ k ≤ n^ 2), return the k-th smallest eleme...
Implement encoding validation and grid shortest path
Part A — Byte-encoding validation: You are given an array of integers in [0, 255] representing bytes. Determine whether the sequence encodes valid cha...
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 ...
Solve four OA coding problems
The online assessment reportedly contained four coding problems: 1. Compare negative and positive counts Given a sorted integer array nums in non...
Detect earliest collision among moving cars
You are given n vehicles with kinematics parameters. A “collision” means two vehicles occupy the same position at the same time. Assume continuous tim...
Compute maximum score using up to 3 categories
Problem A library runs a summer reading program. Each book a student reads earns a certain number of points, and each book belongs to a category. A st...
Compute Max Score From Up to 3 Categories
You are implementing a scoring function for a library summer reading program. Each book a student read is represented as a tuple (category: str, point...
Design robust group size limiting for calls
Design the admission-control and enforcement algorithm to limit group-call size under real-world race conditions. Constraints: multiple SFU edges in m...
Implement randomized Quickselect without k-shift bug
Implement randomized Quickselect to return the k-th largest element (1-based k, 1 ≤ k ≤ n) from an unsorted integer array. Use an in-place partition t...
Compute 95th-percentile call concurrency
Given N call sessions as half-open intervals [start, end) in UNIX seconds, design an algorithm to compute the 95th percentile of per-minute concurrent...