Filter interviews by
I applied via Naukri.com and was interviewed in Jul 2024. There was 1 interview round.
Python code for solving a string usecase using stack, SQL join and groupby queries
I applied via Recruitment Consulltant and was interviewed before Apr 2023. There were 3 interview rounds.
DSA questions and programming concepts
Reverse array of strings efficiently
Use two pointers approach to swap characters from start and end of each string
Optimize by using in-place reversal instead of creating new strings
Consider edge cases like empty strings or strings with only one character
posted on 17 Jul 2024
Hackerrank coding round.
I applied via Referral and was interviewed in Apr 2024. There were 2 interview rounds.
The question is about implementing a children sum property in trees and finding the height of a binary tree.
Children sum property in trees means that the value of a node must be equal to the sum of the values of its children nodes.
To find the height of a binary tree, you can recursively calculate the height of the left and right subtrees and return the maximum height plus one.
Example: For a binary tree with nodes 1, 2,
posted on 8 Apr 2024
based on 11 reviews
Rating in categories
Senior Analyst
227
salaries
| ₹7.5 L/yr - ₹23 L/yr |
Analyst
201
salaries
| ₹5 L/yr - ₹12.5 L/yr |
Developer
157
salaries
| ₹9.1 L/yr - ₹28.6 L/yr |
Developer Associate
149
salaries
| ₹5.9 L/yr - ₹15 L/yr |
Consultant
107
salaries
| ₹10 L/yr - ₹33.4 L/yr |
CIBIL
Experian
Equifax
Crif High Mark Credit Information Services