Moonfrog Labs | Interview Experience | SDE-2

Posted
8 May 2025
284 reads

Summary

I received a call from a recruiter and proceeded to a DSA round. I was presented with two specific data structures and algorithms questions. Despite clarifying questions, the experience concluded with being ghosted.

How it went

I got a call from a recruiter.

let's keep it simple and straight-forward.

Round-1 : DSA

Some HLD questions related to DB & features i developed.

i was asked 2 questions -

  1. You’re building a dashboard for a ride-sharing service. Drivers submit ride logs throughout the day. Each log entry includes a driverId who picked up a passenger.

The operations team wants to identify the smallest number of drivers who together accounted for at least k total pickups in the day.

Your task is to return the minimum number of unique drivers required to reach at least k rides. The same driver may appear multiple times in the log (each time they picked someone up).

  1. You’re building a backend service for a video streaming platform. Each server in your system can support a maximum bitrate capacity (measured in Mbps). Given a list of available servers and their capacities, you want to allocate at most k servers to serve a user in a way that guarantees at least a certain total bitrate.

Your task is to find the minimum number of servers required to meet or exceed the target total bitrate.

"for both the questions i asked multiple clarity questions, and asked for some examples to help me clearly understand"

***got ghosted***.

***So please upvote this and help others if you find it useful***

sad-thumbs-up-cat.3.meme.webp

Questions asked (2)

  1. 01

    Minimum Drivers for K Pickups

    Data Structures & Algorithms

    You’re building a dashboard for a ride-sharing service. Drivers submit ride logs throughout the day. Each log entry includes a driverId who picked up a passenger.

    The operations team wants to identify the smallest number of drivers who together accounted for at least k total pickups in the day.

    Your task is to return the minimum number of unique drivers required to reach at least k rides. The same driver may appear multiple times in the log (each time they picked someone up).

  2. 02

    Minimum Servers for Target Bitrate

    Data Structures & Algorithms

    You’re building a backend service for a video streaming platform. Each server in your system can support a maximum bitrate capacity (measured in Mbps). Given a list of available servers and their capacities, you want to allocate at most k servers to serve a user in a way that guarantees at least a certain total bitrate.

    Your task is to find the minimum number of servers required to meet or exceed the target total bitrate.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Moonfrog Labs recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!