Mindtree private limited interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Mindtree private limited
upvote
share-icon
3 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 Months
Topics: Data structures, Algorihtms, Database, OOPS, Operating System, Computer Networks
Tip
Tip

Tip 1 : Study core CS subjects like OS, CN, DBMS etc properly
Tip 2 : Be ready for the basic DSA question
Tip 3 : Try to write code on paper and then code on IDE. They usually ask to write code on white paper

Application process
Where: Campus
Eligibility: 7+ CGPA to be eligible for their written test
Resume Tip
Resume tip

Tip 1 : Mention your projects properly
Tip 2 : Do mention core CS subjects as well. Don't neglect them

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 Minutes
Interview date20 Sep 2019
Coding problem1

MCQ mixture of core CS subjects and one coding question

1. Third greatest element

Easy
20m average time
80% success
0/40
Asked in companies
OlaWalmartOracle

Given an array/list 'ARR' of ‘N’ distinct integers, you are supposed to find the third largest element in the given array 'ARR'.

Problem approach

I took three variables to store max, 2nd max and 3rd max elements while I kept on traversing the array. The time compx. will be O(n) and space compx will be O(1).

Try solving now
02
Round
Medium
Face to Face
Duration40 Minutes
Interview date24 Sep 2019
Coding problem1

This round was mixture of DSA based questions followed by Computer networks questions. I was asked to write the code on paper and then walkthrough the code.

1. Find Duplicates In Array

Easy
15m average time
90% success
0/40
Asked in companies
LinkedInBNY MellonFreshworks

You are given an array/list 'ARR' consisting of N integers, which contains elements only in the range 0 to N - 1. Some of the elements may be repeated in 'ARR'. Your task is to find all such duplicate elements.

Note:
1. All the elements are in the range 0 to N - 1.
2. The elements may not be in sorted order.
3. You can return the duplicate elements in any order.
4. If there are no duplicates present then return an empty array.
Problem approach

I used Hashset to solve this problem. Java was my primary language to code and I prefered to solve in it. Keep on adding elements from array in Hashset and the element that returns false means it's already present in hashset and is hence duplicate. Print such element.

Try solving now
03
Round
Easy
HR Round
Duration15 Minutes
Interview date25 Sep 2019
Coding problem0

Basic HR questions like why Mindtree, do you have any other offers currently etc.

Here's your problem of the day

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

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
Software Engineer
3 rounds | 7 problems
Interviewed by Mindtree private limited
1267 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree private limited
839 views
0 comments
0 upvotes
Software Engineer
3 rounds | 3 problems
Interviewed by Mindtree private limited
1174 views
0 comments
0 upvotes
Software Engineer
4 rounds | 2 problems
Interviewed by Mindtree private limited
1545 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7874 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
9973 views
1 comments
0 upvotes
company logo
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
4310 views
1 comments
0 upvotes