Filter interviews by
I applied via LinkedIn and was interviewed in Aug 2024. There were 2 interview rounds.
Logical reasoning and Numerical reasoning
I appeared for an interview in Feb 2017.
posted on 3 May 2017
I appeared for an interview before May 2016.
I appeared for an interview 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 appeared for an interview 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 appeared for an interview 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%.
I appeared for an interview before Jun 2016.
I applied via Naukri.com and was interviewed in May 2021. There were 4 interview rounds.
Quick sort is a divide and conquer algorithm that sorts the array by selecting a pivot element and partitioning the other elements around it. Merge sort is also a divide and conquer algorithm that divides the array into two halves, sorts them separately and then merges them.
Quick sort has an average time complexity of O(n log n) while merge sort has a time complexity of O(n log n) in all cases.
Quick sort is an in-place...
System design for Naukri.com platform
Identify user requirements and design the system architecture accordingly
Use scalable and reliable technologies for high traffic handling
Implement features like job search, job posting, resume upload, etc.
Ensure data security and privacy of users
Integrate with third-party services like payment gateways, social media platforms, etc.
Highest sum of contiguous subarray in an array
Use Kadane's algorithm to find the maximum sum subarray
Initialize max_so_far and max_ending_here to 0
Loop through the array and update max_ending_here and max_so_far
Return max_so_far as the highest subset sum subarray
I applied via Naukri.com and was interviewed in May 2021. There were 3 interview rounds.
Add two linked lists and return the sum as a linked list.
Traverse both linked lists and add the corresponding nodes.
Handle carry over while adding nodes.
Create a new linked list to store the sum and return it.
Quick sort is faster but unstable, while merge sort is slower but stable.
Quick sort uses a pivot element to divide the array into two parts and recursively sorts them.
Merge sort divides the array into two halves, sorts them separately, and then merges them.
Quick sort has an average time complexity of O(n log n), while merge sort has a time complexity of O(n log n) in all cases.
Quick sort is not stable, meaning that the...
based on 1 interview
Interview experience
Medical Representative
6
salaries
| ₹3 L/yr - ₹3.6 L/yr |
Manager
5
salaries
| ₹4.5 L/yr - ₹20 L/yr |
Executive
5
salaries
| ₹2 L/yr - ₹11.3 L/yr |
Sales Officer
5
salaries
| ₹3 L/yr - ₹4 L/yr |
Quality Manager
4
salaries
| ₹4.2 L/yr - ₹14.2 L/yr |
Marpu Foundation
Huawei Technologies
HCL Infosystems
Z X Learning