🔴 GUIDE for COMPETITIVE PROGRAMMING | RESOURCES | EXCEL YOURSELF

[@the_humble_lazy]

>1st set of basic stuffs 1.Pattern printing problems 2.time complexity analysis 3.linear search and circular array representation 4.palindrome and other numbers(perfect, Armstrong) for basic number problems 5.Simple Hashing Problem(frequency counting and stuffs) 6.Prefix Sum Problems(1D and 2D) {codeforces } 7.Sliding window technique(2 out of 5 contests) ----------------------------------------------------------------------------------------------------------- Basics of number theory 1.Binary Search is a must(2/5 contests) 2. GCD of 2 numbers in logarithmic time(Euclidean and Extended Euclidean Algorithm) 3.linear Diphantine Equation 4. Checking prime in sqrt(n) complexity 5.Sieve of Eratosthenes(very imp to perform querry probs on the prime) 6.Segmented Sieve 7.Finding prime factorisation of a number in logn per querry 8.Euler Totent Function 9.Fermat Little Theorum 10.Wilson's Theorum (gfg articles and hacker earth probs for 8,9,10) tougher version of number theory 1.Finding x^n in log(n) 2. Modular Arithmetic 3.Modular Inverse of a number 3.Modular Exponentiation 4.Chinese Remainder Theorum 5.Factorial Modulo Mod 6.Finding nCr and nPr for queries (constant time) 7.Inclusion Exclusion Principle (combinatorics problems) {hackerearth has wonderful bunch} {codeforces} ---------------------------------------------------------------------------- 1.learn about basic sorting algorithms (bubble, selection, insertion) 2. do problems which are constructive and have a lot of swapping terms in it. 3.solve problems related to two pointer approach. 4.Bit manupulation(left shift, right shift, xor, or, and,set bit,MSB, LSB etc..) 5.Power set of a given array or string using BIT 6.Number of subarrays with XOR as zero(not an algorithm but a must do problem) (hackerearth has a very good tutorial on bit manipulation, coding blocks too has a proper video on bit) {for problems visit hackerearth} 7. Problems related to greedy algorithm tag 8.Kadane's algorithm and problems related to them 9.Job sequencing and activity selection problem (after doing 8 and 9 go to codeforces and solve problems with greedy tag on it) ---------------------------------------------------------------------------- time to learn recursion 1.start with basic problems like finding factorial and all. 2.implement binary search 3.implement modular exponentiation using recurison 4.solve recursion problems like finding subset with given and others to get a stronggrip 5.Learn about merge sort and quick sort 6.solve problems related to merge sort 7. Do backtracking problems like sudoko and N Queen, it will help you when you want do DP Path problems (for recursion you can refer to leetcode or gfg's practice where u will find recursion and backtracking problems) After Recursion: 1. Meet in the middle algorithm and problems related to it. 2.Divide and conquer problems{highly recommended to use codeforces only for this} 3. Next greater element and next smaller element using stack 4. porblems related to parenthesis. 5.largest rectangular area in histogram. (concept is used in a lot of problems) 6.Problems related to Heap(Priority Queue) {although this gets under the greedy category but by priority queue will help you learn an inbuilt stl) ---------------------------------------------------------------------------- now the real advanced parts and the game decider (imp guideline from 11:16 to 12:20) String algorithms: 1.hashing on strings(learn and solve problem, understand when collision happens) {cpalgorithms has a wonderful article written on it) {Spoj or codeforces} 2.Rabin Karp Algorithm(cpalgorithm has a wonderful blog on it) 3.Prefix Function 4.KMP Algorithm 5.Z-function 6.Manchers' Algorithm (once you have wrapped up the above algorithms, solve a bunch of problems(25-30) on them from different platforms.) --------------------------------------------------------------------------- Tree Algorithm : 1.Tree/Graph representation 2.DFS/BFS Traversal in Graph/Tree 3.Basic stuffs(diameter of tree, height of tree, level of tree) 4.Euler Tour of Tree(Learn and solve problems) 5.Finding LCA using Euler Tour(14:00){efficient solution uses segment trees) 6.Finding LCA using Binary Lifting. 7.Distance between two nodes. 8.Subtree Problems. (SPOJ is highly recommended for trees and codeforces D and E problems also) --------------------------------------------------- Graphs: 1.Connected Components. 2.Topological Sort. 3.Cycle Detection in Graph 4.Bipartite Check in graph 5.SCC using Kosaraju’s algorithm 6.Dijkstra’s Algorithm 7.Bellman Ford Algorithm Sources for learning :hackerearth and cpalgorithm blogs (25-30 problems on the avove topics,SPOJ and codeforces,hackerearth too) -------------------------------------------------------------------------------- Then: 1.Bridges In graphs 2.Articulation Point in a graph 3.Minimum Spanning Tree using Kruskal’s Algo 4.Prim’s Algorithm 5.0/1 BFS(a big saviour) 6.Learn Finding Bridges Online(cpalgorithms) Solve problem ------------------------------------------------------------------------- Dynamic Programming: Imp instructions at 16:08 1.Solve the AtCoder Educational Contests on Dyanamic Programming.(all 26) 2.Solve problems from SPOJ(highly recommended,since it doesn’t involve any other algorithms) 3. Google dynamic programming practice problem codeforces,u’ll get a wonderful blog with a lot of problems on it. After all the above standard DP,learn: 4.Understand how we write recurrence for Digit DP(codeforces blog)(digit dynamic progg) and solve problems 5. read about DP with Bitmasks and solve problems(hackerearth blog) 6.DP on trees(gfg articles,rachit jains video) 7.SOS DP(cpalgorithm blog) Solve as much probs possible ----------------------------------------------------------------------------- 1.Disjoint Set(cpalgorithms) 2.Offline Queries using Disjoint Set(colourful array problem from spoj) 3.Kruskal’s Algorithm using disjoint set Solve bunch of problems on avove ------------------------------------------------------------------------------------ 1.Sparse Table(not that imp) 2.Fenwick Tree and Binary Lifting on Fenwick Tree(read about range update trick also) 3.problems on fenwick tree ----------------------------------------------------------- 1.Matrix Exponentiation(problems) 2.Sqrt Decomposition Technique(gfg or cpalgorithms or codeforces) 3.Update and Querry Operations 4.Mo's algorithm(solve powerful array from codeforces)(codeforces blog) 5.Mo's algorithm on trees 6.Segment Tree(a must)(Range Queries and point Updates) 7.Lazy propagation on segment trees -------------------------------- then some optional and rare ones: 1.Sprague-Grundy Theorum 2.Flows and Related Problems 3.Heavy Light Decomposition 4.Convex Hull Algorithm 5.FFT/NTT

[@aanchalsharma5264]

thanks

[@Bakasta170]

i was waiting for this comment!! thanks:)

