2 questions- 1. https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ - Solved using deque. This question took little bit extra time. 2. https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/ - Provided stack approach and was asking for without stack. Time was less so...

LeetCode Question · Sep 2021 · London

Facebook | Software Engineer, Product | London | Phone Screening | Sept 21 | Result(Passed))

SWE Phone Screen

4 upvotes 1,664 views 1 reply

Question Details

2 questions- 1. - Solved using deque. This question took little bit extra time. 2. - Provided stack approach and was asking for without stack. Time was less so...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Binary Tree Queue Stack

← All Meta questions Meta Software Engineer Questions → All Coding Questions →

Facebook | Software Engineer, Product | London | Phone Screening | Sept 21 | Result(Passed))

Question Details

Full Details

Topics

More from Meta