i
HighRadius
Filter interviews by
Clear (1)
Creating a Web App using React JS and Java Servlets
I applied via Campus Placement
There was a very basic aptitude test ,but time was very low.
For round 2 there were given 2 questions which were very easy, any beginner programmer can do it.
I applied via Campus Placement and was interviewed before Mar 2023. There was 1 interview round.
They first taught React ,javaEE and sql and than told us to make a full stack B2b invoice management system
What people are saying about HighRadius
I applied via Campus Placement
I am an avid traveler and have visited over 20 countries
I love experiencing new cultures and trying new foods
I have backpacked through Europe and Asia
I have volunteered in orphanages in Cambodia and Nepal
Mobile advertising platform
Adtech
Mobile marketing
App monetization
Maximum sub sequence sum in an array
Use Kadane's algorithm
Initialize max_so_far and max_ending_here to 0
Iterate through the array and update max_ending_here and max_so_far
Return max_so_far
Endianness refers to the byte order of a system. It determines how multi-byte data types are stored in memory.
Little-endian systems store the least significant byte first, while big-endian systems store the most significant byte first.
Endianness can affect the way data is transmitted between systems.
To determine the endianness of a system, you can use the byte order mark (BOM) or write a test program that checks the by...
Sort an array of 0's and 1's only.
Use two pointers, one at the beginning and one at the end of the array.
Swap 0's from the beginning with 1's from the end until the pointers meet.
Alternatively, use a counting sort algorithm to count the number of 0's and 1's and then reconstruct the array.
Heaps are data structures used to efficiently find the maximum or minimum element in a collection.
Max heap: parent nodes are always greater than or equal to child nodes
Min heap: parent nodes are always smaller than or equal to child nodes
Heaps are commonly used in priority queues and sorting algorithms
Heap operations include insert, delete, and extract max/min
Example: An array [3, 8, 2, 5, 1, 4, 6] can be represented a
Find 3 numbers in an array where a+b=c.
Loop through the array and check for all possible combinations of a and b.
Use a hash table to store the values of a and b, and check if c is present in the hash table.
Sort the array and use two pointers to find a and b, and then check if their sum equals c.
Algorithms for manipulating arrays and strings in coding
Use sorting algorithms like quicksort and mergesort for arrays
Use string manipulation functions like substring and replace for strings
Use dynamic programming for optimizing solutions to array and string problems
Designing a large scale Ad Server
Use distributed systems for scalability
Implement caching for faster ad delivery
Ensure high availability and fault tolerance
Use real-time bidding for efficient ad placement
Implement fraud detection mechanisms
Ensure compliance with privacy regulations
I applied via Company Website and was interviewed in Sep 2020. There were 5 interview rounds.
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 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.
I applied via Approached by Company and was interviewed before Apr 2023. There was 1 interview round.
Live coding with interviewer
based on 3 interviews
Interview experience
based on 8 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