Bajaj Finserv Java Microservice Developer Interview Questions and Answers

Q1. Design patterns that you have followed in your past projects.
Ans. 
I have followed the MVC, Singleton, and Factory design patterns in my past projects.
• MVC pattern for separating concerns and improving maintainability

• Singleton pattern for ensuring only one instance of a class is created

• Factory pattern for creating objects without exposing the instantiation logic
Answered by AI
View 1 more answer
Q2. How to secure the applications?
Ans. 
Applications can be secured by implementing various security measures such as authentication, authorization, encryption, and regular updates.
• Implement strong authentication mechanisms such as multi-factor authentication

• Use authorization to restrict access to sensitive data and functionalities

• Encrypt sensitive data both in transit and at rest

• Regularly update the application and its dependencies to patch security vulnera...read more
Answered by AI
View 1 more answer

Q1. 1)Project related,
Add your answer
Q2. What is the Polymorphism?
Ans. 
Polymorphism is the ability of a function or method to behave differently based on the object it is acting upon.
• Polymorphism allows objects of different classes to be treated as objects of a common superclass.

• There are two types of polymorphism: compile-time (method overloading) and runtime (method overriding).

• Example: Inheritance in object-oriented programming languages like Java allows for polymorphism.
Answered by AI
Add your answer
Q3. What is RestController?
Ans. 
RestController is a class in Spring framework used to handle HTTP requests and return responses as JSON or XML.
• Handles HTTP requests in Spring framework

• Returns responses as JSON or XML

• Annotate a class with @RestController to define it as a RestController

• Example: @RestController public class UserController {}
Answered by AI
Add your answer

Find the number of occurrences of each element in the given ArrayList

Q1. Discussion with hr like reason to switch.
Add your answer

Round duration - 65 Minutes
Round difficulty - Medium

This was an online proctured coding test where we had 2 questions to solve under 65 minutes. Both the questions were of difficulty Medium to Hard.

Q1. 
Make Array Elements Equal Problem Statement
Given an integer array, your objective is to change all elements to the same value, minimizing the cost. The cost of changing an element from x to y is defined ...read more
Ans. 
Find the minimum cost to make all elements of an array equal by changing them to a common value.
• Calculate the median of the array and find the sum of absolute differences between each element and the median.

• Sort the array and find the median element, then calculate the sum of absolute differences between each element and the median.

• If the array has an even number of elements, consider the average of the two middle elem
Answered by AI
Add your answer
Q2. 
Pattern Matching Problem Statement
Given a pattern as a string and a set of words, determine if the pattern and the words list align in the same sequence.
Input:
T (number of test cases)
For each test ca...read more
Ans. 
Given a pattern and a list of words, determine if the words align with the pattern.
• Create a mapping between characters in the pattern and words in the list.

• Check if the mapping preserves the order of characters in the pattern.

• Return 'True' if the sequence of words matches the order of characters in the pattern, else return 'False'.
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 algorithmic questions in which I first had to explain my approach with proper complexity analysis and then code the solution in any preferred IDE.

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. 
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
• Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

• If the complement exists, add the pair to the result list.

• Sort the result list based on the criteria mentioned in the question.

• Return the sorted list of pairs.
Answered by AI
Add your answer
Q2. 
Merge Overlapping Intervals Problem Statement
Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping interv...read more
Ans. 
Merge overlapping intervals and return sorted list of merged intervals.
• Iterate through intervals and merge overlapping ones

• Sort merged intervals based on starting times

• Handle edge cases like empty input or single interval

• Example: Input - [[1,4], [3,5], [6,8], [10,12], [8,9]], Output - [[1,5], [6,9], [10,12]]
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 1 standard coding question followed by some questions from OS and at last I was also asked some questions related to Statistics and Probability.

Q1. 
Spiral Matrix Problem Statement
You are given a N x M matrix of integers. Your task is to return the spiral path of the matrix elements.
Input
The first line contains an integer 'T' which denotes the nu...read more
Ans. 
The task is to return the spiral path of elements in a given matrix.
• Iterate through the matrix in a spiral path by adjusting the boundaries at each step.

• Keep track of the direction of traversal (right, down, left, up) to cover all elements.

• Handle edge cases such as when the matrix is a single row or column.

• Implement the spiral path traversal algorithm efficiently to meet the time limit.

• Ensure to print the elements in t
Answered by AI
Add your answer
Q2. How can you print numbers from 1 to 100 using more than two threads in an optimized approach?
Ans. 
Use multiple threads to print numbers from 1 to 100 in an optimized approach.
• Divide the range of numbers (1-100) among the threads to avoid overlap.

• Use synchronization mechanisms like mutex or semaphore to ensure orderly printing.

