Hey, Kunal, Actually, your DSA playlist is awesome and I have learnt the recursion and tree basic concepts from you thoroughly thank you. Can you please make the videos on Graphs and DP.
@Anic10
2 жыл бұрын
Kunal, your series helped me with motivation. I got selected in Morgan Stanley as QA. Thanks brother. 😊
@KunalKushwaha
2 жыл бұрын
That's amazing, congratulations and thank you!
@Anic10
2 жыл бұрын
Hi Kunal, first of all a very big thank you. I have started watching your KZitem videos of Data structures #DSAwithKunal. I am an experienced guy with 4 years of Automation Testing experience. I started leetcode when you solved that recursion problem. Your Strings video helped me with clearing concepts. Every QUALITY ASSURANCE guy/girl must also watch this series. #Dsforall Currently completing Recursion series. Thanks man. A big thank you 🙏
@tafiquehossainkhan3740
2 жыл бұрын
Bro when will we get all the video..
@pythonenthusiast9292
2 жыл бұрын
@@Anic10 but bro how is DSA helping in field of QA ?
@Anic10
2 жыл бұрын
@@pythonenthusiast9292 Yes bro.. Big tech companies like Arcesium, Browserstack have coding rounds prior to interviews. In interviews they ask easy to medium problems on linked list,stacks ,queue and time complexities. So to become SDET DSA is necessary.
@akashvarma4325
2 жыл бұрын
In the isSafe method in the If condition you have written "board[row][col] == num" which is only checking that element for 9 times instead of checking all the forward elements, it is not giving error but the sudoku is not properly solved, instead there should be "board[row][i] = num" which will check other elements in the row as well and then the sudoku will be solved properly.
@mukeshkumarv5677
2 жыл бұрын
Yeah I also noticed that 😅...
@arpityadav2268
2 жыл бұрын
Yeah, you are right, bro!
@aakashyadav9117
Жыл бұрын
You are right i was not able to solve sudoku and this took me 1 hour to find this issue . thanx bro
@gojosatoru988
Жыл бұрын
I saw that too, like in the first row 6 & 2 are getting repeated, and same issue with other rows
@suhaspatil8682
2 жыл бұрын
Wow . The best Recursion playlist ever made (according to me) . As you said I have drawn Recursive tree for each and every problem. Yes it was time consuming and it was really tough in the beginning but later on I started enjoying it. So I will suggest whoever thinking to follow this DSA playlist can follow it blindly.
@KunalKushwaha
2 жыл бұрын
Wow, thank you!
@rahuls8613
2 жыл бұрын
I am a beginner in coding can I watch it for good jobs? I think it is in Java.
@shyamraj3605
2 жыл бұрын
@@rahuls8613 yes
@Tomharry910
Жыл бұрын
I have now watched all the 11 videos in your recursion series playlist. I am now able to understand how recursion functions - how the recursion calls go onto the stack and how it comes out. I feel more confident with recursion which I used to dread earlier and was a nightmare for me. I now feel happier when I learn to code. Your videos has helped hundreds of thousands of struggling students like me and in the coming time hopefully will help millions of students learning to code around the world. Thank you for sharing your knowledge and wisdom so generously and freely with us without even charging a penny. Hope the seeds of learning that you have sowed in our lives, abounds and brings much happiness and success in your life as well. Wishing you the very best life has to offer. Thank you so much, Sensei 🙏💐💐
@KunalKushwaha
Жыл бұрын
You’re welcome
@shanmugamnp4615
Жыл бұрын
@@KunalKushwaha Hey Kunal, We need the content of Dynamic Programming, Tree and Graph algorithms from you. Please do it as soon as possible.
@mbilal11097
2 жыл бұрын
We can't thank this guy enough. Such an amazing course so far.
@piyushgupta6290
2 жыл бұрын
Don't know how people can dislike this kind of content. This is the finest and most premium course I have found not only youtube even the paid contents. And this DSA course is not just a course its like we are feeling the DSA. Making my imagination strong and new thought process starts growing. THANK. YOU KUNAL BHAI YOU ARE LIT!!
@jnayehsirine6222
Жыл бұрын
its been more than 3 months since i completed the serie and i still rwatch again , thank youuuu !!!!!
@shafinnahian75
Жыл бұрын
Kudos to you, man. I genuinely found a mentor I can follow. I can certainly see light on the other end of the road, and you're helping me to walk each step - carefully guiding me through every obstacle upfront. Thank you, Kunal. I sincerely mean it. Just completed the Recursion playlist ( July 10th, 2023 ). Going to complete a few "Assignments" from your GitHub repo and dive deep into the DSA playlist afterwards. I'll keep you updated with that playlist too xD Thanks again, man. If I could, I would've given you the warmest hug (with a box of biriyani of course XD )
@mohammedharoon1167
Күн бұрын
I dont think anyone will hate recursion after completing this playlist. if they do it must be lack of practice. Lovable course for sure 😍😍😍
@snehashishghosh6914
2 жыл бұрын
The way you broke down the ideas and made them so simple to understand and apply is "very next level" :)
@shivamtyagi2668
2 жыл бұрын
it took me 2 days ,but i didn't give up, I SOLVED it, Revised everything I was struggling with
@KunalKushwaha
2 жыл бұрын
awesome
@animeshsingh3748
2 жыл бұрын
This is literally the best recursion playlist I ever laid my eyes on. You made sure to cover all the doubts that could arise in one's mind. Your explanations were just amazing and you made these problems look so simple. Thanks for all your hard work and dedication. 😊
@nikhilchauhan3506
Жыл бұрын
hi bro can you help me
@anujraj1000
3 ай бұрын
Just minor correction, while checking the row for the number instead of board[row][col]== num, just replace col with [i] . It will fix the duplication issue.
@hargunsingh8800
Жыл бұрын
Hi Kunal, Your recursion playlist on KZitem has been a game-changer for me! I have learned so much and have been able to apply the concepts in my coding projects. I would love to see a new lecture series on dynamic programming. I know it's a challenging topic, but I trust your teaching style and explanations to make it more approachable. Keep up the great work!
@adbhuthareddy
2 жыл бұрын
Never tried to solve a sudoku in my entire life. Now just writing a program for sudoku to solve itself 😎.... Came a long way 😂 Thanks @Kunal Kushwaha
@KunalKushwaha
2 жыл бұрын
Best of luck!
@adbhuthareddy
2 жыл бұрын
@@KunalKushwaha Thank you Bro !!!
@aswinvignesh3985
Жыл бұрын
@KunalKushwaha +1 mistake, which no one spotted for suprise. In nKnights , the loop goes on stops at the last row and last col of matrix , instead of running through it . Your code - row
@aswinvignesh3985
Жыл бұрын
For 3 x 3 there should be 36 ans instead we have 25 ans since last box is missed in output. Check output there will be no knight in last box in any of those ans
@GuruPruthviJM
25 күн бұрын
Hey, Kunal, Actually, your DSA playlist is awesome and I have learnt the recursion and tree basic concepts from you thoroughly thank you. Can you please make the videos on Graphs and DP.
@Rashmi-bs-09
8 ай бұрын
Yes, the best Recursion Playlist with progression to Backtracking concept so Far . Thanks Kunal, Keep up the good work .
@hrithikshaw434
2 жыл бұрын
Once again best quality teaching as always. Thankyou Kunal ❤️
@KunalKushwaha
2 жыл бұрын
Thanks for sharing! More to come!
@poorpanda9033
10 ай бұрын
Watching this video after completing the previous videos, Just makes it so easy to understand ! Thank you so much for teaching this for FREE!
@KunalKushwaha
10 ай бұрын
Glad it was helpful!
@vudumulanagasairahul1298
8 ай бұрын
complete this playlist and dynamic programming as soon as possible brother you are worth for every student iam loving your content so much
@amitbutola2291
2 жыл бұрын
15:50 Simple way to find diagonal left and diagonal right // diagonal left int r = row; for(int c = col;c>=0&&r>=0;c--,r--){ if(board[r][c]){ return false; } } // diagonal right r = row; for(int c = col;c=0;c++,r--){ if(board[r][c]){ return false; } }
@abhinjr4918
9 ай бұрын
i wrote the same thing in my rough before he explained other approach
@petersampodiras6590
2 жыл бұрын
This is by far the best playlist on youtube. Your teaching is truly amazing. Are you planning on making any videos explaining dynamic programming?
@tharunkumar9208
Ай бұрын
I always feared of recursion and data structures even after started this bootcamp..i gave up at recursion videos at first but later i thought of giving a shot and now im here and can say that i really loved learning recursion and the way you are teaching is awesome. Looking forward for more videos on this playlist.
@thankyou2494
2 жыл бұрын
I was feeling sleepy but This video is refreshing
@himanshusharma3301
2 жыл бұрын
I think that for the isValid function if the N- Knights there should be 4 more conditions which are : (r+2,c+1) ,(r+2,c-1),(r+1,c+2) &(r+1,c-2) .
@roshanmhatre8810
2 жыл бұрын
Yeah, total 8 conditions are there.
@prasoonlall9432
2 жыл бұрын
We are moving gradually downwards from each row. So while checking, we need to make sure that the new location doesn't have any knights positioned above that row, as the below rows will be empty at that stage. Hence, he didn't include all 8 conditions. Even if he did add the remaining 4 conditions, they'll always return true as they would contain false at that stage.. Hope you got the concept.
@shubhamrawat3984
2 жыл бұрын
If I am placing a knight at (r, c), where will the previous knight could be present? (keep in mind that we are travelling one row after another) Will the previously placed knights be present on the same row as ours and on the rows before it? OR Can a previously placed knight be found on the rows below our current (r, c)? If not, then do we really have to check for r+1 and r+2 rows?? THINK ABOUT IT.....
@ShiveshSumbly
Жыл бұрын
bro we only check for the above rows whle placing the knight because we are placing them from top to bottom
@aswinvignesh3985
Жыл бұрын
Its like we both have eye contact, if i can see you then you can definitely see me . Same in knights we only check on top or above moves because there is no knights below . Both has same moves if they intercepted
@deepakchourasiya5957
2 жыл бұрын
Soon you will receive silver play button ✌😊
@suheabkhan2546
2 жыл бұрын
The best I have ever seen... Felt happy from depths of my heart💖💖
@kavyaN2004
3 күн бұрын
Kunal.... Please start uploading videos for dynamic programming...! Please.. I have been trying for so long to learn DP but couldn't able to solve the problems. So please start teaching dynamic programming.🥺🥺🥺
@amansayer4943
Жыл бұрын
i dont know why i am not getting this backtracking questions .but still thank you kunal you created the base of recursion .
@Karan-vq5vg
2 жыл бұрын
For SUDOKU Solver : Is the if condition under //row check correct? I think it should be if(board[row][i] == num) return false. What is your opinion Kunal?
@anandhisubramaniam6630
2 жыл бұрын
I guess it is row, i, where it should remove duplicates.
@158.sahilsaxena8
2 жыл бұрын
That's exactly i am thinking about... @ 1:07:51 - there is no dependency of if condition on the loop... so how it check row's element..... it should be if ( board [row] [i] == num) and the output was also incorrect .... there were a repeating elements is the row....
@priyanshutiwari1151
2 жыл бұрын
Yes u r right karan....there should be board[row][i]
@Coding_GupShup
7 ай бұрын
Thanks a lot for solution, i just stuck there. And thought where was the actual problem. Thank u.
@nancychhatwal2615
7 ай бұрын
COMPLETE SUDOKU CODE WITH COMMENTS:- public class Sudoku { public static void solve(int[][] grid,int n){ solveSudoku(grid,0,0,n); } public static void solveSudoku(int[][] grid,int row,int col,int n){ //print the grid if we have reached the last row and last col if(row == grid.length-1 && col == grid.length){ for(int i=0;i
@PradeepYadav-fg2yg
2 жыл бұрын
never thought i could literally understand these concepts thankyou for teaching🙏🙏
@rishabhrawat8197
2 жыл бұрын
thankyou you made coding so interesting its approx. one month following your dsa series i purchased some courses but i never got intuitions then i skipped coding now i am getting intuitions as well
@aniruddhmishra6182
Жыл бұрын
By far the best recursion playlist i've ever seen
@the_ranjit_kumar_nayak
2 жыл бұрын
I just eagerly wait for your video kunal ❤️
@satishgajavilli7816
2 жыл бұрын
Sir, understanding videos very very well but coming to assignment facing lot of difficulty
@KunalKushwaha
2 жыл бұрын
check leetcode video i made
@sweetyprasad287
5 ай бұрын
Thank you so much for this amazing recursion series!
@AkOp-bf9vm
19 күн бұрын
Easy peasy lemon squeezy to Solve Soduku in c++ bool SudukuSolver(vector &board,int row,int col){ // WHEN ROW == N MEANS WE HAVE FILL ALL THE BOX OF SODUKU if(row>=n) return true; // WHEN COLUMN EXCEEDS THE THE BOUNDRY THEN INCREASE THE ROW AND COLUMN = 0 if(col>=n){ return SudukuSolver(board,row+1,0); } if(board[row][col]=='.'){ for (char num = '1'; num
@VishalKumar-pk9ek
2 жыл бұрын
mind blowing....... ek ek line of code kya kar raha hai har question me , sab samajh aa gaya 😍😍😍😍
@KunalKushwaha
2 жыл бұрын
that was the plan
@rajendiranvenkat5992
8 ай бұрын
kunal, waiting for your sliding window concepts badly. Thank you so much for this playlist.
@janakiram1187
2 жыл бұрын
Bro do some videos on Linkedlist,stacks
@KunalKushwaha
2 жыл бұрын
coming very soon after OOP
@janakiram1187
2 жыл бұрын
@@KunalKushwaha thanks bro 👍
@anmolsharma9539
2 жыл бұрын
Excellent video kunal thanks for explaining in such great way . I think there is a small mistake in the N knight problem a knight can move in 8 different direction instead of four so I think 8 checks will be required . Thanks again for the awesome content.
@shubhamrawat3984
2 жыл бұрын
If I am placing a knight at (r, c), where will the previous knight could be present? (keep in mind that we are travelling one row after another) Will the previously placed knights be present on the same row as ours and on the rows before it? OR Can a previously placed knight be found on the rows below our current (r, c)? If not, then do we really have to check for r+1 and r+2 rows?? THINK ABOUT IT.....
@niteshkushwaha9493
Жыл бұрын
@@shubhamrawat3984 thanks for the explanation
@soomrokazim5822
Жыл бұрын
No brother your concern is legit, I also had same question but think about it deeply we are starting from first row to bottom and while doing down we have to only check for upwards as there's no any knight placed already in the end rows whereas in upper rows we placed and came down.
@milan_20
9 ай бұрын
36:35 Really i can assure the code kunal sir does...if you understand it then ... there's no shorter version you can find...
@shyamkedia4202
2 жыл бұрын
Ho could have earn lacks thru this ... Thaxxx bruu
@KunalKushwaha
2 жыл бұрын
Always free for all.
@aryanchiyaj7057
7 ай бұрын
Thank you soo much for this awesome content, bro ! I learned a lot from in these series !! please make series of dynamic programming
@kaushikdeka4529
2 жыл бұрын
Thank you bhiya you are a gem
@hassankazmi5443
2 жыл бұрын
Great job man, you make it look so easy
@devjeff3192
2 жыл бұрын
Thank you soo much for this awesome content, bro ! I learned a lot from in these series !!!
@anmolsharma9539
2 жыл бұрын
39:39 knight is respectable
@saurabhrao7423
2 жыл бұрын
hey kunal , can we start doing the hard section in your git hub assignment ( after completing recursion series) ?
@KunalKushwaha
2 жыл бұрын
Yes
@premsoni619
6 ай бұрын
Is this a Java + DSA course or a Netflix series? 🤔 Honestly, it's been so captivating from start to finish with such thorough explanations. Thank you for making learning so enjoyable! Can't wait for more!
@Apna_Gamer-rz2jl
5 ай бұрын
how your sudoko code is correct bro. look at your answer in the very first row 2 is coming twice at 4 and 6 index
@gem13259
Жыл бұрын
U made it very easy to me tqq kunal❤✌
@himanshudixit2848
2 жыл бұрын
Ki Kunal, There should be 8 - cases for N Knights Problem under "isValid" Method or I'm doing something wrong ?
@abirsikdar628
2 жыл бұрын
we check for the previous rows only, so I guess 4 cases is all
@sirishbhat
2 жыл бұрын
small error in checking if the number is in the row. The condition should be if(board[row][i] == num)
@dark_techyy
2 жыл бұрын
yes because of which 2 is getting repeated in the output..have u seen that?? 😅
@abhinavupadhyay9460
2 жыл бұрын
Right!!
@diptamo
2 жыл бұрын
Sir please make a video on Gsoc and its guidelines and how prepare for it.. whats skills and roadmap required.. please🙏🙏✨.... Please sir...make a guideline... You dsa bootcamp is❤️🔥
@KunalKushwaha
2 жыл бұрын
Sure I will
@neeldiyora3575
Жыл бұрын
The answer of sudoku solver that you're getting is wrong.
@itsvk3678
Ай бұрын
You are my God ❤
@UvUtkarsh
2 жыл бұрын
great video bhai, but at 1:16:52 the sudoku was not solved correctly. Edit : Solved vertically but not horizantally, what a coincidence
@tushargupta6533
2 жыл бұрын
🥲
@serveshchaturvedi2034
2 жыл бұрын
Great eye man. I think the first check should be board(row)(i) == num, isn't it?
@21AniketThakre
2 жыл бұрын
@@serveshchaturvedi2034 yes that's correct,l👍🏻
@dhanushramnagarajan2635
2 жыл бұрын
Hi kunnal, I watched all videos in recursion is too good. I like your way of approaching the problem. In this video "Sudo solver" output is "incorrect". Because of minor mistake in "isSafe method -> Checking the row".
@KunalKushwaha
2 жыл бұрын
It's correct I just did a typo with variable in hurry which is mentioned in timestamps
@dhanushramnagarajan2635
2 жыл бұрын
@@KunalKushwaha Yes noticed 👍
@nancychhatwal2615
7 ай бұрын
COMPLETE N-QUEENS CODE WITH COMMENTS:- //VALID MOVES-1 queen in a row and col only. if more than one queens are present in a row/col, there'll be a clash public class NQueens { public static int displayQueensOnBoard(boolean[][] board,int row){ // passing only row and not column bcoz every time the col is going to be starting from 0 only if(row == board.length){ // if all the rows have been traversed, then its time to dispay the board displayBoard(board); System.out.println(); return 1; } int count = 0; for(int col=0;col
@siddheshsurve6608
2 жыл бұрын
Sir ji plz ye course band mat karna or delete bhi nahi karna 🥺😄🤩
@nancychhatwal2615
7 ай бұрын
COMPLETE N-KNIGHTS CODE WITH COMMENTS:- import java.util.Arrays; public class NKnights { public static void placeKnights(boolean[][] board,int row,int col,int k){ //if all the knights are placed,display the board if(k == 0){ displayBoard(board); System.out.println(); return; } //if we have reached the last row and last col, we don't have to do anything if(row == board.length && col == board.length){ return; } //if we have reached the last col of a row,we'll move to next row and start looking from first col if(col == board[0].length){ if(row+1
@vigneshp9961
Жыл бұрын
can someone help me out, why do we "return" at line 16 in the N Knights problem (timestamp: 46:12), would be highly appreciated
@anshultripathi8902
Жыл бұрын
here col=n(board length) if you dont return the code will go aheaa and run issafe function for c=n which will return true and obv u cant place knight there because its not the part of the board also then col will keep on increasing and we dont have any base case for c>n resulting in infinite loop. HOPE U UNDERSTAND :)
@Cloud-577
2 жыл бұрын
I was waiting for this!! When is dp lecture will be out
@nishu0766
14 күн бұрын
Kunal please upload DP and graph series
@kattamurinagabhushan9879
Жыл бұрын
all of you please like the video , don't just go without liking the video
@nikhilchauhan3506
Жыл бұрын
hi bro i need help
@code2287
Жыл бұрын
There's a mistake in the soduku isSafe problem it doesn't check all columns in particular row Should be board[row][I] == number You wrote board[row][col] == number Which just checks the same thing and iterates over... check the first row of answer it has 2 twice second row two has duplicates along the row
@KunalKushwaha
Жыл бұрын
yeah that's a typo I made while live coding but self explanatory
@code2287
Жыл бұрын
@@KunalKushwaha Sure, must be stressful going long hours....Thanks for the playlist anyway really beneficial
@chaitanyakumarboddu7117
2 жыл бұрын
Thank you !!
@raktimghosal4562
2 жыл бұрын
Damn this course is lit 🔥🔥🔥
@NehaVerma-il1us
2 жыл бұрын
Can u PLZZ tell when will this course will be finished ❤️❤️❤️
@_AkashRuidas
2 жыл бұрын
❤️❤️ amazing content
@MayankCodes
2 ай бұрын
The backtracking is not correctly applied in Sudoku solver. Everytime return true in solve(board) hits and since if waa running before that else condition gets untouched making it no application of backtracking. Am I thinking right if anyone can tell??
@hritikapal683
2 жыл бұрын
100k supersoon 💖
@ShubhamGupta-lb5cx
Жыл бұрын
Great explanation 👍
@doshanthsai8726
2 жыл бұрын
Bro opps concepts
@KunalKushwaha
2 жыл бұрын
next
@lakshyadhawan800
3 ай бұрын
in sudoku output, in first row 2 and 6 are repeating and in second row 9 is repeating and many more
@manjeetsingh6028
4 ай бұрын
bro giving his 100% to promote his previous videos
@yaswanthkosuru
2 жыл бұрын
this video deservs million of views by the by when dp lectures coming in your channel
@anshulgoel1940
Жыл бұрын
Sudoku is not solved in the final printed answer
@TanmaySarkar
2 жыл бұрын
Recursion done ! Thank You ❤
@venkateshwarrao5321
2 жыл бұрын
Tanmay how was this playlist? Is this playlist good as compared to Striver's playlist??
@30_abhishekpandey23
Жыл бұрын
52:50 bookmark
@dineshmadduru7043
2 ай бұрын
Thank You:)
@suyashkumar8840
2 жыл бұрын
100k soon
@yashkharche8661
2 жыл бұрын
I code in JavaScript and Python, will watching the lectures from the beginning be beneficial? Will the Theory be beneficial?
@KunalKushwaha
2 жыл бұрын
yes
@malishagavali9225
Ай бұрын
can anyone explain why is it O(n^2) in recurrance relation ofr NQueens
@DevanshuAugusty
Жыл бұрын
Q1 easy code for diagonals checking in c++ : bool safe(vector& board, int row, int col) { // checking vectical; for(int i=0;i 0 && j > 0) { if(board[--i][--j]) { return false; } } // right diagonal; i = row; j = col; while(i > 0 && j < board.size()-1) { if(board[--i][++j]) { return false; } } return true; }
@lucascardoso6166
2 жыл бұрын
u are insane, ty for the content!
@Valysis
7 ай бұрын
it feels u were looking answer for sudoku solver problem and then explaining.
@abhishekpant5040
2 жыл бұрын
can anybody tell me what is n in 9^n*n in Sudoku solver complexity analysis ?
@sameerakhatoon9508
Жыл бұрын
sure, because we have n*n cells, also we can have 1 to 9 nums in each of cell, so 1st cell --> 9, 2nd cell--> 9, ... so on till n^2 cell --> 9, hence 9^(n*n)
@sameerakhatoon9508
Жыл бұрын
@KunalKushwaha 34:14 i believe this isn't linear recurrence relation with constant coefficient to use method you taught us in time complexity lecture, ig this could be solved using substitution method, but i could not end up with precise answer like that of yours as O(N! + N^3) = O(N!) i solved it in the following way T(n) = n*T(n-1) + O(n^2) => T(n) - n*T(n-1) = O(n^2) => (T(n))/n! - (T(n-1))/(n-1)! = O(n^2)/n! => (T(n))/n! = ∑ x from 2 to n (x/(x-1)!)] == ∑ x from 2 to n (1/(x-2)!)] by Maclaurin's expansion for e, => (T(n))/n! = O(e) => T(n) = O(n!*e) ignoring constant terms, we get T(n) = O(n!) can you please help me with elaborating more on your approach to solve this and get O(N! + N^3) as solution? else if someone who know kunal's approach please reply here, I'd really appreciate Thanks!
@aakashyadav9117
Жыл бұрын
@kunal i cound not get the time complexity of n queens with akra bazi , but i was able to get it through substitution method , request you to made one video where there are functions like T(n) = N*T(N-1) + g(n) like this
@masteradvisor594
Ай бұрын
1:06:59
@ramit1411
2 жыл бұрын
Let Go!!!
@suryanshpandey7464
Жыл бұрын
good lecture
@justvibhor3743
Жыл бұрын
You r the best🔥🔥
@nikhilchauhan3506
Жыл бұрын
static int queens(boolean[][] board,int row){ if (row==board.length){ display(board); System.out.println(); return 1; } int count=0; for (int col=0;col=0;c--,r--){ if (board[r][c]){ return false; } } r=row; //right for (int c=col;c=0;c++,r--){ if (board[r][c]){ return false; } } return true; }
@nikhilchauhan3506
Жыл бұрын
hi bro, actually i am stuck, my program doesnt print ans in matrix, instead it print this in one single vertical line, can you help
@saibhargav9039
2 жыл бұрын
Hey kunal just wanted to ask by when will this course be completed?
@muneebahmed3993
2 жыл бұрын
By the end of this month ig
@gauravgautam5963
2 жыл бұрын
@@muneebahmed3993 This is only the limitation of this course . It's already 6 months sep-feb but still we have covered only one data structure linked list
@gauravgautam5963
2 жыл бұрын
@@muneebahmed3993 This is only the limitation of this course . It's already 6 months sep-feb but still we have covered only one data structure linked list
Пікірлер: 235