Filter interviews by
I applied via Referral and was interviewed in Sep 2024. There were 2 interview rounds.
I can join within two weeks of receiving an offer.
I can start within two weeks of receiving an offer.
My current notice period is two weeks.
I am available to start immediately.
I applied via devnetjobs and was interviewed before Jan 2023. There were 3 interview rounds.
Project management and client relationship
I applied via Company Website and was interviewed in Feb 2023. There were 3 interview rounds.
Simple skill or knowledge based
Giz interview questions for popular designations
I applied via www.devnetjobsindia.org and was interviewed before Oct 2020. There were 3 interview rounds.
I applied via Devnetjobs and was interviewed before May 2020. There were 3 interview rounds.
Communication at different levels involves adapting communication style and content to suit the audience.
Different levels of communication include interpersonal, group, organizational, and public
Communication style and content should be adapted to suit the audience's needs and preferences
Effective communication at different levels can improve relationships, productivity, and outcomes
Examples include tailoring a present...
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.
based on 7 interviews
Interview experience
Technical Expert
18
salaries
| ₹12.4 L/yr - ₹26 L/yr |
Consultant
10
salaries
| ₹6 L/yr - ₹18 L/yr |
Technical Advisor
10
salaries
| ₹10 L/yr - ₹31 L/yr |
Technical Consultant
6
salaries
| ₹6 L/yr - ₹9 L/yr |
Advisor
6
salaries
| ₹13 L/yr - ₹26.1 L/yr |
Flipkart
Amazon
Snapdeal
Paytm