Filter interviews by
Be the first one to contribute and help others!
I applied via Company Website and was interviewed before Dec 2020. There were 3 interview rounds.
posted on 27 Apr 2022
I applied via Company Website and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Recruitment Consultant and was interviewed before May 2020. There were 4 interview rounds.
I applied via Recruitment Consultant and was interviewed in Jan 2021. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before Dec 2021. There were 3 interview rounds.
Good not too tough not too much easy
I applied via Naukri.com and was interviewed in Jun 2021. There were 3 interview rounds.
I applied via Shine and was interviewed in May 2023. There were 2 interview rounds.
Sliding window problem involves finding a subarray of fixed size k with maximum sum.
Use a sliding window approach to iterate through the array and calculate the sum of each subarray of size k.
Keep track of the maximum sum encountered so far.
Move the window by one element at a time and update the sum accordingly.
Example: Given array [1, 3, -1, -3, 5, 3, 6, 7] and k = 3, the subarray with maximum sum is [5, 3, 6] with su
I applied via Referral and was interviewed in Apr 2022. There were 2 interview rounds.
based on 1 review
Rating in categories
Fabindia
Raymond Lifestyle Limited
Welspun Living Limited
Arvind Group