CommonLounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.
Segment Treesby Wiki
Motivation: Given an array of N numbers, you need to support two operations. Operation 1: find-min(i, j) = return the minimum value in array[i ... j]. Operation 2: update(i, v) = update the value at array[i] to v. Solve the problem for N <= 10^6, number of operations <= 10^6.
To solve the above problem, both the operations need to run in O(log N) time, but using an naive array gives O(N) run-time for operation 1 (and O(1) run-time for operation 2). So how do you solve the problem? Read on. :)
Video tutorial: This is a superb tutorial, giving the motivation, walking through example, and going step-by-step through the pseudocode.
Read more…(295 words)
[LEADGAME] Lead Gameby Keshav Dhandhania
Problem statement clarification:
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)
Summer Programming Workshop 2018by Onkar Koli
HI friends!!.. Codechef is arranging the coding workshop for beginners and also for those who make grasp on DSA..if anyone planning to join please reply!!! I mentioned link below:-!O:-)👇
Read more…(29 words)
Indian Computing Olympiad Syllabusby Keshav Dhandhania
Note: There is no official syllabus for ZCO vs INOI vs IOITC. Syllabus for ZCO, INOI has been determined by looking at all the concepts covered in all ZCO, INOI problems since last 5 years. All the topics covered by ZCO, INOI are also in the Basic topics section of ICO online study material. Syllabus for IOITC is same as syllabus for IOI, since the training camp is training you for IOI. There is a higher focus on the topics mentioned in the Advanced topics specifically covered in ICO online study material. :)
The below tutorials are the best tutorials on the internet for each topic. If you find better tutorials for a particular topic, please share them with everyone.
How many attempts for ZCO are available ? Is there restriction on number of attempts ?
Read more…(16 words)
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 ...