Q&A Session with Sumeet Varma, Codeforces India #1by Keshav Dhandhania
Hey there! I’m Sumeet Varma. I am extremely interested in Algorithms and Data Structures and so I do a lot of competitive programming. I am also a big fan of Counter-Strike, Politics and reading random answers on Quora.
My team (FruitSalad) came 1st in ACM ICPC ‘17 Kharagpur Regionals, 2nd in Kolkata Regionals and 7th in India Finals and we have qualified for World Finals. Also, I have been Red on Codeforces and the highest rated Indian programmer on Codeforces, Hackerrank and Topcoder in the past.
Currently, I am doing an internship at Directi (Bangalore) as a part of my project for final semester at DA-IICT, Gandhinagar.
Ask me anything!
Moderator note: We are very excited to host Sumeet for a Q&A session! He has a max rating of 2515 on Codeforces and 2173 on TopCoder, and you can see the graph going up consistently over the last 2.5 years. It's time to find out more about the person behind ...
I am in class 12 now and this year i will be appearing for KVPY as well as IOI .As the date for the KVPY has been released (4th November) and for ZCO the date has not been declared yet.So,what to do if the dates get clashed (because the registration of ZCO will start in the month of September and the last date of registration for KVPY is in August)Is there any way to postpone the dates of ZCO and ZIO or does anyone have any idea of the dates of ZCO and ZIO so that I can appear for both of the examinations.
Now I get it, I was misinterpreting question all this time. Actually after finish of each round, lead is not the difference between points of that round. But the lead is difference between the points achieved through all rounds including current round - Lakpa Tashi Bhutia
Read more…(49 words)
Why do we need (efficient) algorithms?by Wiki
Computers can only do a limited number of operations in a given time, usually about a billion operations per second. Here, by an individual operation, we mean addition, multiplication, assigning a value to a variable, etc. Hence, if we want our algorithm to finish executing in a second or so, then we need to make sure that the total number of operations we are asking it to do is less than 1 billion.
Estimating the exact run-time of an algorithm without implementing and executing it is very tough since it depends on so many factors - including the programming language being used, the compiler, the hardware of the computer itself, and more. Instead, what we'd like to do most of the time, is to estimate the run-time approximately.
Rate of growth
In algorithms, we focus on estimating the execution ...