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

Web Developer

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

Interview preparation journey

expand-icon
Preparation
Duration: 1 Month
Topics: DSA, OOPS, OS, DBMS, Computer Networks,
Tip
Tip

Tip 1 : Be Strong with DSA
Tip 2 : Be Strong with OOPS and Core CS Fundamentals

Application process
Where: Other
Eligibility: 7 CGPA
Resume Tip
Resume tip

Tip 1 : One Page Resume
Tip 2 : Highlight your coding profiles

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 Minutes
Interview date14 Jul 2021
Coding problem0

Online Test

4O MCQs

OS, (8 Questions)
DBMS, (8 Questions)
Networks, (8 Questions)
OOPS, (8 Questions)
Problem Solving, (8 Questions)

02
Round
Easy
Video Call
Duration60 Minutes
Interview date22 Jul 2021
Coding problem2

DSA problem solving

1. Length of the longest substring with the equal number of 1s and 0s.

Moderate
30m average time
70% success
0/80
Asked in companies
Media.netMcKinsey & CompanyFlipkart limited

You are given a binary string 'S' of length 'N'. Your task is to find the length of the longest substring with an equal number of 1s and 0s.

Note:

1. The given string will only contain 0 and 1.
Problem approach

An efficient solution is to use hashing. 
1) Traverse string and keep track of counts of 1s and 0s as count_1 and count_0 respectively. 
2) See if current difference between two counts has appeared before (We use hashing to store all differences and first index where a difference appears). If yes, then substring from previous appearance and current index has same number of 0s and 1s.

Try solving now

2. Count Substrings With K Ones

Moderate
23m average time
0/80
Asked in companies
OlaMedia.netAmazon

You are given a binary array 'arr' of length 'N' and an integer 'k'. Return the number of subarrays having the count of 1's equal to ‘k’.


Example :
Let the array 'arr' be: [1, 0, 1].
Let ‘k’ be: 1

Then the subarrays having the number of ones equal to ‘k’ will be: [1], [1,0], [0,1], [1].
Try solving now

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
Web Developer
3 rounds | 9 problems
Interviewed by Media.net
1829 views
0 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Media.net
1442 views
0 comments
0 upvotes
Web Developer
3 rounds | 4 problems
Interviewed by Media.net
622 views
0 comments
0 upvotes
Web Developer
2 rounds | 5 problems
Interviewed by Media.net
566 views
0 comments
0 upvotes