Skip to content

A collection of problems in competitive programming solved via a variety of techniques and algorithms.

Notifications You must be signed in to change notification settings

jvpcms/Competitive_Programming

Repository files navigation

Competitive_Programming

A collection of problems in competitive programming solved via a variety of techniques and algorithms.

The following concepts are used in this collection:

  • Dynamic programming;
  • The knapsack algorithm
  • Graph theory;
  • Dijkstra's algorithm;
  • Topological sorting;
  • Depth-first search and Breadth First Search;
  • Data Structures.

About

A collection of problems in competitive programming solved via a variety of techniques and algorithms.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages