i
Think Future Technologies
Filter interviews by
Clear (1)
I applied via Indeed and was interviewed in Sep 2024. There were 4 interview rounds.
I applied via Approached by Company and was interviewed before Dec 2023. There were 4 interview rounds.
2 sum program from Geeks for Geeks
Lazy loading delays loading of related data until it is specifically requested, while eager loading loads all related data upfront. N+1 problem occurs when lazy loading results in multiple additional queries being made.
Lazy loading is used to improve performance by only loading related data when needed
Eager loading loads all related data upfront to reduce the number of queries made
N+1 problem occurs in lazy loading whe...
I was interviewed before Jan 2024.
Logical reasoning questions (1-1.5 hours)
DSA Questions(2 hours)
Think Future Technologies interview questions for designations
Nothing
I applied via Walk-in and was interviewed before Mar 2022. There were 3 interview rounds.
Java and python test was there
I was interviewed before Sep 2020.
Round duration - 70 Minutes
Round difficulty - Hard
Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...
The task is to distribute candies to students based on their performance while minimizing the total candies distributed.
Create an array to store the minimum candies required for each student.
Iterate through the students' ratings array to determine the minimum candies needed based on the adjacent ratings.
Consider both left-to-right and right-to-left passes to ensure fair distribution.
Keep track of the total candies dist
You are given a sequence of numbers, ARR
. Your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Use Divide and Conquer approach to recursively divide the input array into two halves.
Merge the sorted halves to produce a completely sorted array.
Ensure the implementation handles the constraints specified in the problem statement.
Example: For input [3, 1, 4, 1, 5], the output should be [1, 1, 3, 4, 5].
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Do not put false things on resume.
Tip 2 : Have some projects on resume.
Top trending discussions
I applied via Walk-in and was interviewed before Jul 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed before Jan 2021. There were 2 interview rounds.
Good
I was interviewed in Sep 2016.
Developed a web-based project management tool for a software development company.
Used Agile methodology for development
Implemented features like task assignment, progress tracking, and team collaboration
Integrated with third-party tools like GitHub and Slack
Designed a user-friendly interface with responsive design
Deployed on AWS using EC2 and RDS
My CV showcases my experience in software development, including projects in Java, Python, and web development.
Experience in Java, Python, and web development
Worked on projects involving database management systems
Familiar with Agile development practices
based on 6 interviews
1 Interview rounds
based on 17 reviews
Rating in categories
Software Engineer
122
salaries
| ₹0 L/yr - ₹0 L/yr |
Test Engineer
52
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
47
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Test Engineer
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
36
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
HCLTech