└── readme.md /readme.md: -------------------------------------------------------------------------------- 1 | # 90 Days of Code Challenge 2 | 3 | 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. 4 | 5 | ``` Starts from 28th February 2018 ``` 6 | 7 | **```This challenge is going to help only if you solve the problems on your own, without cheating. 8 | Your main goal should be learning, not scoring.```** 9 | 10 | ## Ranklist 11 | 12 | ```before 26th March 2018``` 13 | 14 | 1. raghav7997 ```204 points (+58)``` 15 | 2. lostground97 ```193 points (+49)``` 16 | 3. Ruchi-nitd ```118 points (+40)``` 17 | 3. ashutosh97 ```47 points (+47)``` 18 | 4. piyu007 ```43 points (+0)``` 19 | 5. deblina-talukdar ```8 points (+0)``` 20 | 6. akjais99 ```8 points (+0)``` 21 | 22 | Next ranklist with username and score will be updated here on 3rd April 2018. 23 | 24 | 25 | ## Getting Started 26 | 27 | If you’ve decided to join, following are the steps you need to go through: 28 | 29 | 1. From today onwards, for the next 90 days, you are going to commit to our 90 days of coding challenge. 30 | 2. You are expected to code each and every day and solve as many problems as you can. 31 | 3. You should solve problems on your own. Try for at least 4-5 hours, then you may seek help. 32 | 4. Solutions of almost all problems are available online. In case of further doubts, visit [AskREC](http://recursionnitd.in/askrec). 33 | 5. Create your own branch, solve the problems daily, mark the corresponding checkbox in this file in your corresponsing branch, commit and push to github. 34 | 6. Encourage at least 5 of your friends to do the same. 35 | 7. Raise an issue and/or a pull request if you want something to be improved and/or to add a question. 36 | 37 | ### Steps to follow to push changes 38 | 39 | 1. fork this repo 40 | 2. clone your forked repo, not this repo. 41 | 3. create a new branch (branch name should be same as your username on github). 42 | 4. commit your changes on your branch, nothing on master branch. 43 | 5. push it to your forked repo. 44 | 6. Send a merge request 45 | 46 | Do steps 1 to 3 once and then steps 4 to 6 daily to update the changes. 47 | 48 | ## Prerequisites 49 | 50 | - Basic git knowledge. You can learn it from [here](https://www.youtube.com/playlist?list=PL6gx4Cwl9DGAKWClAD_iKpNC0bGHxGhcx) 51 | - A working laptop and an internet connection. 52 | 53 | ## Scoring 54 | 55 | 1. Each push is worth 3 points (Minimum 1 question should be solved) and every 5 continuous push will increase your score by 20 percent. 56 | 57 | 2. For each solved question, score is calculated as follows: 58 | - **Easy section** 5 points 59 | - **Medium section** 7 points 60 | - **Hard section** 10 points 61 | 62 | 3. 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.\ 63 | **```25 - 18 - 15 - 12 - 10 - 8 - 6 - 4 - 2 - 1```** 64 | 65 | 66 | ## Update this section at every push 67 | 68 | ``` 69 | X = data before current push 70 | Y = data after current push 71 | ``` 72 | 73 | **Change the following block only** 74 | ``` 75 | Number of easy questions solved: X Y 76 | Number of medium questions solved: X Y 77 | Number of hard questions solved: X Y 78 | Number of total questions solved: X Y 79 | 80 | Change X and Y only according to your progress.** 81 | ``` 82 | 83 | ``` 84 | For example - if you solved 1 easy question and 2 hard questions today 85 | Number of easy questions solved: 0 1 86 | Number of medium questions solved: 0 0 87 | Number of hard questions solved: 0 2 88 | Number of total questions solved: 0 3 89 | ``` 90 | 91 | **Please note that any misinformation will decrease your score by 100.** 92 | 93 | ``` 94 | To mark the checkbox, change [ ] to [x]. 95 | ``` 96 | 97 | ### Questions 98 | 99 | #### Easy 100 | 101 | 1. [ ] [https://goo.gl/Kkf8eD](https://goo.gl/Kkf8eD) 102 | 2. [ ] [https://www.codechef.com/problems/SCC0103](https://www.codechef.com/problems/SCC0103) 103 | 3. [ ] [http://www.spoj.com/problems/GSS1/](http://www.spoj.com/problems/GSS1/) 104 | 4. [ ] [https://www.codechef.com/problems/BITMASK3](https://www.codechef.com/problems/BITMASK3) 105 | 5. [ ] [https://goo.gl/PTpmny](https://goo.gl/PTpmny) 106 | 6. [ ] [https://www.codechef.com/problems/BITMASK3](https://www.codechef.com/problems/BITMASK3) 107 | 7. [ ] [https://www.hackerrank.com/challenges/two-arrays/problem](https://www.hackerrank.com/challenges/two-arrays/problem) 108 | 8. [ ] [http://www.spoj.com/problems/FREQUENT/](http://www.spoj.com/problems/FREQUENT/) 109 | 9. [ ] [http://www.spoj.com/problems/BUGLIFE/](http://www.spoj.com/problems/BUGLIFE/) 110 | 10. [ ] [https://goo.gl/shR8UK](https://goo.gl/shR8UK) 111 | 11. [ ] [http://www.spoj.com/problems/GERGOVIA/](http://www.spoj.com/problems/GERGOVIA/) 112 | 12. [ ] [http://codeforces.com/problemset/problem/793/C](http://codeforces.com/problemset/problem/793/C) 113 | 13. [ ] [http://www.spoj.com/problems/COINS/](http://www.spoj.com/problems/COINS/) 114 | 14. [ ] [https://goo.gl/h7a3mN](https://goo.gl/h7a3mN) 115 | 15. [ ] [https://goo.gl/MDTg6s](https://goo.gl/MDTg6s) 116 | 16. [ ] [http://www.spoj.com/problems/TOPOSORT/](http://www.spoj.com/problems/TOPOSORT/) 117 | 17. [ ] [https://www.hackerrank.com/challenges/angry-children/problem](https://www.hackerrank.com/challenges/angry-children/problem) 118 | 18. [ ] [http://www.spoj.com/problems/QUEEN/](http://www.spoj.com/problems/QUEEN/) 119 | 19. [ ] [http://www.spoj.com/problems/HORRIBLE/](http://www.spoj.com/problems/HORRIBLE/) 120 | 20. [ ] [http://www.spoj.com/problems/PAIRS1/](http://www.spoj.com/problems/PAIRS1/) 121 | 21. [ ] [http://www.spoj.com/problems/JUSTAPAL/](http://www.spoj.com/problems/JUSTAPAL/) 122 | 22. [ ] [https://goo.gl/m5DbXZ](https://goo.gl/m5DbXZ) 123 | 23. [ ] [http://www.spoj.com/problems/ELEVTRBL/](http://www.spoj.com/problems/ELEVTRBL/) 124 | 24. [ ] [https://www.codechef.com/problems/K1/](https://www.codechef.com/problems/K1/) 125 | 25. [ ] [http://www.spoj.com/problems/PT07Y/](http://www.spoj.com/problems/PT07Y/) 126 | 26. [ ] [https://goo.gl/JHSdm1](https://goo.gl/JHSdm1) 127 | 27. [ ] [https://goo.gl/viMSCX](https://goo.gl/viMSCX) 128 | 28. [ ] [https://goo.gl/PzwksW](https://goo.gl/PzwksW) 129 | 29. [ ] [http://www.spoj.com/problems/BLHETA/](http://www.spoj.com/problems/BLHETA/) 130 | 30. [ ] [https://goo.gl/TGfXMv](https://goo.gl/TGfXMv) 131 | 31. [ ] [https://www.hackerrank.com/challenges/angry-children/problem](https://www.hackerrank.com/challenges/angry-children/problem) 132 | 32. [ ] [https://www.codechef.com/problems/PANSTACK](https://www.codechef.com/problems/PANSTACK) 133 | 33. [ ] [https://goo.gl/1A7rHf](https://goo.gl/1A7rHf) 134 | 34. [ ] [https://www.hackerrank.com/challenges/flipping-bits/problem](https://www.hackerrank.com/challenges/flipping-bits/problem) 135 | 35. [ ] [https://www.codechef.com/problems/CDX1604](https://www.codechef.com/problems/CDX1604) 136 | 36. [ ] [https://goo.gl/u1ZFt7](https://goo.gl/u1ZFt7) 137 | 37. [ ] [http://www.spoj.com/problems/STRMATCH/](http://www.spoj.com/problems/STRMATCH/) 138 | 38. [ ] [https://goo.gl/NnEu73](https://goo.gl/NnEu73) 139 | 39. [ ] [https://www.hackerrank.com/challenges/lonely-integer/problem](https://www.hackerrank.com/challenges/lonely-integer/problem) 140 | 40. [ ] [https://www.codechef.com/problems/FIRESC](https://www.codechef.com/problems/FIRESC) 141 | 41. [ ] [http://codeforces.com/problemset/problem/579/A](http://codeforces.com/problemset/problem/579/A) 142 | 42. [ ] [https://goo.gl/66cr2p](https://goo.gl/66cr2p) 143 | 43. [ ] [https://goo.gl/fvbDS5](https://goo.gl/fvbDS5) 144 | 44. [ ] [https://www.codechef.com/problems/REL102](https://www.codechef.com/problems/REL102) 145 | 45. [ ] [http://www.spoj.com/problems/SUMITR/](http://www.spoj.com/problems/SUMITR/) 146 | 46. [ ] [https://goo.gl/S69rSA](https://goo.gl/S69rSA) 147 | 47. [ ] [https://goo.gl/xMWucx](https://goo.gl/xMWucx) 148 | 48. [ ] [http://www.spoj.com/problems/CRSCNTRY/](http://www.spoj.com/problems/CRSCNTRY/) 149 | 49. [ ] [https://goo.gl/uH7FYz](https://goo.gl/uH7FYz) 150 | 50. [ ] [https://goo.gl/DDzNyE](https://goo.gl/DDzNyE) 151 | 51. [ ] [https://goo.gl/tSnDU7](https://goo.gl/tSnDU7) 152 | 52. [ ] [https://www.hackerrank.com/challenges/sum-vs-xor/problem](https://www.hackerrank.com/challenges/sum-vs-xor/problem) 153 | 53. [ ] [http://www.spoj.com/problems/ADAJOBS/](http://www.spoj.com/problems/ADAJOBS/) 154 | 155 | 156 | #### Medium 157 | 158 | 1. [ ] [http://www.spoj.com/problems/RENT/](http://www.spoj.com/problems/RENT/) 159 | 2. [ ] [https://www.codechef.com/DCL1501/problems/DCL2015E/ [2D BIT]](https://www.codechef.com/DCL1501/problems/DCL2015E/) 160 | 3. [ ] [http://codeforces.com/problemset/problem/774/D](http://codeforces.com/problemset/problem/774/D) 161 | 4. [ ] [http://www.spoj.com/problems/KNAPSACK/](http://www.spoj.com/problems/KNAPSACK/) 162 | 5. [ ] [http://www.spoj.com/problems/GCPC11J/](http://www.spoj.com/problems/GCPC11J/) 163 | 6. [ ] [https://goo.gl/yLirva](https://goo.gl/yLirva) 164 | 7. [ ] [http://codeforces.com/problemset/problem/777/B](http://codeforces.com/problemset/problem/777/B) 165 | 8. [ ] [https://www.hackerrank.com/challenges/largest-permutation/problem](https://www.hackerrank.com/challenges/largest-permutation/problem) 166 | 9. [ ] [http://www.spoj.com/problems/CODESPTB/](http://www.spoj.com/problems/CODESPTB/) 167 | 10. [ ] [https://www.codechef.com/problems/TRAL](https://www.codechef.com/problems/TRAL) 168 | 11. [ ] [http://www.spoj.com/problems/SDITSAVL/ [AVL tree]](http://www.spoj.com/problems/SDITSAVL/) 169 | 12. [ ] [http://codeforces.com/problemset/problem/439/D](http://codeforces.com/problemset/problem/439/D) 170 | 13. [ ] [http://www.spoj.com/problems/PPATH/](http://www.spoj.com/problems/PPATH/) 171 | 14. [ ] [http://www.spoj.com/problems/DISUBSTR/ [suffix tree or suffix array]](http://www.spoj.com/problems/DISUBSTR/) 172 | 15. [ ] [https://goo.gl/jNsdWQ](https://goo.gl/jNsdWQ) 173 | 16. [ ] [https://www.hackerrank.com/challenges/morgan-and-a-string/problem](https://www.hackerrank.com/challenges/morgan-and-a-string/problem) 174 | 17. [ ] [https://goo.gl/1tU579 [sqrt decompostion]](https://goo.gl/1tU579) 175 | 18. [ ] [http://www.spoj.com/problems/PT07Z/](http://www.spoj.com/problems/PT07Z/) 176 | 19. [ ] [http://www.spoj.com/problems/ADABRANC/](http://www.spoj.com/problems/ADABRANC/) 177 | 20. [ ] [https://www.hackerrank.com/challenges/richie-rich/problem](https://www.hackerrank.com/challenges/richie-rich/problem) 178 | 21. [ ] [https://www.hackerrank.com/challenges/pylons/problem](https://www.hackerrank.com/challenges/pylons/problem) 179 | 22. [ ] [http://www.spoj.com/problems/MAKETREE/](http://www.spoj.com/problems/MAKETREE/) 180 | 23. [ ] [https://www.codechef.com/problems/RRDAG](https://www.codechef.com/problems/RRDAG) 181 | 24. [ ] [http://www.spoj.com/problems/BUSYMAN/](http://www.spoj.com/problems/BUSYMAN/) 182 | 25. [ ] [http://codeforces.com/problemset/problem/579/A](http://codeforces.com/problemset/problem/579/A) 183 | 26. [ ] [http://codeforces.com/problemset/problem/106/E](http://codeforces.com/problemset/problem/106/E) 184 | 27. [ ] [http://www.spoj.com/problems/PARTIT/](http://www.spoj.com/problems/PARTIT/) 185 | 28. [ ] [http://codeforces.com/problemset/problem/431/E](http://codeforces.com/problemset/problem/431/E) 186 | 29. [ ] [http://codeforces.com/problemset/problem/898/C](http://codeforces.com/problemset/problem/898/C) 187 | 30. [ ] [https://www.codechef.com/problems/WTHINGS](https://www.codechef.com/problems/WTHINGS) 188 | 31. [ ] [http://www.spoj.com/problems/FACEFRND/](http://www.spoj.com/problems/FACEFRND/) 189 | 32. [ ] [https://goo.gl/DWyiui [persistent segTree]](https://goo.gl/DWyiui) 190 | 33. [ ] [https://goo.gl/5MwpVj [trie]](https://goo.gl/5MwpVj) 191 | 34. [ ] [http://www.spoj.com/problems/LABYR1/](http://www.spoj.com/problems/LABYR1/) 192 | 35. [ ] [https://www.codechef.com/problems/CROFT](https://www.codechef.com/problems/CROFT) 193 | 36. [ ] [https://www.hackerrank.com/challenges/aorb/problem](https://www.hackerrank.com/challenges/aorb/problem) 194 | 37. [ ] [https://www.hackerrank.com/challenges/similar-strings/problem](https://www.hackerrank.com/challenges/similar-strings/problem) 195 | 38. [ ] [http://codeforces.com/problemset/problem/633/C](http://codeforces.com/problemset/problem/633/C) 196 | 39. [ ] [https://goo.gl/GcBqqy](https://goo.gl/GcBqqy) 197 | 40. [ ] [https://goo.gl/poJyjN](https://goo.gl/poJyjN) 198 | 41. [ ] [http://www.spoj.com/problems/DQUERY/](http://www.spoj.com/problems/DQUERY/) 199 | 42. [ ] [http://codeforces.com/problemset/problem/777/D](http://codeforces.com/problemset/problem/777/D) 200 | 43. [ ] [http://www.spoj.com/problems/MIXTURES/](http://www.spoj.com/problems/MIXTURES/) 201 | 44. [ ] [https://www.hackerrank.com/challenges/whats-next/problem](https://www.hackerrank.com/challenges/whats-next/problem) 202 | 45. [ ] [http://www.spoj.com/problems/SBANK/](http://www.spoj.com/problems/SBANK/) 203 | 46. [ ] [https://goo.gl/FxvqiP](https://goo.gl/FxvqiP) 204 | 47. [ ] [https://goo.gl/s1gkhH](https://goo.gl/s1gkhH) 205 | 48. [ ] [http://www.spoj.com/problems/RMQSQ/ [sparse table]](http://www.spoj.com/problems/RMQSQ/) 206 | 49. [ ] [http://codeforces.com/problemset/problem/596/D](http://codeforces.com/problemset/problem/596/D) 207 | 50. [ ] [https://goo.gl/oXTucZ](https://goo.gl/oXTucZ) 208 | 51. [ ] [http://www.spoj.com/problems/INVCNT/](http://www.spoj.com/problems/INVCNT/) 209 | 52. [ ] [http://www.spoj.com/problems/GSS3/](http://www.spoj.com/problems/GSS3/) 210 | 53. [ ] [http://codeforces.com/problemset/problem/340/D](http://codeforces.com/problemset/problem/340/D) 211 | 54. [ ] [http://www.spoj.com/problems/RMID2/ [heaps]](http://www.spoj.com/problems/RMID2/) 212 | 55. [ ] [http://www.spoj.com/problems/DCEPC206/](http://www.spoj.com/problems/DCEPC206/) 213 | 56. [ ] [http://www.spoj.com/problems/BRIDGE/](http://www.spoj.com/problems/BRIDGE/) 214 | 57. [ ] [http://www.spoj.com/problems/KGSS/](http://www.spoj.com/problems/KGSS/) 215 | 58. [ ] [https://www.hackerrank.com/challenges/counter-game/problem](https://www.hackerrank.com/challenges/counter-game/problem) 216 | 59. [ ] [https://www.hackerrank.com/challenges/and-product/problem](https://www.hackerrank.com/challenges/and-product/problem) 217 | 60. [ ] [https://goo.gl/gngBzX](https://goo.gl/gngBzX) 218 | 61. [ ] [http://www.spoj.com/problems/BISHOPS/](http://www.spoj.com/problems/BISHOPS/) 219 | 62. [ ] [http://www.spoj.com/problems/ADAFRIEN/](http://www.spoj.com/problems/ADAFRIEN/) 220 | 63. [ ] [http://www.spoj.com/problems/POTHOLE/](http://www.spoj.com/problems/POTHOLE/) 221 | 64. [ ] [https://www.hackerrank.com/challenges/task-scheduling/problem](https://www.hackerrank.com/challenges/task-scheduling/problem) 222 | 65. [ ] [http://www.spoj.com/problems/MKTHNUM/](http://www.spoj.com/problems/MKTHNUM/) 223 | 66. [ ] [http://codeforces.com/contest/510/problem/C](http://codeforces.com/contest/510/problem/C) 224 | 67. [ ] [https://www.hackerrank.com/challenges/the-great-xor/problem](https://www.hackerrank.com/challenges/the-great-xor/problem) 225 | 68. [ ] [http://www.spoj.com/problems/BACKUP/ [heaps]](http://www.spoj.com/problems/BACKUP/) 226 | 69. [ ] [https://goo.gl/5ztFts](https://goo.gl/5ztFts) 227 | 70. [ ] [https://www.hackerrank.com/challenges/bike-racers/problem](https://www.hackerrank.com/challenges/bike-racers/problem) 228 | 71. [ ] [https://www.hackerrank.com/challenges/yet-another-minimax-problem/problem](https://www.hackerrank.com/challenges/yet-another-minimax-problem/problem) 229 | 72. [ ] [http://codeforces.com/problemset/problem/761/D](http://codeforces.com/problemset/problem/761/D) 230 | 231 | 232 | #### Hard 233 | 234 | 1. [ ] [https://www.hackerrank.com/challenges/hamming-distance/problem](https://www.hackerrank.com/challenges/hamming-distance/problem) 235 | 2. [ ] [http://www.spoj.com/problems/BRDGHRD/](http://www.spoj.com/problems/BRDGHRD/) 236 | 3. [ ] [http://www.spoj.com/problems/AGGRCOW/](http://www.spoj.com/problems/AGGRCOW/) 237 | 4. [ ] [http://www.spoj.com/problems/SUBXOR/ [trie]](http://www.spoj.com/problems/SUBXOR/) 238 | 5. [ ] [http://codeforces.com/contest/538/problem/F](http://codeforces.com/contest/538/problem/F) 239 | 6. [ ] [https://www.hackerrank.com/challenges/board-cutting/problem](https://www.hackerrank.com/challenges/board-cutting/problem) 240 | 7. [ ] [http://codeforces.com/problemset/problem/653/F [persistent segTree]](http://codeforces.com/problemset/problem/653/F) 241 | 8. [ ] [https://www.hackerrank.com/challenges/string-transmission/problem](https://www.hackerrank.com/challenges/string-transmission/problem) 242 | 9. [ ] [http://codeforces.com/contest/506/problem/D [sparse table]](http://codeforces.com/contest/506/problem/D) 243 | 10. [ ] [http://codeforces.com/problemset/problem/903/E](http://codeforces.com/problemset/problem/903/E) 244 | 11. [ ] [https://www.codechef.com/problems/MONOPLOY [HLD]](https://www.codechef.com/problems/MONOPLOY) 245 | 12. [ ] [http://www.spoj.com/problems/GSS7/ [HLD]](http://www.spoj.com/problems/GSS7/) 246 | 13. [ ] [http://www.spoj.com/problems/KATHTHI/](http://www.spoj.com/problems/KATHTHI/) 247 | 14. [ ] [http://codeforces.com/problemset/problem/780/F](http://codeforces.com/problemset/problem/780/F) 248 | 15. [ ] [https://www.hackerrank.com/challenges/save-humanity/problem](https://www.hackerrank.com/challenges/save-humanity/problem) 249 | 16. [ ] [https://goo.gl/MvotAY](https://goo.gl/MvotAY) 250 | 17. [ ] [http://codeforces.com/problemset/problem/813/E [persistent segTree]](http://codeforces.com/problemset/problem/813/E) 251 | 18. [ ] [http://www.spoj.com/problems/ASSIGN/](http://www.spoj.com/problems/ASSIGN/) 252 | 19. [ ] [https://www.codechef.com/problems/CL16BF](https://www.codechef.com/problems/CL16BF) 253 | 20. [ ] [http://www.spoj.com/problems/SKYLINE2/](http://www.spoj.com/problems/SKYLINE2/) 254 | 21. [ ] [http://www.spoj.com/problems/RPLA/](http://www.spoj.com/problems/RPLA/) 255 | 22. [ ] [https://goo.gl/HgGzcJ](https://goo.gl/HgGzcJ) 256 | 23. [ ] [http://www.spoj.com/problems/LONGCS/ [suffix tree or suffix array]](http://www.spoj.com/problems/LONGCS/) 257 | 24. [ ] [https://www.hackerrank.com/challenges/stonegame/problem](https://www.hackerrank.com/challenges/stonegame/problem) 258 | 25. [ ] [http://codeforces.com/problemset/problem/678/E](http://codeforces.com/problemset/problem/678/E) 259 | 26. [ ] [http://www.spoj.com/problems/SSORT/](http://www.spoj.com/problems/SSORT/) 260 | 27. [ ] [http://www.spoj.com/problems/INUMBER/](http://www.spoj.com/problems/INUMBER/) 261 | 28. [ ] [https://goo.gl/SVvLEA](https://goo.gl/SVvLEA) 262 | 29. [ ] [https://www.hackerrank.com/challenges/2s-complement/problem](https://www.hackerrank.com/challenges/2s-complement/problem) 263 | 30. [ ] [https://goo.gl/nqXngJ](https://goo.gl/nqXngJ) 264 | 31. [ ] [https://www.hackerrank.com/challenges/iterate-it/problem](https://www.hackerrank.com/challenges/iterate-it/problem) 265 | 32. [ ] [https://www.codechef.com/problems/DGCD](https://www.codechef.com/problems/DGCD) 266 | 33. [ ] [http://www.spoj.com/problems/ANARC05H/](http://www.spoj.com/problems/ANARC05H/) --------------------------------------------------------------------------------