Another episode of Weekends With Champions is on its way: https://bit.ly/3ha1hCV, and this time we are talking to Nishant Chitkara, two times ICPC regionalist. Join us on September 11th and get to know how he cracked the competition!
Learn programming with CodeChef pinned «https://youtu.be/sGGR3lLrVfU»
🔴You can checkout the complete DSA For Placements -Learn the Basics, course in Bilingual, Click on the playlist link - https://bit.ly/3kflAjf
Learn programming with CodeChef pinned «🔴You can checkout the complete DSA For Placements -Learn the Basics, course in Bilingual, Click on the playlist link - https://bit.ly/3kflAjf»
Network with the people who will help you grow. With access to industry specialists and top IT professionals, you can grow at an even faster pace: https://bit.ly/3trAhDP! Learn the A to Z on how to ace your technical interviews, get your projects reviewed by experts, understand how you can increase your CP ratings, build your technical competency, and much more for just Rs 83 per month for a one-year subscription. Use code CODECHEF for an extra discount.
Let f(n, B) be the sum of digits of the integer n when written in base B.
Given Q queries, each consisting of three integers n, L, R, find B such that f(n, B) is minimum for all L <= B <= R. If there are multiple such values, you can print any of them.
Solve the problem: https://bit.ly/3l3oCYl
Given Q queries, each consisting of three integers n, L, R, find B such that f(n, B) is minimum for all L <= B <= R. If there are multiple such values, you can print any of them.
Solve the problem: https://bit.ly/3l3oCYl
Tune in at 8 PM today for the next episode of 'DSA for Placements': https://bit.ly/3E2gK1Z, where Mohammad Fraz will discuss some practice problems on Dynamic Programming.
YouTube
Dynamic Programming - Learn to Solve Practice Problems | DSA For Placements | Ep 23 | Mohammad Fraz
In the DSA For Placement series, you will learn a few of the most important topics you need to know to ace the interviews. In this video, we will discuss Dynamic Programming - Practice Problems.
🎯Click here https://bit.ly/2Wbt6Dw to register yourself on…
🎯Click here https://bit.ly/2Wbt6Dw to register yourself on…
Starters 11 will be here on 15th September, 8 PM IST onwards: https://bit.ly/2X1fv2s. So div 3 coders, make sure to participate and show off your coding skills.
This is your chance to participate in SnackDown 2021: https://bit.ly/3yXLgpN and make your college proud. Register right away, and start your preparation!
What if we told you, you can have access to exclusive content by top educators to help you ace all your interviews for just Rs 83 per month for a one-year subscription: https://bit.ly/3l6JqxX? Get expert help for your projects, improve your technical competency and CP skills, and much more! Use code: CODECHEF for an extra discount.
Let f(n, B) be the sum of digits of the integer n when written in base B.
Given Q queries, each consisting of two integers n, R, find B such that f(n, B) is minimum for all 2 <= B <= R. If there are multiple such values, you can print any of them.
Solve the problem: https://bit.ly/2YyvIfG
Given Q queries, each consisting of two integers n, R, find B such that f(n, B) is minimum for all 2 <= B <= R. If there are multiple such values, you can print any of them.
Solve the problem: https://bit.ly/2YyvIfG
Register for SnackDown 2021: https://bit.ly/3ldDpj4
The video editorial for the next problem (SNAKPROC) of the SnackDown Practice Contest for Beginners is out now: https://www.youtube.com/watch?v=hjrWtthd8WU. So go right away, and take a look at the logic and the concepts.
The video editorial for the next problem (SNAKPROC) of the SnackDown Practice Contest for Beginners is out now: https://www.youtube.com/watch?v=hjrWtthd8WU. So go right away, and take a look at the logic and the concepts.
YouTube
SNAKPROC | Snake Procession | CodeChef SnackDown 2021 Practice Contest- Beginners | Problem Solution
You can find the practice problem for SnackDown 2021 here:
https://www.codechef.com/problems/SNAKPROC
Improve your skills and logic and master the art of Competitive Programming with CodeChef. It's best if you can solve it yourself. But if you can't, you…
https://www.codechef.com/problems/SNAKPROC
Improve your skills and logic and master the art of Competitive Programming with CodeChef. It's best if you can solve it yourself. But if you can't, you…
Who wouldn't love a hot debate, right? Announcing a new series, where two top coders will discuss and put forward their opinions on various topics. This week, we have Rajarshi Basu (NUS Undergrad researcher, CC Contest Editorialist) and Saptarshi Mukherjee (SDE @ Google, ICPC 19 regionalist) go face to face and debate on whether Java is better than C++ or not: https://buff.ly/3hkuCLc. Join us this Sunday at 5 PM to get an answer to this.
Register for SnackDown 2021: https://bit.ly/3ldDpj4
The next problem in the SnackDown Practice Contest for Beginners is live now: https://bit.ly/2Vwt8px, and it is one of the best. So start practicing now, and get your concepts right.
The next problem in the SnackDown Practice Contest for Beginners is live now: https://bit.ly/2Vwt8px, and it is one of the best. So start practicing now, and get your concepts right.
Starters 11 is here: https://bit.ly/3tCIBAT and it’s your chance, Division 2 & 3 coders, to increase your ratings on September 15th, at 8 PM IST.
Saturday is here, and so is the much-awaited episode of Weekends With Champions: https://buff.ly/3l7bhOs. This time Nishant Chitkara, two times ICPC regionalist, will be joining us for a live AMA session at 3 PM. We will be discussing his programming strategies and approach, and you can get all your doubts cleared as well.