media.net logo
Media.net· SDE 2

Media.Net SDE 2 Interview Round1

Result
Rejected
Experience
4 years
Posted
19 Oct 2025
754 reads

Summary

I interviewed for an SDE 2 role at Media.Net and was ultimately rejected. I faced two LeetCode medium Data Structures and Algorithms (DSA) questions, struggling initially with a probability-based problem but arriving at a pseudo-code, and needing a hint for a two-pointer problem.

How it went

During the interview, I was presented with two DSA questions. For the first question, which was probability-based, I struggled initially because I hadn't encountered such problems before. I began with a brute-force recursive solution and later realized that Dynamic Programming (DP) could optimize it. I derived the recurrence relation, and the interviewer agreed with my approach. As time was running out, I wrote the pseudo-code. However, I believe I messed up when asked about a space-optimized solution; I mentioned using prev and curr pointers but couldn't integrate it into the pseudo-code, which was a mistake. This question took me about 45 minutes.

For the second question, due to limited time, I immediately started with a brute-force solution. The interviewer asked me to optimize it, and after a couple of minutes of intense thought, I came up with a two-pointer solution. My initial logic, however, was incorrect. The interviewer then provided a hint, which enabled me to complete the solution correctly within approximately 15 minutes.

Ultimately, I was rejected. I had a little bit of hope because I could complete the correct solutions and explain things iteratively, but I guess I took too many hints from the interviewer and couldn't complete the correct code perfectly. It's disheartening to hear, but I will keep on grinding!

Questions asked (2)

  1. 01

    Knight Probability in Chessboard

    Data Structures & Algorithms · Medium

    Given an N×N chessboard and a knight at (row, column), find the probability that the knight remains on the board after exactly K moves.

    Open the problem
  2. 02

    Find the Celebrity

    Data Structures & Algorithms · Medium

    In a party of N people, a celebrity is someone who is known by everyone else but does not know anyone. Given an API bool knows(a, b) which returns true if a knows b, find the celebrity.

    Open the problem

How they prepared

I have 4+ years of experience and restarted practicing Data Structures and Algorithms (DSA) in April. I've been getting very few callbacks, even though I'm from a Tier-1 college, which I guess doesn't matter much now. This was the fifth company I've interviewed with, and the interviewer approached me.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Media.net 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!