SkillShip Foundation along with PyLadies Delhi have organized its first ever 1.5 months mentorship program in competitive programming.
This program will consist of 2 phases.
Mentees will be paired with a mentor and for the duration of 1-month participants would be provided learning material and questions of different difficulty levels which mentees need to attempt daily.
The scores and progress of participants will be recorded.
Top 3 will get goodies and additionsl benefits.
Online contests will be organized on platorms like Codechef
Winners will be chosen after considering his/her cumulative performance in both phases.
Certificates will be awarded to all participants who attempts all the questions provided by the team.
Event Description : Codonfest
- Time Complexity, Array, Linear Search, Binary Search, Kadane's Algorithm:
- What is Time Complexity
- Best, worst and Avg Complexity
- Linear Search and Binary Search
- Kadane's Algorithm
- Count Sorting
- Recursion, Memoization and STL algorithms:
- Sieve of Ethranos
- What is Hashmap ?
- LinkedList
- https://www.youtube.com/watch?v=YoZPTyGL2IQ
- https://www.youtube.com/watch?v=moPtwq_cVH8
- https://www.youtube.com/watch?v=86CQq3pKSUw&t=366s
- https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/
- https://www.geeksforgeeks.org/maximize-the-subarray-sum-after-multiplying-all-elements-of-any-subarray-with-x/
- https://leetcode.com/problems/container-with-most-water/
- Beginner & Easy
- https://www.codechef.com/problems/TRN2
- https://www.codechef.com/problems/BC202
- https://www.codechef.com/problems/BC106
- https://www.codechef.com/problems/EXPCODE1
- https://www.codechef.com/problems/CHGM1
- https://www.codechef.com/problems/SNTEMPLE
- https://www.codechef.com/problems/TLG
- https://www.codechef.com/problems/NOKIA
- Intermediate:
- Hard:
- LinkedList, Queue & Stack:
- Into to Linked List
- Intro to Queue
- Intro to Stack
- Push, Pop and Size operations
- String, Maps & Heap:
- Intro to strings library
- Min heap and Max heap
- https://www.cs.cmu.edu/~adamchik/15-121/lectures/Linked%20Lists/linked%20lists.html
- https://m.youtube.com/watch?v=WwfhLC16bis
- Easy :
- https://www.codechef.com/problems/BEX
- https://www.codechef.com/problems/THESAV
- https://www.codechef.com/problems/ECJAN20D
- https://leetcode.com/problems/valid-parentheses/
- https://www.codechef.com/COOK115B/problems/XORGM
- https://www.codechef.com/problems/GOOGOL05
- https://leetcode.com/problems/kth-largest-element-in-an-array/
- https://leetcode.com/problems/two-sum/
- https://leetcode.com/problems/valid-anagram/
- https://leetcode.com/problems/jewels-and-stones/
- https://leetcode.com/problems/add-two-numbers/
- https://leetcode.com/problems/palindrome-linked-list/
- https://leetcode.com/problems/merge-two-sorted-lists/description/
- https://www.codechef.com/problems/THESAV
- Intermediate:
- Set, Tree, Tree Traversal and Trie
- Using set library
- Operations like insert,size, begin, end, iterators
- Learning two pointer technique
- Intro to tree
- Intro to Binary Tree and Complete Tree
- Pre order traversal
- In order traversal
- Post order traversal
- Intro to TRIE and it’s Implementatio
- https://medium.com/basecs/how-to-not-be-stumped-by-trees-5f36208f68a7
- https://medium.com/basecs/leaf-it-up-to-binary-trees-11001aaf746d
- https://www.hackerearth.com/practice/notes/trees/
- https://medium.com/basecs/learning-to-love-heaps-cef2b273a238
- https://medium.com/basecs/trying-to-understand-tries-3ec6bede0014
- Easy:
- https://leetcode.com/problems/diameter-of-binary-tree/
- https://www.interviewbit.com/problems/identical-binary-trees/
- https://leetcode.com/problems/set-matrix-zeroes/
- https://leetcode.com/problems/remove-duplicates-from-sorted-array/
- https://leetcode.com/problems/merge-sorted-array/
- https://leetcode.com/problems/intersection-of-two-arrays/
- https://leetcode.com/problems/intersection-of-two-arrays-ii/
- https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/
- https://leetcode.com/problems/squares-of-a-sorted-array/
- https://www.interviewbit.com/problems/preorder-traversal/
- https://www.codechef.com/problems/TREEROOT
- https://www.codechef.com/problems/CHEFDETE
- https://www.codechef.com/problems/BINTREE
- https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/
- https://leetcode.com/problems/symmetric-tree/
- https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/
- https://leetcode.com/problems/balanced-binary-tree/
- Intermediate:
- https://leetcode.com/problems/find-largest-value-in-each-tree-row/
- https://leetcode.com/problems/deepest-leaves-sum/
- https://leetcode.com/problems/implement-trie-prefix-tree/
- https://leetcode.com/problems/binary-tree-right-side-view/
- https://www.codechef.com/problems/BANKPASS
- https://www.codechef.com/problems/CAPIMOVE
- https://www.codechef.com/problems/NPLFLF
- Memoization, Backtracking Algorithm, Dynamic Programming, Graph, BFS, DFS, Greedy Algorithm:
- What is Memoization
- What is Dynamic Programming ?
- Top Down & Bottom Up approach
- Fibonacci Series
- 1D Prefix Sum Array
- 2D Prefix Sum Array
- What is Graph ? Types- directed and undirected
- Depth First Search
- Breadth First Search
- Easy
- https://www.codechef.com/problems/ALTARAY
- https://www.codechef.com/problems/DELISH
- https://www.codechef.com/problems/DBOY
- https://www.hackerrank.com/challenges/coin-change/problem
- https://www.hackerrank.com/challenges/unbounded-knapsack/problem
- https://www.hackerrank.com/challenges/dynamic-programming-classics-the-longest-common-subsequence/problem
- https://leetcode.com/problems/maximum-subarray/
- https://leetcode.com/problems/is-subsequence/
- Medium
- Hard