Solve array merge, tree view, and maze tasks
Company: Meta
Role: Machine Learning Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: This question evaluates array manipulation and in-place algorithms, binary tree traversal and visibility reasoning, and grid graph traversal for path existence and shortest paths, reflecting competencies in data structures, algorithmic complexity, and space- and time-efficient implementations.