Rudimentary Reccomendation System #2
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
prabhuomkar
requested review from
prabhuomkar,
harshagr18,
rsd511 and
shambhavisudarsan
|
Appreciate your contribution @naidukarthi2193 :) |
rsd511
approved these changes
Apr 6, 2020
prabhuomkar
requested changes
Apr 6, 2020
| best_d[tops]=srt[0:5] | ||
|
|
||
| return unexp_d,prac_d,best_d | ||
|
|
There was a problem hiding this comment.
Make sure the code is linted with pylint default configuration.
| Jinja2==2.11.1 | ||
| joblib==0.14.1 | ||
| kiwisolver==1.2.0 | ||
| MarkupSafe==1.1.1 |
There was a problem hiding this comment.
Update requirements.txt to have major requirements like 'Flask', 'matplotlib', 'numpy', 'pandas'.
Avoid versioning for individual dependent packages and overall.
| background-color: #000; | ||
| } */ | ||
|
|
||
|
|
There was a problem hiding this comment.
- Drop the stylesheets and javascript files which are not required.
- Unless you are using custom stylesheets and javascript code, don't put the downloaded files here (like bootstrap css and jquery), instead use CDN links for bootstrap, jQuery
student_analysis/problems.json
Outdated
| ,{"_id":{"$oid":"5e8065b799770c00221d371a"},"tags":["string"],"code":"SRM16A","points":100,"name":"Go Corona, Corona Go","description":"Since the lockdown, Mithil has been coding just to end his boredom. Mithil who is also a pro gamer, thinks to play a Game and put away coding for some time. So today, the game he’s playing is about Spoidy. Spoidy is initially at a location <b>c=0</b>.\r\nMithil can press D and U:\r\n '<b>D</b>' moves character down, setting his position to <b>c − 1</b>\r\n '<b>U</b>' moves character up, setting his position to <b>c + 1</b>\r\n\r\nBut Mithil's controller is a bit old, it crashes at some instances. Sometimes few of the button presses are <b>ignored</b> and there is <b>no change</b> in Spoidy’s position. \r\nFor example, if Mithil sends instructions \"<b>UUD</b>\", it might be interpreted as any of the following:\r\n\r\n<b>UUD, UU, U, D, UD</b>\r\n\r\nMithil is unaware of which instructions will be sent successfully beforehand. Thus, he wants to know how many <b>different</b> locations may Spoidy end up at.\r\n\r\n","explainInput":"The first line of input contains an integer <b>T</b> denoting the number of test cases. The first and only line of each test case contains a string <b>S</b> of <b>N</b> commands, each either '<b>D</b>' or '<b>U</b>'.","explainOutput":"For each test case, print a single line consisting of <b>one integer</b> denoting the number of different locations Spoidy may end up at.","constraints":"1<= <b>T</b> <=100\r\n1<= <b>N</b> <= 10<sup>5</sup>\r\n","example":"Input:\r\n2\r\nUUD\r\nDUDU\r\nOutput:\r\n4\r\n5\r\n","explanation":"Test Case 1:\r\n<b>UUD</b> = 0+1+1-1 = 1\r\n<b>UU</b> = 0+1+1 = 2\r\n<b>U</b> = 0+1 = 1\r\n<b>D</b> = 0-1 = -1\r\n<b>UD</b> = 0+1-1 = 0\r\nSpoidy may end up anywhere between <b>-1,0,1,2</b>. Hence <b>4</b> unique locations.\r\n","contestCode":"SRM16","inputFile":"https://firebasestorage.googleapis.com/v0/b/siesgstarena-1819.appspot.com/o/stdin%2FSRM16%2FwUi0wldd-.in?alt=media","outputFile":"https://firebasestorage.googleapis.com/v0/b/siesgstarena-1819.appspot.com/o/stdout%2FSRM16%2FwUi0wldd-.out?alt=media","createdAt":{"$date":"2020-03-29T09:09:11.144Z"},"updatedAt":{"$date":"2020-03-29T13:47:25.978Z"},"__v":0} | ||
| ,{"_id":{"$oid":"5e8088ab99770c00221d371d"},"tags":["math,number theory"],"code":"SRM16B","points":250,"name":"Devin's Prime Time Hack","description":"Devin loves to work with graphics in his free time, and due to recent viral outbreaks, he wants to try working on a new graphic software which is out in the market. However his parents won’t allow him to buy the very expensive software and the serial key cannot be easily cracked. \r\nThe serial key is made up of <b>4 parts</b>. Each part has a <b>hexadecimal </b>code. The code is valid, if the <b>decimal</b> conversion of each individual part of the code (<b>N</b>) has a <b>prime count</b> of <b>factors</b>. For example, the number <b>\"13\"</b> has <b>2</b> factors “<b>1</b> and <b>13</b>”.<b> 2</b> is a <b>prime</b> number, hence <b>13</b> is valid.","explainInput":"The first line of input contains an integer T denoting the number of test cases.\r\nEach test case consists of 1 line of 4 “-” separated hexadecimal numbers ","explainOutput":"For each test case, output a single word “<b>YES</b>” or “<b>NO</b>” on a single line.","constraints":"1 <= <b>T</b> <= 100\r\n0 <= <b>N (in decimal)</b> <= 10<sup>9</sup>","example":"<b>Input:</b>\r\n2\r\nd-b3-bf-11b\r\naaa-caf-5b3-581\r\n\r\n<b>Output</b>:\r\nYES\r\nNO","explanation":"<b>Test Case 1:</b>\r\nThe first part converts to <b>13</b> in decimal which has <b>2 factors</b> (1 and 13). The second part converts to <b>179</b> which has <b>2 factors</b> (1 and 179). The third part converts to <b>191</b> in decimal which has <b>2 factors</b> (1 and 191). The fourth part converts to <b>283</b> in decimal which has <b>2 factors</b> (1 and 283). Hence the code is <b>valid</b>.\r\n\r\n<b>Test Case 2:</b>\r\nThe first part converts to <b>2730</b> in decimal which has <b>32 factors</b> but 32 is not prime. Hence the code is <b>invalid.</b>","contestCode":"SRM16","inputFile":"https://firebasestorage.googleapis.com/v0/b/siesgstarena-1819.appspot.com/o/stdin%2FSRM16%2FdiwlZmY31.in?alt=media","outputFile":"https://firebasestorage.googleapis.com/v0/b/siesgstarena-1819.appspot.com/o/stdout%2FSRM16%2FdiwlZmY31.out?alt=media","createdAt":{"$date":"2020-03-29T11:38:19.621Z"},"updatedAt":{"$date":"2020-03-29T12:42:42.748Z"},"__v":0} | ||
| ,{"_id":{"$oid":"5e80968d99770c00221d371e"},"tags":["math"],"code":"SRM16C","points":300,"name":"Secret Info","description":"Cibin, is the head of an intelligence agency. Since there is a lot of fake information, he wants to share some highly confidential information <b>S</b> to all the defense officials regarding this pandemic.\r\nHere the message to be sent is in a single word consisting of only lowercase English letters. For the confidentiality of the information he decides to encrypt the message. He makes a string <b>M</b> of length <b>N</b>, such that after deleting a substring of <b>non-zero</b> length from <b>M</b>, the remaining string is <b>S</b>. He needs your help to find out the number of all such possible ways he can form the string <b>M</b>.\r\n<b>Note:</b> The string <b>M</b> can be a combination of <b>lowercase</b> English letters.","explainInput":"First line contains the number of test cases <b>T</b>. \r\nFor each test case there is a single line which contains a space separated integer, <b>N</b> and a string <b>S</b>.\r\n","explainOutput":"For each test case, output the number of possible strings modulo <b>10^9+7</b>.","constraints":"1≤ <b>T</b> ≤ 1000\r\n1≤ <b>N</b> ≤10^18\r\n1≤ <b>|S|</b> ≤100\r\n<b>S</b> contains only lowercase English letters.","example":"<b>Input:</b>\r\n3\r\n2 a\r\n3 a\r\n3 ab\r\n<b>Output:</b>\r\n51\r\n1326\r\n76\r\n","explanation":"Following are some examples of 2 lettered words:\r\naa, ab, az, zz, bd, etc.\r\nWe can form <b>26*26 = 676</b> such words but only <b>51</b> out of them contain at least one ‘a’ so that we can form the string <b>S</b>. \r\nEg: We can get <b>‘a’</b> from <b>‘ab’</b> after removing the substring <b>‘b’</b>.\r\n But we can’t get <b>‘a’</b> from <b>‘cd’</b> or <b>‘tf’</b>.\r\n","contestCode":"SRM16","inputFile":"https://firebasestorage.googleapis.com/v0/b/siesgstarena-1819.appspot.com/o/stdin%2FSRM16%2FeKWMBpauU.in?alt=media","outputFile":"https://firebasestorage.googleapis.com/v0/b/siesgstarena-1819.appspot.com/o/stdout%2FSRM16%2FeKWMBpauU.out?alt=media","createdAt":{"$date":"2020-03-29T12:37:33.055Z"},"updatedAt":{"$date":"2020-03-29T13:50:09.46Z"},"__v":0} | ||
| ] |
There was a problem hiding this comment.
Dataset files can change over period of time. Add reference in your README from where you have to download dataset files and where you have to keep them for loading..
You may need to make some code changes for that.
|
Good work @naidukarthi2193
|
shambhavisudarsan
approved these changes
Apr 6, 2020
|
Above Changes pushed to Repo |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Created A Dashboard for Student Performance Analysis
Type Of Change
TODO: Enhanced Recommendation system