Bajaj Finserv Software Developer Interview Questions, Process, and Tips

Q1. Basics of SQL Basics CMD commands SQL query
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Round duration - 120 minutes
Round difficulty - Medium

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Add your answer
Q2. 
Word Presence in Sentence
Determine if a given word 'W' is present in the sentence 'S' as a complete word. The word should not merely be a substring of another word.
Input:
The first line contains an in...read more
Add your answer

Q1. 
Alien Dictionary Problem Statement
You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...read more
Ans. Permutations Approach
Approach:
• Find all the distinct characters present in all the words.
• Generate all permutations of these distinct characters.
• Treat each of the permutations as a correct sequence of alphabets. Now check if the given words are sorted according to this sequence. In order to do this, we will:-
  • For all words from 1 to n - 1, let the current word be ‘currWord’ and the next word be ‘nextWord’.
  • One by one compa...read more
Answered Anonymously
Add your answer
Q2. 
The Skyline Problem
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...read more
Ans. Brute Force
The idea here is to first, sort the critical POINTS with respect to their coordinate and height pairs. Make a pair of 'X1' and take a negative of the height for the building so that 'X1' pairs are sorted before 'X2' pairs. Create a dictionary keeping the heights as keys and as soon as a left edge of a building is encountered, we add that building to the dictionary with its height as the key. When we encounte...read more
Answered Anonymously
Add your answer
Q3. 
Reverse Words In A String Problem Statement
Given a string of length N, reverse the string word by word. Ensure that the output reversed string has a single space between two words and does not contain le...read more
Ans. Brute force
• Create a String ans to store the reversed string.
• Initialize a variable i to 0 and iterate the whole string through a while loop.
• Skip initial spaces by just incrementing i.
• Create a String that will store the current word.
• Add the currentword and space at the beginning of ans.
• After traversing the whole string, check if the length of ans is greater than 0 then return ans after removing the last space otherwise r...read more
Answered Anonymously
Add your answer
Q4. 
Flood Fill Algorithm Task
Assist Ninja in altering the color of a specific region in his photo. Given the image as a 2D array where each pixel is a positive integer, update the color of a specified pixel ...read more
Ans. Using Recursion
• Starting from the given pixel let's traverse the image using recursion.
• The idea is to replace the colour of the starting pixel with the new colour and repeat the same procedure for the adjacent same coloured pixels.
• During the traversal, we do not replace the colour of the current pixel if:
  • It has a different colour than the starting pixel.
  • Or if it has already been replaced with a new colour.
• In this way, w...read more
Answered Anonymously
Add your answer