TIBCO Software Associate Software Engineer Interview Questions and Answers

Code to delete duplicate nodes in a sorted linked list

• Traverse the linked list and compare adjacent nodes

• If nodes are equal, delete one of them

• Repeat until all duplicates are removed

Printing all root to leaf paths in a binary search tree

• Traverse the tree recursively and keep track of the current path

• When a leaf node is reached, add the current path to the list of paths

• Print all the paths in the list

• Use an array of strings to store the paths

Find two integers in an array whose sum is closest to zero.

• Sort the array in ascending order.

• Initialize two pointers at the beginning and end of the array.

• Move the pointers towards each other until the sum is closest to zero.

Count set bits in a 32-bit integer in linear time

• Use bit manipulation to count set bits

• Divide the integer into 16-bit chunks and count set bits in each chunk

• Use lookup tables to count set bits in each 8-bit chunk

• Use parallel processing to count set bits in multiple integers simultaneously

To determine the width of a binary tree using breadth-wise traversal, we need to count the number of nodes at each level.

• Perform a breadth-first traversal of the binary tree

• Count the number of nodes at each level

• Keep track of the maximum number of nodes seen at any level

• Return the maximum number of nodes seen

Files are preferred over databases for certain types of data and applications.

• Files are faster for small amounts of data.

• Files are easier to manage and backup.

• Files are more flexible for certain types of data, such as images or videos.

• Databases are better for complex data relationships and queries.

• Databases are more secure and scalable for large amounts of data.

• The choice between files and databases depends on the spec

I have contributed to my projects by developing and implementing new features, fixing bugs, and improving overall performance.

• Developed and implemented new features

• Fixed bugs and issues

• Improved overall performance

• Collaborated with team members to ensure project success

• Provided technical support and troubleshooting assistance

I encourage open communication and collaboration to identify and solve problems within the team.

• Encourage open communication and active listening

• Identify the root cause of the problem

• Brainstorm solutions as a team

• Assign tasks and follow up on progress

• Evaluate the effectiveness of the solution

• Provide constructive feedback

• Celebrate successes and learn from failures

I expect a company that values innovation, growth opportunities, and work-life balance.

• Opportunities for professional development and growth

• A culture that encourages innovation and creativity

• A healthy work-life balance

• Clear communication and transparency

• Competitive compensation and benefits

• Collaborative and supportive team environment

Yes, I am planning to pursue a Master's degree in Computer Science.

• I am interested in specializing in Artificial Intelligence.

• I have already researched and shortlisted a few universities.

• I plan to apply for the next academic year.

• I believe higher studies will help me gain a deeper understanding of the field and advance my career.

I am very flexible in my professional life and can adapt to changing situations easily.

• I am open to learning new technologies and skills

• I can work in different environments and with different teams

• I am willing to take on new challenges and responsibilities

• I can adjust my work schedule to meet project deadlines

• I am comfortable with remote work and flexible work arrangements

I am a software engineer with experience in developing web applications and a passion for problem-solving.

• Experienced in developing web applications using languages such as Java, Python, and JavaScript

• Proficient in using frameworks such as Spring, Django, and React

• Strong problem-solving skills and ability to work in a team environment

• Passionate about learning new technologies and keeping up with industry trends

To determine if a point is inside a polygon, use the ray casting algorithm.

• Create a line from the point to a point outside the polygon

• Count the number of times the line intersects with the polygon edges

• If the count is odd, the point is inside the polygon; otherwise, it is outside

The four storage classes in C are auto, register, static, and extern.

• Auto: default storage class for all local variables

• Register: used to define local variables that should be stored in a register instead of RAM

• Static: used to define local variables that retain their value between function calls

• Extern: used to declare a global variable that is defined in another file

i is stored in global data segment, j is stored in stack, k is stored in heap.

• i is a global variable and is stored in the global data segment

• j is a local variable and is stored in the stack

• k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()

Use a hash table to store the words and check for existence in constant time.

• Create a hash table with the words as keys and a boolean value as the value.

• For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.

• Alternatively, use a set data structure to store only the unique words and check for existence in the set.

Return all root to leaf node paths in a binary tree with row, col and value.

• Traverse the binary tree recursively and keep track of the current path.

• When a leaf node is reached, add the path to the result array.

• Include row, col and value of each node in the path.

• Use an array of strings to store the paths.

To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.

• Create a separate stack to keep track of maximum values

• Push the maximum value onto the stack whenever a new maximum is encountered

• Pop the maximum value stack whenever the top element of the main stack is popped

• Return the top element of the maximum value stack to get the maximum value in O(1)

To get max element from a queue in O(1) time complexity

• Maintain a separate variable to keep track of the maximum element in the queue

• Update the maximum element variable whenever a new element is added or removed from the queue

• Return the maximum element variable when getMax() function is called

Find the Next Greatest Element to the right for each element in an array of strings.

• Iterate through the array from right to left

• Use a stack to keep track of elements

• Pop elements from stack until a greater element is found

• If no greater element is found, assign -1

• Return the result array

To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.

• Identify and remove parenthesis around single variables or constants

• Identify and remove parenthesis around expressions with only one operator

• Identify and remove parenthesis around expressions with operators of equal precedence

• Identify and remove parenthesis around expressions with operators of different ...read more

Find the maximum product of three integers in an array.

• Sort the array in descending order.

• Check the product of the first three numbers and the product of the first and last two numbers.

• Return the maximum of the two products.

Find length of longest consecutive sub array forming an AP from given array of integers.

• Sort the array in ascending order

• Iterate through the array and find the longest consecutive sub array forming an AP

• Use a variable to keep track of the length of the current consecutive sub array forming an AP

• Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far