This challenge is currently meant for the students of NIT Durgapur
. Commit yourself to our 90 days of code challenge and contribute to the improvement of the coding culture of our college.
Starts from 28th February 2018
This challenge is going to help only if you solve the problems on your own, without cheating. Your main goal should be learning, not scoring.
First ranklist with username and score will be updated here on 10th March 2018.
If you’ve decided to join, following are the steps you need to go through:
- From today onwards, for the next 90 days, you are going to commit to our 90 days of coding challange.
- You are expected to code each and every day and solve as many problems as you can.
- You should solve problems on your own. Try for at least 4-5 hours, then you may seek help.
- Solutions of almost all problems are available online. In case of further doubts, visit AskREC.
- Create your own branch, solve the problems daily, mark the corresponding checkbox in this file in your corresponsing branch, commit and push to github.
- Encourage at least 5 of your friends to do the same.
- Raise an issue and/or a pull request if you want something to be improved and/or to add a question.
- Basic git knowledge. You can learn it from here
- A working laptop and an internet connection.
-
Each push is worth 3 points (Minimum 1 question should be solved) and every 5 continuous push will increase your score by 20 percent.
-
For each solved question, score is calculated as follows:
- Easy section 5 points
- Medium section 7 points
- Hard section 10 points
-
At the end of every 10 days, we will update our ranklist. Following predefined score (F1 based) will be added to your total score based on your rank.
25 - 18 - 15 - 12 - 10 - 8 - 6 - 4 - 2 - 1
X = data before current push
Y = data after current push
Change the following block only
Number of easy questions solved: X Y
Number of medium questions solved: X Y
Number of hard questions solved: X Y
Number of total questions solved: X Y
Change X and Y only according to your progress.**
For example - if you solved 1 easy question and 2 hard questions today
Number of easy questions solved: 0 1
Number of medium questions solved: 0 0
Number of hard questions solved: 0 2
Number of total questions solved: 0 3
Please note that any misinformation will decrease your score by 100.
To mark the checkbox, change [ ] to [x].
- https://goo.gl/Kkf8eD
- https://www.codechef.com/problems/SCC0103
- http://www.spoj.com/problems/GSS1/
- https://www.codechef.com/problems/BITMASK3
- https://goo.gl/PTpmny
- https://www.codechef.com/problems/BITMASK3
- https://www.hackerrank.com/challenges/two-arrays/problem
- http://www.spoj.com/problems/FREQUENT/
- http://www.spoj.com/problems/BUGLIFE/
- https://goo.gl/shR8UK
- http://www.spoj.com/problems/GERGOVIA/
- http://codeforces.com/problemset/problem/793/C
- http://www.spoj.com/problems/COINS/
- https://goo.gl/h7a3mN
- https://goo.gl/MDTg6s
- http://www.spoj.com/problems/TOPOSORT/
- https://www.hackerrank.com/challenges/angry-children/problem
- http://www.spoj.com/problems/QUEEN/
- http://www.spoj.com/problems/HORRIBLE/
- http://www.spoj.com/problems/PAIRS1/
- http://www.spoj.com/problems/JUSTAPAL/
- https://goo.gl/m5DbXZ
- http://www.spoj.com/problems/ELEVTRBL/
- https://www.codechef.com/problems/K1/
- http://www.spoj.com/problems/PT07Y/
- https://goo.gl/JHSdm1
- https://goo.gl/viMSCX
- https://goo.gl/PzwksW
- http://www.spoj.com/problems/BLHETA/
- https://goo.gl/TGfXMv
- https://www.hackerrank.com/challenges/angry-children/problem
- https://www.codechef.com/problems/PANSTACK
- https://goo.gl/1A7rHf
- https://www.hackerrank.com/challenges/flipping-bits/problem
- https://www.codechef.com/problems/CDX1604
- https://goo.gl/u1ZFt7
- http://www.spoj.com/problems/STRMATCH/
- https://goo.gl/NnEu73
- https://www.hackerrank.com/challenges/lonely-integer/problem
- https://www.codechef.com/problems/FIRESC
- http://codeforces.com/problemset/problem/579/A
- https://goo.gl/66cr2p
- https://goo.gl/fvbDS5
- https://www.codechef.com/problems/REL102
- http://www.spoj.com/problems/SUMITR/
- https://goo.gl/S69rSA
- https://goo.gl/xMWucx
- http://www.spoj.com/problems/CRSCNTRY/
- https://goo.gl/uH7FYz
- https://goo.gl/DDzNyE
- https://goo.gl/tSnDU7
- https://www.hackerrank.com/challenges/sum-vs-xor/problem
- http://www.spoj.com/problems/ADAJOBS/
- http://www.spoj.com/problems/RENT/
- https://www.codechef.com/DCL1501/problems/DCL2015E/ [2D BIT]
- http://codeforces.com/problemset/problem/774/D
- http://www.spoj.com/problems/KNAPSACK/
- http://www.spoj.com/problems/GCPC11J/
- https://goo.gl/yLirva
- http://codeforces.com/problemset/problem/777/B
- https://www.hackerrank.com/challenges/largest-permutation/problem
- http://www.spoj.com/problems/CODESPTB/
- https://www.codechef.com/problems/TRAL
- http://www.spoj.com/problems/SDITSAVL/ [AVL tree]
- http://codeforces.com/problemset/problem/439/D
- http://www.spoj.com/problems/PPATH/
- http://www.spoj.com/problems/DISUBSTR/ [suffix tree or suffix array]
- https://goo.gl/jNsdWQ
- https://www.hackerrank.com/challenges/morgan-and-a-string/problem
- https://goo.gl/1tU579 [sqrt decompostion]
- http://www.spoj.com/problems/PT07Z/
- http://www.spoj.com/problems/ADABRANC/
- https://www.hackerrank.com/challenges/richie-rich/problem
- https://www.hackerrank.com/challenges/pylons/problem
- http://www.spoj.com/problems/MAKETREE/
- https://www.codechef.com/problems/RRDAG
- http://www.spoj.com/problems/BUSYMAN/
- http://codeforces.com/problemset/problem/579/A
- http://codeforces.com/problemset/problem/106/E
- http://www.spoj.com/problems/PARTIT/
- http://codeforces.com/problemset/problem/431/E
- http://codeforces.com/problemset/problem/898/C
- https://www.codechef.com/problems/WTHINGS
- http://www.spoj.com/problems/FACEFRND/
- https://goo.gl/DWyiui [persistent segTree]
- https://goo.gl/5MwpVj [trie]
- http://www.spoj.com/problems/LABYR1/
- https://www.codechef.com/problems/CROFT
- https://www.hackerrank.com/challenges/aorb/problem
- https://www.hackerrank.com/challenges/similar-strings/problem
- http://codeforces.com/problemset/problem/633/C
- https://goo.gl/GcBqqy
- https://goo.gl/poJyjN
- http://www.spoj.com/problems/DQUERY/
- http://codeforces.com/problemset/problem/777/D
- http://www.spoj.com/problems/MIXTURES/
- https://www.hackerrank.com/challenges/whats-next/problem
- http://www.spoj.com/problems/SBANK/
- https://goo.gl/FxvqiP
- https://goo.gl/s1gkhH
- http://www.spoj.com/problems/RMQSQ/ [sparse table]
- http://codeforces.com/problemset/problem/596/D
- https://goo.gl/oXTucZ
- http://www.spoj.com/problems/INVCNT/
- http://www.spoj.com/problems/GSS3/
- http://codeforces.com/problemset/problem/340/D
- http://www.spoj.com/problems/RMID2/ [heaps]
- http://www.spoj.com/problems/DCEPC206/
- http://www.spoj.com/problems/BRIDGE/
- http://www.spoj.com/problems/KGSS/
- https://www.hackerrank.com/challenges/counter-game/problem
- https://www.hackerrank.com/challenges/and-product/problem
- https://goo.gl/gngBzX
- http://www.spoj.com/problems/BISHOPS/
- http://www.spoj.com/problems/ADAFRIEN/
- http://www.spoj.com/problems/POTHOLE/
- https://www.hackerrank.com/challenges/task-scheduling/problem
- http://www.spoj.com/problems/MKTHNUM/
- http://codeforces.com/contest/510/problem/C
- https://www.hackerrank.com/challenges/the-great-xor/problem
- http://www.spoj.com/problems/BACKUP/ [heaps]
- https://goo.gl/5ztFts
- https://www.hackerrank.com/challenges/bike-racers/problem
- https://www.hackerrank.com/challenges/yet-another-minimax-problem/problem
- http://codeforces.com/problemset/problem/761/D
- https://www.hackerrank.com/challenges/hamming-distance/problem
- http://www.spoj.com/problems/BRDGHRD/
- http://www.spoj.com/problems/AGGRCOW/
- http://www.spoj.com/problems/SUBXOR/ [trie]
- http://codeforces.com/contest/538/problem/F
- https://www.hackerrank.com/challenges/board-cutting/problem
- http://codeforces.com/problemset/problem/653/F [persistent segTree]
- https://www.hackerrank.com/challenges/string-transmission/problem
- http://codeforces.com/contest/506/problem/D [sparse table]
- http://codeforces.com/problemset/problem/903/E
- https://www.codechef.com/problems/MONOPLOY [HLD]
- http://www.spoj.com/problems/GSS7/ [HLD]
- http://www.spoj.com/problems/KATHTHI/
- http://codeforces.com/problemset/problem/780/F
- https://www.hackerrank.com/challenges/save-humanity/problem
- https://goo.gl/MvotAY
- http://codeforces.com/problemset/problem/813/E [persistent segTree]
- http://www.spoj.com/problems/ASSIGN/
- https://www.codechef.com/problems/CL16BF
- http://www.spoj.com/problems/SKYLINE2/
- http://www.spoj.com/problems/RPLA/
- https://goo.gl/HgGzcJ
- http://www.spoj.com/problems/LONGCS/ [suffix tree or suffix array]
- https://www.hackerrank.com/challenges/stonegame/problem
- http://codeforces.com/problemset/problem/678/E
- http://www.spoj.com/problems/SSORT/
- http://www.spoj.com/problems/INUMBER/
- https://goo.gl/SVvLEA
- https://www.hackerrank.com/challenges/2s-complement/problem
- https://goo.gl/nqXngJ
- https://www.hackerrank.com/challenges/iterate-it/problem
- https://www.codechef.com/problems/DGCD
- http://www.spoj.com/problems/ANARC05H/