Meta Loop
- Posted
- 9 May 2025
Summary
I'm sharing the interview questions encountered during my Meta interview process, across multiple rounds.
How it went
Time to give back to the community.
R1 Q1: https://leetcode.com/problems/buildings-with-an-ocean-view
R1 Q2: variant of https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string
R2 Q1: https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii
R2 Q2: https://leetcode.com/problems/random-pick-with-weight
Questions asked (4)
- 01
Buildings With an Ocean View
Data Structures & Algorithms
Open the problemGiven an array of building heights, return a list of buildings that have an ocean view. A building has an ocean view if all buildings to its right are strictly shorter.
- 02
Variant of Remove All Adjacent Duplicates In String
Data Structures & Algorithms
Open the problemA variation of the problem where you remove all adjacent duplicate characters from a string until no more duplicates can be removed.
- 03
Lowest Common Ancestor of a Binary Tree III
Data Structures & Algorithms
Open the problemFind the lowest common ancestor of two given nodes in a binary tree where each node has a parent pointer.
- 04
Random Pick with Weight
Data Structures & Algorithms
Open the problemGiven an array of positive integers w, where w[i] describes the weight of index i, implement the function pickIndex which randomly picks an index in proportion to its weight.