Skip to content

Latest commit

 

History

History
12 lines (10 loc) · 361 Bytes

README.md

File metadata and controls

12 lines (10 loc) · 361 Bytes

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.