Filter interviews by
I applied via Campus Placement and was interviewed in Mar 2024. There were 4 interview rounds.
Two DSA question based on dp and recurssion
The depth of a string is the number of nested levels of parentheses in the string.
Iterate through the characters of the string and keep track of the current depth using a counter variable.
Increment the counter when an opening parenthesis is encountered and decrement it when a closing parenthesis is encountered.
Return the maximum depth reached during the iteration as the final depth of the string.
The right view of a binary tree shows the rightmost nodes at each level from top to bottom.
Traverse the tree in a level order manner and keep track of the rightmost node at each level.
Use a queue to store nodes at each level and update the rightmost node as you traverse.
Example: For a binary tree with root node 1 and right children 3 and 4, the right view would be [1, 3, 4].
I was asked 2 medium level DSA problems and expectation was to cover every edge case while writing code
I applied via Referral and was interviewed in Aug 2023. There were 2 interview rounds.
Was alright. Needed some time to practice.
Top trending discussions
I applied via Company Website and was interviewed before Feb 2020. There was 1 interview round.
I applied via Walk-in and was interviewed before Sep 2019. There were 5 interview rounds.
I applied via Campus Placement and was interviewed in Oct 2020. There were 4 interview rounds.
Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.
Start from the first element and compare it with the next element
If the next element is smaller, swap them
Repeat this process for all elements in the array
Continue this process until no more swaps are needed
A program to print all prime numbers
Take input from user for range of numbers
Loop through the range and check if each number is prime
Print the prime numbers
Hashmap is a data structure that stores key-value pairs and allows constant time access to values based on their keys.
Hashmap uses a hash function to map keys to indices in an array.
Collisions can occur when multiple keys map to the same index, which can be resolved using techniques like chaining or open addressing.
Examples of hashmap implementations include Java's HashMap class and Python's dict type.
Inheritance is a mechanism in object-oriented programming where a new class is created by inheriting properties of an existing class.
Inheritance allows code reuse and promotes code organization.
The existing class is called the parent or superclass, and the new class is called the child or subclass.
The child class inherits all the properties and methods of the parent class and can also add new properties and methods.
For...
based on 2 interviews
Interview experience
Software Development Engineer II
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Development Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Product Manager
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Zoomcar
Revv
Drivezy
Myles Cars