[@satyamkulkarni9175]

Thanks

[@ankitjha9862]

@Ayush kumar Thank you so much bro!

[@ExabyteGeeks]

Great Man!

[@takeUforward]

Let me know what do you think about the question that I asked at 23:20 in the comments. A pdf has not been made because a reach of pdf < a reach of video. If i put in pdf, people will not watch the video, hence again the reach will be less. PDF nai bana sakta, video banane me 4 din lag gaye, ab tum log PDF khud bana lena please! If you are still lazy to note down the points yourself, this road is not for you. A person who cannot work hard to note down the points, for him to take such a long path is not possible.!

[@mukulbindal2303]

Youthoob😂😂😂😂

[@aniket7512]

Yep we want such interview. Try one with Errichto too if possible 😊

[@adarshrai9516]

Yes we want interview Thanks for the video ♥️

[@yashpreetbathla4653]

Yes it would be great :))

[@Khabibullah]

@@hitman2754 VPN use karo bro

[@nikhilnagrale]

This is the thing that I have been searching from 4 months. Great ❤️

[@aryaman5106]

same ❤️

[@Yash-uk8ib]

Me too

[@k.m.jiaulislamjibon1443]

Just curious so after 9 months how much did you learned?

[@nikhilnagrale]

@@k.m.jiaulislamjibon1443 everything

[@k.m.jiaulislamjibon1443]

@@nikhilnagrale idk if by everything u mean all things you can implement with logic for solving a problem... I'm too slow for last 4 months i have been learning to do cp but still I'm not confident in mid level cp. Would u plz share how much hour did you put through the learning process

