Meta Phone Screen
- Posted
- 28 Apr 2025
Summary
I had a recent phone screen interview with Meta where I solved one coding problem perfectly and struggled with another.
How it went
Sharing my recent phone screen experience. 1) Min add to make parenthethis valis: No variant. https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/description/. This round was perfect. Coded and did a dry run with multiple examples. 2) Merge 3 sorted arrays. The resulted array should not have duplicates. Got confused and messed this up. Did the coding but could not finish in time :( Good luck everyone who is preparing for Meta!
Questions asked (2)
- 01
Minimum Add to Make Parentheses Valid
Data Structures & Algorithms · Medium
Open the problemGiven a string S of '(' and ')' parentheses, the task is to find the minimum number of parentheses to add to make the string valid. This was the standard LeetCode problem, with no variants mentioned.
- 02
Merge Three Sorted Arrays with No Duplicates
Data Structures & Algorithms
Merge three given sorted arrays into a single resultant array. The key constraint is that the merged array should not contain any duplicate elements.