i
HighRadius
Filter interviews by
I applied via Campus Placement and was interviewed in Nov 2023. There was 1 interview round.
I applied via LinkedIn and was interviewed in Apr 2022. There were 3 interview rounds.
Logical thinking and coding mcq which was moderate in difficulty
Hard with data structure concepts
I applied via Company Website and was interviewed in Oct 2023. There were 2 interview rounds.
Good place to interview in the campus
Binary search is a search algorithm that finds the position of a target value within a sorted array.
Binary search works by repeatedly dividing the search interval in half.
It is more efficient than linear search for large arrays.
Example: Searching for the number 7 in the array [1, 3, 5, 7, 9, 11] using binary search.
It's like very easy properly prepare for aptitude round
I applied via Recruitment Consulltant and was interviewed before Oct 2023. There were 3 interview rounds.
I was interviewed in Sep 2024.
C programming and java
Advanced coding on c
I chose this company because of its innovative projects, strong company culture, and opportunities for growth.
Innovative projects that challenge me and allow me to learn new skills
Strong company culture that values teamwork and collaboration
Opportunities for growth and advancement within the company
My aim is to continuously improve my technical skills, contribute to innovative projects, and eventually become a technical leader in the field.
Continuous learning and skill development
Contribution to innovative projects
Becoming a technical leader in the field
2 Medium level DSA question
Use the exponentiation by squaring algorithm to optimally find n^m.
Use the exponentiation by squaring algorithm to reduce the number of multiplications needed.
Divide the exponent by 2 and recursively calculate the result.
Handle the cases when the exponent is even or odd separately.
Example: n^5 = n * n^2 * n^2
The edit distance problem involves finding the minimum number of operations required to transform one string into another.
The edit distance problem can be solved using dynamic programming.
Common operations include insertion, deletion, and substitution of characters.
Example: Given strings 'kitten' and 'sitting', the edit distance is 3 (substitute 'k' with 's', insert 'g', substitute 'n' with 'g').
I applied via LinkedIn and was interviewed in Sep 2022. There were 3 interview rounds.
2 coding , 2 SQL with some quants
Remove redundant parentheses in a expression
Identify the innermost parentheses
Evaluate the expression inside the innermost parentheses
Replace the innermost parentheses with the evaluated expression
Repeat until no more redundant parentheses exist
A coding test on hackerrank with some basic graph problems
based on 2 interviews
Interview experience
based on 9 reviews
Rating in categories
Associate Software Engineer
408
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Consultant
340
salaries
| ₹0 L/yr - ₹0 L/yr |
Techno Functional Consultant
199
salaries
| ₹0 L/yr - ₹0 L/yr |
Consultant
197
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer 2
196
salaries
| ₹0 L/yr - ₹0 L/yr |
Chargebee
Freshworks
Zoho
CleverTap