TIBCO Software India PVT LTD interview experience Real time questions & tips from candidates to crack your interview
Junior Engineer Associate
TIBCO Software India PVT LTD
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 2.5 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Interview rounds
01
Round
Easy
Video Call
Duration50 minutes
Interview date4 Jul 2022
Coding problem2
Technical round based on DSA.
1. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach
One way is to use recursion to reverse the list. Divide the linked list in two halves, the first node and the rest of the list. Reverse the second half using recursion and append the first half, that is the first node at the end of the reversed linked list. Return the head of the reversed linked list.
2. Maximum Subarray Sum
Moderate
35m average time
81% success
0/80
Asked in companies
You are given an array 'arr' of length 'n', consisting of integers.
A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.
Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.
The sum of an empty subarray is 0.
Example :
Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]
Output: 11
Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Problem approach
Divide the array into 2 halves.
Get the answer of left and right parts of the array by recursion.
Get the answer of Maximum subarray sum such that the subarray crosses the midpoint.
To find the maximum subarray sum of crossing points we need to find the maximum sum starting from mid point and ending at some point on the left of mid, then find the maximum sum starting from mid + 1 and ending with some point on right of mid + 1. Total sum would be the sum of both left part and right part.
Maximum of all three sums would be the final answer.
02
Round
Easy
Video Call
Duration45 minutes
Interview date4 Jul 2022
Coding problem2
Technical interview round with questions on OOPs concepts mainly.
1. OOPs Questions
Difference between C and C++
Java questions on multi threading, exception handling.
2. Data structure based question
Distinguish between stack and queue.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
Member of Technical Staff
3 rounds | 6 problems
Interviewed by TIBCO Software India PVT LTD
Selected 
611 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 2 problems
Interviewed by TIBCO Software India PVT LTD
Rejected
689 views
0 comments
0 upvotes
Member of Technical Staff
1 rounds | 2 problems
Interviewed by TIBCO Software India PVT LTD
Rejected
575 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3452 views
0 comments
0 upvotes