Filter interviews by
I applied via Walk-in and was interviewed in Feb 2023. There were 2 interview rounds.
I was interviewed before Oct 2020.
I applied via Newspaper Ad and was interviewed before Apr 2021. There were 2 interview rounds.
I was interviewed in Dec 2018.
I applied via Approached by Company and was interviewed in Feb 2023. There were 2 interview rounds.
I applied via LinkedIn and was interviewed before Mar 2023. There was 1 interview round.
Hashing is a technique used to map data to a fixed-size array, collision occurs when two different inputs produce the same hash value.
Hashing involves using a hash function to map data to a fixed-size array.
Collision happens when two different inputs produce the same hash value.
Common techniques to handle collisions include chaining and open addressing.
No, time complexity of HashMap is not always O(1).
Time complexity of HashMap is O(1) on average, but can degrade to O(n) in worst case scenarios.
Worst case scenarios include hash collisions, which can lead to linear probing and degrade performance.
Load factor and capacity of the HashMap can also affect time complexity.
In scenarios where many keys hash to the same index, the time complexity can degrade.
Very good coding test ques of linked list were asked
Good questions like what is data science
What is python boss was a good
I applied via Recruitment Consulltant and was interviewed in Mar 2023. There were 2 interview rounds.
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Food & Beverage Associate
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Flight Supervisor
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Commis III
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Jr. Sous Chef
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Team Lead
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Taj Air
Club One Air
InterGlobe Aviation
Spicejet