LeetCode Experience · Mar 2024

Meta Phone Screen | E5

SWE Phone Screen Senior
603 views 5 replies

Interview Experience

Had my phone screen today: Q1: Longest Increasing path in a matrix ( Q2: Given two nodes in a tree (no root was passed), find their lowest common ancestors ( I struggle...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Graph Binary Tree Linked List Dynamic Programming Matrix