Open In App

Medlife Interview Experience

Improve
Improve
Like Article
Like
Save
Share
Report

Round 1:

This round consisted of an online test on Hackerrank. There were 10 MCQs and 2 Programming questions. The MCQs had questions from OS, SQL, aptitude and Networks.

The first coding problem was – Given an array, find the no. of segments with the leftmost and rightmost element being the largest element.

Second problem – Given a string, find the rank of the string in the set of all its sub-strings.

12 students cleared this round.

Round 2:

F2F interview:- 2 problems based on data structures and algorithms.

  1. https://stackoverflow.com/questions/20125805/reverse-stack-without-using-any-data-structure
  2. given an array, find the maximum product of 2 elements .     The problem can be solved in O(n) time and O(1) space.

Few questions from OS and Networks.

6 students cleared this round.

Round 3:

F2F interview:- 2 problems based on data structures and algorithms.

  1. Divide a tree (normal binary tree) into two halves such that the difference between the sum of nodes of both the sub trees is minimum.
  2. Given a file with large number of strings. The length of each string is also huge i.e. none of the strings can be loaded in the RAM. Find the two strings which are similar in less than O(n^2) time.

3 students were finally selected including me.


Last Updated : 18 Aug, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads