CP HUB Summer of Code Timeline
MAY
JUNE
Greedy and Binary Search
- 1. Resource 1
- 2. Activity Selection Problem
- 3. Egyptian Fraction
- 4. Job Sequencing
- 5. Job Sequencing using DSU
- 6. Job Sequencing - Loss Minimisation
- 7. Huffman Coding
- 8. Huffman Decoding
- 9. Water Connection Problem
- 10. Policeman catches Thieves
- 11. Minimum Swaps for Bracket Balancing
- 12. Fitting Shelves Problem
- 13. Assign Mice to Holes
- 14. Fractional Knapsack
- 15. Binary Search
- 16. Fractional Knapsack
- 17. Ternary Search 1
- 18. Ternary Search 2
- 19. Ternary Search 3
- 20. Problemset
JUNE
Data Structures
- 1. Queue using Stacks
- 2. Stacks & Queues 1
- 3. Stacks & Queues 2
- 4. Stacks & Queues 3
- 5. Stacks & Queues 4
- 6. BST Traversals
- 7. Insert Values in self balancing BST
- 8. Median in a stream
- 9. Reconstruction from traversal data
- 10. Find root to leaf path with specified sum
- 11. Hashing 1
- 12. Hashing 2
- 13. Hashing 3
- 14. Hashing 4
- 15. Heap
- 16. Heap 1
- 17. Heap 2
- 18. Disjoint Set
- 19. Disjoint set 1
- 20. Disjoint set 2
- 21. Disjoint set 3
- 22. Segment Tree
- 23. Segment Tree 1
- 24. Segment Tree 2
- 25. Problemset
JUNE
JULY
JULY
Number Theory
- 1. Euclid's GCD algorithm and Extended Euclid algorithm
- 2. Basic Modular Arithematic
- 3. Modular Exponentiation
- 4. Modular Inverse
- 5. Prime Factorization of a number
- 6. Sieve of Eratosthenes
- 7. Segmented Sieve
- 8. Euler Totient Function
- 9. Fermat's Little Theorem
- 10. NCR mod p calculation
- 11. Lucas Theorem
- 12. Chinese Remainder Theorem
- 13. Mobius Function
- 13.1. Mobius Function
- 14. Problemset