Media.net Software Services (India) Software Developer Interview Questions, Process, and Tips

It will be around 3 hours and 2 questions of leetcode hard difficulty will be asked in the interview and 1 question is of codeforces 2400+ difficulty question.

Q1. 1-2 DSA medium-hard difficulty question will be asked.
Add your answer
Q2. CS fundamentals in depth had been asked in the ending of the interview.
Add your answer

Q1. System Design problem was asked.
Add your answer

Q1. This is a cultural fit round. Common HR question was asked.
Add your answer

Held on interview bit. 3 ques were asked. Questions were from range query and DP.

Q1. 1 Hard DSA question. Given a sequence of positive numbers, make it a non-decreasing sequence. Operation allowed: adjacent elements can be added to form a single element. What is the minimum no of operatio...read more
Add your answer

Q1. Asked two array and string dsa questions of medium-hard level
Add your answer

Round duration - 90 Minutes
Round difficulty - Hard

The test was at 6 pm with cam on and in fullscreen mode.

Q1. 
Interleaving Two Strings Problem Statement
You are given three strings 'A', 'B', and 'C'. Determine if 'C' is formed by interleaving 'A' and 'B'.
String 'C' is an interleaving of 'A' and 'B' if the lengt...read more
Ans. Brute-force
Approach:
In order to solve this problem, let us solve a smaller problem first. Let’s assume that the length of the string A and B is 1 and the length of the string C is 2. Now in order to check whether C is formed by interleaving A and B or not, we consider the last character of string C and if this character matches neither with the character of the string A nor with the character of string B, then we retur...read more
Answered Anonymously
Add your answer
Q2. 
Construct Binary Tree from Inorder and Postorder Traversal
Given two lists representing the inorder and postorder traversal of a binary tree of integer type with 'N' nodes, construct the binary tree and r...read more
Ans. Depth First Search
To solve this problem, first, we take the last element in the ‘POST_ORDER’  array/list as the root because we know post-order traversal is like the first traverse of the left subtree nodes and then the right subtree node at the end traverse root. Hence the root is present as the last element of post-order traversal. Then we find the position of the root data in the ‘IN_ORDER’ array/list. Let’s as...read more
Answered Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

At 10:00 AM. Interviewer was very friendly and young but his cam was off.

Q1. 
Find Paths in Binary Tree
Kevin has sketched a series of integers, forming a diagram that represents a binary tree. Challenged by a friend, Kevin needs to find all paths from the root to the leaf where th...read more
Ans. Depth First Search and Backtracking
The basic idea is to perform Depth First Search on the given binary Tree and keep track of the current sum and whenever reached the lead node check if the sum becomes equal to the ‘K’ then pick this path, otherwise just backtrack to the previous node and exclude the value of this leaf node from the current sum.
 
We are here using a helper function that is recursive in nature and i...read more
Answered Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

It was held at 4 p.m. The interviewer was senior compared to the one in the previous round. Also, his cam was also on, but he wasn't speaking much and neither giving any expressions.

Q1. 
Boxes of Power Problem Statement
Given a set of boxes represented by an array gainPower, where each box has a certain power value, along with an initial power value 'power', your task is to maximize the t...read more
Ans. Two Pointers
The idea is to sort the given array ‘gainPower’ and then use the two-pointer approach. Use two pointers ‘i’ and ‘j’ - one at the beginning and the other at the end of the array ‘gainPower’.
If the current power is greater than the power of the ith box, then increase the score by 1, subtract the power of the ith box from the current power and remove the box from the set. Otherwise, if the score is greater tha...read more
Answered Anonymously
Add your answer