CommonLounge is a community of learners who learn together. Get started with the featured resources above, ask questions and discuss related stuff with everyone.
NaN.
course
Learn Data Structures and Algorithms
Overview
This 28-part course consists of tutorials on data structures and algorithms. It alternates between tutorials and implementation, and you get to implement every algorithm. You can think of this course as a "Free Online Nano Book".
This course teaches algorithms and data structures f...
Read more…(191 words)
Syllabus
Why algorithms?
This section introduces the concept of algorithms, and defines what it means when we talk about an algorithm's efficiency.
We'll start with the greedy algorithm, and after that we'll learn about recursion.
Binary search is a recursive search algorithm which runs in O(\log n) time. It's an example of a divide-and-conquer algorithm.
Sorting algorithms
Sorting algorithms are a set of algorithms that all solve the same problem (sorting) but using very different strategies. These algorithms will introduce you to techniques such as recursion, divide-and-conquer, heaps, etc.
Unfortunately, not everyone knows how to write an essay, including me, and thanks to this site Best Essay Writers Online, on which absolutely any written work is written, I became not only unique for the teacher, but also an excellent student
Need an online paper writer but can't find someone you can trust? I would like to offer you my candidacy as a writer. I will help you complete all your homework.
This is a very comprehensive 94-part course on competitive programming. It gets you from knowing basic programming to being a yellow-red rated coder on Codeforces / CodeChef / TopCoder / etc.
The primary objectives of this course are to learn about 30 different algorithms and data structures. The algorithm tutori...
There are a bazillion different websites for competitive programming out there. Codeforces, SPOJ, TopCoder, Timus, CodeChef, USACO, and on and on. This discussion is a place to highlight the interesting features of each website and tell us which one you like best.
International Olympiad in Informatics Training: Path to Gold
Overview
This is a 100+ part playbook that takes you from basic C++ programming to a Gold medal at IOI. It has tutorials on 30+ algorithms and data structures, and 75+ problems based on those topics, sorted by increasing difficulty.
Read more…(348 words)
Syllabus
C++ review
2 problems to check if you satisfy C++ pre-requisites.
This playlist covers the required amount of C++ / Java / Python knowledge you need for programming contests such as Olympiad in Informatics, CodeChef, Codeforces, etc.
Expected time to completion: 5-10 sessions.
The programming language topics covered are input-ou...
I have completed every question. I am not able to generate certificate for the course. Do we need to do something else as well to qualify for the certificate.
Hello everyone, wanted to share the Competitive Programmer's Handbook (~300 page PDF). I think reading this book will take you 10x lesser time than Introduction to Algorithms CLRS while teaching you just as much. The book has ~10x lesser words than CLRS and 5x more diagrams (lesser theory and math). Diagrams are very helpful in learning algorithms because it is all about visualization. That is also why this community has a lot of short video tutorials on various algorithms, because visualizing it makes it easy to understand. Enjoy!