Meta | Phone Screen | London
- Location
- London
- Posted
- 29 May 2025
Summary
I had a phone screen with Meta in London, where I was presented with two algorithm questions, variants of 'Random Pick with Weight' and 'Shortest Path in Binary Matrix'. I performed well on the first and mostly on the second, but I made mistakes in the time and space complexity analysis for the second question. I am currently awaiting an update on my application.
How it went
Q1: variant of https://leetcode.com/problems/random-pick-with-weight/description/
Q2: variant of https://leetcode.com/problems/shortest-path/description/
I aced Q1 and mostly Q2 but screwed up the TC and SC of Q2. still waiting for the update atm.
Questions asked (2)
- 01
Random Pick with Weight (Variant)
Data Structures & Algorithms · Medium
Open the problemA variant of the Random Pick with Weight problem, which typically involves picking an index based on given weights, often solved using prefix sums and binary search.
- 02
Shortest Path in Binary Matrix (Variant)
Data Structures & Algorithms · Medium
Open the problemA variant of the Shortest Path in Binary Matrix problem, which typically involves finding the shortest path from a source to a target in a grid with obstacles, often using Breadth-First Search (BFS).