i
Elite Elevators
Filter interviews by
Clear (1)
Guido van Rossum
Guido van Rossum is the founder of Python programming language
He started developing Python in the late 1980s
Python was first released in 1991
Top trending discussions
I applied via Campus Placement and was interviewed in Apr 2022. There was 1 interview round.
I applied via AmbitionBox and was interviewed in Feb 2022. There were 2 interview rounds.
Aptitude, Reasoning
Technical codes
I applied via Campus Placement and was interviewed in Apr 2022. There were 2 interview rounds.
I applied via Company Website and was interviewed before Dec 2020. There were 3 interview rounds.
Reverse a given Linked List with O(1) and O(N) space complexity.
For O(1) space complexity, use three pointers to reverse the links in place.
For O(N) space complexity, use a stack to store the nodes and then pop them to create the reversed list.
Be careful with edge cases such as empty list or list with only one node.
Find the celebrity in a party of N people where only one person is known to everyone.
The celebrity doesn't know anyone in the party.
We can use a stack to keep track of potential celebrities.
If a person knows someone, they cannot be a celebrity.
If a person doesn't know someone, we can push them onto the stack.
After iterating through all people, we check if the stack has only one person and if that person is known to eve
Merge Sort and Quick Sort are sorting algorithms that use divide and conquer approach.
Merge Sort divides the array into two halves, sorts them recursively, and then merges them.
Quick Sort selects a pivot element, partitions the array around the pivot, and recursively sorts the sub-arrays.
Merge Sort has a worst-case time complexity of O(nlogn), while Quick Sort has an average case time complexity of O(nlogn).
Merge Sort ...
Compute amount of water trapped in an elevation map after raining
Iterate through the array and find the maximum height on the left and right of each bar
Calculate the amount of water that can be trapped on each bar using the difference between the minimum of the two maximum heights and the height of the bar
Add up the amount of water trapped on each bar to get the total amount of water trapped
Zigzag traversal of a binary tree is a way of traversing the tree in a zigzag pattern.
Use a stack to keep track of nodes to be visited.
For each level, alternate between adding nodes to the stack from left to right and right to left.
Pop nodes from the stack and add their children to the stack in the appropriate order.
Repeat until all nodes have been visited.
Sort a dictionary by key or value in ascending/descending order.
Use sorted() function with lambda function to sort by key or value.
For ascending order, use reverse=False and for descending order, use reverse=True.
Example: sorted_dict = sorted(dictionary.items(), key=lambda x: x[0], reverse=True)
I applied via Campus Placement and was interviewed in Jun 2021. There were 3 interview rounds.
I applied via Naukri.com and was interviewed in Mar 2022. There were 2 interview rounds.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Business Development Manager
166
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Development Executive
29
salaries
| ₹0 L/yr - ₹0 L/yr |
HR Executive
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Relationship Manager
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Regional Manager
18
salaries
| ₹0 L/yr - ₹0 L/yr |
Otis Elevator
KONE
Schindler Group
Johnson Lifts