i
HighRadius
Filter interviews by
Clear (1)
I applied via Campus Placement and was interviewed before Jul 2023. There were 4 interview rounds.
Basic questions like stats, probability etc
Scenario based question
Top trending discussions
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 Referral and was interviewed in May 2024. There was 1 interview round.
Guestimate question on how a new product can be launch
I applied via Referral and was interviewed in Mar 2020. There were 5 interview rounds.
Implemented data-driven strategies to increase revenue by 15% in previous company.
Developed predictive models to optimize pricing strategies
Identified key customer segments for targeted marketing campaigns
Automated data collection and analysis processes for efficiency
Collaborated with cross-functional teams to implement data-driven decisions
I applied via Referral and was interviewed in Nov 2019. There were 5 interview rounds.
Implemented a machine learning model to predict customer churn using advanced algorithms
Developed a predictive model using logistic regression, random forest, and gradient boosting
Utilized feature engineering techniques to improve model performance
Integrated the model into the company's CRM system for real-time predictions
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
based on 1 interview
Interview experience
based on 5 reviews
Rating in categories
Associate Software Engineer
409
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Consultant
341
salaries
| ₹0 L/yr - ₹0 L/yr |
Consultant
200
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer 2
200
salaries
| ₹0 L/yr - ₹0 L/yr |
Techno Functional Consultant
199
salaries
| ₹0 L/yr - ₹0 L/yr |
Chargebee
Freshworks
Zoho
CleverTap