Filter interviews by
I applied via LinkedIn and was interviewed in Feb 2024. There was 1 interview round.
Increase virtual CPU without stopping it by hot adding CPU resources.
Use hot add feature provided by the virtualization platform to increase CPU resources without shutting down the virtual machine.
Ensure that the virtual machine and the underlying hypervisor support hot adding CPU resources.
Monitor the performance of the virtual machine after adding CPU resources to ensure optimal performance.
Examples: VMware vSphere a...
I applied via Naukri.com
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I appeared for an interview before May 2016.
I appeared for an interview in Sep 2016.
As a mechanical engineer, I choose corporate because it offers diverse opportunities, professional growth, and stability.
Corporate provides a wide range of industries and sectors to work in, allowing me to explore different areas of mechanical engineering.
Working in a corporate environment offers opportunities for professional growth through training programs, mentorship, and exposure to new technologies.
Corporate jobs...
I appeared for an interview in Mar 2017.
I appeared for an interview in Oct 2016.
I applied via Campus Placement
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit
based on 1 interview
Interview experience
Devops Engineer
44
salaries
| ₹8.4 L/yr - ₹24 L/yr |
Cloud Engineer
39
salaries
| ₹2.8 L/yr - ₹8 L/yr |
Data Engineer
13
salaries
| ₹8 L/yr - ₹19 L/yr |
Senior Data Engineer
12
salaries
| ₹20 L/yr - ₹35.9 L/yr |
Senior Developer
12
salaries
| ₹15 L/yr - ₹30 L/yr |
Teleperformance
Amazon
Deloitte
KPMG India