Dataset Viewer
Auto-converted to Parquet
question_id
stringclasses
2 values
question
stringclasses
2 values
starter_code
stringclasses
2 values
inputs
stringclasses
2 values
outputs
stringclasses
2 values
is_synthesized
stringclasses
2 values
test_case_type
stringclasses
2 values
func_name
stringclasses
2 values
class_name
stringclasses
2 values
seed_15504
"John gave Jack a very hard problem. He wrote a very big positive integer A0 on a piece of paper. Th(...TRUNCATED)
"[\"139427\\n999999999999999999999999999999999999999999999999999999999999999999999999999999999999999(...TRUNCATED)
"[\"9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+9+(...TRUNCATED)
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
seed_10667
"Given a number s(in string form). Find the Smallest number (Not leading Zeros) which can be obtaine(...TRUNCATED)
"#User function Template for python3\n\n\n\nclass Solution:\n\n\tdef minimum_Number(self, s):\n\n\t\(...TRUNCATED)
"[\"assert Solution().minimum_Number(\\\"846903\\\") == \\\"304689\\\"\\n\", \"assert Solution().min(...TRUNCATED)
"[\"\", \"\", \"5\", \"56\", \"149\", \"4567\", \"11899\", \"235789\", \"2033678\", \"33444589\", \"(...TRUNCATED)
"[0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,(...TRUNCATED)
"[2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,(...TRUNCATED)
minimum_Number
Solution
README.md exists but content is empty.
Downloads last month
23