[@deepeshdragoneel3351]

I overcome my laziness By noting each and every point on a book, and now my journey begins!

[@muj1003]

You're doing amazing work for the CP community ! God bless you.

[@skm9865]

NUMBER THEORY 1 pattern printing 2 time complexity 3 linear search circular array 4 palindrome numbers(perfect , armstrong)basic 5 simple hasing problems 6 prefix sums both 1d and 2d 7 sliding window technique 8 binary search 9 gcd in logn (Euclidean and Extended eucledian algorithm) 10 Linear diphantime equation 11 checking primes in sqrt(n) 12 Sieve of Eratosthenes 13 Segmented Sieve 14 Finding the prime factorization of a number in Logn/query 15 Euler totient function 16 Fermat Little Theorem 17 Wilson's theorem 1 Finding x^n in logn 2 Modular Arithmetic 3 Modular Inverse of a number 4 Modular exponentiation 5 Chinese Remainder Theorem 6 Factorial Modulo 7 Finding nCr and nPr for queries in O(1) time 8 Inclusion Exclusion Principle(Not DP) *********************************************** 1 Basic Sorting Algorithms 2 constructive and swapping terms in it 3 2 pointer approach 4 Bit Manipulation 5 Power Set of a given array 6 Number of Subarrays with XOR as 0 (MUST do) 7 Kadane Algo(Greedy) 8 Job Sequencing and Activity Selection(Greedy) 9 Recursion (Factorial etc)(helps in Dp) 10 Implement Binary search using recursion 11 Implement Modular Exponentiation 12 Subset with given sum using recursion and other prob 13 Merge Sort and quick sort 14 quick inversion and problems related to quick and merge sort 15 Backtracking problems like Sudoko and N queen(helps in Dp ) 16 Meet in middle Algorithms and prob related 17 divide and conquer problems(codeforces) 18 Next Greater/smaller element using stack 19 Prob related to paranthesis 20 Largest Rectangular Area in Histogram(imp) 21 Problems related to Heap(Priority queue) *************************************************** 1 Hashing on Strings 2 Rabin karp Algorithm 3 Prefix Function 4 KMP Algorithm 5 Z-function 6 manacher's Algorithm Try to go through blogs and not videos 25-30 problems each ***************************************************** TREE/GRAPH 1 Tree/Graph 2 DFS/BFS Traversal in Graph/Tree 3 Diameter of Tree 4 euler Tour of Tree 5 Finding LCA using Euler Tour 6 Finding LCA using Binary Lifting 7 Distance between two nodes 8 Subtree Problems 9 Solve problems on the above Algorithms Graph 1 connected Components 2 Topological Sort 3 Cycle Detection in Graph 4 Bipartite Check in Graph 5 SCC using Kosaraju's Algorithm 6 Dijstra's Algorithm 7 Bellman Ford Algorithm 8 Floyd Warshall Algorithm 25-30 problems each from (Hacker earth) 1 Bridges in Graph 2 Articulation Point in Graph 3 Minimum Spanning Tree using Kruskal's Also 4 Prim's Algorithm 5 0/1 BFS (CP Algorithm) 6 Finding Bridges online ****************************************************** Dynamic Programming first solve using recursion not iteration 1 Common problems 2 Atcoder Educational contest DP 3 Problems from (SPOJ then codeforces) 4 recurrence for Digit DP(CF blog) 5 Dp with bitmasks 6 DP on trees 7 SOS DP ****************************************************** 1 Disjoint Set(Using all optimization) 2 Offline Queries using Disjoint set 3 Kruskal's Algorithm 4 Sparse Table(Not much imp) 5 Fenwick Tree 6 Binary Lifting on Fenwick Tree 7 Matrix Exponentiation 8 Sqrt Decompostion Technique 9 Update and Query Opeartions 10 Mo's Algorithm / algo on trees 11 Segment Trees(Range Queries and Point Updates) 12 Lazy Propagation on Segement Trees ***************************************************** RARE 1 Sprague-Grundy Theorem 2 Flows and Realted Problems 3 Heavy LIght Decompostion(Anudeep) 4 Convex Hull Algorithm(Meow) 5 FFT/NTT

