Meta Data collection team rounds
- Posted
- 13 Mar 2026
Summary
I interviewed for a role at Meta and went through a design round and DSA rounds, encountering problems related to system design, linked lists, LRU cache, and array manipulation.
How it went
Design round:
1. Ad - aggregator service. Asked how to scale with number of servers and db estimations
DSA in python:
1. Linkedlist with nodes having strings. check if both linked list have same value
2. LRU cache
3. Given sorted array return which no is repeating n/4 times or more
Questions asked (4)
- 01
Ad Aggregator Service Design
System Design
Design an ad aggregator service. I was asked how to scale it with the number of servers and database estimations.
- 02
Compare Linked Lists with String Nodes
Data Structures & Algorithms
Given two linked lists where nodes have strings, check if both linked lists have the same value (sequence of strings).
- 03
LRU Cache Implementation
Data Structures & Algorithms
Implement an LRU (Least Recently Used) cache.
- 04
Find Element Repeating N/4 Times in Sorted Array
Data Structures & Algorithms
Given a sorted array, return the number that is repeating n/4 times or more.