Meta Screening Round Experience - Two Questions Asked
- Posted
- 28 Aug 2025
Summary
I recently completed a screening round interview at Meta, which included two coding challenges: Range Sum of BST and Expression Add Operators. It was an interesting experience covering different algorithm types.
How it went
My screening round with Meta involved tackling two distinct coding problems. The first one was 'Range Sum of BST', which felt like an easy-to-medium problem primarily focusing on binary search tree traversal. The second challenge was 'Expression Add Operators', a hard problem that required me to think about backtracking and string manipulation techniques. The problem statement for the second question was clearly articulated, asking to find all possible ways to insert binary operators (+, -) between digits in a string to reach a given target value.
Questions asked (2)
- 01
Range Sum of BST
Data Structures & Algorithms · Medium
Open the problemGiven the root of a binary search tree and two integers
lowandhigh, return the sum of all nodes' values that are in the inclusive range[low, high]. - 02
Expression Add Operators
Data Structures & Algorithms · Hard
Open the problemGiven a string of digits and a target value, return all possible ways to add binary operators (+, -) between the digits so they evaluate to the target value.