i
HighRadius
Filter interviews by
Clear (1)
I applied via Company Website and was interviewed in May 2021. There were 3 interview rounds.
Exceptions are errors that occur during program execution and can be handled using try-catch blocks.
Checked exceptions: must be handled or declared in the method signature
Unchecked exceptions: occur at runtime and do not need to be declared
Error: serious problems that cannot be handled, such as OutOfMemoryError
Examples: NullPointerException, ArrayIndexOutOfBoundsException
Exceptions should be handled gracefully to prevent application crashes.
Use try-catch blocks to catch exceptions.
Handle exceptions at the appropriate level of abstraction.
Log exceptions to aid in debugging.
Provide meaningful error messages to the user.
Avoid catching generic exceptions.
Use finally blocks to release resources.
Consider using custom exceptions for specific error conditions.
To create a custom read-only list, use the ReadOnlyCollection class in C#.
Create a List
Use the AsReadOnly() method to create a read-only wrapper around the list.
Use the ReadOnlyCollection
Example: List
Example: var readOnlyList = myList.AsReadOnly();
Example: var trulyReadOnlyList = new ReadOnlyCollect
Collections are data structures that store and manipulate groups of related objects.
Collections are used to store and manipulate groups of related objects
They can be classified into three main categories: Lists, Sets, and Maps
Lists maintain the order of elements and allow duplicates (e.g. ArrayList, LinkedList)
Sets do not allow duplicates and do not maintain order (e.g. HashSet, TreeSet)
Maps store key-value pairs and d...
Binary search is a search algorithm that finds the position of a target value within a sorted array.
The array must be sorted before applying binary search
Compare the target value with the middle element of the array
If the target value is smaller, search the left half of the array
If the target value is larger, search the right half of the array
Repeat until the target value is found or the search space is exhausted
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
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.
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
Coding test contains two graph problems
I applied via Company Website and was interviewed in Sep 2020. There were 5 interview rounds.
I applied via Campus Placement and was interviewed before Jan 2024. There were 3 interview rounds.
DSA Coding interview on arrays and strings
I applied via Job Portal and was interviewed in Jul 2022. There were 2 interview rounds.
Good and nice. 2 set of questions:-
1.general aptitude
2.simple coding question
2nd round - coding in pc.. General logic is important
I applied via Walk-in and was interviewed in Feb 2022. There were 2 interview rounds.
Reasoning and C and C++ code snippet test
Develop the Angular App
I applied via Campus Placement and was interviewed in Jun 2021. There were 6 interview rounds.
based on 2 interviews
Interview experience
based on 20 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