i
Think Future
Technologies
Filter interviews by
I appeared for an interview in Nov 2020.
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.
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...
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,...
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.
Tip 1 : Practice aptitude as much as possible.
Tip 2 : Practice more and more questions related to your skills.
Tip 3 : Proper revision is must.
Tip 1 : It should not be too long or too short.
Tip 2 : Each skill and project should be reflected properly in your resume.
Top trending discussions
I applied via Walk-in and was interviewed before Mar 2021. There were 3 interview rounds.
Aptitude test
Current affairs
I applied via Campus Placement and was interviewed in Nov 2024. There was 1 interview round.
Easy to medium leetcode questions
I appeared for an interview in Nov 2024, where I was asked the following questions.
I applied via Google and was interviewed in Aug 2023. There were 4 interview rounds.
Coding questions about array and string.
Cosing questions about sql and ds.
posted on 17 Oct 2024
I applied via Walk-in
To implement a queue using a stack, use two stacks and simulate the queue operations.
Use two stacks, one for enqueue operation and one for dequeue operation.
For enqueue operation, simply push elements onto the stack used for enqueueing.
For dequeue operation, if the dequeue stack is empty, pop all elements from enqueue stack and push onto dequeue stack.
Then pop from the dequeue stack to simulate dequeue operation.
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
Create a Node class with data and next pointer
Initialize a head pointer to null
Add nodes by updating next pointers
Traverse the list by following next pointers
I appeared for an interview in Jul 2024.
Leet code medium level question
Guide to completing a RESTful API coding task with essential pointers and examples.
Understand REST principles: Use HTTP methods (GET, POST, PUT, DELETE) appropriately.
Define clear endpoints: Example - /api/users for user-related operations.
Implement status codes: Use 200 for success, 404 for not found, 500 for server errors.
Use JSON for data interchange: Ensure requests and responses are in JSON format.
Consider authent...
Managing multiple events on a single variable requires careful synchronization to ensure accurate results.
Use locks or mutexes to prevent race conditions when accessing the variable.
Implement event debouncing to limit the frequency of updates, ensuring only the final event is processed.
Utilize a queue to handle events sequentially, processing them one at a time to maintain accuracy.
Consider using atomic operations for ...
Fizz buzz question and array related
I applied via Referral and was interviewed before Aug 2021. There were 2 interview rounds.
General topics like mathe, English, social etc
based on 1 review
Rating in categories
Software Engineer
116
salaries
| ₹4.7 L/yr - ₹18.4 L/yr |
Senior Software Engineer
55
salaries
| ₹9.5 L/yr - ₹33 L/yr |
Test Engineer
54
salaries
| ₹4 L/yr - ₹12 L/yr |
Senior Test Engineer
45
salaries
| ₹7 L/yr - ₹27 L/yr |
Software Developer
41
salaries
| ₹3.6 L/yr - ₹12 L/yr |
Maxgen Technologies
JoulestoWatts Business Solutions
Value Point Systems
F1 Info Solutions and Services