Software Engineer · Phone Screen · Coding

Meta — Software Engineer

Level: Senior-Level

Round: Phone Screen · Type: Coding · Difficulty: 6/10 · Duration: 60 min · Interviewer: Neutral

Topics: Arrays, Binary Search Tree, Graph Traversal

Location: San Francisco Bay Area

Interview date: 2026-01-15

Summary

Interview Rounds Overview

• Round 1: Coding

Details

I had a coding interview where I was asked two questions:

1. Given a matrix, set all rows and columns containing a zero to zero.
2. Find the longest ordered path in a BST. The path doesn't necessarily need to pass through the root, and the function should return an integer representing the length of the path.