[@DeepakSingh-nh2qe]

Thank you so much for such a great summary

[@adithyashetty851]

Thanks!!

[@foziljonofficial]

Thanks bro !

[@manishkumar-uw5mw]

Thanks for summarizing bro.

[@abhijeetkumar2970]

great share

[@amitbhatt9972]

Huge respect man. Your channel is highly underrated. Hope to see your subscribers count increase 1000 time in the future. Keep up the good work.

[@takeUforward]

actually its just 2 months old

[@amitbhatt9972]

@@takeUforward Ya I know..but the content is too good and well researched..so it deserves lot more subs even if its 2 months :):). I have a question, for someone who is already a software engineer with 1+ yrs of experience, how much time do you think it will take to complete all the topics covered in your video, considering that person want to switch to a product based company(likes of FAANG) and can give 2-3 hrs daily(Note: Not good in ds and algo at all, knows only arrays and singly linked list). Thanks in advance :)

[@DurgeshKumar-pv6pm]

@@amitbhatt9972 as striver said that everyone has different speed of learning and grasping things so it's depend on person to person.

[@nikhilsharma1694]

Amazing video . Thanks a lot for the guidance

[@memecached]

Now he has 2.2L subscribers.

[@rohitkumarvarma4952]

People like you who helps others to come to the level they are in, are the ones this mankind want. I will be forever indebted to this video. Thanks for clearly stating complete guide for cp. Practice starts now🔥🔥

[@omanshsharma6796]

how are you doing now bro?

[@rohitkumarvarma4952]

@@omanshsharma6796 hey omansh, I am doing great, practised dsa sheets and questions by striver got a good job, still hustling and learning from his new set of problems 😄..hope you are doing great too!

[@omanshsharma6796]

@@rohitkumarvarma4952 that's sooo good to hear!! keep going!! I am doing great too, I have just started cp 2 months ago, it's really fun!!

[@rohitkumarvarma4952]

@@omanshsharma6796 great to know! All the best💥

[@Souravkumar-zq9ip]

so i have noted each every point you said and i will be starting from July from step 1 learning c++ hope fully i am able to complete this in 6 months as this is my last year in BCA and i want to be good at competitive programming by the end of it. Btw this is the best video i have seen on this topic.

[@anjneykumarsingh4461]

Bhut time lgta h bhai

[@ashrafapon5513]

@@anjneykumarsingh4461 can i have ur note pls?

[@aktaransari5246]

How's it going??

[@cplusplussizeddick1430]

Howd it go

[@omkarshendge5438]

Lol no this is not some interview preparation bhai. It takes people 2 or more than 2 years just to reach candidate master it depends on person to person someone is fast someone is not. Completely depends on person I've seen people go to expert in 6 months which is like miraculous.

[@BhagyaRana]

Clarity is Power!!This Video has Cleared all my Doubts Regarding the Order I should Learn to Build Strong Foundations in CP. Great Guidance for Upcoming CP Coders & Community.MUST WATCH VIDEO!! This is A Golden Video explaining All the Concepts require to Get to a Bare Minimum Point (6* Code chef / 1800 + Code forces) in CP. Thanks for Your Efforts ,Striver Bhaiya! (Suggestion : Change the Thumbnail for Greater Reach)

[@SwatejTech]

Can you give me an update about how it's going? Did it work

[@hackein9435]

A sincere programmer will definitely subscribe for the hard work you did in video

[@ashishkpkpkp]

Best roadmap for those aspiring for competitive programmer

[@kishanmishra9802]

Yes I want the series of queries with people working in great product based companies. Thanks for your guidance 🙏🙏

[@jigarzanzarukiya4892]

I am doing Competitive Programming for last 1.5 years. Today I realise "STILL I HAVE MILES TO GO." Thanks for video...

[@pranjaladhav9600]

Ohh... Then what u did n tha past 1.5yr🤔

[@vickyedoc2782]

Bro c++ or java for cpp

[@aishwarya1895]

Literally ....... Thanx a lot from. The deepest heart.... U r doing a grt job for people who are not in IIT.. A big respect for u man✌

[@aniket7512]

