CodeChef Long Challenge Walk-Through Part 1 || Competitive Programming || CodeChef MSNSADM1
ฝัง
- เผยแพร่เมื่อ 4 ต.ค. 2024
- CodeChef is one of the most popular online competitive programming sites. In this series, I go through a recent CodeChef Long Challenge and walk through how I solve the problems. Each problem will be in its own video, increasing in complexity as I go through all of them!
Competitive programming is an exciting way to learn to program, and CodeChef is a great place to do that. Masters and Beginners can all participate and show their skills! Even though it can seem daunting at first, there is much that can be learned even for those who are just getting started. I remember when I was first learning to code, a big part of becoming a programmer was putting in the time and practicing. Competitive programming is a great way to get that practice in a super fun way!
Happy Coding!
If you have any specific questions about algorithms or programming methods, please let me know in the comments section below! We can all learn together! Don’t forget to subscribe to the channel to follow along :)
--------
My Gear:
Computer - amzn.to/2Z0hfYo
Monitor - amzn.to/2KgsoMD
Heated Mug - amzn.to/2YZxjFO
Standing Desk - amzn.to/31crGpk
Camera - amzn.to/2KgCAVs
Microphone - amzn.to/2KgD3aa
Shelves - (Custom... message for details!)
--------
#CodeChef #CompetitiveProgramming #LearnToCode
Welcome to the world of CodeChef and competitive programming! Let’s do this!
Thank you for following my recommendation ...
Of course! Thanks for watching, and don’t forget to hit ‘Like’ on the videos that are your favourites!
Great choice starting your own channel! Loved your class.
Thanks Braeden!! You did amazing in the class, Keep up the great work :)
Keep up the good work
Thank you for the support! I’m glad you enjoyed the video! If you have any specific topics / problems you would like me to cover, let me know! 😀
Yes, actually i have many topics...
Digit Dp : a topic rarely found on TH-cam
Fenwick tree
2-d Prefix sum
🙏🙏🙏
Thanks! Fenwick Trees are tied closely to the prefix sums, so I will probably include those in a progressive series of explanations I’m working on!
Along with solving problems please make videos on graph & dp
I plan on doing both! Tomorrow’s video will be a conceptual one, explaining how certain algorithms / styles work!