Meta Software Engineer Coding & Algorithms Interview Questions
Practice 218 real Coding & Algorithms interview questions for Software Engineer roles at Meta.
"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 Parser, Trading, Tree, And Deck Tasks
You will solve several independent programming tasks. For each task, implement clean, tested code and state the time and space complexity. 1. Validate...
Validate Sorted Order Under a Custom Alphabet
This question evaluates a candidate's ability to apply custom ordering rules and string comparison logic, a common variant of array and string validat...
Find Shortest Unique Prefixes
This question evaluates string-processing skills and understanding of data structures for prefix management (e.g., tries), along with algorithmic effi...
Palindrome After Deleting at Most One Character
This question evaluates a candidate's ability to reason about two-pointer string traversal and palindrome verification under a single edit constraint....
Solve Three Coding Interview Problems
The interview included three coding tasks: 1. Common ancestor in an N-ary tree You are given the root of an N-ary tree and two target nodes. Dete...
Select words to maximize unique characters
Problem You are given an array of strings words. You may choose any subset of these strings and concatenate the chosen strings in any order. Your goal...
Implement BFS-based maze solver
Maze Printing and BFS Solver You are given a 2D grid representing a maze. Each cell of the grid is one of: - '#' – wall (cannot be passed) - '.' – emp...
Implement four coding challenges
You are asked to solve the following four independent coding problems. --- 1) Block Placement Simulator (Tetris-like) You have an empty n x m grid (ro...
Find top-K frequent elements in a stream
You receive a large stream of items (e.g., integers or strings) that may not fit in memory. Design an algorithm that can return the top K most frequen...
Count Distinct Values in a Sorted Array When K Is Small
Count Distinct Values in a Sorted Array When K Is Small Given an integer array sorted in nondecreasing order, return the number of distinct values. Le...
Build a FastAPI summarization service
Implement a minimal but production-ready FastAPI service for text summarization. Requirements: - Expose an endpoint POST /summarize. - The request bod...
Compute Exclusive Execution Times
This question evaluates understanding of nested function execution and precise exclusive-time accounting derived from chronological logs, emphasizing ...
Solve Maze and Suffix Problems
Solve the following two coding problems. Problem A: Find the shortest path through a maze with keys and doors You are given a 2D grid representing a m...
Resolve a cd Path Against the Current Directory
Resolve a cd Path Against the Current Directory Implement path resolution for a simplified Unix-like cd command. cwd is a normalized absolute path. ar...
Solve Tree Columns And Maze Variants
This question evaluates tree traversal and column-based grouping skills along with grid-based graph search, state modeling, and handling dynamic maze ...
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...
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...