All the important data structures and algorithms that I use in Competitive Prgramming
-
Updated
Oct 13, 2024 - Java
All the important data structures and algorithms that I use in Competitive Prgramming
🚀 A blazing-fast, ultra-lightweight (~18 MB) C/C++ IDE built with Tauri, React, and Monaco Editor. Engineered for competitive programmers with built-in expected-vs-actual test case runners, solve trackers, radial quick-menus, and an extensive library of pre-loaded algorithm snippets.
Proof of the terrible consequences of amateur library design prevalent in the Rust community.
Fast buffered I/O for Java competitive programming (USACO, Codeforces). Single-class, paste-ready for one-file submissions.
This repository offers a complete template for competitive programming with pre-written functions and utilities for coding contests. It helps you save time and focus on solving problems. Feel free to explore, use, and customize these templates. If you find it useful, don’t forget to give it a star!
This was the project assignment for the Algorithms & Data Structures course.
A curated collection of reusable Java utilities, data structures, and algorithms for competitive programming — includes fast I/O, graph algorithms, number theory, segment trees, and more for Codeforces, LeetCode, and ICPC.
Plantilla del club Γα=Ω5 para su uso en la programación competitiva en C++
To associate your repository with the fast-io topic, visit your repo's landing page and select "manage topics."