i
HighRadius
Filter interviews by
I have a strong background in the industry, relevant experience, and a proven track record of success.
I have X years of experience in the industry
I have successfully completed similar projects in the past
I possess the necessary skills and qualifications for the job
I applied via Company Website and was interviewed before Jun 2021. There were 2 interview rounds.
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 was interviewed in Sep 2024.
C programming and java
Advanced coding on c
I chose this company because of its innovative projects, strong company culture, and opportunities for growth.
Innovative projects that challenge me and allow me to learn new skills
Strong company culture that values teamwork and collaboration
Opportunities for growth and advancement within the company
My aim is to continuously improve my technical skills, contribute to innovative projects, and eventually become a technical leader in the field.
Continuous learning and skill development
Contribution to innovative projects
Becoming a technical leader in the field
I chose to pursue a career in software development instead of BE.
I have a passion for coding and problem-solving
I enjoy the creativity and flexibility of software development
I believe that software development offers more opportunities for growth and innovation
I have found that my skills and interests align better with software development than with BE
I come from a close-knit family of five, with parents who have been married for over 30 years.
My parents have been married for over 30 years
I have two siblings, a younger brother and an older sister
We are a close-knit family and enjoy spending time together
My parents have always been supportive of my career aspirations
We have a family tradition of going on a vacation every year
I will consider the offer and evaluate the overall benefits before making a decision.
I will assess the job responsibilities and growth opportunities in the new company.
I will compare the benefits package, including health insurance, retirement plans, and vacation time.
I will weigh the commute time and cost of living in the new location.
I will negotiate with my current employer to see if they can match or exceed the off...
My aim is to continuously improve my skills and knowledge in software development while contributing to the success of the company.
To become a proficient developer
To learn new technologies and programming languages
To contribute to the success of the company
To work collaboratively with other developers
To deliver high-quality software products
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.
based on 2 interviews
Interview experience
based on 7 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