Filter interviews by
I applied via Approached by Company
I applied via Referral and was interviewed before Sep 2020. There was 1 interview round.
I applied via Company Website and was interviewed before Sep 2021. There were 2 interview rounds.
Active Directory is a Microsoft service that manages network resources and user accounts.
It is used to authenticate and authorize users and computers in a Windows domain network.
It stores information about users, computers, printers, and other network objects.
It allows administrators to manage network resources and apply security policies.
It uses a hierarchical structure of domains, trees, and forests to organize netwo...
LINK interview questions for popular designations
I applied via Campus Placement and was interviewed in Jul 2020. There were 4 interview rounds.
I appeared for an interview in Aug 2017.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
I applied via Naukri.com and was interviewed in May 2019. There were 4 interview rounds.
I applied via Company Website and was interviewed in May 2019. There were 5 interview rounds.
I applied via Company Website and was interviewed in May 2019. There were 4 interview rounds.
Implemented a new customer feedback system that increased customer satisfaction by 20%
Implemented a new customer feedback system to gather insights and improve customer experience
Analyzed feedback data to identify common issues and areas for improvement
Implemented changes based on feedback to address customer concerns and enhance overall satisfaction
Trained team members on how to effectively use the new system and inte...
I applied via Naukri.com
Associate
35
salaries
| ₹3 L/yr - ₹4.4 L/yr |
Senior Associate
17
salaries
| ₹3.2 L/yr - ₹8 L/yr |
Team Lead
7
salaries
| ₹7.3 L/yr - ₹11 L/yr |
Project Manager
7
salaries
| ₹10 L/yr - ₹21 L/yr |
IT Support Analyst
5
salaries
| ₹4.2 L/yr - ₹12 L/yr |
Flipkart
Amazon
Snapdeal
Paytm