Raja Software Labs Interview Questions, Process, and Tips

20 questions were given.
aptitude + simple coding output based.

5 questions were shared on a doc file. We need to code them paste their solutions in the file. Level was easy to medium. Array-string based Questions.

Q1. There Were 3 Technical rounds. In 1st Round Basic coding Questions were Asked on Array like find minimum angle between hour and minute hand. 0,1 array sort and there was another question too which I don't...read more
Add your answer
Q2. Find minimum angle between hour and minute hand.
Ans. 
Find minimum angle between hour and minute hand.
• Calculate the angle made by hour hand with 12 o'clock position and minute hand with 12 o'clock position.

• Calculate the difference between the two angles.

• If the difference is greater than 180 degrees, subtract it from 360 degrees to get the minimum angle.
Answered by AI
Add your answer
Q3. 0, 1 array sort (keep complexity low)
Ans. 
Sort an array of 0s and 1s with low complexity.
• Use two pointers, one at the beginning and one at the end of the array.

• Swap 0s from the beginning with 1s from the end until the pointers meet.

• Time complexity: O(n), space complexity: O(1).
Answered by AI
Add your answer

Q1. Then on next day Technical Round 2 happened Same another Interviewer and same process. Round was 1 hour long. I was given a question and I had to solve it. I was not asked puzzles but some of my friends we...read more
Add your answer
Q2. Maximum span of 1 in a 0,1 array
Ans. 
Find the maximum span of 1 in a 0,1 array.
• Iterate through the array and keep track of the first and last occurrence of 1.

• Calculate the difference between the last and first occurrence of 1.

• Repeat the process for all 1's in the array and return the maximum difference.
Answered by AI
Add your answer
Q3. Upside down triangle pattern
Add your answer

Q1. Next day Technical Round 3 This time my interviewer was a Senior Engineer Interview round was 1 hour+ I was given 2 coding questions then hr questions were asked. In hr they asked me a lot regarding my pro...read more
Add your answer
Q2. First non repeating Character
Ans. 
Find the first non-repeating character in a string.
• Create a hash table to store the frequency of each character in the string.

• Iterate through the string and update the frequency in the hash table.

• Iterate through the string again and return the first character with a frequency of 1.
Answered by AI
Add your answer
Q3. Sort a binary array using one traversal and no extra space
Ans. 
Sort a binary array using one traversal and no extra space.
• Use two pointers, one starting from the beginning and one from the end of the array.

• Swap the elements if the left pointer points to 1 and the right pointer points to 0.

• Continue traversing until the pointers meet in the middle.
Answered by AI
View 1 more answer

Code Snept question with 3-4 Reasoning question. Google form

Pen paper coding round. String , Array . Linkedlist , graph, questions

Q1. Maximum Spaning
Add your answer
Q2. Nearest Prime number
Ans. 
To find the nearest prime number, iterate from the given number in both directions until a prime number is found.
• Start iterating from the given number in both directions to find the nearest prime number.

• Check if a number is prime by dividing it by all numbers less than its square root.

• Keep track of the closest prime number found during the iteration.
Answered by AI
Add your answer
Q3. Second Maximum Number in Array
Ans. 
Find the second maximum number in an array of strings.
• Convert the array of strings to an array of integers.

• Sort the array in descending order.

• Return the second element in the sorted array.
Answered by AI
Add your answer

Q1. Project Question
Add your answer
Q2. Robot question of DSA
Add your answer
Q3. Stock Buy and sell - VI . Leetcode Hard
Add your answer
Q4. Leetcode Medium
Add your answer

Programming questions on string, array, numbers.
Difficultity level was simple.

5 questions were asked out of which 2 of them were easy and rest of them were hard.
Easy :- sorting, numbers
Hard :- bitwise, mathematical equation question.

Three were basic questions around strings and arrays

Q1. Detailed discussion on data structures and algorithms
Add your answer