i
HighRadius
Filter interviews by
Quant, logical and vocabulary
Coding and aptitude was on the same round
posted on 15 Nov 2024
I applied via Referral and was interviewed in Oct 2024. There were 2 interview rounds.
Merge two sorted linked lists into a single sorted linked list
Create a new linked list to store the merged result
Iterate through both input linked lists and compare nodes to determine the order in which they should be added to the result list
Handle cases where one list is longer than the other
To check if parentheses are balanced, use a stack data structure to keep track of opening and closing parentheses.
Use a stack to push opening parentheses and pop when encountering a closing parenthesis
If stack is empty when encountering a closing parenthesis, return false
After iterating through all parentheses, if stack is empty, return true
The right view of a Binary Search Tree shows the nodes that are visible when viewing the tree from the right side.
The right view of a Binary Search Tree includes the rightmost node at each level.
Nodes at each level that are not visible from the right side are not included in the right view.
Example: For the Binary Search Tree with values 1, 2, 3, 4, 5, the right view would be 1, 3, 5.
General DSA with some ds questions
There were DSA questions and time limit was 1 hr
Factorial calculation using tabulation in dynamic programming
Create an array to store factorial values up to n
Initialize the array with base cases (0! = 1, 1! = 1)
Iterate from 2 to n and calculate factorial using previous values in the array
Return the factorial value at index n
posted on 15 Nov 2024
I applied via Campus Placement and was interviewed in Oct 2024. There were 2 interview rounds.
5 sections networking, os, aptitude, dbms, data structures
posted on 8 Jun 2024
I applied via Referral and was interviewed in Dec 2023. There were 4 interview rounds.
Sorting algorithms are used to arrange elements in a specific order.
Sorting algorithms can be categorized as comparison-based or non-comparison-based.
Examples of sorting algorithms include Bubble Sort, Merge Sort, and Quick Sort.
Efficiency of sorting algorithms is measured in terms of time complexity and space complexity.
I applied via Campus Placement and was interviewed in Aug 2023. There were 2 interview rounds.
So total 4 coding questions 2-medium 2-hard
RDBMS is a type of DBMS that stores data in a structured format with relationships between tables.
RDBMS enforces ACID properties for database transactions.
RDBMS uses SQL for querying and managing data.
DBMS is a general term for any system that manages databases, while RDBMS is a specific type.
DBMS may not support relationships between tables like RDBMS does.
Oops concept in Java refers to Object-Oriented Programming principles like Inheritance, Encapsulation, Polymorphism, and Abstraction.
Inheritance allows a class to inherit properties and behavior from another class.
Encapsulation involves bundling data and methods that operate on the data into a single unit.
Polymorphism allows objects to be treated as instances of their parent class.
Abstraction hides the implementation d...
Sorting algorithms are used to arrange elements in a specific order in an array.
Common sorting algorithms include Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and Heap Sort.
Each algorithm has its own time complexity and best/worst case scenarios.
For example, Merge Sort has a time complexity of O(n log n) and is efficient for large datasets.
I applied via Campus Placement and was interviewed in Oct 2022. There were 4 interview rounds.
You will be given a dataset and a questionnaire to be solved over it
Confidence interval is a range of values that is likely to contain the true population parameter with a certain level of confidence.
Confidence interval is used to estimate the population parameter based on a sample statistic.
It is calculated by taking the sample mean and adding or subtracting the margin of error.
The level of confidence is typically set at 95% or 99%.
For example, a 95% confidence interval for the averag...
Logistic regression is a statistical method used to analyze and model the relationship between a binary dependent variable and one or more independent variables.
It is used to predict the probability of a binary outcome (0 or 1).
It uses a sigmoid function to map the input values to the output probability.
It is commonly used in machine learning for classification problems.
Example: predicting whether a customer will buy a...
Confusion matrix is a table used to evaluate the performance of a classification model.
It helps in calculating various metrics like accuracy, precision, recall, F1 score, etc.
It compares the predicted values with the actual values to identify true positives, true negatives, false positives, and false negatives.
It is commonly used in machine learning and data science to evaluate the performance of classification models.
...
Academic projects are assignments given to students to apply their theoretical knowledge in practical scenarios.
Academic projects are designed to help students gain hands-on experience in their field of study.
They require students to apply their theoretical knowledge to solve real-world problems.
Examples of academic projects include building a website, designing a software application, conducting a research study, or c...
It was campus through internship
based on 1 interview
Interview experience
Associate Software Engineer
408
salaries
| ₹5.5 L/yr - ₹11 L/yr |
Associate Consultant
338
salaries
| ₹6.6 L/yr - ₹11 L/yr |
Associate Software Engineer 2
195
salaries
| ₹6.3 L/yr - ₹13 L/yr |
Techno Functional Consultant
189
salaries
| ₹6 L/yr - ₹11.5 L/yr |
Consultant
180
salaries
| ₹6.5 L/yr - ₹19.5 L/yr |
Chargebee
Freshworks
Zoho
CleverTap