Les 10 concurrents cp-algorithms.com les plus visités

codeforces.com

codeforces. programming competitions and contests, programming community

geeksforgeeks.org

Your All-in-One Learning Portal: GeeksforGeeks is a comprehensive educational platform that empowers learners across domains-spanning computer science and programming, school education, upskilling, commerce, software tools, competitive exams, and more.

leetcode.com

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

usaco.guide

OS-specific instructions for installing and running C++ via the command line.

hackerearth.com

Transform tech hiring with AI-powered assessments, automated interviews, and access to 10M+ developers. Streamline screening, interviewing, and engagement.

topcoder.com

Thrive is our vault of content that we have been gathering over the years. It is full of tutorials and workshops that matter. Grow with us!

visualgo.net

visualgo was conceptualised in 2011 by dr steven halim as a tool to help his students better understand data structures and algorithms, by allowing them to learn the basics on their own and at their own pace. together with his students from the national university of singapore, a series of visualizations were developed and consolidated, from simple sorting algorithms to complex graph data structures. though specifically designed for the use of nus students taking various data structure and algorithm classes (cs1010/equivalent, cs2040/equivalent, cs3230, cs3233, and cs4234), as advocators of online learning, we hope that curious minds around the world will find these visualizations useful as well.

stanford-cs161.github.io

A listing of all the course sections.

brilliant.org

Support vector machines are a supervised learning method used to perform binary classification on data. They are motivated by the principle of optimal separation, the idea that a good classifier finds the largest gap possible between data points of different classes. For example, an algorithm learning to separate the United States from Europe on a map could correctly learn a boundary 100 miles off the eastern shore of the United States, but a much …

mathworld.wolfram.com

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i from x and distance j from y depends only on i, j, and the graph distance between x and y, independently of the choice of x and y. In particular, a distance-regular graph is a graph for which there exist integers b_i,c_i,i=0,...,d such that for any two vertices x,y in G and distance i=d(x,y), there are exactly c_i...