Uni Cards Software Developer Interview Questions and Answers

Round duration - 30 minutes
Round difficulty - Easy

It was in the day time. I was asked the programming language of my choice. It was mostly focused on programming fundamentals. I was asked 2 questions based on Data Structures and Algorithms.

Q1. How can you detect a loop in a linked list?
Ans. 
A loop in a linked list can be detected using Floyd's Cycle Detection Algorithm.
• Use two pointers - slow and fast, where slow moves one step at a time and fast moves two steps at a time.

• If there is a loop, the two pointers will eventually meet at some point within the loop.

• To detect the start of the loop, reset one pointer to the head and move both pointers one step at a time until they meet again.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This round was mostly focused on my resume and projects.

Round duration - 30 minutes
Round difficulty - Easy

It was in the evening. I went to their office in Gurgaon. It was taken by one of the technology director who had a lot of experience. 
 

There were three coding questions.

Q1. Could you provide a thorough explanation of the project?
Add your answer
Q2. OOps Concepts and question from the technical subjects
Add your answer
Q3. Why Spring Boot
Add your answer
Q4. JWT Authentication
Add your answer
Q5. Docker and Kubernetes
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Q1. 
Maximum Sum With Specific Difference Problem Statement
Given an array of integers and a number 'K', your task is to find the maximum possible sum of disjoint pairs of numbers where the absolute difference...read more
Ans. 
Find maximum sum of disjoint pairs with absolute difference less than K in an array.
• Iterate through the array and sort it.

• Find all possible disjoint pairs with absolute difference less than K.

• Calculate the sum of these pairs to get the maximum sum.
Answered by AI
Add your answer
Q2. 
Ninja And The Tree Problem Statement
Ninja, while learning Binary Search Trees (BST), accidentally swapped two nodes in her self-constructed BST. Your task is to help Ninja by correcting the BST so that a...read more
Ans. 
The task is to correct a Binary Search Tree by swapping two nodes in the tree.
• Parse the input level order tree and construct the BST

• Identify the two nodes that are swapped incorrectly

• Swap the values of the incorrectly swapped nodes to correct the BST

• Return the corrected BST in level order form
Answered by AI
Add your answer