i
Snapdeal
Filter interviews by
Clear (1)
I applied via Recruitment Consulltant and was interviewed in Dec 2023. There was 1 interview round.
The order of execution refers to the sequence in which instructions or operations are executed in a program.
The order of execution is determined by the programming language and the specific code being executed.
Generally, code is executed line by line from top to bottom.
However, there are exceptions such as loops, conditionals, and function calls that can alter the order of execution.
In some programming languages, there...
Top trending discussions
I want to join eBay because of its global reach, innovative technology, and strong company culture.
Global reach: eBay operates in multiple countries, allowing me to work on projects with a global impact.
Innovative technology: eBay is known for its cutting-edge technology and continuous innovation, which excites me as a software engineer.
Strong company culture: eBay values diversity, collaboration, and personal growth, ...
I was interviewed 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
based on 3 reviews
Rating in categories
Assistant Manager
103
salaries
| ₹0 L/yr - ₹0 L/yr |
Category Manager
93
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Executive
89
salaries
| ₹0 L/yr - ₹0 L/yr |
Deputy Manager
59
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
49
salaries
| ₹0 L/yr - ₹0 L/yr |
Flipkart
Amazon
Meesho
eBay