Meta E4 Screening

meta logo
meta
E4Ongoing
October 9, 20242 reads

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.

Full Experience

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.

Interview Questions (2)

Q1
Path Sum (Variation)
Data Structures & AlgorithmsMedium

This 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.

Q2
Minimum Window Substring
Data Structures & AlgorithmsHard

Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (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"
Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!