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."
Find closest BST value and remove parentheses
Question LeetCode 270. Closest Binary Search Tree Value LeetCode 1249. Minimum Remove to Make Valid Parentheses (follow-up: achieve without using a st...
Solve tree leaf sum and target indices search
Question LeetCode 129. Sum Root to Leaf Numbers LeetCode 2089. Find Target Indices After Sorting Array (array already sorted; require O(log n) time) h...
Check Palindrome and Add Decimal Strings
Question LeetCode 266. Palindrome Permutation – Given a string, determine whether any permutation can form a palindrome. Follow-up: If a palindrome pe...
Handle palindrome & decimal addition
Question LeetCode 266. Palindrome Permutation Given two non-negative decimal number strings, implement addition that supports a decimal point. https:/...
Solve vertical order & diameter variants
Question LeetCode 314. Binary Tree Vertical Order Traversal LeetCode 543. Diameter of Binary Tree – modified to return the number of nodes (edges + 1)...
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...
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 ...
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...
Find minimum and most frequent number efficiently
Find minimum and most frequent number efficiently Given an unsorted integer array, write functions to: (a) find the minimum value; and (b) find any va...
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...
Produce asymmetric side views of a binary tree
Produce asymmetric side views of a binary tree Given a binary tree, output two sequences: ( 1) Left-bottom-up view: for each depth, the first node vis...
Remove adjacent duplicate groups repeatedly
Remove adjacent duplicate groups repeatedly Given a string s, repeatedly delete any maximal contiguous group of identical characters whose length is a...
Implement string sum and weighted city picker
Implement string sum and weighted city picker Part A — Add two numbers represented as strings: Given two non‑negative integers provided as decimal str...
Implement range-sum tree and sort merged lists
Implement range-sum tree and sort merged lists 1) Given a binary tree whose nodes store integer values, and two integers low and high defining an incl...
Solve two string algorithm tasks
Solve two string algorithm tasks Answer both parts. A) Parentheses correction: Given a string s consisting only of '(' and ')', output the minimum num...
Evaluate arithmetic expression without parentheses
Evaluate arithmetic expression without parentheses Write evaluate(s: string) to compute the value of an arithmetic expression containing non-negative ...
Implement weighted random index picker
Implement weighted random index picker Design a class WeightedPicker that is initialized with an array of positive integer weights w and supports pick...
Compute tree right view and target-sum subarrays
You are given two separate programming tasks. --- Task 1: Right-side view of a binary tree You are given the root of a binary tree. Imagine standing o...