Taksh Pratap SinghProgrammer: interested in competitive programming and getting started with data science and AI · 21w
Can you please share your code for this solution ?
Read more… (10 words)
Taksh Pratap Singh
Programmer: interested in competitive programming and getting started with data science and AI
Active In
International Olympiad in Informatics
Indian Computing Olympiad (ICO)
Competitive Programming
Machine Learning
International Mathematics Olympiad
Commonlounge Meta
USA Computing Olympiad
College Admissions
Deep Learning
ACM International Collegiate Programming Contest
Featured Contributions
NaN.
discussion
[DEVIOUS] Devious Minister
Note: The online judge solution checker has issues for this problem because this problem has multiple correct solutions.
Read more…(18 words)
reply in this discussion
NaN.
discussion
[EXPT] Indraneel's Experiment
Hi!
I made a DP state similar to LCS where dp[i][j] indicates the length of the best subsequence possible using A[0..j] and B[...
Read more…(137 words)
reply in this discussion
Taksh Pratap SinghProgrammer: interested in competitive programming and getting started with data science and AI · 24w
Hints:
If you still don't understand try to check the code for some values by hand or on your machine and print the entire L array or the P array for more insight.
Feel free to contact me for further help or clarific...
Read more… (184 words)
NaN.
discussion
Brackets (INOI 2016: India)
Indian National Olympiad in Informatics (INOI) is round 2 out of 3 (i.e. intermediate) for selection into Indian IOI team. See the discussion replies for solution one hint at a time (credits: Arpan Bhattacharya)
Read more…(35 words)
reply in this discussion
Taksh Pratap SinghProgrammer: interested in competitive programming and getting started with data science and AI · 24w
Were you able to solve the 2nd test case without TLE ?
Read more… (12 words)
NaN.
discussion
Corey's Party (AIO 2014: Australia)
Please provide a hint regarding what algorithm to use for the following problem: Given an undirected graph of N nodes and M edges find the maximum size of a subgraph of the graph such that the...
Read more…(116 words)
reply in this discussion
Taksh Pratap SinghProgrammer: interested in competitive programming and getting started with data science and AI · 24w
I guess there is some problem with the grader.
Read more… (9 words)
reply in this discussion
Taksh Pratap SinghProgrammer: interested in competitive programming and getting started with data science and AI · 24w
Is it part of the playlist ?
Read more… (7 words)
reply in this discussion
Taksh Pratap SinghProgrammer: interested in competitive programming and getting started with data science and AI · 24w
Wouldn't the complexity of this solution be more than O(n^2) ?
Read more… (11 words)
NaN.
discussion
Hii, I got selected to IOITC this year. I only know topics of INOI like dp and bit of graph theory(since i got to know about ZIO & ZCO this year only and managed to get into INOI through ZIO. Can anybody suggest what should i do to prepare for IOITC
and please soon due to lack of time.
Read more…(68 words)
reply in this discussion
Taksh Pratap SinghProgrammer: interested in competitive programming and getting started with data science and AI · 28w
Which class are you in ?
Read more… (6 words)
NaN.
course
Learn Machine Learning
This 29-part course consists of tutorials on ML concepts and algorithms, as well as end-to-end follow-along ML examples, quizzes, and hands-on projects. You can think of this course as a "Free Online Nano Book".
Read more…(176 words)
reply in this discussion
Taksh Pratap SinghProgrammer: interested in competitive programming and getting started with data science and AI · 29w
I recently started following this list but got to know about this new course: Introduction to Machine Learning offered by Google. This course seems to be quite basic than this list. So how does this list compare to the Google Machine Learning course's difficulty ? Should I begin with this list and then move to the other course or vice versa or should I follow both courses in tandem ?
Thanks in advance.
Read more… (73 words)
NaN.
discussion
HOW SHOULD I PREPARE FOR ZCO AND INOI SO THAT I CAN GO TO IOITC THIS YEAR??
Hi,I am Vivaan Gupta from class 7.How should i prepare for ZCO and INOI so I can go to IOITC this year.More generally how can I improve in competitive programming and also crack ZCO and INOI.
Thanks in advance
Read more…(43 words)
reply in this discussion
Taksh Pratap SinghProgrammer: interested in competitive programming and getting started with data science and AI · 29w
Learn a programming language and follow this playlist thoroughly :International Olympiad in Informatics: Path to Gold. Also take part in codeforces, hackerrank, codechef etc. contests. Remember that practice is key.
Read more… (31 words)
NaN.
course
Learn Machine Learning
This 29-part course consists of tutorials on ML concepts and algorithms, as well as end-to-end follow-along ML examples, quizzes, and hands-on projects. You can think of this course as a "Free Online Nano Book".
Read more…(176 words)
reply in this discussion
Taksh Pratap SinghProgrammer: interested in competitive programming and getting started with data science and AI · 34w
Thank you for the playlist. It looks most interesting !
I found a lot of online resources for learning machine learning. To what extent does this playlist go ?
Also, is this playlist enough alone or would you recommend using it along with other resources ?
Thanks in advance.
Read more… (49 words)