Filter interviews by
Hashmap problem involving storing and retrieving data efficiently.
Hashmap is a data structure that stores key-value pairs.
It allows for fast retrieval of values based on keys.
Examples include storing student grades by student ID, or mapping employee names to their salaries.
I applied via Referral
Top trending discussions
I was interviewed in Feb 2017.
I was interviewed in Dec 2016.
posted on 3 May 2017
I was interviewed before May 2016.
I was interviewed in Mar 2017.
To make the red fishes 98%, 50 fishes have to be removed from the aquarium.
Calculate 1% of 200 fishes, which is 2 fishes.
To make the red fishes 98%, subtract 1% (2 fishes) from 99% (198 fishes).
To find the number of fishes to be removed, divide the difference by 1% (2 fishes).
Therefore, 50 fishes have to be removed to make the red fishes 98%.
I was interviewed in Mar 2017.
To make the red fishes 98%, 50 fishes have to be removed from the aquarium.
Calculate 1% of 200 fishes to find the number of red fishes.
Subtract the number of red fishes from 200 to find the number of non-red fishes.
Calculate 2% of the total number of fishes to find the desired number of red fishes.
Subtract the desired number of red fishes from the current number of red fishes to find the number of fishes to be removed.
posted on 28 Jun 2017
I was interviewed in Mar 2017.
To make the red fishes 98%, 50 fishes have to be removed from the aquarium.
Calculate 1% of 200 fishes to find out how many fishes represent 1%.
Multiply the result by 2 to find out how many fishes represent 2%.
Subtract the result from 200 to find out how many fishes represent 98%.
based on 1 interview
Interview experience
based on 6 reviews
Rating in categories
Software Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Program Manager 2
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Microsoft Corporation
Apple
Samsung