competitioncode

CompetitionCode Datasets

This folder contains datasets and resources related to algorithmic programming competitions code, hosted on Hugging Face at @competitioncode.

Available Datasets

Seed Datasets (Smaller versions for experimentation)

• meet_in_the_middle_seed (80 examples) - Meet in the middle algorithm problems
• mo_algorithm_seed (80 examples) - Mo's algorithm problems
• segment_tree_dc_seed (60 examples) - Segment tree divide and conquer problems
• cdq_dc_seed (60 examples) - CDQ divide and conquer problems
• sqrt_dc_seed (100 examples) - Square root decomposition problems

Full Datasets (Larger training sets)

• meet_in_the_middle (400 examples) - Comprehensive meet in the middle problems
• mo_algorithm (400 examples) - Mo's algorithm problem set
• segment_tree_dc (300 examples) - Segment tree divide and conquer challenges
• cdq_dc (300 examples) - CDQ divide and conquer algorithm problems
• sqrt_dc (500 examples) - Square root decomposition techniques

Algorithmic Techniques Covered

• Meet in the Middle: Optimization technique for brute force algorithms
• Mo's Algorithm: For offline range queries on arrays
• Segment Tree Divide and Conquer: Advanced data structure problems
• CDQ Divide and Conquer: Multi-dimensional divide and conquer
• Square Root Decomposition: Block-based optimization technique

Contributor

• Yuhan Cao