Meta E4 Screening
- Result
- Ongoing
- Posted
- 9 Oct 2024
Summary
I completed a screening interview for an E4 position at Meta, successfully solving two coding problems, though I needed to correct a minor error on one. I am currently awaiting feedback.
How it went
I recently had my screening interview for an E4 position at Meta. The interview session involved tackling two coding questions. I managed to solve both of them, but during the second problem, the interviewer pointed out a mistake in my code. I promptly identified and corrected the error, completing the solution.
Based on discussions I've seen on LeetCode, I'm not entirely confident about moving forward, and I'm eagerly awaiting their feedback.
Questions asked (2)
- 01
Path Sum (Variation)
Data Structures & Algorithms · Medium
Open the problemThis was a variation of the classic LeetCode Path Sum problem. The standard problem asks to determine if there exists a root-to-leaf path in a binary tree such that its node values add up to a given target sum. While the specific details of the variation weren't provided, it built upon this core concept.
- 02
Minimum Window Substring
Data Structures & Algorithms · Hard
Open the problemGiven two strings
sandtof lengthsmandnrespectively, return the minimum window substring ofssuch that every character int(including duplicates) is included in the window. If there is no such window, return an empty string"".For example:
Input: s = "ADOBECODEBANC", t = "ABC" Output: "BANC"