@23:20 Yep we want such interviews. Try one with Errichto too if possible 😊 Thanks for this guidance.

[@pragmatic_p8]

****//***TIME STAMPS***//*** Section 1 : 3:45 Section 2 : 4:50 Section 3 : 6:04 Section 4 : 7:04 Section 5 : 8:58 Section 6 : 10:07 Section 7 : 11:13 Section 8 : 12:20 Section 9 : 13:29 Section 10 : 14:39 Section 11 : 15:28 Section 12 : 16:09 Section 13 : 18:02 Section 14 : 19:03 Section 15 : 20:00 Section 16 : 21:20

[@hamdaanshaikh7846]

Thank you so much for this road map to Competitive Programming, this was exactly what I was looking for! As a non-computer science graduate wanting to dive into this field, it was so perplexing to find a pathway in the plethora of information out there and make sense out of them. You have built this guide so meticulously and for that, Lots of love, and hope you grow exponentially!

[@qaseemhasan3594]

Hey striver, can you make a video about going to ICPC regionals like what's the procedure for new college students(I mean like students of those colleges that are participating first time), the cost/overhead, regional centers, preparation,etc

[@codeguy21]

It is NOW KICK START RIGHT

[@nishantsharma8824]

@@codeguy21 no

[@raghavsingh4275]

Main thing is that u have a team of three members of same college and everyone should know cp, if your not from iit or nit it is difficult to get other members because no one intrested same thing happens for me iam trying to build a team but it seems difficult to me.

[@darksidekiller5300]

@@raghavsingh4275 same bro literally nobody in my college wants to grind for ICPC regionals atleast

[@manohargrandhi6881]

Really really thanks a lot no words.i am tierd of search how to become competitive programmer.at last I got your video by luck.thank you very much.so much helpful no words bro.

[@VinayKumar-oi4yq]

A very thanks to you, this is the golden video for beginners of CP. I was finding suck video or a blog for a very long long time!

[@devvratjoshi9122]

A video like this takes place when you do a topological sort on entire Competitive Programming topics. That's very helpful.

[@anoosha9600]

Wow.. This is really & clearly good! Not even have an idea of these many concepts present.

[@yashaggarwal3226]

Awesome video, i got to known about this channel from your interview with love babbar and this roadmap REALLY is a gold mine . i am subscribed and thank you again for sharing this roadmap .

[@mohdaasimqureshi7115]

I notedown each and every point that you told. I know cpp basic stuff and learned cpp stl as you told Now from today my journey of cp begins following your roadmap only I am currently in 2nd year(b.tech CSE) if someone wants to guide me as i am starting, you are warmly welcome to reply on my comment

[@manasvi4586]

Not everyone has the guts to come up and help others to make them successful..Thanks a lot for such a proper guidance 🙏🙏

[@aadilsaudagar8432]

Thanks a lot.Will be starting from this weekend and hopefully provide an update after my 4th Sem.

[@mdzaid5925]

I am overwhelmed with so many algorithms

[@Snehaa2296]

thank you so much..i was blindly learning ds algo and just practicing basic problems...thanks for saving my research time :)

[@codersantani7773]

We will love to have people from Codenation and master /candidate master do live questions here!

[@mayankbhatnagar3421]

This video should be made mandatory to watch for all the students stepping into the engineering colleges. I'm 3 years late, how much are you? 😂

[@xsuritox1058]

2 yrs late😂😂😂

[@angiras07]

just 1 but i lose motivation

[@Sanjeevsingh-kp4el]

I m in final year

[@gauravkakoti3259]

Class 12

[@RajputAnkit11]

@@gauravkakoti3259 if you are sure that you will definitely get cse branch in engineering then start following this video it will change your life

[@HarshKumar-nh6be]

No words to say thanku to you bhai, you have boost me up and within a year i will be a programmer better than others..❤❤😤😤

[@namangirdhar8736]

This video was too good and clearly shows ur hardwork u have putted in . Keep the good work up🔥🔥🔥🔥

[@abhijitburman1260]

Just what I looking for after yesterday codeforces and today i found this video. Very helpful and much appreciated your hard work bhaiya.

[@masudalam6805]

This video is really going to help me a lot, As I am beginner. Thank you so much for this awesome video

