çould you please tell the flow of this recursion? with values

You are a genious man !!

Excellent solution sir

Can I know the overall time complexity for your solution to this problem?

Shouldn't the order be like below to finish the game quickly?.

/* Recursive Cases */
    return solvable(array, m, i + m) || 
           solvable(array, m, i + 1) || 
           solvable(array, m, i - 1);

Hi rshaghoulian can you explain how ` return isSolvable(array, m, i + m) || isSolvable(array, m, i + 1) || isSolvable(array, m, i - 1); Is behaving

isSolvable(array, m, i - 1) is giving ArrayIndexOutOfBoundsException ...... in the very 1st test case....

My Code does not working out well.So, What should I do right now.Please tell me because I am still struggling to solve this programming question, Since 1 hours.

Hi, I'm confused with the value at current index eg: test case 1 5 3 1 0 0 0 0 --> I can leap to i+1 || i+3(leap) -- if arr[i+3]||[i+1]==0. i dont see that if i start at index 0 and it has a value 1(not a constraint basedon the question), does'nt make a move

_/_

import java.util.*;

public class Solution {
    public static boolean canWin(int n,int leap, int[] game) {
        int i=0,ptr=0;
          while(i<n){
            if(i+leap<=n-1 && game[i+leap]==0 && leap!=0) i=i+leap;
            else if(i+1<=n-1 && game[i+1]==0) i=i+1;
            else if(i-1>=0 && game[i-1]==0) i=i-1;
            else return false;
            game[i]=1;
            if(i==n-1 || i+leap>=n) return true;
        }
        return true;
    } 
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int q = scan.nextInt();
        while (q-- > 0) {
            int n = scan.nextInt();
            int leap = scan.nextInt();
            
            int[] game = new int[n+leap];
            for (int i = 0; i < n; i++) {
                game[i] = scan.nextInt();
            }

            System.out.println( (canWin(n,leap, game)) ? "YES" : "NO" );
        }
        scan.close();
    }
}

This code passes 5 TCs. I've tried it without using recursion.Please help me complete this code.

My code has passed 5 test cases . it is failing the test cases which has 5000 test cases . does this has to do any thing with that ??i even tried running 5000 test cases but i am getting output for 1473 records can any body try my code and tell me atleast what is happening and why just 1473 test cases are executing ????? +rshaghoulian(appriciate if you can help me)

import java.util.*;

public class Solution {
    public static boolean canWin(int leap, int[] game) {
    	
    	
		for(int i=0, j=0;j<game.length &&i<game.length;j++){
			if(i+leap>=game.length){
				return true;
			}else if(game[i+leap]==0){
				i=i+leap;
				if(i<game.length-1 &&i+leap<game.length ){
					while(game[i]==0 &&i>0 ){
						i--;
					}
					i++;

				}

			}else if(i+1<game.length&&game[i+1]==0){
				i=i+1;

			}else if(i+1<game.length&&game[i+1]==1){
				return false;
			}else{
				return false;
			}



		}return false;
    }
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int q = scan.nextInt();
        while (q-- > 0) {
            int n = scan.nextInt();
            int leap = scan.nextInt();

            int[] game = new int[n];
            for (int i = 0; i < n; i++) {
                game[i] = scan.nextInt();
            }

            System.out.println( (canWin(leap, game)) ? "YES" : "NO" );
        }
        scan.close();
    }
}

it's not working even if i copy pasted by the solution......error showing that cannot find symbol and method anWin cannot applied to the given type.....? what is the problem i have no idea

How can call this function in the main function?

@RodneyShag

Could you please explain why the recursive function will perform all these 3 steps. It should perform just 1 because others are in "OR". So it should be either to one position forward, or direct to the (index+leap) position or 1 step backword.

Could you pleae explain the working of that return statement.

getting eror...

Solution.java:7: error: illegal start of expression private static boolean solvable(int [] array, int m, int i) {

how is this question related to DFS? what is DFS??

Hi bro..! I have solved this problem following your solution,but i did'nt get any pts.Tell me please what's the problem???

sir it not excuting it is showing the errors sir

This is pure genius, great solution.

Can You Tell me What we be the recurrence relation for this

wow that was amazing, I still can't judge where n how to use recursive function

cann you please explaine in breff

Why do we mark game[i] = 1? I know we have visited that index once, but the goal is to see if we can win or not , right?

hey! amazing solution. i was just wondering, can we use DP to solve this?

Nice.. I like how you have used comments to show exactly what the base cases and recursive cases are. Also, writing the three recursive cases on three separate lines makes the solution neater and easier to read. 10/10

This logic is soo neat. Oh my god.

could you please explain the logic to move backward i.e why i-1 ?

This is BRILLIANT. Thankyou!

Why is it false if i < 0 ?

what a beautifull use of recursion!!!

good job

This is really helpful, Thankyou So much for providing this. I am doing this one from past 1 hour, i was completely fed up with this question. Thanks.

can you please tell me about your third recursion "isSolveable(leap, game, i-1 ) ".

// Recursive Cases return isSolvable(leap, game, i + leap) || isSolvable(leap, game, i + 1) || isSolvable(leap, game, i - 1);

                 what's the flow of this?

can anyone explain how this return statement works.

return isSolvable(leap, game, i + leap) || isSolvable(leap, game, i + 1) || isSolvable(leap, game, i - 1);