CommonLounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.
Q&A Session with Sumeet Varma
Codeforces India #1
This Q&A Session has now ended but
Sumeet may still answer new questions
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 ...
How to find total numbers having frequency=kin a particular range(l,r) in a given array. There are total 10^5 queries of formatl,rand each query is built on the basis of previous query's answer. In particular, after each query we incrementlby the result of the query, swappinglandrifl>r. Note that0<=a[i]<=10^9. Total elements in array isn=10^5.
Hello everyone! I am Md Mahbubul Hasan from Bangladesh. I entered competitive programming world probably back in 2003 when I was in class 10. Unfortunately tutorials, editorials etc was not much available back then. Even there was not much of online competitions, except some regular monthly or bi-weekly contest at UVa, specially during the end of a year. It was difficult to access TopCoder from our country, even in 2005, because of slow internet and load shedding issues. We went to ACM ICPC World Finals in 2008 and 2009. Since then I am no longer devoted in programming contest as full time. But somehow I managed to float around in the same level through out the time. It was wonderful to compete with/against multi generation of contestants from our country. Nowadays I mostly take part in annual competitions where there is tshirt as prize. Even if it is not by performance, my luck does not disappoint me winning them in lottery!
Personally I have very low capacity hard disk (can't recognize people, can't recall names, even if you give me some problem which I solved a few days ago there is high probability that I would...
My name is Amr Mahmoud. I'm currently studying Computer and Systems Engineering at Alexandria University. I was on the team that got the first place in Egypt National CPC, also the first place in Arab Regional CPC, and qualified to last year's ICPC in Phuket. I had an internship in Microsoft R&D lab. I'm currently doing an internship in Amazon web services.
I am a average competitive coder nearly 1200 world rank on Hackerank. I am in final year of my bachelor's in computer science. I am devoting now nearly 3to 4 hours in learning advance DS and algo's,and then Nealy 5 hours in Competive coding practices .
As I am in final sem it is must for me to do interns...
There are N star systems in the space, connected by M wormholes. Each wormhole can teleport you from a system A to system B (you cannot teleport in the opposite direction).
Each wormhole has a fixed time shift T (negative or positive). If it's positive it will take you from system A to system B and you will land T years after. If T is negative, it will take you from A to B and land T years before (in the past).
You are asked to determine the star systems such that for each of them, you can start a journey there and keep traveling in the past (via wormholes) infinitely, so you can watch the Big Bang :)