Meta | Phone Screen | Bangalore
- Location
- Bangalore
- Posted
- 7 May 2025
310 reads
Summary
I had a phone screen with Meta in Bangalore where I was asked two data structure and algorithm questions. One involved counting occurrences of 1s in a given range using an API, and the other was about finding the most frequent number in a set of overlapping ranges.
How it went
Phone Screen Round
Asked 2 questions
- Given a range of 0 and 1, count the number of occurrences of 1 within the specified range. There will be an API where you pass the start and end values, and it returns the total count of 1's.
- Given a range of numbers, find the number that occurs most frequently within the ranges. For example, with the input [[1, 4], [2, 5], [3, 6], [6, 9]], the output would be 3.
Questions asked (2)
- 01
Count Occurrences of 1s in Binary Range with API
Data Structures & Algorithms
Given a range of 0 and 1, count the number of occurrences of 1 within the specified range. There will be an API where you pass the start and end values, and it returns the total count of 1's.
- 02
Find Most Frequent Number in Overlapping Ranges
Data Structures & Algorithms
Given a range of numbers, find the number that occurs most frequently within the ranges. For example, with the input [[1, 4], [2, 5], [3, 6], [6, 9]], the output would be 3.