Think Future Technologies Software Developer Intern Interview Questions and Answers

Round duration - 40 minutes
Round difficulty - Medium

It was early in the morning around 8:00AM-8:40AM. Platform used was hackerrank and the questions asked were of moderate level.

Q1. 
Split Array with Equal Sums Problem Statement
Given an array 'ARR' of size 'N', determine if there exists a triplet (i, j, k) satisfying the conditions: 0 < i , i + 1 < j , j + 1 < k and k < N...read more
Ans. 
The problem involves determining if there exists a triplet in an array such that the sums of specific subarrays are equal.
• Iterate through all possible triplets (i, j, k) within the array.

• Calculate the sums of the subarrays [0, i - 1], [i + 1, j - 1], [j + 1, k - 1], [k + 1, N - 1] for each triplet.

• Check if any triplet satisfies the condition of having equal sums for the subarrays.

• Return 'True' if such a triplet exists,
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

It was in the evening around 4;00PM-4:20PM. This round was very interesting as it focuses more about your personality rather than your knowledge which has been already checked in previous rounds.