[@shashankkumarsingh6516]

Yes , we want such experience sharing videos of Top Performers. It would be a great insight for us

[@sabalniroula26]

Getting started with Competitive programming Will have a long journey to success. Hope will make it one day. Thank you sir for making my math easier 👍 Loved your efforts on making this video.

[@samarth2915]

so did u follow this order ? and did it help for placements ?

[@hemanth_ps_]

Superb video.. Very helpful... Thanks is not enough

[@a-33-akshaymishra5]

You are doing a great job! This roadmap will be really helpful.

[@prateekmanta2097]

Yes bro it would be awesome to have a series like that 😎. And thank you so much for your wonderful research man 😭👍🏻 and sharing your experience

[@Abhishek-hg9ql]

This Is An Complete Road Map Provided By Striver.... Thanks Buddy

[@munawarhussain3236]

Heyy..striver...iam amazed....thx fr ur video...nd ur answer for the ques u asked in last...was yes....wud love 2 seee u with people working in gud companies!!

[@Raju-rk4qo]

You just gave me a complete roadmap as i am a pupil at codeforces .Now I know what to learn sequencally...Thank you very much striver_79.... And p.s. - We want that series...:)

[@Amritanjali]

wow I have done same mistake started dp by iterative approach after seeing tushar sir videos and then I started hating dp

[@simitchinnu7313]

This is the best guide so far, thank you !

[@sourabhsaxena3132]

Brother this is want all we really need Vast,perfect research and explanation in this video you revel all your cp journey This will helps me alot ♥️ Stay active and share content like this because no one is dedicated like you Thanks alot

[@lostgen36]

Now that's what i call a complete guideline!

[@faang1485]

Gave a best source for algorithms designing..gave suitable data structures source

[@praveenkumar-ym5ei]

Please start the series bro we are waiting,and you doing marvellous job by spreading knowledge about this

[@beanlighter9491]

I will come back to this video one year later to inform you about my progress

[@abhisheksinghchauhan5169]

@take U forward you said there are a bunch of good problems of prefix sum 1D and 2D on codeforces but I can't find them as there is no such specific tag for it. It would be great help if anyone can share link.

[@manishkumar-uw5mw]

Thank you sir. I can't express great fullness to you in words.❣️❣️

[@robinsingh4492]

Thank you so much Striver. It will help all of us alot.

[@debadiptobiswas5611]

I totally agree with you with CP algorithm argument.

[@jubayerislam7298]

From which minute?

[@ArnabJhaYT]

Bookmarking this comment for further updates. I amstarting this roadmap and my aim is 5 stars by the end of December, 2022.

[@vishalrout2593]

Thank you so much man... I had no clue on how to start ds and algo your video helped a ton ty

[@ckshenoy]

Now I understand how u got selected in Google, Amazon etc. What if someone is not that interested about coding. Like I've been trying to code atleast for 1hr daily but as soon as I see any tough one I just shut down my laptop. Any solution? Btw I have basic knowledge of coding and have cracked tcs so u might get an idea how much im into coding

[@yeshwanths7198]

bro your are really doing a great job, if you try and add videos on each algorithm it will be really helpfull

[@ayushraj-zb6sv]

well i never liked competitive coding personlly,was more into open source and stuff.But lately i am realizing that if i got to get into my favourate company i got to do cp.I am just promoted into final year and have solved only 230 questions on codeforces and 250 question o leetcode.

[@sayedmuddassirhussain5803]

Best roadmap ever seen😇😇

[@amansaxena4314]

Suno, idhar aao. SAB PADHLO ! 🤭 What a cool video! Nicely explained. 👍

[@akhilsaini5956]

Thank you bhai for such an amazing video. And I really apprecite your hard work. I used to learn topics randomly which really affect my learning speed but know I do have a full index. Thanks again Bro.

[@c_shekhar]

Firstly,Heartfelt Thanks❤❤ And I am interested in the interview/similar videos with candidate masters at codeforces,etc.

[@ajitshiva9193]

You are a best youtuber. 😍😍

[@chaitanyagawande855]

This is best path to follow to become competitive codef❤️😍🇮🇳

[@sanisahani818]

The best video I came across ao far☺️ Thank you...🙏

