i
PromptCloud
Filter interviews by
I applied via Naukri.com and was interviewed before Oct 2019. There was 1 interview round.
Top trending discussions
I applied via Referral and was interviewed in Sep 2024. There was 1 interview round.
The requirement of bananas in a city like Mumbai can be calculated based on population, consumption habits, and availability.
Calculate the population of Mumbai
Estimate the average consumption of bananas per person
Consider factors like tourism and events that may increase demand
Take into account the availability of bananas from local markets and imports
A good retailer focuses on customer satisfaction, product quality, and efficient operations.
Good retailers prioritize customer satisfaction by providing excellent customer service and addressing customer needs.
Good retailers offer high-quality products that meet customer expectations.
Good retailers have efficient operations, including inventory management, supply chain logistics, and streamlined processes.
Bad retailers...
I applied via LinkedIn and was interviewed in Oct 2024. There were 2 interview rounds.
Was given two hours to implement an Api
Number of islands in DSA refers to the problem of finding the number of connected groups of 1s in a 2D grid.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the grid and mark visited islands.
Count the number of times DFS/BFS is called to find the total number of islands.
Consider diagonal connections if specified in the problem.
Example: Given grid [['1','1','0','0'],['0','1','0','1'],['1','0','0','
Quantiative Aptitude
45 minutes test of aptitude and sql
I applied via LinkedIn and was interviewed before May 2022. There were 2 interview rounds.
Python dictionary is implemented using hash tables.
Python dictionary is a collection of key-value pairs.
The keys in a dictionary must be unique and immutable.
The values in a dictionary can be of any data type.
Python dictionary is implemented using hash tables.
Hash tables provide constant time complexity for insertion, deletion and retrieval of elements.
The hash function used in Python dictionary is based on the key's h...
Heap sort is a comparison-based sorting algorithm that uses a binary heap data structure.
It divides the input into a sorted and an unsorted region.
It repeatedly extracts the maximum element from the unsorted region and inserts it into the sorted region.
It has a time complexity of O(n log n) and is not stable.
Example: [8, 5, 3, 1, 9, 6, 0, 7, 4, 2] -> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
I applied via Indeed and was interviewed before Aug 2023. There were 3 interview rounds.
Core HTML, CSS and JS
JS deep dive and react
based on 3 reviews
Rating in categories
Software Engineer
31
salaries
| ₹5 L/yr - ₹8.2 L/yr |
Data Engineer
10
salaries
| ₹4 L/yr - ₹8 L/yr |
Devops Engineer
9
salaries
| ₹6.5 L/yr - ₹10.6 L/yr |
Data Quality Analyst
7
salaries
| ₹2 L/yr - ₹5 L/yr |
Technical Program Manager
7
salaries
| ₹6.5 L/yr - ₹10 L/yr |
InsanelyGood
Mogli labs
Shine
Vegrow