Meta phone screen
- Location
- US
- Experience
- 5 years
- Posted
- 21 Apr 2025
324 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.
How it went
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.
Questions asked (2)
- 01
Merge K Sorted Lists with getNext() Function
Data Structures & Algorithms
Open the problemThe problem was similar to Merge K Sorted Lists but with
List<List<Integer>>as input instead of linked lists.
The aim was to implement agetNext()function that returns the next element in sorted order across all lists.
The eventual output of all calls togetNext()would be a sorted list containing all elements from all input lists. - 02
Clone Graph
Data Structures & Algorithms · Medium
Open the problemThe problem was to clone a given graph.