Meta
More Experiences
Meta phone screen
April 21, 2025 • 4 reads
Summary
I had a phone screen with Meta where I was asked two coding problems: an adaptation of Merge K Sorted Lists and Clone Graph. I successfully solved both problems and am awaiting the results.
Full Experience
YOE - 5+
Location - US
Alright time to give back to the community !!
I was asked 2 problems
- Merge K sorted Lists: Similar to this but just had lists(not linked list) as input (
List<List<Integer>>)
- Aim if the problem was to implement a getNext() function that will give the next element in sorted order in all lists.
- Eventual output of all the calls to getNext() will be a sorted list including all the elements from all the list.
- https://leetcode.com/problems/merge-k-sorted-lists/description/
- Clone graph
- https://leetcode.com/problems/clone-graph/
Was able to solve these problems. Looking forward to the result.
PS: Meta does not need you to run the code. So don't worry too much about the syntax. Make sure logic is solid.
Interview Questions (2)
Q1
Merge K Sorted Lists with getNext() Function
Data Structures & Algorithms
The problem was similar to Merge K Sorted Lists but with List<List<Integer>> as input instead of linked lists.
The aim was to implement a getNext() function that returns the next element in sorted order across all lists.
The eventual output of all calls to getNext() would be a sorted list containing all elements from all input lists.