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

SDE - 1

Mindtree
upvote
share-icon
5 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Trees LinkedList Dynamic Programming LLD Arrays Strings
Tip
Tip

Tip 1 : Learn it well and practice it well
Tip 2 : Don't hurry to learn DSA
Tip 3 : Do Development Also

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

Tip 1 : Latest Technologies Project on Resume
Tip 2 : You know very well what you write on resume

Interview rounds

01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date28 Feb 2021
Coding problem1

Evening

1. Minimize The Maximum

Easy
15m average time
85% success
0/40
Asked in companies
OracleGartnerSAP Labs

You are given an array of N integers and an integer K. For each array element, you are allowed to increase or decrease it by a value k. The task is to minimize the difference between the maximum element and the minimum element after modifications.

Problem approach

The idea is to increase the first i towers by k and decrease the rest tower by k after sorting the heights, then calculate the maximum height difference.
This can be achieved using sorting.

Try solving now
02
Round
Easy
Online Coding Interview
Duration20 minutes
Interview date1 Mar 2021
Coding problem1

late night

1. DBMS Questions

SQL Joins
View 
Types of joins

03
Round
Easy
Online Coding Interview
Duration20 minutes
Interview date3 Mar 2021
Coding problem1

Late night

1. Conceptual Questions

Time and space complexity of merge sort.
Explain heap sort.
Explain abstraction.
Explain internal working of hashmap.
Design Parking lot.
Design Minstack.

04
Round
Medium
Online Coding Interview
Duration20 minutes
Interview date3 Apr 2021
Coding problem1

Late evening

1. 0 1 Knapsack

Easy
15m average time
85% success
0/40
Asked in companies
TwitterWalmartAmazon

A thief is robbing a store and can carry a maximal weight of W into his knapsack. There are N items and the ith item weighs wi and is of value vi. Considering the constraints of the maximum weight that a knapsack can carry, you have to find and return the maximum value that a thief can generate by stealing items.

Try solving now
05
Round
Easy
Online Coding Interview
Duration20 minutes
Interview date4 Mar 2021
Coding problem1

Late evening

1. Basic HR Questions

Weakness and strength.
Why we should hire you?

Here's your problem of the day

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

Skill covered: Programming

To make an AI less repetitive in a long paragraph, you should increase:

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 11 problems
Interviewed by Mindtree
853 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 4 problems
Interviewed by Mindtree
839 views
0 comments
0 upvotes
company logo
SDE - 1
5 rounds | 7 problems
Interviewed by Mindtree
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by Mindtree
1589 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114453 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57719 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34914 views
7 comments
0 upvotes