├── README.md ├── Track1 ├── 01_GettingStatedWithC++ │ ├── README.md │ └── RESOURCES.md ├── 02_BasicsOfC++_Sorting │ ├── README.md │ └── RESOURCES.md ├── 03_STL_TimeComplexity │ ├── README.md │ ├── RESOURCES.md │ └── STL.pdf ├── 04_Recursion_NumberTheory │ ├── README.md │ └── RESOURCES.md └── README.md └── Track2 ├── 01_IntroductorySession ├── README.md ├── STL.pdf ├── Session_1.pdf └── Session_1.pptx ├── 02_GraphsAndTrees ├── README.md └── RESOURCES.md ├── 03_StringHashing ├── README.md └── RESOURCES.md ├── 04_SegmentTrees ├── README.md └── RESOURCES.md ├── 05_FFT ├── FFT.pdf ├── README.md └── RESOURCES.md └── README.md /README.md: -------------------------------------------------------------------------------- 1 | # Competitive-Programming-League 2 | Resources for competitive programming league. 3 | -------------------------------------------------------------------------------- /Track1/01_GettingStatedWithC++/README.md: -------------------------------------------------------------------------------- 1 | # Getting Started With C++ 2 | ### Session on input, output, variables, for loops, and first AC submission on Codechef. 3 | 4 | **Date**: 04 September 2018 5 | 6 | **Venue**: CSE Department Seminar Hall 7 | 8 | **Speaker**: 9 | 10 | Ashwin Joisa, Algorithms Co-Head, Web Club
11 | Contact: +91 9482851775 -------------------------------------------------------------------------------- /Track1/01_GettingStatedWithC++/RESOURCES.md: -------------------------------------------------------------------------------- 1 | ## Theory 2 | - https://cal-linux.com/tutorials/getting_started_with_c++.html 3 | - https://www.tutorialspoint.com/cplusplus/ 4 | - https://www.geeksforgeeks.org/c-plus-plus/ 5 | 6 | ## Problems 7 | - https://www.codechef.com/problems/FLOW001 8 | - https://www.codechef.com/problems/FLOW002 9 | - https://www.codechef.com/problems/FLOW017 10 | - https://www.codechef.com/problems/FLOW004 11 | - https://www.codechef.com/problems/FLOW007 -------------------------------------------------------------------------------- /Track1/02_BasicsOfC++_Sorting/README.md: -------------------------------------------------------------------------------- 1 | # Basics of C++ Part II 2 | ## Sorting 3 | **Date**: 09 October 2018 4 | 5 | **Venue**: CSE Department Seminar Hall 6 | 7 | **Speakers**: 8 | - Spandana B, Web Club 9 | - Sharanya Kamath, Web Club 10 | -------------------------------------------------------------------------------- /Track1/02_BasicsOfC++_Sorting/RESOURCES.md: -------------------------------------------------------------------------------- 1 | # Resources 2 | - [Bubble Sort Explanation](https://www.tutorialspoint.com/data_structures_algorithms/bubble_sort_algorithm.htm) 3 | - [Selection Sort Explanation](https://www.tutorialspoint.com/data_structures_algorithms/selection_sort_algorithm.htm) 4 | - [While Loop](https://www.tutorialspoint.com/cplusplus/cpp_while_loop.htm) 5 | 6 | # Problems 7 | - [Sorting elements of an array by frequency](https://practice.geeksforgeeks.org/problems/sorting-elements-of-an-array-by-frequency/0) 8 | - [Arrays](https://www.hackerrank.com/challenges/arrays-introduction/problem) 9 | -------------------------------------------------------------------------------- /Track1/03_STL_TimeComplexity/README.md: -------------------------------------------------------------------------------- 1 | # STL in C++ and Recursions 2 | 3 | **Date**: 25 October 2018 4 | 5 | **Time**: 6:15 pm 6 | 7 | **Venue**: Mining Seminar Hall 8 | 9 | **Speakers**: 10 | - Shanthanu S Rai, Web Club 11 | - Madhuparna Bhowmik, Web Club 12 | -------------------------------------------------------------------------------- /Track1/03_STL_TimeComplexity/RESOURCES.md: -------------------------------------------------------------------------------- 1 | ## Theory 2 | - https://www.geeksforgeeks.org/analysis-of-algorithms-set-4-analysis-of-loops/ 3 | - https://www.geeksforgeeks.org/analysis-algorithm-set-4-master-method-solving-recurrences/amp/ 4 | - Topcoder Tutorial on STL : http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=standardTemplateLibrary 5 | - C++ Reference – http://cplusplus.com/reference 6 | - Code chef – http://codechef.com 7 | - SPOJ – http://spoj.com 8 | - Code forces – http://codeforces.com 9 | 10 | ## Problems 11 | - http://codeforces.com/problemset/problem/344/D 12 | - http://www.codechef.com/problems/BEX 13 | - http://www.spoj.com/problems/STPAR/ 14 | - http://www.spoj.com/problems/FACEFRND 15 | - http://www.codechef.com/problems/LEMUSIC 16 | - http://www.codechef.com/problems/TOURMAP 17 | - http://www.spoj.com/problems/AMR12G/ 18 | - http://www.spoj.com/problems/HOMO/ 19 | - http://www.spoj.com/problems/SANTA1/ 20 | - http://www.spoj.com/problems/classical/sort=-6 21 | 22 | -------------------------------------------------------------------------------- /Track1/03_STL_TimeComplexity/STL.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/WebClub-NITK/Competitive-Programming-League/6017f5c345362ab81a9d466fb6837ab6e268c742/Track1/03_STL_TimeComplexity/STL.pdf -------------------------------------------------------------------------------- /Track1/04_Recursion_NumberTheory/README.md: -------------------------------------------------------------------------------- 1 | ## Recursion and Basic Number Theory 2 | 3 | **Date:** 1st November 2018 4 | 5 | **Time:** 6:15 pm 6 | 7 | **Venue:** Mining Seminar Hall 8 | 9 | **Speakers:** 10 | - Arpitha Raghunandan, Web Club 11 | - Sagnik Ghosh, Web Club 12 | -------------------------------------------------------------------------------- /Track1/04_Recursion_NumberTheory/RESOURCES.md: -------------------------------------------------------------------------------- 1 | ## Number Theory : 2 | 3 | Theory: 4 | - http://theoryofprogramming.com/2014/12/24/modular-arithmetic-properties/ 5 | - https://www.google.co.in/amp/s/www.geeksforgeeks.org/modular-exponentiation-recursive/amp/ 6 | - https://discuss.codechef.com/questions/20451/a-tutorial-on-fast-modulo-multiplication-exponential-squaring 7 | - https://www.topcoder.com/community/competitive-programming/tutorials/mathematics-for-topcoders/ 8 | - https://www.geeksforgeeks.org/c-program-find-gcd-hcf-two-numbers/ 9 | - https://artofproblemsolving.com/community/c90633h1291397 10 | 11 | Problems: 12 | - https://codeforces.com/problemset/problem/835/A 13 | - https://codeforces.com/problemset/problem/598/A 14 | - https://www.hackerrank.com/challenges/sherlock-and-permutations/problem 15 | - https://codeforces.com/blog/entry/49494 16 | - https://codeforces.com/problemset/problem/70/A 17 | 18 | ## Recursion : 19 | 20 | Theory: 21 | - http://www.geeksforgeeks.org/recursion/ ( along with some solved examples ) 22 | - https://www.topcoder.com/community/data-science/data-science-tutorials/an-introduction-to-recursion-part-1/ 23 | - https://www.topcoder.com/community/data-science/data-science-tutorials/an-introduction-to-recursion-part-2/ 24 | - http://web.mit.edu/6.005/www/fa15/classes/10-recursion/ 25 | 26 | Problems: 27 | - https://www.hackerearth.com/practice/basic-programming/recursion/recursion-and-backtracking/practice-problems/algorithm/its-confidential-f006e2c4/ 28 | - https://www.codechef.com/problems/TRISQ 29 | - https://www.interviewbit.com/problems/generate-all-parentheses-ii/ 30 | 31 | -------------------------------------------------------------------------------- /Track1/README.md: -------------------------------------------------------------------------------- 1 | # Topics Covered: 2 | - Getting started with C++ 3 | - Basics of C++ part-II, Sorting 4 | - STL and Time Complexity 5 | - Recursion and Number Theory 6 | -------------------------------------------------------------------------------- /Track2/01_IntroductorySession/README.md: -------------------------------------------------------------------------------- 1 | # Introductory Session 2 | ### Session on basic C++, STL (Standard Template Library), Searching and Sorting algorithms and Divide and Conquer. 3 | 4 | **Date**: 24 February 2018 5 | 6 | **Venue**: MSH 7 | 8 | **Speakers**: 9 | 10 | Mohit Reddy, Convener Web Club.
11 | Contact: mohitreddy1996@gmail.com. 12 | 13 | Ashwin Joisa, Second Year CS.
14 | Contact: +919482851775 15 | 16 | 17 | -------------------------------------------------------------------------------- /Track2/01_IntroductorySession/STL.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/WebClub-NITK/Competitive-Programming-League/6017f5c345362ab81a9d466fb6837ab6e268c742/Track2/01_IntroductorySession/STL.pdf -------------------------------------------------------------------------------- /Track2/01_IntroductorySession/Session_1.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/WebClub-NITK/Competitive-Programming-League/6017f5c345362ab81a9d466fb6837ab6e268c742/Track2/01_IntroductorySession/Session_1.pdf -------------------------------------------------------------------------------- /Track2/01_IntroductorySession/Session_1.pptx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/WebClub-NITK/Competitive-Programming-League/6017f5c345362ab81a9d466fb6837ab6e268c742/Track2/01_IntroductorySession/Session_1.pptx -------------------------------------------------------------------------------- /Track2/02_GraphsAndTrees/README.md: -------------------------------------------------------------------------------- 1 | # Graphs and Trees 2 | ### Topics Covered 3 | - Graphs, trees, and its representations 4 | - BFS, DFS 5 | - Dijkstra, Floyd Warshall 6 | 7 | ###### [Click here to view `RESOURCES.md`](./RESOURCES.md) 8 | 9 | **Date**: 06 September 2018 10 | 11 | **Venue**: MSH 12 | 13 | **Speakers**: 14 | 15 | Siddharth Gangwani, Algorithms Head, Web Club.
16 | Contact: +91 9538033902 17 | 18 | Ashwin Joisa, Algorithms Co-Head, Web Club.
19 | Contact: +91 9482851775 20 | -------------------------------------------------------------------------------- /Track2/02_GraphsAndTrees/RESOURCES.md: -------------------------------------------------------------------------------- 1 | ## Theory 2 | - [Graph Representation](https://www.hackerearth.com/practice/algorithms/graphs/graph-representation/tutorial/) 3 | - [Breadth First Search](https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/tutorial/) 4 | - [Depth First Search](https://www.hackerearth.com/practice/algorithms/graphs/depth-first-search/tutorial/) 5 | - [Minimum Spanning Tree](https://www.hackerearth.com/practice/algorithms/graphs/minimum-spanning-tree/tutorial/) 6 | - [Shortest Path Algorithms](https://www.hackerearth.com/practice/algorithms/graphs/shortest-path-algorithms/tutorial/) 7 | 8 | ## Problems 9 | - https://www.spoj.com/problems/AMR11A/ 10 | - http://codeforces.com/problemset/problem/986/A 11 | - http://codeforces.com/problemset/problem/916/C 12 | - http://codeforces.com/problemset/problem/989/C 13 | - http://codeforces.com/problemset/problem/842/C 14 | -------------------------------------------------------------------------------- /Track2/03_StringHashing/README.md: -------------------------------------------------------------------------------- 1 | # String Hashing 2 | ### Topics Covered 3 | - Calculating hash values 4 | - Applying it in problems 5 | 6 | ###### [Click here to view `RESOURCES.md`](./RESOURCES.md) 7 | 8 | **Date**: 14 September 2018 9 | 10 | **Venue**: CSE Department Seminar Hall 11 | 12 | **Speaker**:
13 | Somnath Sarkar
14 | Contact: +91 8879523822 15 | -------------------------------------------------------------------------------- /Track2/03_StringHashing/RESOURCES.md: -------------------------------------------------------------------------------- 1 | ## Theory 2 | - https://cp-algorithms.com/string/string-hashing.html 3 | - https://ieee.nitk.ac.in/blog/hashing-in-competitive-programming/ 4 | 5 | ## Problems 6 | - [A Needle in the Haystack - SPOJ](https://www.spoj.com/problems/NHAY/) 7 | - [Double Profiles - Codeforces](http://codeforces.com/problemset/problem/154/C) 8 | - [Password - Codeforces](http://codeforces.com/problemset/problem/126/B) 9 | - [SUB_PROB - SPOJ](https://www.spoj.com/problems/SUB_PROB/) 10 | - [INSQ15_A](https://www.codechef.com/problems/INSQ15_A) 11 | - [SPOJ - Ada and Spring Cleaning](https://www.spoj.com/problems/ADACLEAN/) 12 | - [GYM - Text Editor](http://codeforces.com/gym/101466/problem/E) 13 | - [Codeforces - Games on a CD](http://codeforces.com/contest/727/problem/E) 14 | - [Codeforces - Santa Claus and a Palindrome](http://codeforces.com/contest/752/problem/D) 15 | - [Codeforces - String Compression](http://codeforces.com/contest/825/problem/F) 16 | - [Codeforces - Palindromic Characteristics](http://codeforces.com/contest/835/problem/D) 17 | - [SPOJ - Test](https://www.spoj.com/problems/CF25E/) 18 | - [Codeforces - Palindrome Degree](http://codeforces.com/contest/7/problem/D) 19 | - [Codeforces - Deletion of Repeats](http://codeforces.com/contest/19/problem/C) 20 | -------------------------------------------------------------------------------- /Track2/04_SegmentTrees/README.md: -------------------------------------------------------------------------------- 1 | 2 | Topics Covered
3 | Segment Trees 4 | 5 | 6 | Date: 28 october 2018 7 | 8 | Venue: MSH 9 | 10 | Speakers: 11 | 12 | Bhabesh Chanduka, Algorithms Group, Web Club. 13 | Contact: +91 9663893576 14 | 15 | Archana Priyadarshini, Algorithms Group, Web Club. 16 | Contact: +91 8050359370 17 | -------------------------------------------------------------------------------- /Track2/04_SegmentTrees/RESOURCES.md: -------------------------------------------------------------------------------- 1 | Theory 2 | - https://www.hackerearth.com/practice/data-structures/advanced-data-structures/segment-trees/tutorial/ 3 | 4 | Problems 5 | - https://www.hackerearth.com/practice/data-structures/advanced-data-structures/segment-trees/practice-problems/ 6 | - [All other problems can be found here](https://codeforces.com/blog/entry/22616) 7 | -------------------------------------------------------------------------------- /Track2/05_FFT/FFT.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/WebClub-NITK/Competitive-Programming-League/6017f5c345362ab81a9d466fb6837ab6e268c742/Track2/05_FFT/FFT.pdf -------------------------------------------------------------------------------- /Track2/05_FFT/README.md: -------------------------------------------------------------------------------- 1 | # FFT 2 | ### Topics Covered 3 | - Multiplying 2 polynomials in `O(nlogn)` time 4 | - Convolution using FFT 5 | 6 | ###### [Click here to view `RESOURCES.md`](./RESOURCES.md) 7 | 8 | **Date**: 24 January 2019 9 | 10 | **Venue**: ISTE Seminar Hall 11 | 12 | **Speaker**:
13 | Ashwin Joisa
14 | Contact: +91 9482851775 15 | -------------------------------------------------------------------------------- /Track2/05_FFT/RESOURCES.md: -------------------------------------------------------------------------------- 1 | ## Theory 2 | - https://codeforces.com/blog/entry/43499 3 | - http://www.cs.cmu.edu/afs/cs/academic/class/15451-s10/www/lectures/lect0423.txt 4 | - https://www.hackerrank.com/challenges/emma-and-sum-of-products/editorial 5 | 6 | ## Problems 7 | - Problem H : https://codeforces.com/gym/101667/attachments 8 | - https://codeforces.com/problemset/problem/528/D 9 | - https://codeforces.com/problemset/problem/632/E 10 | -------------------------------------------------------------------------------- /Track2/README.md: -------------------------------------------------------------------------------- 1 | # Topics Covered: 2 | - Introductory Session 3 | - Graphs and Trees 4 | - String Hashing 5 | - Segment Trees 6 | - FFT 7 | --------------------------------------------------------------------------------