Live session #2 | Contest discussion | Doubts

[@it_08amanagarwal35]

Excellent Live Session I am only able to do 2 out of 3 coding question in contest waiting for next contest to do all❤❤❤❤❤❤❤❤❤❤❤

[@ratnasanjay]

Thankyou bhaiya for this session

[@aasifali9139]

thx for this session bhaiya, i will surely give 3rd question a try.

[@acdcacdcacdc]

any prizes in contest like vouchers??

[@aasthagoyal5059]

Contest kha hota hhai??

[@ranitbandyopadhyay]

I could do only 1 and 3. Can't do 2

[@jayanthipenugonda7274]

bro Once check my code please for 3rd question import java.util.*; public class Solution { static boolean flag=false; static int[] arr; public static int[] findLangford(int n) { if(n%4==1 || n%4==2){ return new int[]{-1}; } arr=new int[2*n]; int[] a=new int[2*n]; Arrays.fill(a,-1); helper(n,a); return arr; } static void helper(int n,int[] a){ if(n==0){ for(int i=0;i

[@naveen_kotha]

Could u keep the solution of 3rd Question??

[@ranitbandyopadhyay]

@@naveen_kotha what are you trying to say? I couldn't get it

[@naveen_kotha]

@@ranitbandyopadhyay I asking to share the solution of 3rd Q

[@ranitbandyopadhyay]

@@naveen_kotha it's easy than you can think. See fraz's solution. Lest you can think of an iterative solution that can be solved.