[@deepakchawla1105]

Thanks ! I wonder how can anyone dislike this .

[@gautamsuthar4143]

Do I need to learn DSA before all these topics? Should I learn DSA first or simultaneously. I am a beginner and I know basic C++. and I have done 150 Questions on codeforces(first two pages). Now, I want to learn DSA. From where Should I learn DSA? Tell me about Best youtube channel or website to learn DSA?

[@varshatiwari9067]

One of the best video's I've ever seen

[@lovetocode9266]

This is a real roadmap ❤️❤️

[@jhashivam28]

As a newbie at codeforces I think I have a long journey to cover 😅

[@ilikememes9052]

I am a newbie too 😁😂

[@R39006]

I dont even have a codeforce id , i only used havkerrank till now 😪. Poor me

[@jhashivam28]

@@R39006 after getting gold in hackerrack u get ready for the real learning

[@jhashivam28]

@@R39006 😂😂

[@R39006]

Imma 3 star coder in HackerRank, should i start with Codeforces ,Spoj or GFG

[@kushalkumarvennu5409]

You are truely a master.

[@codeguy21]

Make collaboration with rachit jain 1.How he managed both electrical and software.

[@Expanses02]

He just did Cp in free time , i dont think he did anything related to development. So its not a big deal, since you dont require university courses for cp.

[@siddharthmagadum16]

@@Expanses02 He has done web development

[@shivatomar4319]

This is gold....🙆🏻‍♂️ Thanks mate 🖤 Subscribed 👏🏼

[@mukulkathpalia6924]

Really Nice video cleared lot of my doubts

[@ayushgupta7447]

Can you provide everything you discussed as a document with lists? That will help a lot😬

[@shashankshetti4477]

Bhai.. this Video is Simply Awesome ❤️ ..

[@faang1485]

Very useful information striver ..gave this type of information relate to cp and product base company more..

[@anuragsrigyan677]

You with this video should have come one year earlier...needed these things at that time...now kinda time's up.

[@arpitaggarwal4087]

Incredible video I can't explain bhaiya how much this video helped me ♥️♥️♥️♥️

[@shubhamagarwal2998]

Immense respect for U and your contribution bro.

[@manas_singh]

How dare did you scroll down while the legend was speaking?

[@rehaankhan2491]

Thanks a lot bro! Wish you lot of success in life.

[@mursalinahmed3463]

yes we want a series like this

[@mayursb2259]

Please tell about Data structure path too and C++ Competitive programming function which u got while doing them...ex which are not in theory..And main PROJECTS TO DO WHICH TO SELECT..ETC!! THANKS FOR BEING THERE 🙏

[@yashshukla1637]

