i
LTIMindtree
Filter interviews by
I applied via campus placement at The Yeshwantrao Chavan College of Engineering, Nagpur and was interviewed in Jun 2024. There were 3 interview rounds.
Asked basic aptitude questions.
MCQ on core cs subjects.
Merge sort is a divide and conquer algorithm that recursively splits an array into halves, sorts them, and then merges them back together.
Divide the array into two halves
Recursively sort each half
Merge the sorted halves back together
Merge sort has a time complexity of O(n log n) and a space complexity of O(n).
Time complexity of merge sort is O(n log n) where n is the number of elements in the array.
Space complexity of merge sort is O(n) as it requires additional space to store the temporary arrays during the merging process.
Merge sort is a divide and conquer algorithm that recursively divides the array into halves until each subarray contains only
I applied via campus placement at Haldia Institute of Technology (HIT) and was interviewed in Jun 2024. There were 3 interview rounds.
Technical ques,quant, logical reasoning
DBMS is a software system that manages databases, while RDBMS is a type of DBMS that stores data in a structured format using tables.
DBMS stands for Database Management System, while RDBMS stands for Relational Database Management System.
DBMS allows users to create, retrieve, update, and manage data in a database, while RDBMS uses a structured query language (SQL) to interact with the database.
RDBMS enforces referentia...
Confidence is belief in oneself based on experience and ability, while overconfidence is excessive belief in oneself without proper justification.
Confidence is earned through hard work and experience, while overconfidence is often based on arrogance and lack of self-awareness.
Confidence allows individuals to take risks and push themselves out of their comfort zone, while overconfidence can lead to reckless behavior and...
I applied via Campus Placement and was interviewed in Jun 2024. There were 3 interview rounds.
Various sessions on aptitude, advanced coding, and English.
What people are saying about LTIMindtree
I applied via Naukri.com and was interviewed in May 2024. There were 3 interview rounds.
They provide link for hackerthon test which is having two questions to write basic java programs
LTIMindtree interview questions for popular designations
I applied via Newspaper Ad and was interviewed in Jun 2024. There was 1 interview round.
DBMS stands for Database Management System. It is a software that manages databases and allows users to interact with data.
DBMS helps in storing, retrieving, and managing data efficiently.
It provides data security by allowing access control and data encryption.
DBMS ensures data integrity by enforcing constraints and maintaining consistency.
Examples of DBMS include MySQL, Oracle, SQL Server, and PostgreSQL.
DSA stands for Data Structures and Algorithms. Knapsack is a problem in combinatorial optimization.
DSA is a field of study that involves the design and analysis of data structures and algorithms.
Knapsack problem involves maximizing the value of items in a knapsack without exceeding its capacity.
There are two types of knapsack problems: 0/1 knapsack (where items cannot be broken) and fractional knapsack (where items can
Get interview-ready with Top LTIMindtree Interview Questions
I applied via Campus Placement and was interviewed in Jun 2024. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Jun 2024. There were 3 interview rounds.
Full of analytical and reasoning
I applied via Campus Placement and was interviewed in Jun 2024. There were 3 interview rounds.
2 hour test without coding test
In five years, I see myself as a senior engineer leading a team of talented individuals, working on innovative projects and continuously learning and growing in my career.
Leading a team of engineers
Working on innovative projects
Continuously learning and growing in my career
Hash-map uses a hash function to map keys to values for efficient retrieval.
Hash-map uses a hash function to compute an index where the value is stored
Collisions can occur when multiple keys hash to the same index
Hash-map typically uses linked lists or binary trees to handle collisions
Hash-map provides constant time complexity O(1) for insertion, deletion, and retrieval
A thread is a lightweight process that can run concurrently with other threads within the same process.
Threads allow for parallel execution of tasks within a single process.
Threads share the same memory space and resources of the process that created them.
Threads can be created in programming languages like Java, C++, and Python using built-in libraries or frameworks.
For example, in Java, you can create a thread by ext...
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.7k reviews
Rating in categories
5-10 Yrs
Not Disclosed
8-12 Yrs
Not Disclosed
Senior Software Engineer
21.3k
salaries
| ₹4.7 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.3 L/yr - ₹36 L/yr |
Senior Engineer
4.4k
salaries
| ₹4.2 L/yr - ₹16.5 L/yr |
Cognizant
Capgemini
Accenture
TCS