Meta full loop
- Posted
- 10 Apr 2025
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.
How it went
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 :_))
Questions asked (8)
- 01
Binary Tree Right Side View
Data Structures & Algorithms · Medium
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.
- 02
Minimum Remove to Make Valid Parentheses
Data Structures & Algorithms · Medium
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.
- 03
Search in Rotated Sorted Array
Data Structures & Algorithms · Medium
Search for a target value in a rotated sorted array.
- 04
Simplify Path (with current working directory variant)
Data Structures & Algorithms · Medium
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.
- 05
Vertical Order Traversal of a Binary Tree
Data Structures & Algorithms · Hard
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).
- 06
Basic Calculator (without stack)
Data Structures & Algorithms · Hard
Implement a basic calculator to evaluate a simple expression string. The problem explicitly stated not to use a stack for the solution.
- 07
Sum Root to Leaf Numbers
Data Structures & Algorithms · Medium
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.
- 08
Design a Chat Application
System Design
Design a scalable chat application.