### *Guide for Competitive Programming: Roadmap and Resources* #### *Introduction* - Competitive programming is challenging due to uncertainty in what, how, and how much to practice. - Importance of following the *correct learning path* to avoid common mistakes and save time. - The focus is on the *exact order of algorithms, data structures, and resources* needed to excel. --- #### *Foundation* - *Programming Basics*: Learn the *basic syntax* and *standard libraries* (e.g., STL for C++) before diving into algorithms. - Balance *learning algorithms* and *practicing problems*: - Alternate between algorithm study days and problem-solving days. - *Participate in contests* early on to build speed and concentration without focusing on ratings. --- #### *Step-by-Step Learning Path* ##### *Basic Concepts* 1. *Pattern Printing Problems*: Develop logical thinking and mastery of loops. 2. *Time Complexity Analysis*: Understand expected complexity to approach problems efficiently. 3. *Basic Algorithms*: - *Linear Search* and *Circular Array Implementation*. - Number-based problems: Palindromes, Armstrong numbers, etc. ##### *Intermediate Topics* 4. *Hashing*: Simple hashing, frequency counting, and prefix sums (1D and 2D). 5. *Sliding Window Technique*: Essential for many competitive programming problems. 6. *Binary Search*: Common in contests; learn efficient GCD and extended Euclidean algorithms. ##### *Number Theory* 7. *Prime Numbers*: Efficient checks, sieve methods, and segmented sieve. 8. Advanced Number Theory: - Modular arithmetic, modular exponentiation, and modular inverse. - Combinatorics using *NCR/NPR* and the *Inclusion-Exclusion Principle*. --- #### *Advanced Concepts* ##### *Data Structures and Algorithms* 1. *Sorting Algorithms*: Bubble sort, selection sort, and constructive problems. 2. *Bit Manipulation*: Operators, significant bits, power sets, and related problems. 3. *Greedy Algorithms*: Focus on *Kruskal's*, job sequencing, and activity selection. 4. *Recursion*: Foundational for dynamic programming, binary search, and modular exponentiation. ##### *Trees and Graphs* 5. *Trees*: - Basics: DFS, BFS, height, diameter, Euler tour, and Lowest Common Ancestor (LCA). - Advanced: Subtree concepts and LCA with binary lifting. 6. *Graphs*: - Core algorithms: Connected components, topological sort, cycle detection, and shortest paths. - Algorithms: *Dijkstra*, *Bellman-Ford*, *Floyd-Warshall*, and *0-1 BFS*. - Spanning trees: Kruskal’s and Prim’s algorithms. ##### *Dynamic Programming* 7. Learn through recursion first, then progress to memoization and iterative approaches: - Problems like LCS, knapsack, and digit DP. - Explore *tree DP*, *bitmask DP*, and *SOS DP*. --- #### *Advanced Techniques* 1. *Disjoint Set Union (DSU)*: Offline queries and optimizations like Kruskal's algorithm. 2. *Segment Trees*: - Focus on *range queries*, *point updates*, and lazy propagation. - Applications in solving advanced problems up to Codeforces *E-level*. 3. *Specialized Topics*: - *Square Root Decomposition* and *Mo’s Algorithm*. - Advanced math: Sprague-Grundy theorem and combinatorial theorems. - *Heavy-Light Decomposition* for tree-based problems. 4. *Convex Hull and FFT (Fast Fourier Transform)*: Rare but important for high-level contests. --- #### *General Advice* - *Practice Consistently*: Focus on solving 25-30 problems per topic to build mastery. - Participate regularly in contests to maintain current skill levels while improving through new challenges. - Avoid comparison and demotivation: *Everyone progresses at their own pace*. --- #### *Resources* - Learning Platforms: *Codeforces*, *A2OJ ladders*, *CP Algorithms*, *GeeksforGeeks*, and *HackerRank*. - Blogs and Tutorials: - For algorithms: *CP Algorithms*, Gaurav Sen, and Anudeep’s blogs. - For practice: Codeforces (tagged problems) and CodeChef. - Advanced tutorials: Codeforces blogs, AdHoc educational contests, and KZbin channels for specific topics. --- #### *Closing Notes* - Stay patient and motivated; focus on *learning over results*. - Engage with the community via platforms like LinkedIn and Telegram. - Suggestions for future video series include Q&A sessions with experienced coders and industry professionals. --- *Key Takeaway*: Combine consistent practice, structured learning, and regular contest participation to excel in competitive programming.

[@angiras07]

what if i am practicing on a2oj and get stuck on a segment tree problem should i save it for later or learn segment tree instantly and come back to the problem before proceeding to the next problem

[@kunjparekh4632]

Thank you sir for this wonderful explanation.

[@wilson7846]

07:00 Number Theory

[@yoda6994]

Most elaborate roadmap 😇

[@nikhilnagrale]

First ❤️😍let me watch then I will give review 😁😁

[@nikhilnagrale]

I am noob

[@subhikshaps6242]

Hats off to ur wonderful and amazing work

[@ajaysapkota8088]

Really appreciated for your hard work brother

[@rupakkorde]

This is gold 🤩 Will follow it.

[@Expanses02]

I think you should have posted a link for paste bin for all these topics.

[@maharajchakraborty4773]

This is so good :-) Thanls a lot n surely u can start the series . thumbs up for that

[@yashkumardhawan6961]

After listening to this I can feel my pulse fading. Anyways, great content man.

[@poorvashinde8059]

@striver is it necessary to learn basic data structures like linked list, stack ,queue ,set,map, before doing whatever you mentioned

[@nihalshukla7718]

please suggest all topics in sequence for learning CP.

[@ankitkumarmishra9369]

Very informative 👌🏻 Thank you so much for this ✨