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 Two String Problems
The interview included two coding questions: 1. Exactly one edit apart Given two strings s and t, determine whether they are exactly one edit apart...
Debug and optimize a card-drawing strategy
This question evaluates debugging and implementation skills, combinatorial search and optimization, and the ability to design and interpret simulation...
Extend a Maze Solver
You are given an existing codebase for a maze game and solver. The maze is represented as a 2D grid containing: - S: start cell - T: target cell - .: ...
Find Any Local Minimum with Iterative Binary Search
Find Any Local Minimum with Iterative Binary Search Given a nonempty integer array numbers, return the index of any local minimum. An index i is a loc...
Write queries for follows and bookings
This question evaluates the ability to manipulate temporal event logs, enforce bidirectional relational integrity, and implement efficient graph and i...
Implement an in-memory key-field-value DB with TTL
In-Memory DB with TTL + Scan + Backup/Restore Implement an in-memory database storing records by (key, field) -> value with optional TTL. Data model /...
Return Binary Tree Nodes in Vertical Order
Return Binary Tree Nodes in Vertical Order A binary tree has nodes numbered from 0 through n - 1, with node 0 as the root. Arrays left and right conta...
Merge Three Sorted Arrays Without Duplicates
Merge Three Sorted Arrays Without Duplicates You are given three integer arrays sorted in nondecreasing order. Merge them into one sorted array that c...
Find Maximum Unique-Character Subset
This question evaluates algorithm design and combinatorial optimization skills, specifically the ability to model disjoint-character constraints, hand...
Extend a Maze Solver
This question evaluates competence in graph search and state-space modeling, specifically BFS-based pathfinding, constrained traversal rules (directio...
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...
Validate abbreviations and brackets
The coding round included two short implementation problems: 1. Abbreviation validation Given a lowercase word word and a string abbr, determine wheth...
Implement Multi-Level In-Memory Services
Implement the following independent multi-level in-memory service simulations. In an interview, you may receive one scenario and unlock the levels seq...
Implement an Expiring Record Store
Implement a level-based in-memory record store. The store contains records identified by a string key. Each record contains fields, where each field i...
Implement fast power and k-palindrome
This question evaluates numerical algorithm design and string algorithm skills, focusing on efficient exponentiation with negative exponents and deter...
Implement a versioned in-memory DB with CAS and history
In-Memory DB V2: TTL + Compare-And-Set/Delete + Historical Reads Implement an in-memory database keyed by (key, field) supporting TTL, conditional upd...
Build Friend Recommendations
This question evaluates proficiency with graph data structures, set operations, uniform random sampling, counting mutual connections, and deterministi...
Solve Tree Diameter and Palindromic Counts
This two-problem prompt evaluates proficiency in tree algorithms and recursion for computing longest paths in binary trees, along with string processi...
Simulate Monster Team Battles
This question evaluates a candidate's ability to model stateful simulations and implement deterministic battle mechanics with clean data structures an...
Solve palindrome-check and vertical-order traversal
You are asked to solve two separate coding questions. You do not need to run code; be prepared to explain your approach and walk through examples. Que...