Meta full loop
Summary
I went through the Meta full loop interview process, which included a phone screen, two coding rounds, a system design round, and a behavioral round.
Full Experience
Phone Screen:
- Right side of bt (recursion)
- Minimum remove to make valid paranthesis (don't use stack)
- Find element in rotated sorted array
Coding Round 1:
- Simplify Path (variant also given current working directory)
- Vertical order traversal of bt
Coding Round 2:
- Basic calculator (don't use stack)
- Sum root to leaf of bt
System Design: Design chat application
Behavioral : General questions (got nervous in this round :_))
Interview Questions (8)
Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. The problem suggested using recursion.
Given a string s of '(' , ')' and lowercase English characters. Your task is to remove the minimum number of parentheses ( '(' or ')') so that the resulting parentheses string is valid. The problem specifically asked not to use a stack for the solution.
Search for a target value in a rotated sorted array.
Given a string path, which is an absolute path (starting with a slash '/') to a file or directory in a Unix-style file system, convert it to the simplified canonical path. A variant was given involving the current working directory.
Given the root of a binary tree, return the vertical order traversal of its nodes' values. (i.e., from top to bottom, column by column).
Implement a basic calculator to evaluate a simple expression string. The problem explicitly stated not to use a stack for the solution.
Given a binary tree where each node contains a digit from 0-9, each root-to-leaf path represents a number. Return the total sum of all root-to-leaf numbers.
Design a scalable chat application.