Media Net

Role: SDE-Intern + FTE Backend

College: Not Specified

Interview Date: Not Specified (experience published January 2024)

Interview Type: Not Specified

Result: Advanced to next round

Difficulty: Easy to Hard (Online Assessment)

Rounds: At least 2 rounds

Topics Asked: Data Structures, Algorithms (Maps, Tree + Priority Queue, DP + Bit Masking), Time and Space complexities, Brute force to optimized solutions, Test cases

Experience:

This interview experience for a Media.net SDE-Intern + FTE Backend role was published in January 2024. The candidate successfully solved two problems in the online assessment and partially solved a third, leading to shortlisting for the next round. The candidate received positive feedback after the first algorithm round and advanced.

Online Assessment

The online assessment had 3 problems.

• Problem 1: Easy-level LeetCode question based on Maps.
• Problem 2: Hard-level LeetCode problem based on Tree + Priority Queue.
• Problem 3: Hard-level LeetCode problem based on DP + Bit Masking (solved ~40%).

Round 2: 1st Algorithm Round

After introductions, the interviewer directly presented problem-solving questions, assuming the candidate's proficiency in CS fundamentals.

• Coding Question: A dynamic programming problem.

The candidate initially proposed a brute-force O(N³) solution, then optimized it to O(N²) using dynamic programming. The interviewer sought further optimization. The candidate then explained an optimized solution using sets with a top-down dynamic programming approach and coded it on Google Docs. A thorough dry run with test cases was conducted, and the candidate felt confident about the solution. Key tips include practicing DSA and competitive programming, understanding time and space complexities, coding on Google Docs, starting with brute force, and explaining approaches before implementation.