Filter interviews by
posted on 21 Nov 2021
I applied via Company Website and was interviewed in May 2021. There were 5 interview rounds.
Two easy questions two wasy questions two easy questions two easy questions
3 questions 3 sum linked list missing sum
System design involves creating a high-level architecture of a software system, while HR principles focus on managing people effectively.
System design involves identifying components, defining their interactions, and ensuring scalability and reliability.
HR principles include hiring the right talent, providing training and development opportunities, and fostering a positive work culture.
Both system design and HR princip...
I applied via Campus Placement and was interviewed before May 2023. There were 3 interview rounds.
Easy-level questions were asked. One was for coding up BFS of a tree, another was to implement queue using linked list
Medium level questions were asking related to tree and arrays
Currying is a technique in functional programming where a function with multiple arguments is transformed into a sequence of nested functions, each taking a single argument.
Currying can be achieved using arrow functions in JavaScript.
Arrow functions automatically bind 'this' and do not have their own 'this' value.
Example: const add = a => b => a + b;
Example: const addFive = add(5); const result = addFive(3); // result
First round was aptitude with coding round it was easy
I applied via Referral and was interviewed in Aug 2021. There was 1 interview round.
Find k min elements in given array.
Sort the array and return the first k elements.
Use a min heap of size k to find the k min elements.
Use quickselect algorithm to find the kth smallest element and return first k elements smaller than it.
Check if a given tree is a Binary Search Tree (BST) or not.
Traverse the tree in-order and check if the elements are in ascending order.
Check if the maximum value in the left subtree is less than the root and the minimum value in the right subtree is greater than the root.
Use recursion to check if all subtrees are BSTs.
Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.
Given a BST and a sum, find a pair of nodes whose values add up to the given sum.
Traverse the BST in-order and store the nodes in a list
Use two pointers approach to find the pair with the given sum
If the sum is less than the current pair, move the right pointer to the left
If the sum is greater than the current pair, move the left pointer to the right
If the sum is equal to the current pair, return the pair
Time complexit
1 coding question, and basic MCQ
Consultant
85
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Consultant
53
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Consultant
36
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
35
salaries
| ₹0 L/yr - ₹0 L/yr |
Indegene
Cactus Communications
TCS
IQVIA