i
Ankercloud
Filter interviews by
I applied via Campus Placement
Top trending discussions
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
I applied via Campus Placement and was interviewed before Nov 2020. There were 4 interview rounds.
I applied via Campus Placement and was interviewed before Nov 2020. There was 1 interview round.
I applied via Walk-in and was interviewed before Jun 2021. There were 2 interview rounds.
HR told about the company on the first day, how it works, told the rules, showed the management and a lot
Insertion sort and quicksort are sorting algorithms used to sort arrays of data.
Insertion sort: iterates through the array and inserts each element into its proper position.
Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.
Insertion sort is best for small arrays, while quicksort is best for large arrays.
Bot...
Merge two sorted linked lists using recursion
Create a recursive function that compares the first nodes of both lists
Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list
Base case: if one list is empty, return the other list
Return the merged list
Given an integer, determine which byte is zero.
Convert the integer to a byte array using bitwise operations.
Iterate through the byte array and check for a zero value.
Return the index of the zero byte.
Consider endianness when converting to byte array.
To check endianness, create a 4-byte integer with a known value and check the byte order.
Create a 4-byte integer with a known value
Check the value of the first byte to determine endianness
If the first byte is the least significant, the machine is little endian
If the first byte is the most significant, the machine is big endian
Static objects can be used to print something before main() execution.
Static objects are initialized before main() execution
They can be used to print something before main()
Example: static int x = printf("Hello World!");
Output: Hello World! will be printed before main() execution
Static variables are allocated memory in the data segment of the program's memory space.
Static variables have a fixed memory location throughout the program's execution.
They are initialized to zero by default.
If initialized explicitly, they are stored in the data segment.
Static variables can be accessed by any function in the program.
Finding space and time complexity of a recursive function.
Space complexity is the amount of memory used by the function.
Time complexity is the amount of time taken by the function to execute.
Recursive functions have higher space complexity due to the call stack.
Time complexity can be calculated using Big O notation.
Examples of recursive functions include factorial and Fibonacci sequence.
Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.
Occurs when a class inherits from two classes that share a common base class
Can lead to ambiguity in method calls and data members
Solved using virtual inheritance or by using interfaces
based on 1 interview
Interview experience
based on 26 reviews
Rating in categories
3-8 Yrs
Not Disclosed
3-5 Yrs
Not Disclosed
1-2 Yrs
Not Disclosed
Site Reliability Engineer
19
salaries
| ₹2.5 L/yr - ₹4.5 L/yr |
Machine Learning Engineer
18
salaries
| ₹3.5 L/yr - ₹7.5 L/yr |
Data Engineer
7
salaries
| ₹5.6 L/yr - ₹10.4 L/yr |
Devops Engineer
5
salaries
| ₹3.5 L/yr - ₹13.6 L/yr |
Project Manager
5
salaries
| ₹7 L/yr - ₹19 L/yr |
Salesforce
Microsoft Corporation
Oracle
SAP