Filter interviews by
Code Snept question with 3-4 Reasoning question. Google form
Pen paper coding round. String , Array . Linkedlist , graph, questions
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.
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.
I applied via Recruitment Consulltant and was interviewed in Oct 2024. There were 2 interview rounds.
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.
I applied via Campus Placement
Three were basic questions around strings and arrays
DSA questions such as Map, linked list
Raja Software Labs interview questions for designations
Medium level question based on quantitative aptitude
Medium level leetcode questions
Get interview-ready with Top Raja Software Labs Interview Questions
I applied via Campus Placement
Good question with nice logic
5 question in 1 hour so it's kinda difficult to manage time
Questions based on data structure
Questions based on Data structure
I applied via Campus Placement and was interviewed in Feb 2024. There was 1 interview round.
Basic coding question on array and string.
I applied via Campus Placement and was interviewed in Sep 2023. There were 2 interview rounds.
5 coding questions on google docs..duration 1 hour
I applied via campus placement at Pimpri Chinchwad College of Engineering, Pimpri and was interviewed in Jul 2022. There were 5 interview rounds.
Basic Aptitude questions mainly on quantitative
Google docs was shared which has 5 coding questions mainly on array and string.
The question is about finding the occurrence of characters in a string.
Iterate through the string and count the occurrence of each character.
Use a hash table to store the count of each character.
Consider the case sensitivity of the characters.
Handle special characters and spaces as required.
The angle between hour and minute hand of a clock at a given time.
Calculate the angle made by the hour hand with 12 o'clock
Calculate the angle made by the minute hand with 12 o'clock
Find the difference between the two angles
If the difference is greater than 180 degrees, subtract it from 360 degrees
The result is the angle between the hour and minute hand
Printing all the subsequences in an array with a given sum.
Use recursion to generate all possible subsequences.
Check if the sum of each subsequence is equal to the given sum.
Print the subsequences that satisfy the condition.
Time complexity: O(2^n).
The task is to print a string without any repeating characters.
Iterate through the string and keep track of the characters seen so far.
If a character is already seen, skip it.
Otherwise, add it to the output string.
Return the output string.
Sort an array of 0s and 1s in one loop using two pointers.
Use two pointers, one starting from the beginning and the other from the end.
Swap the values at the pointers if the value at the beginning pointer is greater than the value at the end pointer.
Continue until the pointers meet in the middle.
Time complexity is O(n).
Top trending discussions
Some of the top questions asked at the Raja Software Labs Software Developer interview -
based on 14 interviews
3 Interview rounds
based on 10 reviews
Rating in categories
Software Engineer
239
salaries
| ₹4.5 L/yr - ₹16 L/yr |
Software Developer
60
salaries
| ₹4.5 L/yr - ₹13 L/yr |
IOS Developer
54
salaries
| ₹5 L/yr - ₹15.8 L/yr |
Android Developer
19
salaries
| ₹6 L/yr - ₹18 L/yr |
Softwaretest Engineer
14
salaries
| ₹2.5 L/yr - ₹6.5 L/yr |
TCS
Infosys
Wipro
HCLTech