i
HighRadius
Filter interviews by
I applied via LinkedIn and was interviewed in Feb 2024. There were 4 interview rounds.
Revenue recognition in project implementation is crucial for financial reporting. Key KPIs include project profitability, revenue growth, and cash flow.
Revenue recognition is the process of recording revenue in the financial statements when it is earned, regardless of when the cash is received.
Key KPIs for project implementation include project profitability, which measures the financial success of a project, revenue g...
I applied via Naukri.com and was interviewed in Dec 2022. There were 3 interview rounds.
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 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.
I applied via Company Website and was interviewed in Sep 2020. There were 5 interview rounds.
DSA and lagorithmic optimizations (this is based on team you are joining so questions vary a LOT)
I applied via Referral and was interviewed before Sep 2022. There were 3 interview rounds.
Medium level leetcode questions and some apti very rare but.
Good practice of data structures, algorithms, and operating systems is essential for software engineers.
Regularly practice coding challenges to improve problem-solving skills
Understand the time and space complexity of algorithms
Learn about different data structures and when to use them
Familiarize yourself with operating system concepts like processes, threads, and memory management
Check for cycle in a linked list by using two pointers approach.
Use two pointers, one moving at double the speed of the other.
If there is a cycle, the two pointers will eventually meet.
Alternatively, use a hash set to keep track of visited nodes.
Binary search tree
Linked list
I have experience with a variety of technologies including Java, Python, SQL, and JavaScript.
Java
Python
SQL
JavaScript
based on 1 interview
Interview experience
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