Summary
Full Transcript
PRE-COMPUTATION TECHNIQUES PLAYLIST: https://youtube.com/playlist?list=PLauivoElc3ginp_2p2cX5i-jrBI32xGuX FREE COMPETITIVE PROGRAMMING COURSE PLAYLIST : https://youtube.com/playlist?list=PLauivoElc3ggagradg8MfOZreCMmXMmJ- FOR DOUBTS AND DISCUSSIONS, JOIN DISCORD : https://discord.gg/GMH23tq7Y7 CONNECT ON INSTAGRAM : https://www.instagram.com/i._m_.luv/ In this episode 14 of my competitive programming course, I discuss how you can solve question GCDQ on codechef which is based on pre-computation and is based on a concept where we have to construct 2 prefix arrays. Link to the question : https://www.codechef.com/problems/GCDQ For more practice questions on Hashing and Prefix Sum Check description of this video : https://youtu.be/nZe7P674xZo Timestamps: Brute Force Approach : (0:00) Optimised Approach using Prefix Array : (6:26) Be a part of our awesome Community. Join ○ Discord : https://discord.gg/GMH23tq7Y7 ○ Telegram : https://t.me/LuvIsMeYT You can follow me on below platforms for all the latest updates ○ Instagram : https://www.instagram.com/i._m_.luv/ ○ Twitter : https://twitter.com/Luvk1412 ○ Linkedin : https://www.linkedin.com/in/luvk1412/ Blog(Not frequently updated) ○ Blog : https://www.codewithluv.in Hashtags #gcdq #codechef #precomputation #prefix #competitiveprogramming
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
