Raja Software Labs Interview Questions, Process, and Tips

5 coding questions in the first round

Q1. About yourself , about your project explaination.
Ans. Explianation about your project they'll ask fine details also.
Answered Anonymously
Add your answer
Q2. Find prime numbers value.
Ans. 
A prime number is a number greater than 1 that is divisible only by 1 and itself.
• Start with a loop to iterate through numbers

• Check if each number is divisible by any number from 2 to its square root

• If not divisible, add it to the list of prime numbers
Answered by AI
View 1 more answer

5-6 questions were provided and a day was given.

Q1. DSA question related to array and string
Add your answer

Q1. Find the minimum number of coins to make a given value. (Coin Change)
Ans. 
Find minimum number of coins to make a given value using dynamic programming.
• Use dynamic programming to find the minimum number of coins needed.

• Create a dp array to store the minimum number of coins for each value up to the given value.

• Iterate through each coin denomination and update the dp array accordingly.

• Return the value at the given value index in the dp array.
Answered by AI
Add your answer

The test contains basic programming output questions and some aptitude questions.

We have to solve 5 programming questions in 1 hour. Questions are on arrays and strings.

Q1. Parenthesis balancing Reversing the string Finding the angle between hour and minute hand of clock
Ans. 
Three technical questions related to string manipulation and clock calculations.
• For parenthesis balancing, use a stack data structure to keep track of opening and closing brackets.

• To reverse a string, use two pointers starting from the beginning and end of the string and swap characters until they meet in the middle.

• To find the angle between hour and minute hand of clock, use the formula (30H - 11/2M) degrees, where H
Answered by AI
Add your answer
Q2. Prime no Add all digits in a number
Ans. 
The question asks to check if a number is prime and add all its digits.
• To check if a number is prime, we can use a loop to divide it by all numbers from 2 to its square root.

• If the number is divisible by any of these numbers, it is not prime.

• To add all digits in a number, we can use a loop to extract each digit and add it to a running total.
Answered by AI
Add your answer

Some Questions are based on programming and some are aptitude questions.

This is coding round here 5 coding questions is there?

Q1. Find first non repeated character in string?
Ans. 
Find the first non-repeated character in a string.
• Iterate through the string and count the frequency of each character.

• Return the first character with a count of 1.
Answered by AI
Add your answer
Q2. We have given a integer array then find the second maximum difference ?
Ans. 
Find the second maximum difference in an integer array.
• Sort the array in descending order

• Calculate the difference between adjacent elements

• Return the second maximum difference
Answered by AI
Add your answer
Q3. We have given a integer find the sum of all digits.
Ans. 
Given an integer, find the sum of all its digits.
• Convert the integer to a string and iterate over each character to get the sum.

• Use modulo operator to get the last digit and add it to the sum, then divide by 10 to remove the last digit.

• Recursively call the function with the integer divided by 10 and add the remainder to the sum.
Answered by AI
Add your answer