Media.net interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Media.net
upvote
share-icon
2 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 12 months
Topics: Data Structures, Algorithms, Web Development, Data Science and Machine Learning, Core Subjects(DBMS, Computer Network, OS)
Tip
Tip

Tip 1 : Keep practicing DS and Algos cover all essential topics.
Tip 2 : Have basic knowledge of Core subjects.
Tip 3 : Do at least 2 projects.

Application process
Where: Referral
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Display your skills and your achievements.
Tip 2 : Have some projects on your resume.

Interview rounds

01
Round
Medium
Video Call
Duration60 minutes
Interview date7 Jun 2019
Coding problem1

First basic introduction (10 minutes)
2 questions were asked. (45 Minutes)
Conclusion (5 min)

1. Maximum Product Subarray

Moderate
25m average time
75% success
0/80
Asked in companies
InnovaccerAmazonMicrosoft

You are given an array “arr'' of integers. Your task is to find the contiguous subarray within the array which has the largest product of its elements. You have to report this maximum product.

An array c is a subarray of array d if c can be obtained from d by deletion of several elements from the beginning and several elements from the end.

For e.g.- The non-empty subarrays of an array [1,2,3] will be- [1],[2],[3],[1,2],[2,3],[1,2,3]. 
For Example:
If arr = {-3,4,5}.
All the possible non-empty contiguous subarrays of “arr” are {-3}, {4}, {5}, {-3,4}, {4,5} and {-3,4,5}.
The product of these subarrays are -3, 4, 5, -12, 20 and -60 respectively.
The maximum product is 20. Hence, the answer is 20.
Follow Up:
Can you solve this in linear time and constant space complexity?
Problem approach

Came up with a recursive solution that wasn't fast enough just added memorization logic to optimize my existing code. That was the solution actually.

Try solving now
02
Round
Hard
Video Call
Duration90 minutes
Interview date7 Jun 2019
Coding problem1

Timing: Evening
In this round interviewer mostly covers all the core subjects plus my projects(detailed discussion).
It took around 30 minutes.
Then he asked me to design typeahead(60 minutes).

1. System Design Questions

LSTM vs RNN?
What is the vanishing gradient problem and how does LSTM solve this issue better than RNN?
Design Typeahead Suggestion?

Problem approach

Tip 1 : If you've done some project you should be confident about that, you should be able to answer every question related to that project.
Tip 2 : For design problems always ask beforehand about all the requirements and what to implement.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you remove whitespace from the start of a string?

Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 6 problems
Interviewed by Media.net
4659 views
1 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Media.net
2262 views
0 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Media.net
1441 views
0 comments
0 upvotes
SDE - 1
4 rounds | 6 problems
Interviewed by Media.net
0 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
115097 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
58237 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
35147 views
7 comments
0 upvotes