BHAIYA ME DSA APKI IS SERIES SE HI KRRA HU AUR ISSE PHLE KOI DSA EXPERIENCE NAHI HAI FIR BHI APKI VIDEOS KAFI ACHE SE SAMJ PA RHA HU . while(choice== 'Y'){ cout
This is by far the best information that i wanted to hear: exams. It is really very good that you are conducting exams after completion of topics which is the best way for evaluation. Really appreciate for this bold move.👍👍
Sir if possible let's start with tree and then dp, because dp can be used in every data structures. So let's do tree first then dp. And yes thankyou And I'm ready for the exam .
Registered for the contest sir!! And I think after Recursion we should start with DP because of it's close relationship with Recursion. That will help us to learn Recursion more in depth and also it will help us to eradicate the fear of DP!!
Tree would be more beneficial certainly! Dp is a way too vast topic n for now atleast we should have a good grasp over questions from some major topics, before digging deep! Thank you!!! #DSAbyFraz
After recursion, I would prefer to learn dynamic programming, looking at the closeness and relativeness of the two topics, i.e, recursion, and DP. Please go with DP after we are done with recursion
Update after completion of contest 1: => print series question solved successfully => In create sequence question, I got tle but all the test cases were passed => Couldn't do langford pairing, found that very hard for me
Tree - > Graph - > DP
Registered for the contest will surely give and try score full marks
I will ask for DP after completion of recursion... Because DP is closely related to the recursion and it will maintain the flow of the questions
Yes
++
I was also thinking the same
I prefer DP after recursion.
stay motivated
consistency✌
DP 🙆🏻♀️
Thank you Bhaiya for everything. 🤠
After recursion tree must be there as it will help us understand recursion invest way
Really thank full to your dedication
Thankyou bhaiya for helping us learn this for free
Aapka bump badhta rahega bhaiya 😀thank you for your videos
lets do it 🔥🔥
we r ready for contest 1
Thank you again, I am getting more comfortable solving recession
BHAIYA ME DSA APKI IS SERIES SE HI KRRA HU AUR ISSE PHLE KOI DSA EXPERIENCE NAHI HAI FIR BHI APKI VIDEOS KAFI ACHE SE SAMJ PA RHA HU .
while(choice== 'Y'){
cout
This is by far the best information that i wanted to hear: exams. It is really very good that you are conducting exams after completion of topics which is the best way for evaluation. Really appreciate for this bold move.👍👍
After recursion , tree, binary tree , binary search tree
Yes sir this is the right way
Yes, this one is correct
Bhaiya aap bhot acha kaam karre ho
Thank you so much bhaiya for this DSA series.
Dp is ok bhaiya plz go for it and thankyou for the live session i will be there .👌👌👌💚 registered for the contest 🙌🙌😍
Recursion- Backtracking -dp
Thnq❣️🔥
Great Bhaiya going to participate baad main video dekhta hu😋
Doing grt Job...bhaiya
Sir if possible let's start with tree and then dp, because dp can be used in every data structures. So let's do tree first then dp.
And yes thankyou
And I'm ready for the exam .
Eagerly waiting for tomorrow's live session
Waiting for contest and your live 💥
Ready for exam ❤️
Yes bhaiya, I didn't understand the recursion problems...also the code..
Registered for the contest sir!! And I think after Recursion we should start with DP because of it's close relationship with Recursion. That will help us to learn Recursion more in depth and also it will help us to eradicate the fear of DP!!
AnyOne from karnataka , kannadiga following the series....please join will stay motivate and will solve the things
Tree first bro 💯
Ab maja ayega bidu. 😀😀
Thanks bhaiya
Interesting part is the Exam ...
Dynamic programming!
dynamic programming bhaiya
Yes, you should start DP series after the recursion series.
ok bhaiya ❤️❤️❤️❤️❤️
DP should be start I think.😊
#dsabyfaraz
I think first Cove the tree ,then dp it is more preferable
Tree would be more beneficial certainly! Dp is a way too vast topic n for now atleast we should have a good grasp over questions from some major topics, before digging deep! Thank you!!! #DSAbyFraz
Good bro💥
After recursion, I would prefer to learn dynamic programming, looking at the closeness and relativeness of the two topics, i.e, recursion, and DP. Please go with DP after we are done with recursion
Please start with DP
for tree we need to know stacks and queue. So I think DP will be good after that we can do stack and queues and then trees
Where there is will there is a way!
Dynamic Programming 🙂
dynamic programming for sure
will go with dp and then tree
After recursion please go with DP
tree is best bcz we studied recursion now so that it can help in recursion also
DP and then Trees
And will you cover DP 2d? And the 01 knapsack problem.
Ive seen a rise in these type of question this year.
will start with dp sir😃
Let"s go with dp after recursion
Useful bhaiya
Great
Dp after recursion.It is the best DSA series
Update after completion of contest 1:
=> print series question solved successfully
=> In create sequence question, I got tle but all the test cases were passed
=> Couldn't do langford pairing, found that very hard for me
Tree because you know ,in youtube dp cover but tree are not cover in good way. so please start tree.
I think "Tree" should be the next Topic to start
Bhaiya plz DP after recursion
first tree, then DP bhaiya!!!
😁😁😁😍🤩🤩🤩🤩
dynamic programming
Dynamic programming.
I have registered for contest 😃
dynamic programming first and then trees
bhaiya DP after recursion please.......
start trees
please
I would like to learn Tree 👍 after recursion
Please start tree before dp, so that we will be able to do dp on tree questions while studying dp
Sir, please release the next series!
start dp after this playlist
🔥🔥🔥🔥👌👌
Let's crack the contest
sir plz start with dp next
I want Tree to be next topic.
But better to know everyone's opinion so you should community post a poll 📊 about it
DP first
First Dynamic programming after recursion
Dynamic Programming
I've semester exams from 1st June, won't be able to give the contest
greedy algorithm first and then others
DP will be good choice
How we will take up that contest, that link in the code studio is not working now☹
Hello bhaiya, i would want you to start with which ever is comfortable after recursion
Dynamic programming
bro dp start krwa dena mai pehle jisko series follow kr rha tha wo ab videos nhi daal rhe h but i believe u bro plz put dp videos before tree
Tree -> DP -> Graph
Dynamic Programming
It'll be great to start dp... Also beginner dsa kab start horha hai..
DP 🔥
please start DSA.........many of your followers are waiting...........
DP would be best after learning recursion.
Tree then DP
Bhaiya please Strat DP after this and then Trees
Tree please 👍🏻👍🏻👍🏻
Please cover Trees as the next topic and then DP
Tree GRAPH DP
Consistency ++
Sir please dynamic programming....
Trees💥
❤️❤️
Dynamic programming++
Hi Faraz,
Please enable to submit javascript code in contest.
Thanks
Tree 👍