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 tree, array, and maze tasks
This set of problems evaluates proficiency in algorithms and data structures, covering binary tree diameter computation, array optimization for maximu...
Extend a BFS maze solver stepwise
This question evaluates proficiency in grid-based graph traversal and pathfinding, covering BFS mechanics, stateful reachability with keys and doors, ...
Solve maze tasks and compute shortest routes
This multi-part question evaluates proficiency in grid-based pathfinding and shortest-path reasoning, debugging and incremental code extension, handli...
Compute sparse dot product and count islands
You are asked to solve two coding problems. Problem 1: Sparse vector dot product Given two vectors A and B of the same length n (potentially large, e....
Maximize Unique Letters
This question evaluates proficiency in combinatorial optimization, bit manipulation, and state-compression techniques for selecting subsets under uniq...
Compute Sliding Window Averages
This question evaluates proficiency in array manipulation, sliding-window techniques, and algorithmic efficiency including time and space complexity. ...
Solve four OA coding problems
This set of four problems evaluates core algorithmic competencies including array manipulation and counting in sorted arrays, resource-constrained opt...
Implement BST Iterator and Ticket Queue
This question evaluates understanding of binary search tree traversal and iterator design with amortized time and space analysis, as well as dynamic p...
Deep copy a linked list with random pointers
This question evaluates understanding of linked-list structures, pointer/reference manipulation, deep versus shallow copying, and the ability to analy...
Solve string transform and min-move sorting
This two-part problem evaluates string manipulation and algorithmic problem-solving competencies, specifically rule-based text transformation and comp...
Find shortest path in a maze grid
This question evaluates proficiency in graph traversal and shortest-path reasoning on grid-based data structures, testing skills in pathfinding, state...
Compute unmatched parentheses length
This question evaluates string-processing skills and understanding of parentheses matching and cancellation, focusing on linear-time sequence analysis...
Solve word count, node, segmentation, stock tasks
You have four tasks: 1) Count words with explicit rules: Given a text document, return the number of words. First define precisely what qualifies as a...
Compute capacities after site closures
You are given a nested dictionary redistribution where redistribution[closed_site][dest_site] equals the additional capacity required at dest_site if ...
Compute missing letters to form original string
Implement a function that, given two strings original and typed (typed is a misspelled/partial version of original), returns the number of additional ...
Count palindrome substrings in a string
Given a lowercase ASCII string s, count the number of substrings that are palindromes and return the count. Implement an O(n^ 2) solution using expand...
Solve grid path and top‑k frequency
Part A — Grid Reachability with Obstacles: Given an m×n matrix of 0s and 1s where 0 indicates a passable cell and 1 indicates a blocked cell, starting...
Compute vertical order of a BST
Compute the vertical order traversal of a binary search tree. Define coordinates so the root is at column 0, row 0; the left child is (col−1, row+ 1) ...
Remove minimum parentheses to balance string
Given a string s containing lowercase letters and the characters '(' and ')', remove the minimum number of parentheses so that the resulting string is...
Compute top-N outgoing spenders
Add a feature to report the top N accounts by total outgoing payments across both immediate pays and scheduled payments. Implement: List<String> topNS...