Media.net

It was First time i think that Media.net came in Over College for Hiring.

As we all know. it is the most Reputed Company such that you can compare its selection process with Google or Microsoft.

Role - ASDE - I (Associate Software Developer Engineer - 1)

Total Rounds - 3 (1 Aptitude Test, 2 Algorithmic rounds and HR call)

Round 1 - Coding Test

it was taken on Interview Bit Platform

and Having 3 Medium - Hard Types of Question.

I able to solve 2 Completely and 1 Partially.

and so i get Shortlisted for next round.

They shortlisted Total 15 Students Only.

Round 2 - Algorithmic Round 1

In this round The Interviewer gave me only one coding Question

that was given below.

Question:

Given num array and index array at every index divide array and collect maximum sum of division in Output array.

Example:

Input:

Num = [1, 2, 3, 4, 5, 6]

Index = [2, 4, 3, 5, 1, 0]

Output:

Ans: [15, 6, 6, 3, 1, 0]

Explanation: 

first Index is 2 so Num array will get divided 1, 2 and 4, 5, 6

so 2 division we have in which 2nd has more max sum i.e 4+5+6=15 so we added 15 in output array.

second index is 4 now array will not going to have 3 divisions i.e "1, 2" ,  “4”   and “6” in which 3rd division have maximum sum i.e 6 so we added into our output array

so on…

This looks simple problem but it is Not.

after applying different techniques I solved the Problem.

He told me to write the code. The code was too  complex so i just written half of it and in between i explained him all steps so understood that i can solve the question.

They also asked few Oops Questions and CN Questions and i able to answer correctly.

I Was the only one who cracked this round and qualified for last Interview round.

Round 3 - Algorithmic Round 2

This round was too difficult for me becase it was totally out off syllabus for me basically.

I never Studied Dynamic Programming that time.

This round was similar like Previous round Just question was Different.

Question:

Given different (source, destination) Locations were the Delivery App has to deliver the packages.

with minimum possible distance.

you have given 2 drones to deliver that packages. you can use any drone at any time. 

note - starting point of any drone cost zero distance.

Example: 

Input:

{

[1, 10]

[2, 5]

[6, 3]

[10, 3]

}

Output:

24

note- first drone start at 1 and 2nd drone will start at 2.

I was not able to solve it efficiently. I solved it with Brute force which was not expected by my Interviewer so he Rejected me in this round but It was Great Experience for me to Undergo such Great People to Interview me.

Hope you Get Everything you were looking at here. still have any doubt then reach me on linkedin i will definitely answer your Query.

Linkedin: https://www.linkedin.com/in/aniketvyawahare/