jeggers/codingame

---
license: cc-by-sa-3.0
---

This dataset is scraped from [codingame](https://www.codingame.com/home). Please check them out.

It contains coding problems with description, example input and output as well as about 5 test cases and 5 validator test cases per problem.
Because of the nature of the test cases defining only input and output, this is completly language agnostic and automatically verifiable.

This dataset is under Creative Commons Attribution Share Alike 3.0 license.

The dataset contains different types of puzzles:
| Game Type | Number of puzzles |
|-----------------------------|-------------------|
| Clash of Code | 2657 |
| Classic Puzzle | 680 |
| Multiplayer Game (only url) | 49 |
| Solo Game (only url) | 25 |
| Optimization Game (only url)| 11 |

For the last three categories: Multiplayer Game, Solo Game and Optimization Game, there is only the URL available.

Note that only Clash of Code has gamemodes and only Classic Puzzle has difficulty attribute.
There are three different possible gamemodes: Fastest, Shortest, Reverse. In the original multi player clash of code they work as follows:
In the fastest mode, the player who submits a working solution first wins. In Reverse mode, the goal is also to be the fastest, but instead of the problem statement,
you get the the validator inputs and outputs. You tasks is to understand the pattern and write the code that also works for the test cases. In Shortest mode, the goal is
to submit working code with fewest character count in any programming language. Whoever submits the shortest working code wins.
In all three gamemodes the own code can be tested on the validator cases before submitting. The input and output of the validator cases are also accessable.
When you submit, the score is calculated with the actual test cases.

Here is a list of the difficulties for the Classic Puzzles:

| Difficulty | Number of Challenges |
|------------|----------------------|
| Medium | 257 |
| Easy | 231 |
| Hard | 92 |
| Very Hard | 19 |
| Undefined | 81 |

For some Puzzles the fields example_in, example_out or constraints are missing, but the problems should be solvable without.

原始信息汇总

数据集概述

数据来源

• 数据集从codingame网站抓取。

数据内容

• 包含编程问题的描述、示例输入和输出，以及每个问题约5个测试用例和5个验证测试用例。
• 数据集完全与语言无关，且自动可验证。

数据集类型及数量

游戏类型	谜题数量
Clash of Code	2657
Classic Puzzle	680
Multiplayer Game (仅URL)	49
Solo Game (仅URL)	25
Optimization Game (仅URL)	11

特殊类别说明

• Multiplayer Game、Solo Game 和 Optimization Game 仅提供URL。
• Clash of Code 包含游戏模式，Classic Puzzle 包含难度属性。

游戏模式

• Clash of Code 有三种游戏模式：
  • Fastest：最先提交有效解决方案的玩家获胜。
  • Reverse：目标也是最快，但玩家获得验证输入和输出，需要理解模式并编写适用于测试用例的代码。
  • Shortest：提交字符数最少的有效代码获胜。

难度分布

难度	挑战数量
Medium	257
Easy	231
Hard	92
Very Hard	19
Undefined	81

数据缺失

• 部分谜题可能缺少 example_in、example_out 或 constraints 字段，但问题应仍可解决。