Meta Software Engineer Coding & Algorithms Interview Questions
Practice 207 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."
Compute weighted sum of nested lists
Compute weighted sum of nested lists Given a nested collection that can contain integers or other nested collections, compute the depth-weighted sum w...
Decide palindrome within k deletions
Decide palindrome within k deletions Given a string s and integer k, decide whether s can be transformed into a palindrome by deleting at most k chara...
Find Lowest Common Ancestor with Parents
Question LeetCode 1650. Lowest Common Ancestor of a Binary Tree III Compute the time and space complexity of your solution https://leetcode.com/proble...
Solve UTF-8 Validation & Shortest Path
Question LeetCode 393. UTF-8 Validation LeetCode 1091. Shortest Path in Binary Matrix https://leetcode.com/problems/utf-8-validation/description/ http...
Count three-digit numbers with distinct digits
Problem Given two integers left and right such that 100 ≤ left ≤ right ≤ 999, count how many three-digit integers x in the inclusive range [left, righ...
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 ...
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...
Solve array, tree, and maze problems
The onsite interview included the following algorithmic tasks: 1. Building visibility from the right: Given an integer array heights, where heights[i]...
Find K-th Largest and Longest Vacation
Solve the following two coding problems. 1. Find the k-th largest element Given an integer array nums and an integer k, return the element that wou...
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...
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...
Convert BST to sorted doubly list
Convert a binary search tree into a sorted doubly linked list in-place. Reuse the existing tree nodes: the left pointer becomes prev and the right poi...
Fill rooms with nearest gate distances
You are given an m×n integer grid representing rooms, where -1 is a wall, 0 is a gate, and INF (a large sentinel such as 2^31− 1) is an empty room. Fo...
Validate word abbreviation and reconcile two abbreviations
Validate word abbreviation and reconcile two abbreviations Implement a function isValidAbbreviation(word: string, abbr: string) that returns true if a...
Return all root-to-leaf path sums
Problem You are given the root of a binary tree where each node contains an integer value (may be negative). Return an array/list containing the sum o...
Implement sparse vector dot product
Question Design a SparseVector class for vectors of integers in which most entries are zero, and support an efficient dot product between two such vec...
Remove runs of length at least k
Given a string s and an integer k (k >= 2), repeatedly remove every maximal contiguous group of the same character whose length is at least k, deletin...
Implement in-place duplicate removal
Given a non-decreasing array of integers, overwrite it in-place so that each distinct value appears exactly once while preserving the order of the uni...
Find the kth largest element
Given an unsorted array of n integers and an integer k (1 ≤ k ≤ n), return the k-th largest element without fully sorting the array. Design two method...