Filter interviews by
I applied via Referral
Top trending discussions
posted on 11 Oct 2020
OOPs stands for Object-Oriented Programming. It is a programming paradigm based on the concept of objects.
OOPs is based on the four main concepts: Encapsulation, Inheritance, Polymorphism, and Abstraction.
Encapsulation is the process of hiding the implementation details from the user.
Inheritance is the process of creating a new class from an existing class.
Polymorphism is the ability of an object to take on many forms.
...
I applied via Job Portal and was interviewed in Jan 2023. There were 3 interview rounds.
posted on 7 Jun 2024
Find the pair element from the array
Iterate through the array and use a hashmap to store elements and their counts
Check if the current element's complement exists in the hashmap
Return the pair if found, otherwise return null
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
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 1 review
Rating in categories
Software Engineer
25
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Front end Developer
6
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Flipkart
Snapdeal
Paytm