i
LTIMindtree
Filter interviews by
I applied via campus placement at Nitte Meenakshi Institute of Technology, Bangalore and was interviewed in Feb 2022. There were 2 interview rounds.
It consists of aptitude, basic technical questions and 4 coding questions
Program to print a pattern of stars in a pyramid shape
Use nested loops to print the pattern
The outer loop controls the number of rows
The inner loop controls the number of stars in each row
Asked about resume based questions
Then, asked about basic c,c++ questions and oops concept
Then scenario based questions and finally ended with asking previous day solved coding questions
I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.
This was an elimination round
Easy to Intermediate Question
I applied via Recruitment Consulltant and was interviewed before May 2023. There was 1 interview round.
What people are saying about LTIMindtree
I applied via Telegram and was interviewed in Dec 2021. There was 1 interview round.
A linked list is a linear data structure where each element is a separate object with a pointer to the next element.
Consists of nodes that contain data and a pointer to the next node
Can be singly or doubly linked
Used for dynamic memory allocation, implementing stacks and queues, and more
Bubble sorting is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Bubble sorting is a comparison-based algorithm.
It is named as bubble sort because smaller elements bubble to the top of the list.
It has a worst-case and average-case time complexity of O(n^2).
Example: [5, 3, 8, 4, 2] -> [3, 5, 8, 4, 2] -> [3, 5, 4, 8, 2] -> [3, 5,...
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Bubble sort is a comparison-based algorithm
It works by comparing each pair of adjacent elements and swapping them if they are in the wrong order
The algorithm repeats this process until no more swaps are needed
It has a worst-case and average complexity of O(n^2)
Exampl...
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
It divides the input into a sorted and an unsorted region.
It repeatedly extracts the largest element from the unsorted region and inserts it into the sorted region.
It has a time complexity of O(n log n) and is not stable.
Example: [8, 5, 3, 1, 9, 6, 0, 7, 4, 2] -> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
The fastest sorting algorithm is QuickSort.
QuickSort has an average time complexity of O(n log n).
It is a divide and conquer algorithm that recursively partitions the array.
It is widely used in practice due to its efficiency.
Other fast sorting algorithms include MergeSort and HeapSort.
Constructor is a special method that is called when an object is created.
Constructors have the same name as the class they belong to.
They are used to initialize the object's state.
They can be overloaded to accept different parameters.
If a class does not have a constructor, a default constructor is provided by the compiler.
Garbage Collector is an automatic memory management system that frees up memory occupied by objects that are no longer in use.
Garbage Collector is a part of the Java Virtual Machine that automatically manages memory allocation and deallocation.
It identifies objects that are no longer in use and frees up the memory occupied by them.
Garbage Collector helps prevent memory leaks and improves the performance of the applicat...
Run-Time polymorphism is the ability of an object to take on many forms at runtime.
It is achieved through method overriding and virtual functions.
It allows a subclass to provide its own implementation of a method that is already provided by its parent class.
It is also known as dynamic polymorphism.
Example: Animal class with a virtual method 'makeSound', and subclasses Dog and Cat that override the 'makeSound' method.
Wh...
LTIMindtree interview questions for popular designations
I applied via Walk-in and was interviewed before Aug 2022. There were 4 interview rounds.
Convert integer value to corresponding roman number .
Constructor is a special type of method used to initialize objects in Java.
Constructors have the same name as the class they belong to.
They do not have a return type, not even void.
The 'this' keyword in Java is used to refer to the current object.
Example: public class Car { public Car() { this.make = 'Toyota'; } }
Get interview-ready with Top LTIMindtree Interview Questions
I applied via PrepInsta and was interviewed in Sep 2021. There were 3 interview rounds.
The first round is divided into two major sections, one is cognitive aptitude and the other is coding round.
In Aptitude section there are questions from numerical aptitude and verbal. There are questions from number systems, time and work, clock, LCM and HCF etc.
The questions are moderate level.
In coding there were 5 questions, 2 easy, 2 med and 1 hard.
To eliminate repeated array from a given string
Convert the string to an array using split() method
Use Set object to remove duplicates from the array
Convert the array back to string using join() method
It was conducted on webex platform and the duration was 25 minutes. It is an interview round, and they asked a lot of technical and coding questions in this round.
I am a software engineer with 5 years of experience in developing web applications using Java and JavaScript.
I have a Bachelor's degree in Computer Science from XYZ University.
I have worked on projects using Spring Boot, React, and Angular frameworks.
I am experienced in Agile methodology and have worked in Scrum teams.
I am passionate about learning new technologies and solving complex problems.
In my free time, I enjoy ...
I am comfortable with multiple coding languages including Java, Python, and C++.
Proficient in Java, Python, and C++
Experience with web development languages such as HTML, CSS, and JavaScript
Familiarity with scripting languages like Bash and PowerShell
Comfortable with SQL and NoSQL databases
Knowledge of machine learning libraries like TensorFlow and Keras
A linked list is a linear data structure where each element is a separate object with a pointer to the next element.
Consists of nodes that contain data and a pointer to the next node
Can be singly or doubly linked
Used for dynamic memory allocation, implementing stacks and queues, and more
Sorting algorithms are used to arrange data in a specific order. There are various types of sorting algorithms.
Types of sorting algorithms include: bubble sort, selection sort, insertion sort, merge sort, quick sort, heap sort, counting sort, radix sort, and bucket sort.
Bubble sort compares adjacent elements and swaps them if they are in the wrong order.
Selection sort selects the smallest element and swaps it with the ...
After successful clearance of round 2 you will get a chance to appear for round 3 i.e online HR interview.
This is also performed on the WebEx platform. This round usually goes for about 15-18 min. In this round they asked my hobbies, my strength and basic HR questions. Then they asked what you know about the company I was prepared for this question so I answered very well, he was impressed.
I applied via Campus Placement and was interviewed in May 2022. There were 4 interview rounds.
Easy to clear the aptitude round with some preparations.
I applied via Company Website and was interviewed before Mar 2023. There were 3 interview rounds.
Mcq based on java, IT and maths
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
Aptitude c c++ sql ds
Some of the top questions asked at the LTIMindtree interview for freshers -
The duration of LTIMindtree interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 191 interviews
Interview experience
based on 20.8k reviews
Rating in categories
5-12 Yrs
Not Disclosed
5-10 Yrs
Not Disclosed
8-12 Yrs
Not Disclosed
Senior Software Engineer
21.3k
salaries
| ₹5.1 L/yr - ₹18.7 L/yr |
Software Engineer
16.2k
salaries
| ₹2 L/yr - ₹10 L/yr |
Module Lead
6.7k
salaries
| ₹7 L/yr - ₹25.5 L/yr |
Technical Lead
6.4k
salaries
| ₹9.4 L/yr - ₹36 L/yr |
Senior Engineer
4.4k
salaries
| ₹4.2 L/yr - ₹16.4 L/yr |
Cognizant
Capgemini
Accenture
TCS