Filter interviews by
I applied via Approached by Company and was interviewed before Jun 2021. There were 3 interview rounds.
Hackerrank - dp problems
Find minimum number of jumps required to reach the end of an array.
Use dynamic programming approach to solve the problem.
Maintain an array to store minimum number of jumps required to reach each index.
Traverse the array and update the minimum number of jumps for each index.
Return the minimum number of jumps required to reach the end of the array.
Top trending discussions
posted on 4 Apr 2023
I applied via campus placement at Lovely Professional University (LPU) and was interviewed before Apr 2022. There were 4 interview rounds.
Implementing 2 stacks with optional approach
Two stacks can be implemented in a single array by dividing it into two halves
Optional approach can be implemented by using a third parameter to indicate which stack to use
Push and pop operations can be performed on both stacks independently
posted on 20 Apr 2022
I applied via Recruitment Consulltant and was interviewed in Mar 2022. There was 1 interview round.
I applied via Approached by Company and was interviewed in Jul 2024. There were 3 interview rounds.
posted on 5 Jun 2024
I applied via Recruitment Consulltant and was interviewed in Jul 2024. There was 1 interview round.
posted on 10 Jan 2025
MVVM was asked and swift questions
Time and work ,time and distance
I applied via Company Website and was interviewed in Aug 2023. There were 4 interview rounds.
based on 1 review
Rating in categories
Area Sales Manager
34
salaries
| ₹3.8 L/yr - ₹6.7 L/yr |
Assistant Manager
24
salaries
| ₹6 L/yr - ₹16 L/yr |
Senior Associate
20
salaries
| ₹4 L/yr - ₹12 L/yr |
Product Manager
16
salaries
| ₹15 L/yr - ₹35 L/yr |
Software Developer
14
salaries
| ₹12.1 L/yr - ₹22 L/yr |
LazyPay
Payed
Axio
LendingKart