Filter interviews by
Excel assignment look up assignments
I applied via Approached by Company and was interviewed before Jul 2023. There was 1 interview round.
The assignment was an excel assignment to check the advance excel efficiency of the interviewee
I applied via Naukri.com and was interviewed before Oct 2021. There were 2 interview rounds.
posted on 21 Feb 2025
I appeared for an interview in Jan 2025.
I have 5 years of experience in my current company working in various roles.
Started as a junior associate and worked my way up to a senior position
Led multiple projects and teams, showcasing strong leadership skills
Implemented new strategies that resulted in increased efficiency and productivity
Received recognition for outstanding performance and contributions to the company
posted on 19 Jul 2022
I applied via Recruitment Consulltant and was interviewed in Jan 2022. There were 2 interview rounds.
posted on 6 Oct 2022
I applied via Referral and was interviewed before Oct 2021. There were 3 interview rounds.
CFA and DFA are Change-Tracking and Database-First Approaches in Entity Framework Core.
CFA (Change-Tracking Approach) is used to track changes made to entities in memory and then save them to the database.
DFA (Database-First Approach) is used to generate entity classes and DbContext from an existing database schema.
CFA is useful when working with disconnected entities, while DFA is useful when working with an existing ...
Two easy questions two wasy questions two easy questions two easy questions
1 coding question, and basic MCQ
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
based on 5 interviews
Interview experience
based on 8 reviews
Rating in categories
Consultant
86
salaries
| ₹9.9 L/yr - ₹22 L/yr |
Associate Consultant
53
salaries
| ₹6.5 L/yr - ₹18 L/yr |
Associate
37
salaries
| ₹5 L/yr - ₹8.5 L/yr |
Senior Consultant
36
salaries
| ₹13.5 L/yr - ₹25 L/yr |
Senior Associate
35
salaries
| ₹6.5 L/yr - ₹11 L/yr |
Markets and Markets
Markelytics Solutions
Jasper Colin
Cotecna Inspection India