i
HighRadius
Filter interviews by
Clear (1)
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
It's like very easy properly prepare for aptitude round
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.
I applied via Walk-in and was interviewed before Oct 2022. There were 4 interview rounds.
Easy round a hackerrank test with easy to medium problems
I applied via Referral and was interviewed before Oct 2023. There were 2 interview rounds.
I applied via LinkedIn and was interviewed before Jan 2024. There were 2 interview rounds.
They asked a guesstimate case question. The question was, If you are the manager of McDonalds, where would you place it in the international chennai airport (Arrival or departure).
What will be the yearly revenue McDonalds if all items are priced at Rs.100.
Movie Review App that uses a public API to fetch the movie details and present it in the UI.
Reversing the Linked list
I applied via Approached by Company and was interviewed before Apr 2023. There was 1 interview round.
Live coding with interviewer
I was interviewed before Mar 2021.
Round duration - 60 Minutes
Round difficulty - Medium
three coding questions , no mcq, 1 hr limit
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.
Update the head of the reversed linked list as the last node encountered during the reversal process.
Given an array or list ARR
consisting of N
integers, your task is to identify all distinct triplets within the array that sum up to a specified number K
.
A t...
The task is to identify all distinct triplets within an array that sum up to a specified number.
Iterate through the array and use nested loops to find all possible triplets.
Check if the sum of the triplet equals the specified number.
Print the valid triplets or return -1 if no triplet exists.
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...
Find the node where two linked lists merge, return -1 if no merging occurs.
Traverse both lists to find their lengths and the difference in lengths
Move the pointer of the longer list by the difference in lengths
Traverse both lists simultaneously until they meet at the merging node
Round duration - 45 Minutes
Round difficulty - Medium
1st they asked area of interest like frontend or backend. I said backend
Then thy asked a array based question followed by a linked list.
Then he asked some computer fundametals.
Given an array ARR
of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...
Find duplicates in an array of integers within a specified range.
Iterate through the array and keep track of the count of each element using a hashmap.
Identify elements with count greater than 1 as duplicates.
Return the duplicate elements as the output.
Handle edge cases like empty array or no duplicates found.
You are provided with a singly linked list consisting of integer values and an integer 'K'. Your task is to eliminate all nodes from the linked list that ...
Remove nodes with specific value from a singly linked list.
Traverse the linked list and remove nodes with value equal to 'K'.
Update the references of the previous node to skip the removed node.
Handle edge cases like removing the head node or multiple nodes with the same value.
Return the modified linked list after removal.
Round duration - 60 Minutes
Round difficulty - Medium
mainly focused on dsa , dbms and working of an API
Given a Singly Linked List of integers that are sorted based on their absolute values, the task is to sort the linked list based on the actual values.
The absolute...
Sort a Singly Linked List based on actual values instead of absolute values.
Traverse the linked list and store the values in an array.
Sort the array based on actual values.
Update the linked list with the sorted values.
Tip 1 : Having a prior internship with a dev role will definitely help in interviews.
Tip 2 : If you are not good in frontend then prepare DSA and computer fundamentals very well
Tip 3 : Apart from Leetcode medium questions Have hands on DMBS queries
Tip 4 : Having an API based project will be very helpful for backend roles
Tip 1 : They will mostly ask in first round if you interested in frontend or backend roles and then the follow up interviews will happen in that direction.
Tip 2 : so make your resume specific to the role you are interested in.
Tip 3 : Write what you have worked on in your prior internship.
Tip 4 : if this is your first internship write your strong points and only things which you are confident in because after selection interviewer will driil you on those topics.
based on 1 interview
Interview experience
based on 1 review
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