Meta Screening Round Experience - Two Questions Asked
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.
Full Experience
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.
Interview Questions (2)
Range Sum of BST
Given the root of a binary search tree and two integers low and high, return the sum of all nodes' values that are in the inclusive range [low, high].
Expression Add Operators
Given 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.