Scribd Logo
Upload

Welcome to Scribd!

  • 126 views

    Strategy

    Uploaded by

    smritiRawat95
    Anudeep Nekkanti became 35th in the global ranking for competitive programming within 6-7 months by solving around 300 problems on SPOJ in order of difficulty. This helped him learn common algorithms and data structures. He spent 1-4 hours per problem to first get an accepted solution before moving on. CodeChef contests also helped improve through practice over time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Strategy

    Uploaded by

    smritiRawat95
    126 views2 pages
    Anudeep Nekkanti became 35th in the global ranking for competitive programming within 6-7 months by solving around 300 problems on SPOJ in order of difficulty. This helped him learn common algorithms and data structures. He spent 1-4 hours per problem to first get an accepted solution before moving on. CodeChef contests also helped improve through practice over time.

    Original Description:

    Competitive Programming

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Anudeep Nekkanti became 35th in the global ranking for competitive programming within 6-7 months by solving around 300 problems on SPOJ in order of difficulty. This helped him learn common algorithms and data structures. He spent 1-4 hours per problem to first get an accepted solution before moving on. CodeChef contests also helped improve through practice over time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    126 views2 pages

    Strategy

    Uploaded by

    smritiRawat95
    Anudeep Nekkanti became 35th in the global ranking for competitive programming within 6-7 months by solving around 300 problems on SPOJ in order of difficulty. This helped him learn common algorithms and data structures. He spent 1-4 hours per problem to first get an accepted solution before moving on. CodeChef contests also helped improve through practice over time.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    32,184

    ANSWERSTATS
    Views
    Latest activity 2 Sep
    SHAREANSWER
    What was Anudeep Nekkant i ' s Compet i t i ve
    Pr ogr ammi ng st r at egy t o become 35t h i n Gl obal
    r anki ng, i n j ust 6- 7 mont hs?
    He said in this How did Anudeep Nekkanti become so good at competitive
    programming? , he got to know about online judge in Jan and by August, he was
    35th in Global ranking. I want to know what was his preparation strategy?
    ANUDEEP'S ANSWER
    ANSWERAUTHOR
    MOREFROM ANUDEEP
    How come Anudeep Nekkanti ( a
    great competitive programmer from
    india) is at ANITS (an unknown
    college)?
    I do not think this answer will help any
    one. So I will keep it simple. 1) I did
    not know about IIT-JEE or AIEEE. I
    ...(more)
    How did Anudeep Nekkanti become
    so good at competitive
    programming?
    I came to know about online judge for
    the first time in 2012 Jan. That was
    because of IOPC (programming
    contest by II...(more)
    I'm yellow on Topcoder (the best in
    my college). I am a 3rd year ECE
    B.tech student with arrears, and I
    have CGPA of 4.0 . I have immense
    hatred towards my ECE branch. I'm
    afraid I might not get placed because
    of my low CGPA. What should I do?
    Hari Shankaran and Abhinav Vutukuri
    mentioned everything needed. Let me
    just add 2 lines (kind of proof)...(more)
    Specific Quora Users: This topic is for content about specific Quora users. Questions, answers and reviews with this topic are only shown in feed to
    people who follow the topic. This topic should not be applied to content about Quora users who are well known outside of Quora.
    For reviews about people, please see: What is Quora's Policy on Protecting Individuals?

    507 Follow Question
    What I did ?
    Solved about 300 problems on SPOJ in this order - Sphere Online Judge
    (SPOJ)
    Result ?
    Became very good with C++ and STL
    Got introduced to most Competitive programming KEYWORDS (like DP,
    maxflow, sets, hashing, etc)
    Learned Standard Problems and Algorithms
    Indenting code
    Fast typing :P
    How ?
    Before starting programming, I searched about how and where to start, many
    said "Learn an Algorithm, implement it, solve problems related to it". I did not
    do it that way, If you know what algorithm to use you generally think in that
    direction and leave about correctness. I did them problem by problem, easy to
    hard, I spent 1 - 4 hours on a problem.
    I get the idea, I code it, Get it Accepted. (I used to test a lot, I always wanted to
    get AC on first go)
    I do not get the idea, I save that problem and try it after a month again. If I
    still do not get them, then search for hints. If it clearly needed some algorithm
    which I never used then I first smile (? I could not only because I did not knew
    the algorithm :P ) and then start reading about that algorithm. TopCoder had
    tutorials of almost all common algorithms. This is where I did a BIG
    MISTAKE. I never cared about correctness or run-time analysis proof, I
    always learned how to solve the problem using that algorithm, I hardly
    learned about how the algorithm works. I feel bad about it now, but that is
    how I solved those problems then. I solved max-flow, convex hull, etc.,
    problems using described algorithms but I did not UNDERSTAND those
    algorithms then.
    Mistake: Once I started taking part in contests, I completely stopped practice.
    35th in Global Ranking
    CodeChef long contests are comparatively easy ( Which is good, You can
    learn a lot), you get a lot of time to think about a problem, search for
    resources. You only need KEYWORDS to search for similar problems.
    I gave a lot of time for each contest. I used to solve 4 easy problems in 2-3
    days, then take 5-6 days for other 3 problems.
    CodeChef rating system is not good. It is highly Volatile.
    If I am to start programming now, I would do it this way
    Anudeep Nekkanti, ";" key hates me the most..
    1.8k upvotes by Jayaprakash Sundararaj, Arijit Das, Saurabh Modi, (more)
    Anudeep Nekkanti
    ";" key hates me the most..
    5.2k Follow
    Quora is the best answer to any question.
    Sign up in seconds.
    Remember Me
    Password
    Forgot Password?
    Login
    Science Education Politics Life Food Startups History Literature Business Art
    converted by Web2PDFConvert.com
    About Careers Privacy Terms Sitemap
    Downvote Comments 12+
    Updated 23 Dec, 2013. Asked to answer by Anonymous, Aamir Khan, Pradeep George
    Mathias, and Arvind Kalyan.
    1. Solve 200 most solved problems on SPOJ, Problem by problem. In 2
    months.
    (This will teach all standard problems, algorithms and implementation
    skills)
    2. Solve problems from CodeChef and CodeForces for 2 months.
    (This will teach variations, we can read others solutions and learn better
    ways. Skip easy problems)
    3. Solve problems from TopCoder for 2 months.
    (This will teach Dynamic Programming. Div 1 500p)
    4. Check past ACM ICPC Regional's Problems
    (Great quality problems)
    If I am to learn a new Algorithm now, I would do it this way
    1. Read it from at least 3-4 different sources.
    2. Understand correctness proof and run-time analysis.
    (This is very very important, you will know it only when you deal with
    non standard and hard problems)
    3. Question yourself on every step for correctness. Try to tweak the
    implementation.
    4. Check other implementations.
    Final Note
    Thought I became good in solving problems and had good rank. I later(Feb 13)
    realized that I learned it the wrong way. I then started learning again. I
    learned all the algorithms again this time gave importance to the algorithm
    itself, correctness proof and mathematical analysis. It is worth the time.
    Lucy and the Flowers - Problem from December long contest, Try to solve it
    with suffix arrays. You can only if you understand suffix arrays and LCP
    completely.
    I was able to solve a not-so-obvious medium level Max-Flow problem at ACM
    KGP Onsite only because I completely understood how the algorithm works. It
    was at 4 hour 25 minutes I got 5th problem accepted, then I read this problem
    and got it accepted 4 minutes before end. Learning the algorithm helped. Dot.


    1.8k Upvote
    Top Stories
    What are some of the best rare
    natural phenomena that occur
    on Earth?
    Quora User
    6.4k upvotes by PranavSharma, Karthick
    Mani, Lokesh Bhaskar, (more)
    How did you become a good
    writer?
    Happy to answer this but be aware, my writing
    abilities are quite limited. I am an essayist, an
    article writer of short, pithy, vignettes. Thats it. I
    cannot write novels (like Quorans Graeme
    Shimmin, Cristina Hartmann, Aman Anand, Clifford
    Meyer) or extremely persuasive pieces (Jon Mixon,
    Gary Teal, Marcus Geduld), nor can I distill
    massively complex issues to a single truth (Erica
    Friedm...
    Ellen Vrana, I see you
    444 upvotes by Marcia Peterson Buckie, Lee
    Garibaldi, Anonymous, (more)
    What happens to heroin addicts
    when they quit cold turkey, and
    why is it so unbearable?
    The last time I quit heroin , I went cold turkey on a
    friends couch. It wasn't really planned but it
    happened something like this. I was living with
    some junkie in her parents house. Her parents were
    both coke heads and they knew I was doing heroin
    but they had a 'no needles' policy so when they
    found out we were shooting up, they "politely asked
    me to leave." I was left with very little money...
    Lee Garibaldi, bigger on the inside,
    behold t... (more)
    515 upvotes by Quora User, Quora User, Amey
    Apte, (more)
    Read More Read More Read More
    converted by Web2PDFConvert.com

    You might also like