UBS Software Engineer Interview Questions and Answers

1 coding question based on DP for 25 minutes and 30 MCQs on Java , OOPS and code snippet questions also some basic questions based on trees like number of leaf nodes in a complete binary tree with n nodes.

Q1. Write code for finding palindrome of a string
View 1 more answer
Q2. What is dynamic memory allocation in Java
Add your answer
Q3. You are designing an e commerce website which database will you choose and what will you use for authentication given that you can't use JWT or even third party like Google authentication
Ans. 
I would choose a relational database like MySQL and implement a custom authentication system using session management.
• Choose a relational database like MySQL for storing user data, product information, and orders.

• Implement a custom authentication system using session management to securely authenticate users without JWT or third-party services.

• Use encryption techniques to store and validate user passwords securely.

• Util...read more
Answered by AI
Add your answer

Q1. How do you define clean code?
Ans. 
Clean code is well-organized, easy to read, and maintainable code that follows best practices.
• Clean code is easy to read and understand by other developers.

• It follows consistent naming conventions for variables, functions, and classes.

• Clean code is well-organized with proper indentation and spacing.

• It avoids unnecessary complexity and duplication.

• Clean code is modular and follows the single responsibility principle.

• Exa...read more
Answered by AI
Add your answer
Q2. How to better test your code?
Ans. 
To better test your code, use a combination of unit tests, integration tests, regression tests, and automated testing.
• Write unit tests to test individual components or functions in isolation.

• Perform integration tests to test how different components work together.

• Implement regression tests to ensure that new code changes do not break existing functionality.

• Utilize automated testing tools to run tests quickly and effici...read more
Answered by AI
Add your answer

Easy test

Pattern
15-20 MCQ
1 coding question

Mcqs were on harder side
Coding were on easier side

Q1. Find the middle node of a linked list?
Ans. 
To find the middle node of a linked list, use the two-pointer technique: one moves fast, the other slow.
• Use two pointers: 'slow' and 'fast'.

• Initialize both pointers at the head of the list.

• Move 'slow' by one step and 'fast' by two steps in each iteration.

• When 'fast' reaches the end, 'slow' will be at the middle.

• Example: For the list 1 -> 2 -> 3 -> 4 -> 5, 'slow' will point to 3.
Answered by AI
Add your answer
Q2. Height of the binary tree
Ans. 
The height of a binary tree is the length of the longest path from the root to a leaf node.
• Height is defined as the number of edges in the longest path from the root to a leaf.

• For a tree with only one node (the root), the height is 0.

• Example: In a tree with root and two children, the height is 1.

• A complete binary tree of height h has 2^(h+1) - 1 nodes.

• The height can be calculated recursively: height(node) = 1 + max(hei...read more
Answered by AI
Add your answer