TIBCO Software India PVT LTD interview experience Real time questions & tips from candidates to crack your interview

Senior Java Developer

TIBCO Software India PVT LTD
upvote
share-icon
1 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Data Structures, Java, OOPS, System Design, Algorithms
Tip
Tip

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: Linkedin
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

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
Medium
Video Call
Duration50 minutes
Interview date17 Jan 2022
Coding problem2

Technical interview round with questions on Java and DSA mainly.

1. Merge Two Sorted Linked Lists

Moderate
15m average time
80% success
0/80
Asked in companies
CIS - Cyber InfrastructureAmazonApple

You are given two sorted linked lists. You have to merge them to produce a combined sorted linked list. You need to return the head of the final linked list.

Note:

The given linked lists may or may not be null.

For example:

If the first list is: 1 -> 4 -> 5 -> NULL and the second list is: 2 -> 3 -> 5 -> NULL

The final list would be: 1 -> 2 -> 3 -> 4 -> 5 -> 5 -> NULL
Problem approach

If one of the given lists is NULL, return the head of the other list.
The data of the head of the first node should be less than or equal to the data of the head of the second node.
Traverse both the linked lists simultaneously.
If the current node of the second linked list is smaller than the current node of the first linked list, insert the current node of the second linked list before the current node of the first linked list.
This is done by making the next node of the previous node of the first linked list as the current node of the second linked list. Further, make the next node of this node as the current node of the first linked list.
If the first list has reached the end and the second list hasn’t, point its next node to the head of the second list.

Try solving now

2. Java questions

Singelton pattern
how to implement a singleton in a multithreaded environment?

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
Support Engineer
3 rounds | 5 problems
Interviewed by TIBCO Software India PVT LTD
1044 views
0 comments
0 upvotes
Member of Technical Staff
2 rounds | 4 problems
Interviewed by TIBCO Software India PVT LTD
836 views
0 comments
0 upvotes
Member of Technical Staff
3 rounds | 4 problems
Interviewed by TIBCO Software India PVT LTD
714 views
0 comments
0 upvotes
SDE - 2
2 rounds | 4 problems
Interviewed by TIBCO Software India PVT LTD
917 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Senior Java Developer
3 rounds | 9 problems
Interviewed by Amdocs
1927 views
0 comments
0 upvotes