Meta | Onsite

meta logo
meta
Onsite
May 2, 20253 reads

Summary

I solved all the coding questions, and the behavioral and product design rounds went well, but I was ultimately rejected without specific feedback from the recruiter. The difficulty with one particular coding question, even though I solved it with hints, might have contributed to the rejection.

Full Experience

C2Q2, the question threw me off, I have never solved it before. Interviewer tried helping me with hints, I was able to code the solution. I have verified with couple of test cases, interviwer also verified the solution with a test case and confimred that the code works. At the end interviewer told me to comment on the TC, SC also told that I was over the time limit by 2 minutes. I expected a positive outcome as I have solved all the questions and behav, design also went good. But I got rejected. C2Q2 may be the reason or leetcode design, or even behav, who knows. Recruiter didn't give any feedback. Back to the grind :)

Interview Questions (3)

Q1
Minimum Remove to Make Valid Parentheses
Data Structures & AlgorithmsMedium

Given a string s of '(' , ')' and lowercase English characters. Your task is to remove the minimum number of parentheses ( '(' or ')', in any positions ) so that the resulting parentheses string is valid and return any valid string. A string s is valid if: It is an empty string, contains only lowercase characters, or (A) or AB where A and B are valid strings. Follow up: String can have all kinds of parentheses (e.g., {}, [], ()).

Q2
Nested List Weight Sum
Data Structures & AlgorithmsMedium

You are given a nested list of integers nestedList. Each element is either an integer or a list whose elements may also be integers or other lists. Each integer has one depth. The depth of an integer is how many lists it is inside of. For example, the integer 3 in [1,[2,[3]]] has depth 3. Return the sum of all integers in nestedList weighted by their depth.

Q3
Binary Tree Cameras
Data Structures & AlgorithmsHard

You are given the root of a binary tree. We install cameras on some nodes of the tree. Each camera at a node can monitor itself, its parent, and its direct children. Return the minimum number of cameras needed to monitor all nodes of the tree.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!