Phone Screen: 1. https://leetcode.com/problems/k-closest-points-to-origin/ 2. https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/ **Onsite: 1st coding round: 1. https://leetcode.com/problems/valid-palindrome-ii/solution/ 2. Given a binary tree, implement a function next() that will output the nodes in in-order traversal 2nd coding round: 1. Similar to https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/ System design: Design a...

LeetCode Question · Apr 2021 · USA

Facebook | Full Interview

SWE Phone Screen Senior

33 upvotes 6,662 views 15 replies

Question Details

Phone Screen: 1. 2. **Onsite: 1st coding round: 1. 2. Given a binary tree, implement a function next() that will output the nodes in in-order traversal 2nd coding round: 1. Similar to System design: Design a...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Arrays Binary Tree Strings System Design

← All Meta questions Meta Software Engineer Questions → All System Design Questions →

Facebook | Full Interview

Question Details

Full Details

Topics

More from Meta