Filter interviews by
I applied via Referral and was interviewed before Feb 2023. There were 2 interview rounds.
Basic aptitude questions
Top trending discussions
I applied via Naukri.com and was interviewed in Mar 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Jul 2021. There were 3 interview rounds.
The Python code to get the output string as 'jareen arpohc' from the input string 'neeraj chopra' is provided.
Split the input string into individual words
Reverse each word
Join the reversed words with a space in between
Code to list even numbers from a given list of 10 numbers.
Loop through the list of numbers
Check if each number is even using the modulo operator
If the number is even, add it to a new list of even numbers
Return the new list of even numbers
Reversing a string in Python code
Use slicing to reverse the string
Use the built-in function 'reversed()'
Convert the string to a list, reverse it, and then join it back to a string
I applied via Naukri.com and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
I have experience with various machine learning algorithms including decision trees, random forests, support vector machines, and neural networks.
Decision trees
Random forests
Support vector machines
Neural networks
Perform operations in dataframe
I applied via Naukri.com and was interviewed in Feb 2021. There were 4 interview rounds.
I applied via Campus Placement and was interviewed in Mar 2021. There were 4 interview rounds.
posted on 28 Jul 2021
I applied via Campus Placement and was interviewed before Jul 2020. There was 1 interview round.
Check if binary tree is balanced or not.
A balanced binary tree has the height of left and right subtrees differ by at most 1.
Recursively check the height of left and right subtrees and compare.
Use a helper function to calculate the height of a subtree.
Time complexity: O(nlogn) for a balanced tree, O(n^2) for a skewed tree.
Detect loops in a linked list.
Use two pointers, one moving at a faster pace than the other.
If there is a loop, the faster pointer will eventually catch up to the slower one.
To detect the start of the loop, reset one pointer to the head and move both pointers at the same pace.
I applied via Walk-in and was interviewed in Jul 2023. There were 2 interview rounds.
Asked basic questions on aptitude and reasoning
It cosist of some aptitude questions
I applied via Walk-in and was interviewed before Aug 2022. There were 4 interview rounds.
Test of SQL, Tableau and other skills based on your resume on Skillate
based on 1 interview
Interview experience
based on 7 reviews
Rating in categories
Senior Associate
30
salaries
| ₹0 L/yr - ₹0 L/yr |
Quality Analyst
29
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Manager
16
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Medical Billing Associate
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Maxgen Technologies
Magic Edtech
VDart
ANR Software Private Limited