Ubique Systems Software Developer Interview Questions and Answers

Q1. Why do you think you would be a good fit at our company
Add your answer
Q2. Lets say your boss is asking you to lie for the benefit of the company will you do it
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

It was an online aptitude test on Amcat platform. The overall test was easy with most of the questions testing basic mathematics and logical thinking. The test could be taken at your own convenience and was online proctored.

Q1. 
Nth Fibonacci Number Problem Statement
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.
Input:
...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round was technical in nature with a manager taking it. It was in the afternoon.

Round duration - 90 minutes
Round difficulty - Medium

This was the final round with the co-founder. They were very relaxed and made me feel comfortable. It was late at night because of US time. I was asked puzzles and basic analytics terms.

Q1. How would you cut a cylindrical cake into 8 equal pieces using just 3 straight cuts of a knife?
Add your answer

Q1. Can you tell me about a time when you faced a challenging situation at work and how you resolved it?
Ans. 
I faced a challenging situation when a website I was working on crashed during a major event.
• I quickly identified the issue and found a solution to fix it.

• I communicated the problem and solution to my team and the client.

• I worked overtime to ensure the website was up and running before the event ended.

• I implemented measures to prevent similar issues from happening in the future.
Answered by AI
Add your answer
Q2. How do you handle working under pressure and meeting tight deadlines?
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round consist of two questions and we have to solve both the questions to qualify for the next round.

Round duration - 40 minutes
Round difficulty - Easy

A single coding question was asked that had a lot of corner cases.

Round duration - 45 minutes
Round difficulty - Easy

It had 3 coding questions followed by basic concepts of DP.

Q1. How do you find the maximum difference between a node and its descendant in the same path in a binary tree?
Ans. 
To find the maximum difference between a node and its descendant in the same path in a binary tree, we can perform a depth-first search while keeping track of the minimum value encountered so far.
• Perform a depth-first search on the binary tree, keeping track of the minimum value encountered so far in the path.

• At each node, calculate the difference between the current node value and the minimum value encountered so far ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It had 2 coding questions which were of good level.

Q1. How can you find a Minimum Spanning Tree (MST) from a given graph using Kruskal’s algorithm?
Ans. 
Kruskal's algorithm finds MST by sorting edges, adding smallest edge that doesn't create a cycle, repeat until all vertices are connected.
• Sort all edges in non-decreasing order of their weights.

• Initialize an empty graph to store the MST.

• Iterate through sorted edges and add the smallest edge that doesn't create a cycle in the MST.

• Repeat until all vertices are connected in the MST.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was the last round.