Maximum Connected Group | gfg potd | 11-07-24 | GFG Problem of the day
HTML-код
- Опубликовано: 16 окт 2024
- Geeks for Geeks Problem of the Day(POTD) in C++ | Maximum Connected Group | Fully Explained🧠
Solution Code :
github.com/Ish...
IMPORTANCE OF DSA FOR PLACEMENT:
• Is DSA Still Important...
BEST FREE WEB DEVELOPMENT COURSE:
• Video
🌐 Connect with Me:
GitHub: github.com/Ish...
Linkedin: / ishansawhney
#GFG #POTD #geeksforgeeks #problemoftheday #c++
With all the resources I tried my best to explain this question in detail so the video is very long..... I'm continuously improving my explaining skills but it'll be helpful if you subscribe ☺️
Yeah bro u are doing great job and daily after solving potd I am to u and see your explanation and daily I learn something new and easy way of doing so keep it up ❤
Bro few things u can improve that we viewer wants
1. Make handwriting slight good
2. Make video slightly short so that more people's could be attracted
3. Thumbnail of could also be improved if u wish - optional
@@code_geeky1231 thanks a lot for motivating me.
And about the improvements I've got a new tablet and....till sunday I'll sure have a pen(stylus) so writing and explanation will heavily improve thereby reducing video's length.
And about the thumbnail I'm trying this but if you can help me please contact on LinkedIn or Insta..link in description 🥹
@@CodeGenius316 sure I will contact you on LinkedIn
Areee bhaiii thankkssss ....same approach socha tha meine bhi par wo jab side wale components same hue to waha dikkat aa gayi 😅😅
Thanks bhai ...i still remember you as my early supporter 😁
@@CodeGenius316 Aree thankss bhaiii
sir in last gfg potd question i am bit confuse how recursion work there..... any help would be greatly appreciated
I made videos for all gfg potd daily you can check
I'm a first-year student and I don't understand recursion well, so I would appreciate if you could make a recursion tree in the last video.
If you didn't understand recursion well then first learn that because that question was solved by dp and you can't understand that if you aren't perfect in recursion so first practice that🙂
@CodeGenius316 I understand it, but sometimes I'm confused by it
bhai aap jis tarah se explain kar rahe ho us tarah se to apko ek dsa playlist banani chaiyea. bahut badiya explain kiya aap ne
Thanks 😊
...I'll think about this suree
vaiya agar same loop me 1 aur 0 dono ke liye kare nahi hoga??
We have to run first a loop for making components of ones and replacing them by index of the component...
After that we'll run loop for 0 in the UPDATED MATRIX for checking if we can merge two components or not by changing 0 to 1.
osm explaination
Thanks 😊