AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Raja Software Labs Software Developer Interview Questions and Answers
12 Interview questions
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.
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.
Maximize profit by buying and selling stocks with at most k transactions.
Use dynamic programming to track profits for each transaction.
Maintain an array to store maximum profit for each day.
Example: For prices [3,2,6,5,0,3] and k=2, max profit is 7.
Consider edge cases like k=0 or prices being empty.
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.
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
Find the longest substring that is a palindrome in a given string.
Use dynamic programming to solve the problem efficiently.
Create a 2D boolean array to store the results of subproblems.
Check for palindromes of length 1 and 2 separately.
For substrings of length greater than 2, check if the first and last characters are the same and the substring between them is also a palindrome.
Update the result if a longer palind...
Find the first non-repeating character in a string.
Create a hash table to store character frequency
Iterate through the string and update the hash table
Iterate through the string again and return the first character with frequency 1
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).
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).
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
Raja Software Labs Software Developer Interview Experiences
15 interviews found
Anonymous
Code Snept question with 3-4 Reasoning question. Google form
Pen paper coding round. String , Array . Linkedlist , graph, questions
(3 Questions)
- Q1. Maximum Spaning
- 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.
- 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.
(4 Questions)
- Q1. Project Question
- Q2. Robot question of DSA
- Q3. Stock Buy and sell - VI . Leetcode Hard
- Ans.
Maximize profit by buying and selling stocks with at most k transactions.
Use dynamic programming to track profits for each transaction.
Maintain an array to store maximum profit for each day.
Example: For prices [3,2,6,5,0,3] and k=2, max profit is 7.
Consider edge cases like k=0 or prices being empty.
- Q4. Leetcode Medium
Skills evaluated in this interview
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.
Amey Uplenchwar
I applied via Campus Placement
Three were basic questions around strings and arrays
(1 Question)
- Q1. Detailed discussion on data structures and algorithms
Mayuresh Gujar
DSA questions such as Map, linked list
Medium level question based on quantitative aptitude
Medium level leetcode questions
Interview Preparation Tips
Siya Thakur
I applied via Campus Placement
Good question with nice logic
5 question in 1 hour so it's kinda difficult to manage time
Sarvesh Barapatre
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.
Interview Preparation Tips
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
(1 Question)
- Q1. Questions on string and array manipulation, leap year identification, second largest element of array, etc
I applied via Campus Placement 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.
(4 Questions)
- Q1. Interviewer introduced himself , then told the flow of interview ie. 2 coding question will be asked then he asked to introduce myself
- Q2. Occurance of characters in string
- Q3. Angle between hour and minute hand of clock at a given time
- Q4. Both question I was able to solve quickly interview was sheduled for one hour but i solved questions in 23 minutes so interview ended. I was called for second techinal round
(4 Questions)
- Q1. Same format as above introduction and 2 coding questions
- Q2. 1 Integer to roman it took me some time to solve the question
- Q3. 2 given sum and we have to print all the subsequences in array with given sum
- Ans.
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).
- Q4. The interview took almost 45 minutes and i was able to solve both questions so i was selected for third round ie technical + HR
(5 Questions)
- Q1. First introduction then as all rounds 2 coding questions and then HR questions were asked
- Q2. 1 print string without taking repeating characters eg helper - helpr
- Q3. 2 sort array of 0s and 1s in only one loop solution was using two pointers
- Ans.
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).
- Q4. I solved both the questions then questions were asked on projects
- Q5. Difficulties in project how you learn new technology After two days I received mail and I was selected for software developer role
Interview Preparation Tips
- arrays
- string
- Also see puzzles on GFG they are also asked frequently
- No need to revise DBMS , OS for RSL interviews only coding is necessary
Skills evaluated in this interview
Top trending discussions
Raja Software Labs Interview FAQs
Some of the top questions asked at the Raja Software Labs Software Developer interview -
Tell us how to improve this page.
Raja Software Labs Interviews By Designations
- Raja Software Labs Software Engineer Interview Questions
- Raja Software Labs Software Developer Interview Questions
- Raja Software Labs Developer Interview Questions
- Raja Software Labs Software Engineer Trainee Interview Questions
- Raja Software Labs Software Development Engineer Interview Questions
- Raja Software Labs Java Developer Interview Questions
- Raja Software Labs Billing Executive Interview Questions
- Raja Software Labs Android Developer Interview Questions
- Show more
Interview Questions for Popular Designations
- Software Engineer Interview Questions
- Java Developer Interview Questions
- Web Developer Interview Questions
- Senior Software Developer Interview Questions
- Application Developer Interview Questions
- Salesforce Developer Interview Questions
- Software Development Engineer Interview Questions
- Developer Interview Questions
- Show more
Overall Interview Experience Rating
based on 14 interview experiences
Difficulty level
Duration
Software Developer Interview Questions from Similar Companies
Raja Software Labs Software Developer Reviews and Ratings
based on 12 reviews
Rating in categories
|
Software Engineer
269
salaries
|  ₹6.9 L/yr - ₹14.8 L/yr |
|
Software Developer
66
salaries
| ₹4.5 L/yr - ₹12 L/yr |
|
IOS Developer
55
salaries
| ₹6.2 L/yr - ₹12 L/yr |
|
Senior Software Engineer
20
salaries
| ₹8.2 L/yr - ₹26 L/yr |
|
Android Developer
19
salaries
| ₹6 L/yr - ₹18 L/yr |
Saama Technologies
Jumio
DISYS
Data-Core Systems
- Home >
- Interviews >
- Raja Software Labs Interview Questions
