i
Softura
Filter interviews by
Coding round regarding my domain
posted on 22 Jul 2024
There were 125 questions in the first round in which they asked questions about English grammar and easy questions about general behavior in 75 minutes
posted on 12 Jul 2024
I applied via Referral and was interviewed before Jul 2023. There were 2 interview rounds.
Simple questions related to arraylist and queue
I applied via Company Website and was interviewed in Sep 2022. There were 4 interview rounds.
Basic Aptitude questions like quantitative and logical
Programs have to written for given questions
I applied via Company Website and was interviewed in May 2022. There were 4 interview rounds.
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.
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
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.
I applied via Campus Placement and was interviewed in Jun 2022. There were 6 interview rounds.
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.
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.
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).
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.
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.
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.
posted on 22 Oct 2023
I applied via Campus Placement and was interviewed before Feb 2023. There were 3 interview rounds.
Very easy basic logical questions
Easy level array string questions
2 questions asked should give optimized approach
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
posted on 15 Jul 2022
I applied via Recruitment Consulltant and was interviewed in Jun 2022. There were 3 interview rounds.
Some Questions are based on programming and some are aptitude questions.
This is coding round here 5 coding questions is there?
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.
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
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.
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Software Engineer
135
salaries
| ₹3 L/yr - ₹12 L/yr |
Senior Software Engineer
98
salaries
| ₹6.1 L/yr - ₹20 L/yr |
Test Engineer
38
salaries
| ₹3 L/yr - ₹10 L/yr |
Software Developer
26
salaries
| ₹4 L/yr - ₹17.2 L/yr |
Junior Software Engineer
20
salaries
| ₹3 L/yr - ₹6 L/yr |
Maxgen Technologies
Value Point Systems
JoulestoWatts Business Solutions
F1 Info Solutions and Services