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 Aditya Garg and I am 16 years old. I have very little knowledge in Java and Python. But I am very enthusiastic to work hard to try my hand in IOI. Is it too late for me to start with it? And if its not, how should I start with it. I see there are plenty of books and resources available everywhere. But where should an absolute beginner like me start from? Which concepts should I pick up first? And how should my path be like? I am willing to devote all my energy to this challenge. Any help would be grateful. Thanks you so much for your valuable time.
Given a sorted array x of integers in increasing order of size n, the task is to find two integers x[i] and x[j], such that a point (x[i], x[j]) lies inside a rectangle whose four vertices are mentioned.
Can anyone please share a O(n) algorithm for this? The code is not necessary.
I would grateful.
PS: I tried a lot, but didn't come up with anything linear. Also, I didn't know how to phrase it for Google search.