• Consider using a shared variable to keep track of the current number being printed.
Answered by AI
Add your answer
Q3. What is meant by multitasking and multithreading in operating systems?
Ans. 
Multitasking refers to the ability of an operating system to run multiple tasks concurrently, while multithreading involves executing multiple threads within a single process.
• Multitasking allows multiple processes to run simultaneously on a single processor, switching between them quickly.

• Multithreading enables a single process to execute multiple threads concurrently, sharing resources like memory and CPU time.

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

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. What do you know about the company?
Add your answer
Q2. Why should we hire you?
Add your answer

Round duration - 65 Minutes
Round difficulty - Medium

This was an online proctured coding round where we had 2 questions to solve under 1 hour. Both the questions were preety standard and anyone with a decent grip on Data Structures and Algorithms can solve them.

Q1. 
Split Binary String Problem Statement
Chintu has a long binary string str. A binary string is a string that contains only 0 and 1. He considers a string to be 'beautiful' if and only if the number of 0's ...read more
Ans. 
Find the maximum number of beautiful substrings that a binary string can be split into.
• Count the number of 0's and 1's in the string.

• Iterate through the string and split it whenever the count of 0's and 1's becomes equal.

• Return the maximum number of beautiful substrings that can be formed.
Answered by AI
Add your answer
Q2. 
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...read more
Ans. 
Find the shortest path in a binary matrix from a source cell to a destination cell consisting only of 1s.
• Use Breadth First Search (BFS) algorithm to find the shortest path.

• Keep track of visited cells to avoid revisiting them.

• Update the path length as you traverse the matrix.

• Return -1 if no valid path exists.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 coding questions , the first one was related to Sorting and the second one was related to Hashing. After the coding questions, I was asked some concepts related to OOPS in general.

Q1. 
Rahul And Minimum Subarray Problem Statement
Rahul is mastering arrays. He is tasked to find the length of the smallest contiguous subarray in a given array/list ARR of size N, such that its sum exceeds a...read more
Ans. 
Find the length of the smallest subarray in a given array whose sum exceeds a specified value.
• Iterate through the array while keeping track of the sum of the current subarray.

• Use two pointers to maintain a sliding window approach to find the smallest subarray.

• Update the minimum length of the subarray whenever the sum exceeds the specified value.

• Return the length of the smallest subarray found.

• Handle cases where no suba...read more
Answered by AI
Add your answer
Q2. 
Count Subarrays with Sum Divisible by K
Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.
Input:
The first line of input contains an...read more
Ans. 
Count subarrays with sum divisible by K in an array.
• Iterate through the array and keep track of prefix sum modulo K.

• Use a hashmap to store the frequency of prefix sum remainders.

• For each prefix sum remainder, count the number of subarrays that sum up to a multiple of K.

• Handle cases where the prefix sum itself is divisible by K.

• Return the total count of subarrays with sum divisible by K.
Answered by AI
Add your answer
Q3. What are virtual destructors in C++?
Ans. 
Virtual destructors in C++ are used to ensure that the correct destructor is called when deleting an object through a base class pointer.
• Virtual destructors are declared with the 'virtual' keyword in the base class to allow proper cleanup of derived class objects.

• When deleting an object through a base class pointer, having a virtual destructor ensures that the destructor of the derived class is called.

• Without a virtual...read more
Answered by AI
Add your answer
Q4. What is the difference between a constructor and a method in Object-Oriented Programming?
Ans. 
Constructor is a special method used to initialize objects, while a method is a function that performs a specific task.
• Constructor is called automatically when an object is created, while a method is called explicitly by the programmer.

• Constructors have the same name as the class, while methods have unique names.

• Constructors do not have a return type, while methods have a return type.

• Constructors are used to set initia...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 coding questions both related to Linked List followed by an interesting puzzle and then a question related to Probability.

Q1. 
Divide Linked List Into Two Problem Statement
You have been given a singly linked list of integers. Your task is to divide this list into two smaller singly linked lists wherein the nodes appear in an alt...read more
Ans. 
Divide a singly linked list into two smaller lists with nodes appearing in an alternating fashion.
• Iterate through the original linked list and assign nodes alternatively to the two smaller lists.

• Handle cases where creating either of the sub-lists is impossible by returning an empty list.

• Ensure to properly terminate the linked lists with -1 at the end of each list.

• Consider the constraints provided while implementing the...read more
Answered by AI
Add your answer
Q2. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Ans. 
Find the node where two linked lists merge.
• Traverse both lists to find their lengths and the difference in lengths

• Move the pointer of the longer list by the difference in lengths

• Move both pointers simultaneously until they meet at the merging point
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.

Q1. Why should we hire you?
Add your answer