ez72018 Prepare | CodeChet 2 CodeChef Certified Data Structure & Algorithms Nou Pam One Programme (CCDSAP) ‘ae! 26 Registration Closes on 124 August 2018 » Overviow Prepare Updates ‘Ths section Ist cu the sylabus, the learning resources and Mock Tests to help you prepare for eves the Certfeation test, The resources that we lst here are eferences that we have cllectd over the » bots intamet and some of them from aur own webs, While we do recommend these resources based ‘on te inputs of our user commun, we do nat clam that these ae the most authortatve Learing senadue Resources about an topic, Plasse fel fee to find out what suits bast ta you. © Peepers ‘We have also prepared 2 Mock Tat for each lve A Mack Test isan open assessment const Foundation that wil help you assess yourself for the oartfcaton exam after you ae ready wih the topes. For Aevenced ‘each level we have difrant Mock Tests. Thosa contests wil run forever. We strongly recommend soe you to selve these problems inthe same duration of ime asthe duration ofthe exam before you take the exam, » Examination tse Candidates can expect problems from the fllowing topics fo come inthe exam, Conse Us Foundation » 30a Reprseriatve sylabus: Tho syllabus for each oval fs mentionod balow: 1. Baul Data Stuctures: Arays, Strings, Stacks, Queues ‘Asymptotic analysis (Big-O notation) Basie math operations (adition, subtraction, mulipleston,cvision, expensntation) ‘Satin primalty testing Euelets GOD Agorthm Basie Recursion Greedy Algothms Basie Dynamic Programming Naive sting searching (O(n togn Sorting 11. Binary Searching Learning Resources: 1. Asymptotic analysis (8ig-0 notation) a, Basle [Link] - Time complexty of comouter program i. [Link] - Bi [Link] 1h. [Link] - Algorithms Lecture {= Inroduction to asym [Link] - Maasuting the efclency of alg VL interactvepython org -Parcul Jove notations yor 5.0 rotation b, Advanced rob-bolinet-A boghnats sudo to Big 0 notaton [Link] a3ez72018 Prepare | CodeChet i [Link] - ig.O Notation, Gave Laakman McDowell 1 [Link]- Big © notation IW. [Link] - Time and plex factorial Ve Avery noe tutorial ih examples ©. Practice Problems |. Check some MCQs on space and tme complenty nee. 2 Arrays 8 Resources |. [Link] - Dats Stucture Tuoi Array, i esemaedu- Aeaye I [Link]- Arrays Dats Structure > overvow »b, Practee Probions |. [Link]-LECANDY, edtorial eves i [Link] - NOTE li codechetcom- SALARY, editat Updates sion > Detais Ih. codechetcom- CHNISA, editorial Schedule \. codechelcom- RAINBOWA, actos] = Propare Vi [Link]- ERGTNLNG, eto Foundation vi, codechetcom- COPS, sitral 2. Strings: Expert 8. Resources » Examination |. utoralspointcom -Gee sings vee | [Link]- Java stings contacts docs python org Python stings In. [Link] - Python sings ‘Many questions onthe sting: Destbowrs Wi [Link]- Siting Data Suture Be a Reproseniatwe Me , Practice Problems |. codechetcom- CSUR, ator | codechetcom- LAPIN, edtelat 4, Stack and Quoue a, Resourcos |. gooksforgeoks org - Stack Data Stucre |i [Link]- nkaduction and ray Implementation I [Link] - Data Stuctures Modus I enemuedu- Stacks ¥. csemuedu- Stacks and Quouss Vi caemuedu- Stacks and Queues b, Practice Problems i spojcom - ONE 1. codechaticom- COMPILER ¥. spoicom - MASS Mi spolcom-HISTOGRA vi [Link] - Maximum Xor Secondary vil. spojcom - ANARCOEA x [Link] - . Minimal sting 1 [Link] - BAllemating Curent i [Link] -C. Longest Regular Brackst Sey -[Link] i. You can sea some problems with soliions here: Time complexity ofan slgorthm ana.ez72018 > overvow Updates Levee > Detais Propare Foundation Expert > Examination > FAG Conse Us Be a Reproseniatwe Me Dashboard _ntpsteww.[Link] 1. [Link] - A tuto Prepare | CodeChet ‘Basic math operations (addition, subtraction, multiplication, division, exponentiation) 311 Fast Module Mulioleation Euetle's GCD Algorithm a, Resoureas |. [Link] - Mycodescool video. |i. [Link]- Tho Euclidean Algorithm 1 [Link]- Examola program to fnd ga in ct Prime Numbers, divsibllty of numbers 1 Resources: |. Only Ofsa() algocthn for nding whether a number i a prin, factorization of 2 umber | Elndlg ome factors by taking the sauare rot b. Practice Problems: |. communiytopeadercom | communiytopeodercom i communitytopcodercom 1 communittopeadercom Basic Recursion a, Resources |. topeadericom - An into Pan |i topcodecom - An Inkodustion to Recursion: Part 2 i geckstorgeeks org - Recursion slong with questions) I. wabmitedu - Recursion ¥. [Link] - Recursion (Examples with exercises) i. lovetorprogramming [Link]- Backiracking, Memazation & ) nic Prooramming »b, Practice Problems |. eodechetcom- NOKIA, editorial |i. cadechetcom- TRIS, edtoral Ii codechetcom- LESTACK axtaral I. [Link]- FICE, adore, Greedy Algorithms Resources |. taresorgin - Greedy Algortnms 1. [Link] - Graedy Abort, | topcodeccom - Greedy Algorithms 1. Gisedy Algosthms . Practice Probloms |. eadechatcom -TACHSTCK, edtorial |i. codechetcom- GIELROPT, storal JAXDIEE,edtovil Ih. codecheLcom- GHEEST. edo \ [Link] CAKEDOOM, edtoval Vi codechetcom- CLETAB, vi, [Link] - TADELIVE, edtosal vii, codechetcom- MANYCHEF, ectorial 1 [Link]- MMPROD, edt . codechetcom- CHEETA sdtral i codochetcom - STIOKS, ada il. spojeom -BAISED vel spojcom-BALIEE Xv. spokcom-Gous0188 1 [Link] = tor 33ez72018 > overvow Updates Levee > Detais Propare Foundation Expert > Examination > FAG Conse Us Be a Reproseniatwe Me Dashboard " -[Link] 12 Prepare | CodeChet x x, [Link]- KNPSK ve, codechetcom- LEMUSIC ait spojcom - ABBANGE x6. spojcom -EASHION 10. Dynamic programming (Basie DP) a Resources |. medium [Link] - Demystifying Dy 1 [Link] - Dye li topcodecom -Dysamic Procramming —Fiom Novice to Advanced 1. incised - Dynamic Programming ;(xeroses are recommended) \¥. [Link]- Dynamic Programing Vi gecksforgeckso7g- Dynamic Programming (Contains alot of practic sessions) vi, MIT OCW (Contains some Advanced topics as wel 1 Dynami Programming 4 Dynamic Programming It Dynamic Progamming it 1. Qynamie Pregramming IV »b, Practoe Problons |. [Link] - ALTARAY, edtvat |i codechetcom- I. [Link] vi. codechetcom- EROGY, atrial vil. [Link]- MATRIX2, eto 1 codechetcom- AMSGAME?,adioral 8. spojcom -MCARDS Dal. spojcom - MIXTURES iv. spojcom - SAMEROAD xv. spojcom -AIBOHE, Naive string searching a Resources [Link] [Link] ‘awsorgin Marge sort |. [Link] i, Practice Problems [Link] -MRGSRT sot elgritmm Quick sort |. [Link] - Quicksortalgortim fi. Practice Problems ‘[Link]-TSORT Counting sort |. gooksforgooks.o19 - Counting Son i Practice Problems ana.ez72018 -[Link] > overview Updates Levee > Detais Propare Foundation Expert > Examination > FAG Conse Us Be a Reproseniatwe Me Dashboard Prepare | CodeChet |. [Link] -TACHSTCK, estorial | [Link] - SUCKS, editor 13. Binary Search & Resoutcos fend ofthe nk) 4k codechetcom cada com (Try solving problems of Simple and Moderate level as mentioned inthe ii vsteaeou Na [Link] , Detalles Theoretical analysis |. eed (A thoortical analysis) ©. Probleme |. gocksforgecks org - Binary Search (Contains some soles probloms) |i. [Link]- STRSUB, etal i codechetcom- ASHIGIFT, edtoral Ih. [Link]- STACKS, sisal \. codechetcom- DIVSET, edie, Vi [Link]- LOWSUM, storal vie [Link]- SNTEMPLE, edit vii. [Link]- SNAKEEAT. editorial bx [Link]- SCHEDULE, adtoria x. codechatcom-RIGHTTRI, editor ni [Link]- EORESTGA, adel Dil [Link] - CHEFHCK2ectorial vl. spojcom - ARGDEE xv. [Link]-NOTATRI ._spojcom- Sc) xvi spojcom -SUMEOUR, xe [Link]- SUBSUMS wi spojcom - ANARCOSH xx. spojcom-RENT 2x spojcom- BIE val spo}com-MKUHAR va, [Link]- SVADA vol spojcom-SUBS Mock Test: ‘Test | -codachef comPL MOCK! ‘Test - sodachal comFLMocKar Test 3 -codachel comELMOCKOS Test 4 - coachot comLMonKos Advanced v ‘This levels intended to tst thatthe candidate has a very good grasp of algorithms and data _ructres, and can solve mast preblams that ares in practice, Candidates can expec problems {fom the felowing topics to came inthe exam. Syllabus: vorthing inthe Foundation Love 1. Heaps (prionty queue) 2 Disjint Set Union sna,ez72018 > overvow Updates Levee > Detais Propare Foundation Expert > Examination > FAG Conse Us Be a Reproseniatwe Me Dashboard Prepare | CodeChet Sogmont Tro0s Binary Index Tee (Fenwick to0) ‘Troos (raversals, tree dynamic programming) Finding Lowest Common Ancestors (O(logN) solution where N is number of nodes). ‘Graph Algorithms a. Finding connected components and transive closures. ». Shortest;path algorithms (Dikst2, Selman-Ford,Floye-Warshal) Minimum spanning tee (Prim and Kruskal algorithms) 4, Biconectivty in undirected graphs (bridges, articulation pins) ‘8. Stonaly connected components in drctod graphs Topological Sorting 9. Eur path tourcyte Modular anthmetic including duslon, Inverse Amorized Analysis 10. Dhide and Conquor " ‘expert evel) 12 Slove of Eratostnenes Learning Resources: 1. Heaps (orioty queue) ‘8. Resources | esemuedy u b, Practee Problems |. [Link] IPCTRAIN, extol i [Link] - ANUMLA, I codechetcom- KSUBSUM gdtoral I. [Link]- RATING ito \¥. codechelcom- TSEGuOS, aditxial Vi spojcom- WEIRDEN [Link]- GAPIMOVE, adtoial vil. spocom - RMID2 i spojcom-LAZYPROG X spojcom -EXPEDE vi, aylocedu - Maze Checking and Visualvation 1 [Link]- MOSTDIST, edtoal 2, Disjoint Set Union a Resources codetoom band oa vedas edu fh. [Link] . Practice Problems |. codechatoom~GALACTIK, eden |i. [Link]- DISHOWN, adoral li codechetcom- JABO, ecitoil Ih. codocheLcom- PARITAEE, editorial \. [Link]- ELLMTR, seta! -[Link] ans,ez72018 Prepare | CodeChet vi, D_Quanty of Stings vii, eodechatcom- SETELE, editorial vel, [Link]- FIRESC, edltrial 3. Segment Trees 8. Resources 1 [Link] i aridaireja [Link] > overview I sualpo nat Updates v. loresorain Levee », Practice Probions |. spokeom css > Detais |i [Link]-Gss2 senadue li, [Link] - Classic Sagmant Tras (Export Love) Propare 1. spojcom = 1OPC1207 Foundation ¥.spojcom - ORDERSET vanced YL spokeom-HELPRZD2 expe vi. spojcom ANDROUND vil [Link] = HEAPULM > Examination 1 spojcom - NIGEDAY > FAG x spojcom = YODANESS: Conse Us Mi spojcom-DQUERY Be a Reproseniatwe Me 2 spojcom-KQUERY vel. spojcom -EREQUENT Dashboard Xv. spojcom-GSS3 x4. spojcom-GSS4 xv. spojcom-GSS5 vi, spojcom-KGSS, aol spojcom-HELPR2D2 XX. spojcom -BRGKTS, x spojcom-CTRICK x, spojcom -MATSUM Xl, spo}.com = RATING volt spajcom-RRSCHED sav, spojcom-SUPPER vay. spojcom- ORDERS Jovi. [Link]- LEBOBBLE ren. codechetcom- QUERY. veil [Link] -TEMPLEQ. oii 9po}.com-DISUBSTR ox. spojcom- TREE, veo spojcom- QTREEZ xa, spojcom- GTREES xa, spojcom - QTREES voaiv. spojcom- TREES Problems on segment row with ary propagation |i. spojcom-LITE (ance lazy propagation prabler) -[Link] |. spojcom - HORRIBLE (must do basi lazy propagation problem) m3ez72018 > overvow Updates Levee > Detais Propare Foundation Expert > Examination > FAG Conse Us Be a Reproseniatwe Me Dashboard -[Link] Prepare | CodeChet 1 spojcom = MULLUs (anomer mee zy propagation protiem) 1. codechetioom- CHEED \. [Link]- EUNAGE (adifcult lazy propagation problem) Vi RAR (aeicut and ri lazy propagation) vi. codechetcom- ADDMUL, vil. [Link] - SEGSORSS (a aieut zy propagation problem) ie spojeom-KGSS 2X [Link] - ©. Circular RQ 2 [Link] -E. Lucky Queries (must do hard problem on lazy propagation) 2, [Link] - EA Simple Task sol, [Link] -C. DZV Loves Fibonacci Numbers (important preblem to do, Invoduces some nice properties over lazy propagation) xiv. [Link] -D. The Child and Sequence 2. [Link] -E Lucky ray 4. Binary Index Tree (Fenwick tree) 1. Resources |. imgcadaccom tae. [Link] i isualgocet . Practice Problems: Please sole he problems mentioned in the above segment vee practice problems section. Note that usually ciffcult to do range updates in binary incexed trees. Most, tis used for for range query and pont update, However, you can check the following atte for checking how some simple spectickind of range updates can be peformed on binary indexed tron (hitp:pet-nitichexbhogspo i/20180Sitenwickroe-ange- ‘updates him). Note that range updates on IT is nota part ofthe syabus. |. spojeom -INVCNT |i. spokcom TRIP ‘Troos (traversals) a Resources deste. i [Link] Wi berketeyedu , Practice Problems |. spojcom-TREEORD Finding Lowest Common Ancestors (O(log N) solution where N is number of nodes) 1. Resources 1. ingcadeccom Depth Fist Search, Breadth First Search (Finding connected components and transitive closures) a Resources |. gecksforgeeks org - Con (Components in an undirected i [Link]-Zeansve closure ofa graph sh First Traversal or DFS fora Graph I [Link]- De Iv. aves orgin - Basic Graph Algoatms Ve [Link]- Graph Traversal Vi [Link] -Qroadt First Soares . Practice Probiens |. codechetcom - FIRESS, eltoral |i spojcom-BUGLIFE I [Link] -CAMS ie spojcom- Gape: ¥. spojcom - KES! Vi spoleom-PTOTY ana,ez72018 > overview Updates Levee > Detais Propare Foundation Expert > Examination > FAG Conse Us 8 Be a Reproseniatwe Me Dashboard -[Link] Prepare | CodeChet Wi. spojcom-BTO7Z, vil. spojcom -LABYRI 1 spojcom - PARADOX 3 [Link] -BPATH must do bs problem) Mi spolcom-ELEVIRBL (bs) 8. spojcom - QUEEN (fs) vl. spojcom SSORT i(cycles na graph) Xv. spojcom-BOROTGAL (bs) ‘Shortest path algorithms (Dijkstra, Bellman-Ford, loyd:-Warshall) 1 Resources |. geoksforgecks org - Disa’ shortest ath algonthm i laresorgin - Shares 1 [Link]- Sinola-Sauree Shares! Palhs (SSSP) , Practice Problems |. [Link] - DIGJUMP, editorial |i, codechetcom- AMRI4B, dior i codechetcom- INSOIS F, estoral Iv. [Link]- SPSHORT, esta (sigh dieu sta’ problem.) vs endechatcom= Vi spojcom- SHEATH Wi, spojcom - TRAEFICN vil. spojcom-SAMEROSA I Spojcom- MICEMAZE . spojcom-TRVGOST i [Link]- PAIRGL ST, stort Iman Ford Algorithm 1 Resources |. [Link]- Dynamic Progamming -Balman-FordAlgonthm 1 [Link] -;Qne Source Shortest Path - Beliman-Ford Algorithm b, Practice Probion |. communiytopcodercom - PeonlsYouMayKnow i [Link] -D. Robot Control li spojcom - ARBITRAG - Azbage (Floyd Warshal} Ih. communiytopcadercom - NetworkSecury (Floyd Warshe Minimum spanning tee (rim and Kruskal algorithms) & Resources |. algs4cs princeton edu - Minimum Spanning Trees i fares. [Link] - Seansing aes 1 visualgenet- Soanning Tee », Practice Problem | spokcom MST. |i spojcom-NITTROAD ii [Link] -BLINNET I spokeom- CSTREET ¥.spojcom - HIGHWAYS Vi spokcom ITWBCA! vi. codechetcom- MSTOS, sitar! vil. [Link]- CHEFGAME, edioral ‘x codechatcom- GALACTIK, editorial ana,ez72018 > overview Updates Levee > Detais Propare Foundation Expert > Examination > FAG Conse Us Be a Reproseniatwe Me Dashboard Prepare | CodeChet ‘11. Biconnectivity in undirectes & Resources graphs (bridges, articulation points) |. emanceng appspotcom Finding Sides in a Granh i [Link] - Arculaon Poins i [Link] - Articulation Pints », Practice Probion |. wacontinejudge org - Network. |i [Link] bayer edu Bulaing Bria i [Link]- Tourist Guide I. [Link]- Network ¥. [Link] Eases VL spokcom - SUBMERGE - Submersing Islands vi. spojcom-POLQUERY - Polos Quen vil, [Link] - A Guting Figure 12, Strongly connected components in directed graphs a Resources |. [Link] - Suongly comacted componants {i theorystanford edu - Stony Connected Components », Practee Problem |. spojeom ANTE |i. spojcom- CAPCITY 1 [Link] - SUBMERGE Iv, cadechatcom - MCO 16406, ectrial ¥.spojcom - BOTTOM, VL spolcom- BREAK communitylopcodercom - Marble Colaction Gama, s 13. Topological Sorting 2 Resources |. [Link]- Topological Sorting , Practoe Problem |. spojcom-TOPOSORT |i [Link] - ©, Fox And Names ii codechetcom= 1. spojcom-ELA ve endechetcom = Vi spojcom - MAKETREE ‘4. Euler path toureycle. 1. Resources |. [Link] - Eula Paths and Eulor Cis , Practoe Problem |. spojcom-WoRDSt 4, eodechetcom- CHEFPASS, adtovia} ii [Link]- TOURISTS, editor Ih. [Link] - Dew Year Santa Network \. [Link] Connected City Vi codochetcom- PEOPL OVE ie [Link] - D. Tanya and Password vii [Link] -E, One-Way Reform bx spojcom- goporse . spojcom-MAKETREE 15 Modular arithmetic Including divislon. inverse -[Link] 1013,ez72018 +6. 1. > overview Updates Levee > Detais Propare Foundation Expert > Examination > FAG Conse Us Be a Reproseniatwe Me Dashboard -[Link] Prepare | CodeChet & Resources |. codechatcom - Fast Module Multsiaton Exponential Squaring) 1 [Link] ist known loos for callating Cr SM (only for expert level) ‘Amortized Analysis 1 Resources |. commitedu- Amarized Analysis |i wikipedia org - Amortized An 1 ldmacin - Amonzod Analysis Divide and Conquer 8. Resources |. [Link] - [Link] and Recutrencas |. [Link]- Divde-ane-Con: b, Practice Problem |. [Link]-MRGSRT, adioral |i spojcom-HISTOGRA i codechetcom- ZASTYD, atrial I. codechstioom- RESTPERM, edtoral ¥. codechetcom- ACMIAKEt, edad ‘Advanced Dynamic Programming problems (excluding the dp optimizations which are ‘added in expert ove, Please go trough the basic OP resources ard problems mentioned in foundation level resource.) a Resources |. apps topcader com - Commonly used DP state domains | appstopeoder com - Introducing Dynamic Proeramming _appstopcodercom - Qatmizing DP solution 1. [Link] - DP over Subssis and Patns », Problems fr Advanced DP |e spojcom -MIST2 xp bitmask) |i [Link] -LAZYGOWS :ép bimask) li sp9).com -TRSTAGE :ép bimask) Ih. spokeom-MARTIAN ¥. spojcom - SQRBR ML spojcom- AGMAKER 1 spojcom~ x. spoicom-DE. XL spokeom -EDIST 28. spojcom -KRECT val, spojcom -GNVO7H x, [Link] -BHIDIAS Delt spojcom -PIGBANK Xx. spojcom-ETOZX spojcom-voou. xl spojcom - TOURIST x 200. [Link]- ANARCIZG 200. spojcom - MENU m3ez72018 1 _ntpsteww:[Link] Prepare | CodeChet ‘evi. [Link]- RENT (dp with segment eetBIT) sav, spojcom = INCSEQ sp wth segment reeIT) xavil_spoj.com - INCDSEQ i(ép with segment tree/8IT) vax, You can save some advanced problems fom 29x. [Link] - Dynamic Programing Type 19. Slove of Eratosthenes a. Resoures: 1 [Link]- Sieve Methods rates Problems 1 spojeom-TOKPRIME 1. spolcom -TDPRIMES ik spo}com-ODDDIV sieve + binary search) » overview Iv. spojcom- NDIVEH OWN) prime testing agoitin) Updates spo com = BV {dio ive) so Vi cadechetcom- LEVY, edt! Vi eodochetcom- BAETNUM, eliza » betas il eadechoteom- KERME, atrial 1 [Link]-DIVMAC, sisal (opment ee with seve) a X. codec com- PEER, eal a bt advanced sieve apptcaton) Feu 20. General arent 4. Stanfo Agoutns + et », Stanors Algor 2 » xainaton Mock Test: > xa 4. Test -cadechet com/ALMOCKO contact Us 2, Test2-sadachetcomiNL MOGKO? tee Reprevmiaive 2. Test -codachetcomALMOCKOa 4, Test -codachot com MOCKOE Dashboas Export v ‘This vel intondod ott thatthe candidate is an exportin algorithms and data structures, and has a doop understanding of tho lopcs. Canela {o come in the exam. an expect probloms frm te folloing topics Syllabus: Tho syllabus for Export Lovel is open-ended, Everything in Advanced Level will bo included, along vit reaps: Persistent Data Stuctres 4D Controid Decomposition Computational Geometry Fast Four Transforms Game Theory (Gaussian Elimination Dynamic Programming Optimzations ‘Advanced Sting algorithms (Tes, KMP, Ano-Cor Flows (MaxcFlow, Min Cost Max Flow) ik, Sufix arays, Suh tress) Learning Resources: ‘Tho resources aro listo ass, Mack Test: sans.ez72018 Prepare | CodeChet 4. Coming Soon Nolo: These inks have boon curaed to hap preparation forthe exams, ad alk lo help the ‘community in gonsral But if you own some ofthe material ink o, and you woul ke hem obo hor, pease contact us, ans we wil rmove Directi ther trapot series cy der anol merino som nosed aera ‘coast -& Platform for Aspiring Programmers sinform'a heb atoyanmats make gin he wolf abet, computer programming ss programming corsets A CaceCal we wat ato ‘vv thnk yy hastg programming contest tt sat oe moh and ater alr poor rabge nha mil tm mont We ato ae ‘nrgzeanom ane decison le gree, inary sete, ochiaioe ke aay Heathen. Aaa fom pro 9 lao le propranming competion, Praca Scion -A Place fo hone your Computer Programing Sil ny yor naa tena af our many aces gates nf it ou auton guage ojo ene Cr programming cotati scat zbsone note 38+ ogre langage, Pepring a nti oe wat pave ie rt Ror pt, a move vp Evo Godse rk, Une ou practise able repre yurel ere roe programming chalangee atlas oath men en Codec Compete - Monthly Programming Contests and Coots eure up fr rcagton naw et pee Cur programming contests ha rss warn e 2009 (af naan Conmunty, $79 for lesa Camry) ne irate ‘esecha nodes oot Programming Toole Practica Problams Insts ott Ts Pose sua Bau Pee os _ntpsteww.[Link] 1313