submissionId stringlengths 25 25 | title stringlengths 17 17 | payload dict |
|---|---|---|
cmsv9c94n01jyg4p2ax0z6e3q | Submission 0Z6E3Q | {
"code": "import enum\n\n\nclass Status(enum.Enum):\n OK = 1\n FINE = 1\n BAD = 2\n\n @classmethod\n def _missing_(cls, value):\n if value == \"ok\":\n return cls.OK\n return None\n\n\ndef probe():\n out = [m.name for m in Status]\n out.append(Status.FINE is Status.OK)\n... |
cmsv9c94n01jzg4p2s9n2695w | Submission N2695W | {
"code": "import functools\n\n\n@functools.total_ordering\nclass Ver:\n def __init__(self, n):\n self.n = n\n\n def __eq__(self, other):\n if not isinstance(other, Ver):\n return NotImplemented\n return self.n == other.n\n\n def __lt__(self, other):\n if not isinstance... |
cmsv9c94n01k0g4p22tupv5jw | Submission UPV5JW | {
"code": "def describe(a, b, /, c, *, d=4, **rest):\n return (a, b, c, d, rest)\n\n\ndef probe():\n out = []\n out.append(describe(1, 2, 3))\n out.append(describe(1, 2, c=3, d=9, a=99, b=100))\n try:\n describe(1, 2, 3, 4)\n except TypeError as exc:\n out.append(type(exc).__name__)\n ... |
cmsv9c94n01k1g4p2g1l7ctg6 | Submission L7CTG6 | {
"code": "from dataclasses import dataclass, field, asdict, replace\n\n\n@dataclass\nclass Cart:\n owner: str\n items: list = field(default_factory=list)\n tag: str = field(default=\"x\", repr=False)\n\n def add(self, thing):\n self.items.append(thing)\n return self\n\n\ndef probe():\n a... |
cmsv9c94n01k2g4p2wpxhj7t2 | Submission XHJ7T2 | {
"code": "def trace(mode):\n log = []\n\n def run():\n try:\n log.append(\"try\")\n if mode == \"raise\":\n raise ValueError(\"x\")\n if mode == \"return\":\n return \"from-try\"\n except ValueError:\n log.append(\"except\"... |
cmsv9c94n01k3g4p24r66tu8f | Submission 66TU8F | {
"code": "def find_first(items, target):\n log = []\n for i, x in enumerate(items):\n log.append(x)\n if x == target:\n break\n else:\n log.append(\"no-break\")\n return (-1, log)\n return (i, log)\n\n\ndef probe():\n return (\n find_first([3, 5, 7], 5),\n... |
cmsv9c94n01k4g4p24ol79632 | Submission L79632 | {
"code": "import contextlib\n\n\ndef probe():\n log = []\n with contextlib.suppress(KeyError, IndexError):\n log.append(\"start\")\n data = {}\n log.append(data[\"missing\"])\n log.append(\"unreachable\")\n log.append(\"after\")\n try:\n with contextlib.suppress(KeyErro... |
cmsv9c94n01k5g4p213kufy4d | Submission KUFY4D | {
"code": "def make_source(values):\n it = iter(values)\n\n def pull():\n return next(it, None)\n\n return pull\n\n\ndef probe():\n src = make_source([1, 2, 0, 3, 4])\n got = list(iter(src, 0))\n rest = [src(), src(), src()]\n counter = {\"n\": 0}\n\n def tick():\n counter[\"n\"]... |
cmsvchb1101nsg4p2zvklbmo3 | Submission KLBMO3 | {
"code": "def counter():\n log = []\n def gen():\n for i in range(5):\n log.append(i)\n yield i * i\n squares = gen()\n first_two = [next(squares), next(squares)]\n return first_two, log",
"input": "counter()",
"language": "Python",
"predicted_output": "([0, 1], [0, ... |
cmsvchb1101ntg4p272q2apwm | Submission Q2APWM | {
"code": "def probe(store):\n a = store.get('x', 0)\n b = store.setdefault('y', 0)\n c = store.setdefault('y', 99)\n return a, b, c, sorted(store)",
"input": "probe({'z': 1})",
"language": "Python",
"predicted_output": "(0, 0, 0, ['y', 'z'])"
} |
cmsvchb1101nug4p285cv2zf1 | Submission CV2ZF1 | {
"code": "def reshape(values):\n out = list(values)\n out[1:3] = ['a']\n out[0:0] = ['start']\n return out, len(out)",
"input": "reshape([10, 20, 30, 40])",
"language": "Python",
"predicted_output": "(['start', 10, 'a', 40], 4)"
} |
cmsvchb1101nvg4p2u5ltajpz | Submission LTAJPZ | {
"code": "def classify(value):\n try:\n return 10 / value\n except ZeroDivisionError:\n return 'zero'\n except TypeError:\n return 'type'\n\ndef run():\n return [classify(v) for v in (5, 0, 'x')]",
"input": "run()",
"language": "Python",
"predicted_output": "[2.0, 'zero', 'type... |
cmsvchb1101nwg4p22s57bx7k | Submission 57BX7K | {
"code": "def leaderboard(rows):\n return sorted(rows, key=lambda r: (r['pts'], -len(r['name'])), reverse=True)",
"input": "leaderboard([{'name': 'ann', 'pts': 3}, {'name': 'bo', 'pts': 3}, {'name': 'cyd', 'pts': 5}])",
"language": "Python",
"predicted_output": "[{'name': 'cyd', 'pts': 5}, {'name': 'bo', 'p... |
cmsvg8rg101ocg4p2k6vrje5s | Submission VRJE5S | {
"code": "def bucket_scores(scores):\n buckets = {\"low\": [], \"mid\": [], \"high\": []}\n for s in scores:\n if not isinstance(s, (int, float)):\n continue\n if s < 50:\n buckets[\"low\"].append(s)\n elif s < 80:\n buckets[\"mid\"].append(s)\n else... |
cmsvg8rg101odg4p2tggwl9ih | Submission GWL9IH | {
"code": "class Inventory:\n def __init__(self):\n self.stock = {}\n def add(self, name, qty):\n self.stock[name] = self.stock.get(name, 0) + qty\n def remove(self, name, qty):\n if name not in self.stock or self.stock[name] < qty:\n raise ValueError(f\"insufficient stock for... |
cmsvg8rg101oeg4p2wxkp0g6b | Submission KP0G6B | {
"code": "def running_median(nums):\n import bisect\n sorted_so_far = []\n medians = []\n for n in nums:\n bisect.insort(sorted_so_far, n)\n length = len(sorted_so_far)\n mid = length // 2\n if length % 2 == 1:\n medians.append(sorted_so_far[mid])\n else:\n ... |
cmsvg8rg101ofg4p2czsiq8tl | Submission SIQ8TL | {
"code": "def parse_key_values(pairs):\n result = {}\n for pair in pairs:\n try:\n key, value = pair.split(\"=\", 1)\n except ValueError:\n continue\n key = key.strip()\n value = value.strip()\n if value.isdigit():\n result[key] = int(value)\n... |
cmsvg8rg101ogg4p2ywgce6y2 | Submission GCE6Y2 | {
"code": "def dedupe_preserve_order(items):\n seen = set()\n result = []\n for item in items:\n key = item.lower() if isinstance(item, str) else item\n if key in seen:\n continue\n seen.add(key)\n result.append(item)\n return result\n\ndef zip_with_index(items, star... |
cmsvgvd6401r9g4p2ha3kk07q | Submission 3KK07Q | {
"code": "def flatten(lst):\n result = []\n for item in lst:\n if isinstance(item, list):\n result.extend(flatten(item))\n else:\n result.append(item)\n return result",
"input": "flatten([1, [2, 3, [4, 5]], 6, [7, [8, [9]]]])",
"language": "Python",
"predicted_outpu... |
cmsvgvd6401rag4p26o3rhyqv | Submission 3RHYQV | {
"code": "def gcd_steps(a, b):\n steps = 0\n while b:\n a, b = b, a % b\n steps += 1\n return (a, steps)",
"input": "gcd_steps(252, 105)",
"language": "Python",
"predicted_output": "(21, 3)"
} |
cmsvgwu2901rbg4p25vf687de | Submission F687DE | {
"code": "import itertools\n\ndef take_n_squares(n):\n def gen():\n i = 1\n while True:\n yield i * i\n i += 1\n return list(itertools.islice(gen(), n))",
"input": "take_n_squares(6)",
"language": "Python",
"predicted_output": "[1, 4, 9, 16, 25, 36]"
} |
cmsvgxdx301rcg4p2bbdyquxq | Submission DYQUXQ | {
"code": "import re\n\ndef tokenize(text):\n return [t for t in re.split(r\"[,;\\s]+\", text.strip()) if t]",
"input": "tokenize(\"apple, banana, cherry ,date\")",
"language": "Python",
"predicted_output": "['apple', 'banana', 'cherry', 'date']"
} |
cmsvgyl4f01rdg4p2rw9fgj3y | Submission 9FGJ3Y | {
"code": "from collections import Counter\n\ndef top_words(text, k):\n words = text.lower().split()\n return Counter(words).most_common(k)",
"input": "top_words(\"the cat sat on the mat the cat ran\", 2)",
"language": "Python",
"predicted_output": "[('the', 3), ('cat', 2)]"
} |
cmsvgyl4f01reg4p2a49hwugz | Submission 9HWUGZ | {
"code": "def flatten_dict(d, parent_key=\"\"):\n items = {}\n for k, v in d.items():\n new_key = f\"{parent_key}.{k}\" if parent_key else k\n if isinstance(v, dict):\n items.update(flatten_dict(v, new_key))\n else:\n items[new_key] = v\n return items",
"input": ... |
cmsvgz4ah01rfg4p2ylkbpjg2 | Submission KBPJG2 | {
"code": "class ValidationError(Exception):\n pass\n\ndef validate_all(records):\n errors = []\n for i, r in enumerate(records):\n if \"age\" not in r:\n errors.append(f\"record {i}: missing age\")\n elif r[\"age\"] < 0:\n errors.append(f\"record {i}: negative age\")\n ... |
cmsvh09gc01rgg4p2crm31q55 | Submission M31Q55 | {
"code": "def merge_sorted(a, b):\n result = []\n i = j = 0\n while i < len(a) and j < len(b):\n if a[i] <= b[j]:\n result.append(a[i])\n i += 1\n else:\n result.append(b[j])\n j += 1\n result.extend(a[i:])\n result.extend(b[j:])\n return re... |
cmsvh09gc01rhg4p2hdmhquum | Submission MHQUUM | {
"code": "def is_balanced(s):\n pairs = {\")\": \"(\", \"]\": \"[\", \"}\": \"{\"}\n stack = []\n for ch in s:\n if ch in \"([{\":\n stack.append(ch)\n elif ch in \")]}\":\n if not stack or stack.pop() != pairs[ch]:\n return False\n return not stack",
... |
cmsvh09gc01rig4p21uvm3dup | Submission VM3DUP | {
"code": "def caesar(text, shift):\n result = []\n for ch in text:\n if ch.isalpha():\n base = ord(\"A\") if ch.isupper() else ord(\"a\")\n result.append(chr((ord(ch) - base + shift) % 26 + base))\n else:\n result.append(ch)\n return \"\".join(result)",
"inpu... |
cmsvh1ew801rjg4p25twjdmy0 | Submission WJDMY0 | {
"code": "def compute_facts(ns):\n cache = {}\n def fact(n):\n if n in cache:\n return cache[n]\n if n <= 1:\n result = 1\n else:\n result = n * fact(n - 1)\n cache[n] = result\n return result\n return [fact(x) for x in ns]",
"input": "co... |
cmsvh1ew801rkg4p2ah41bavi | Submission 41BAVI | {
"code": "def caesar_encrypt(text, shift):\n result = []\n for ch in text:\n if ch.isalpha():\n base = ord('A') if ch.isupper() else ord('a')\n result.append(chr((ord(ch) - base + shift) % 26 + base))\n else:\n result.append(ch)\n return \"\".join(result)",
"... |
cmsvh1ew801rlg4p2b5ielaub | Submission IELAUB | {
"code": "def rotate_left(lst, k):\n if not lst:\n return lst\n k %= len(lst)\n return lst[k:] + lst[:k]",
"input": "rotate_left([1, 2, 3, 4, 5], 8)",
"language": "Python",
"predicted_output": "[4, 5, 1, 2, 3]"
} |
cmsvh1rgp01rmg4p2tws8r7v8 | Submission S8R7V8 | {
"code": "from collections import OrderedDict\n\nclass LRUCache:\n def __init__(self, capacity):\n self.capacity = capacity\n self.data = OrderedDict()\n def get(self, key):\n if key not in self.data:\n return -1\n self.data.move_to_end(key)\n return self.data[key]... |
cmsvh1rgp01rng4p2korsuouz | Submission RSUOUZ | {
"code": "def int_to_roman(num):\n vals = [(1000, \"M\"), (900, \"CM\"), (500, \"D\"), (400, \"CD\"), (100, \"C\"),\n (90, \"XC\"), (50, \"L\"), (40, \"XL\"), (10, \"X\"), (9, \"IX\"),\n (5, \"V\"), (4, \"IV\"), (1, \"I\")]\n result = \"\"\n for v, sym in vals:\n while num >= v:... |
cmsvh1rgp01rog4p2u6zuzhn5 | Submission ZUZHN5 | {
"code": "def chunk(lst, n):\n return [lst[i:i + n] for i in range(0, len(lst), n)]",
"input": "chunk([1, 2, 3, 4, 5, 6, 7], 3)",
"language": "Python",
"predicted_output": "[[1, 2, 3], [4, 5, 6], [7]]"
} |
cmsvh1rgp01rpg4p2zs5swh2h | Submission 5SWH2H | {
"code": "def modes(values):\n from collections import Counter\n counts = Counter(values)\n max_count = max(counts.values())\n return sorted(v for v, c in counts.items() if c == max_count)",
"input": "modes([1, 2, 2, 3, 3, 4])",
"language": "Python",
"predicted_output": "[2, 3]"
} |
cmsvh1rgp01rqg4p26r0i5nwy | Submission 0I5NWY | {
"code": "def two_sum(nums, target):\n seen = {}\n for i, n in enumerate(nums):\n complement = target - n\n if complement in seen:\n return [seen[complement], i]\n seen[n] = i\n return None",
"input": "two_sum([2, 7, 11, 15, 3], 13)",
"language": "Python",
"predicted_ou... |
cmsvh1rgp01rrg4p2v8usgajo | Submission USGAJO | {
"code": "class Point:\n def __init__(self, x, y):\n self.x = x\n self.y = y\n def __eq__(self, other):\n return isinstance(other, Point) and self.x == other.x and self.y == other.y\n def __hash__(self):\n return hash((self.x, self.y))\n def __repr__(self):\n return f\"... |
cmsvh1rgp01rsg4p28dd4alq4 | Submission D4ALQ4 | {
"code": "def pipeline_sum(nums):\n evens = filter(lambda x: x % 2 == 0, nums)\n doubled = map(lambda x: x * 2, evens)\n return sum(doubled)",
"input": "pipeline_sum([1, 2, 3, 4, 5, 6, 7, 8])",
"language": "Python",
"predicted_output": "40"
} |
cmsvh3vna01rtg4p2dud9lsao | Submission D9LSAO | {
"code": "def fib_sequence(n):\n a, b = 0, 1\n seq = []\n for _ in range(n):\n seq.append(a)\n a, b = b, a + b\n return seq",
"input": "fib_sequence(10)",
"language": "Python",
"predicted_output": "[0, 1, 1, 2, 3, 5, 8, 13, 21, 34]"
} |
cmsvh3vna01rug4p2rchwkc82 | Submission HWKC82 | {
"code": "def primes_up_to(n):\n sieve = [True] * (n + 1)\n sieve[0:2] = [False, False]\n for i in range(2, int(n ** 0.5) + 1):\n if sieve[i]:\n for j in range(i * i, n + 1, i):\n sieve[j] = False\n return [i for i, is_p in enumerate(sieve) if is_p]",
"input": "primes_u... |
cmsvh3vna01rvg4p2h1hf5l6y | Submission HF5L6Y | {
"code": "def gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\ndef gcd_lcm_pair(a, b):\n g = gcd(a, b)\n return (g, a * b // g)",
"input": "gcd_lcm_pair(48, 18)",
"language": "Python",
"predicted_output": "(6, 144)"
} |
cmsvh3vna01rwg4p2r776mh9b | Submission 76MH9B | {
"code": "def word_freq(text):\n words = text.lower().split()\n freq = {}\n for w in words:\n freq[w] = freq.get(w, 0) + 1\n return sorted(freq.items(), key=lambda kv: (-kv[1], kv[0]))",
"input": "word_freq(\"the cat sat on the mat the cat ran\")",
"language": "Python",
"predicted_output": "... |
cmsvh3vna01rxg4p26kbl19jw | Submission BL19JW | {
"code": "def run_length_encode(s):\n if not s:\n return \"\"\n result = []\n prev = s[0]\n count = 1\n for ch in s[1:]:\n if ch == prev:\n count += 1\n else:\n result.append(prev + str(count))\n prev = ch\n count = 1\n result.append(... |
cmsvh3vna01ryg4p2hx4bq6mh | Submission 4BQ6MH | {
"code": "def matmul(a, b):\n rows_a, cols_a = len(a), len(a[0])\n cols_b = len(b[0])\n result = [[0] * cols_b for _ in range(rows_a)]\n for i in range(rows_a):\n for j in range(cols_b):\n total = 0\n for k in range(cols_a):\n total += a[i][k] * b[k][j]\n ... |
cmsvh3vna01rzg4p2u26zgec3 | Submission 6ZGEC3 | {
"code": "def longest_common_prefix(words):\n if not words:\n return \"\"\n prefix = words[0]\n for w in words[1:]:\n while not w.startswith(prefix):\n prefix = prefix[:-1]\n if not prefix:\n return \"\"\n return prefix",
"input": "longest_common_prefi... |
cmsvh3vna01s0g4p2rz19dqbh | Submission 19DQBH | {
"code": "def quicksort(arr):\n if len(arr) <= 1:\n return arr\n pivot = arr[len(arr) // 2]\n left = [x for x in arr if x < pivot]\n mid = [x for x in arr if x == pivot]\n right = [x for x in arr if x > pivot]\n return quicksort(left) + mid + quicksort(right)",
"input": "quicksort([5, 2, 9... |
cmsvh3vna01s1g4p2wsoodnw4 | Submission OODNW4 | {
"code": "def max_subarray_sum(nums):\n best = nums[0]\n current = nums[0]\n for n in nums[1:]:\n current = max(n, current + n)\n best = max(best, current)\n return best",
"input": "max_subarray_sum([-2, 1, -3, 4, -1, 2, 1, -5, 4])",
"language": "Python",
"predicted_output": "6"
} |
cmsvh3vna01s2g4p21vgxpiy2 | Submission GXPIY2 | {
"code": "def roman_to_int(s):\n values = {\"I\": 1, \"V\": 5, \"X\": 10, \"L\": 50, \"C\": 100, \"D\": 500, \"M\": 1000}\n total = 0\n prev = 0\n for ch in reversed(s):\n v = values[ch]\n if v < prev:\n total -= v\n else:\n total += v\n prev = v\n ... |
cmsvh4bxd01s3g4p2aarbja9w | Submission RBJA9W | {
"code": "def eval_rpn(tokens):\n stack = []\n for tok in tokens:\n if tok in (\"+\", \"-\", \"*\", \"/\"):\n b = stack.pop()\n a = stack.pop()\n if tok == \"+\":\n stack.append(a + b)\n elif tok == \"-\":\n stack.append(a - b)\n ... |
cmsvh4bxd01s4g4p2cds6wpky | Submission S6WPKY | {
"code": "class Node:\n def __init__(self, val, nxt=None):\n self.val = val\n self.next = nxt\n\ndef reverse_list(head):\n prev = None\n while head:\n nxt = head.next\n head.next = prev\n prev = head\n head = nxt\n return prev\n\ndef to_list(head):\n out = []\... |
cmsvh4bxd01s5g4p2go3kauzs | Submission 3KAUZS | {
"code": "class TreeNode:\n def __init__(self, val, left=None, right=None):\n self.val = val\n self.left = left\n self.right = right\n\ndef inorder(node):\n if node is None:\n return []\n return inorder(node.left) + [node.val] + inorder(node.right)\n\ndef build_tree():\n retur... |
cmsvh4bxd01s6g4p2f6j83e69 | Submission J83E69 | {
"code": "def permutations(lst):\n if len(lst) <= 1:\n return [lst]\n result = []\n for i in range(len(lst)):\n rest = lst[:i] + lst[i + 1:]\n for p in permutations(rest):\n result.append([lst[i]] + p)\n return result",
"input": "permutations([1, 2, 3])",
"language": "... |
cmsvh4bxd01s7g4p22mhu04dn | Submission HU04DN | {
"code": "def combination_sum(candidates, target):\n result = []\n def backtrack(start, path, remaining):\n if remaining == 0:\n result.append(list(path))\n return\n if remaining < 0:\n return\n for i in range(start, len(candidates)):\n path.appe... |
cmsvh4bxd01s8g4p24grgeyz1 | Submission RGEYZ1 | {
"code": "def knapsack(weights, values, capacity):\n n = len(weights)\n dp = [[0] * (capacity + 1) for _ in range(n + 1)]\n for i in range(1, n + 1):\n for w in range(capacity + 1):\n if weights[i - 1] <= w:\n dp[i][w] = max(dp[i - 1][w], dp[i - 1][w - weights[i - 1]] + valu... |
cmsvh4bxd01s9g4p28p9vc6dn | Submission 9VC6DN | {
"code": "def compress_if_shorter(s):\n if not s:\n return s\n parts = []\n prev = s[0]\n count = 1\n for ch in s[1:]:\n if ch == prev:\n count += 1\n else:\n parts.append(prev + str(count))\n prev = ch\n count = 1\n parts.append(prev... |
cmsvh4bxd01sag4p2vhnssnjd | Submission NSSNJD | {
"code": "def rotate_matrix(matrix):\n return [list(row) for row in zip(*matrix[::-1])]",
"input": "rotate_matrix([[1, 2, 3], [4, 5, 6], [7, 8, 9]])",
"language": "Python",
"predicted_output": "[[7, 4, 1], [8, 5, 2], [9, 6, 3]]"
} |
cmsvh4bxd01sbg4p2ykvr0uv4 | Submission VR0UV4 | {
"code": "def unique_paths(m, n):\n dp = [[1] * n for _ in range(m)]\n for i in range(1, m):\n for j in range(1, n):\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1]\n return dp[m - 1][n - 1]",
"input": "unique_paths(3, 7)",
"language": "Python",
"predicted_output": "28"
} |
cmsvh4bxd01scg4p2knd4r09s | Submission D4R09S | {
"code": "def edit_distance(a, b):\n m, n = len(a), len(b)\n dp = [[0] * (n + 1) for _ in range(m + 1)]\n for i in range(m + 1):\n dp[i][0] = i\n for j in range(n + 1):\n dp[0][j] = j\n for i in range(1, m + 1):\n for j in range(1, n + 1):\n if a[i - 1] == b[j - 1]:\n ... |
cmsvmflok01vmg4p2zoakvz25 | Submission AKVZ25 | {
"code": "def is_prime(n):\n if n < 2:\n return False\n for i in range(2, int(n ** 0.5) + 1):\n if n % i == 0:\n return False\n return True",
"input": "is_prime(97)",
"language": "Python",
"predicted_output": "True"
} |
cmsvmflok01vng4p25skrn71b | Submission KRN71B | {
"code": "def fibonacci(n):\n seq = [0, 1]\n for i in range(2, n):\n seq.append(seq[-1] + seq[-2])\n return seq[:n]",
"input": "fibonacci(10)",
"language": "Python",
"predicted_output": "[0, 1, 1, 2, 3, 5, 8, 13, 21, 34]"
} |
cmsvmflok01vog4p29ui9ckr5 | Submission I9CKR5 | {
"code": "def mat_mult(a, b):\n result = [[0, 0], [0, 0]]\n for i in range(2):\n for j in range(2):\n for k in range(2):\n result[i][j] += a[i][k] * b[k][j]\n return result",
"input": "mat_mult([[1, 2], [3, 4]], [[5, 6], [7, 8]])",
"language": "Python",
"predicted_outp... |
cmsvmflok01vpg4p28lbtyg12 | Submission BTYG12 | {
"code": "def group_anagrams(words):\n groups = {}\n for w in words:\n key = \"\".join(sorted(w))\n groups.setdefault(key, []).append(w)\n return groups",
"input": "group_anagrams(['eat', 'tea', 'tan', 'ate', 'nat', 'bat'])",
"language": "Python",
"predicted_output": "{'aet': ['eat', 'te... |
cmsvmflok01vqg4p2grjwr7te | Submission JWR7TE | {
"code": "def binary_to_decimal(s):\n return int(s, 2)",
"input": "binary_to_decimal('110101')",
"language": "Python",
"predicted_output": "53"
} |
cmsvmflok01vrg4p2j06uf87l | Submission 6UF87L | {
"code": "def decimal_to_binary(n):\n if n == 0:\n return '0'\n digits = []\n while n > 0:\n digits.append(str(n % 2))\n n //= 2\n return ''.join(reversed(digits))",
"input": "decimal_to_binary(53)",
"language": "Python",
"predicted_output": "110101"
} |
cmsvmflok01vsg4p2sxnc0u48 | Submission NC0U48 | {
"code": "def gcd_lcm(a, b):\n x, y = a, b\n while y:\n x, y = y, x % y\n gcd = x\n lcm = a * b // gcd\n return (gcd, lcm)",
"input": "gcd_lcm(12, 18)",
"language": "Python",
"predicted_output": "(6, 36)"
} |
cmsvmflol01vtg4p2wtglqurr | Submission GLQURR | {
"code": "def compute_zigzag_checksum(values, mod=97):\n total = 0\n direction = 1\n for idx, v in enumerate(values):\n total += direction * (v ** 2 + idx)\n if (idx + 1) % 3 == 0:\n direction *= -1\n return total % mod",
"input": "compute_zigzag_checksum([4, 9, 2, 7, 5, 1, 8, ... |
cmsvmflol01vug4p2qcpu73lp | Submission PU73LP | {
"code": "def merge_two_sorted(a, b):\n i = j = 0\n result = []\n while i < len(a) and j < len(b):\n if a[i] <= b[j]:\n result.append(a[i])\n i += 1\n else:\n result.append(b[j])\n j += 1\n result.extend(a[i:])\n result.extend(b[j:])\n retur... |
cmsvmflol01vvg4p29cttz8ab | Submission TTZ8AB | {
"code": "def run_length_decode(s):\n result = []\n i = 0\n while i < len(s):\n ch = s[i]\n i += 1\n num_start = i\n while i < len(s) and s[i].isdigit():\n i += 1\n count = int(s[num_start:i])\n result.append(ch * count)\n return ''.join(result)",
"i... |
cmsvmjjpi01x0g4p2bpkvv869 | Submission KVV869 | {
"code": "def roman_to_int(s):\n vals = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\n total = 0\n for i in range(len(s)):\n v = vals[s[i]]\n if i + 1 < len(s) and v < vals[s[i + 1]]:\n total -= v\n else:\n total += v\n return total",
"inp... |
cmsvmjjpi01x1g4p2xvm4it39 | Submission M4IT39 | {
"code": "def valid_brackets(s):\n pairs = {')': '(', ']': '[', '}': '{'}\n stack = []\n for ch in s:\n if ch in '([{':\n stack.append(ch)\n elif ch in pairs:\n if not stack or stack.pop() != pairs[ch]:\n return False\n return not stack",
"input": "val... |
cmsvmjjpi01x2g4p2ot7poq9u | Submission 7POQ9U | {
"code": "def caesar_decode(text, shift):\n result = []\n for ch in text:\n if ch.isalpha():\n base = ord('A') if ch.isupper() else ord('a')\n result.append(chr((ord(ch) - base - shift) % 26 + base))\n else:\n result.append(ch)\n return ''.join(result)",
"inp... |
cmsvmjjpi01x3g4p2ntoh7pto | Submission OH7PTO | {
"code": "class VisitCounter:\n def __init__(self):\n self.counts = {}\n def visit(self, page):\n self.counts[page] = self.counts.get(page, 0) + 1\n return self.counts[page]\n\ndef run_visits(pages):\n vc = VisitCounter()\n return [vc.visit(p) for p in pages]",
"input": "run_visits... |
cmsvmjjpi01x4g4p2k4q8bewz | Submission Q8BEWZ | {
"code": "def rle(s):\n if not s:\n return \"\"\n out = []\n prev = s[0]\n count = 1\n for ch in s[1:]:\n if ch == prev:\n count += 1\n else:\n out.append(prev + str(count))\n prev = ch\n count = 1\n out.append(prev + str(count))\n ... |
cmsvmjjpi01x5g4p23d3qdkp1 | Submission 3QDKP1 | {
"code": "def upper_bound(nums, target):\n lo, hi = 0, len(nums)\n while lo < hi:\n mid = (lo + hi) // 2\n if nums[mid] <= target:\n lo = mid + 1\n else:\n hi = mid\n return lo",
"input": "upper_bound([1, 2, 2, 2, 3, 5], 2)",
"language": "Python",
"predicted_... |
cmsvmjjpi01x6g4p2scptpsih | Submission PTPSIH | {
"code": "def flatten_list(lst):\n result = []\n for item in lst:\n if isinstance(item, list):\n result.extend(flatten_list(item))\n else:\n result.append(item)\n return result",
"input": "flatten_list([1, [2, [3, 4], 5], [[6]], 7])",
"language": "Python",
"predicte... |
cmsvmjjpi01x7g4p2u8i9c0m6 | Submission I9C0M6 | {
"code": "def dedupe_preserve_order(items):\n seen = set()\n result = []\n for item in items:\n if item not in seen:\n seen.add(item)\n result.append(item)\n return result",
"input": "dedupe_preserve_order([3, 1, 2, 3, 1, 4, 2, 5])",
"language": "Python",
"predicted_out... |
cmsvmjjpi01x8g4p25296zhi7 | Submission 96ZHI7 | {
"code": "def digit_sum(n):\n n = abs(n)\n if n < 10:\n return n\n return n % 10 + digit_sum(n // 10)",
"input": "digit_sum(987654321)",
"language": "Python",
"predicted_output": "45"
} |
cmsvmjjpi01x9g4p2mee2vj01 | Submission E2VJ01 | {
"code": "def power_set(items):\n result = [[]]\n for item in items:\n result += [subset + [item] for subset in result]\n return sorted(result, key=lambda s: (len(s), s))",
"input": "power_set([1, 2, 3])",
"language": "Python",
"predicted_output": "[[], [1], [2], [3], [1, 2], [1, 3], [2, 3], [1... |
cmsvnghm301yfg4p2jzcnjd3l | Submission CNJD3L | {
"code": "def redact_digits_runs(text, min_run):\n result = []\n i = 0\n n = len(text)\n while i < n:\n if text[i].isdigit():\n j = i\n while j < n and text[j].isdigit():\n j += 1\n run_len = j - i\n if run_len >= min_run:\n ... |
cmsvnghm301ygg4p28eks1oag | Submission KS1OAG | {
"code": "def has_adjacent_vip_conflict(seating_row, vip_set):\n for i in range(len(seating_row) - 1):\n if seating_row[i] in vip_set and seating_row[i+1] in vip_set:\n return True\n return False",
"input": "has_adjacent_vip_conflict(['Ana', 'Ben', 'Cid', 'Dax', 'Eve'], {'Cid', 'Dax', 'Eve'... |
cmsvnghm301yhg4p2akco3ijq | Submission CO3IJQ | {
"code": "def process_tasks_with_aging(tasks, boost_after):\n processed = []\n remaining = [dict(t) for t in tasks]\n tick = 0\n while remaining:\n for t in remaining:\n if tick - t[\"submitted\"] >= boost_after and t[\"priority\"] > 1:\n t[\"priority\"] -= 1\n rem... |
cmsvnghm301yig4p2pdndfg8c | Submission NDFG8C | {
"code": "def evaluate_polynomial(coefficients, x):\n result = 0\n for coef in coefficients:\n result = result * x + coef\n return result",
"input": "evaluate_polynomial([2, -3, 0, 5], 3)",
"language": "Python",
"predicted_output": "32"
} |
cmsvnghm301yjg4p2wlgqxgjz | Submission GQXGJZ | {
"code": "def compute_backoff_schedule(base_delay, max_delay, attempts):\n schedule = []\n delay = base_delay\n for _ in range(attempts):\n schedule.append(min(delay, max_delay))\n delay *= 2\n return schedule",
"input": "compute_backoff_schedule(1, 20, 6)",
"language": "Python",
"pre... |
cmsvnghm301ykg4p2dhktnu7o | Submission KTNU7O | {
"code": "def nearest_warehouse(warehouses, point):\n best = None\n best_dist = None\n for name, (x, y) in sorted(warehouses.items()):\n dist = abs(x - point[0]) + abs(y - point[1])\n if best_dist is None or dist < best_dist:\n best_dist = dist\n best = name\n return b... |
cmsvnghm301ylg4p2k2h8o7v3 | Submission H8O7V3 | {
"code": "def dedupe_events(events, window_seconds):\n result = []\n last_seen = {}\n for event_type, ts in events:\n if event_type in last_seen and ts - last_seen[event_type] < window_seconds:\n continue\n last_seen[event_type] = ts\n result.append((event_type, ts))\n ret... |
cmsvnghm301ymg4p2scqmrajj | Submission QMRAJJ | {
"code": "def scale_recipe(ingredients, factor):\n scaled = {}\n for name, amount in ingredients.items():\n new_amount = round(amount * factor, 2)\n scaled[name] = new_amount\n return scaled",
"input": "scale_recipe({'flour': 2.5, 'sugar': 1.0, 'eggs': 3, 'butter': 0.75}, 1.5)",
"language"... |
cmsvnghm301yng4p2er6xiu56 | Submission 6XIU56 | {
"code": "def match_route(routes, path):\n path_parts = path.strip(\"/\").split(\"/\")\n for pattern, handler in routes:\n pattern_parts = pattern.strip(\"/\").split(\"/\")\n if len(pattern_parts) != len(path_parts):\n continue\n params = {}\n matched = True\n for ... |
cmsvnghm301yog4p28zvuk598 | Submission VUK598 | {
"code": "def compare_versions(v1, v2):\n parts1 = [int(x) for x in v1.split(\".\")]\n parts2 = [int(x) for x in v2.split(\".\")]\n length = max(len(parts1), len(parts2))\n parts1 += [0] * (length - len(parts1))\n parts2 += [0] * (length - len(parts2))\n for a, b in zip(parts1, parts2):\n if... |
cmsvnghm301ypg4p2ztecr1vs | Submission ECR1VS | {
"code": "def group_duplicate_files(files):\n def simple_hash(content):\n h = 0\n for ch in content:\n h = (h * 31 + ord(ch)) % 1000000007\n return h\n groups = {}\n for name, content in files:\n h = simple_hash(content)\n groups.setdefault(h, []).append(name)\n... |
cmsvnghm301yqg4p2yuzplvdv | Submission ZPLVDV | {
"code": "def weighted_round_robin(servers, num_requests):\n current_weights = {name: 0 for name, _ in servers}\n total_weight = sum(w for _, w in servers)\n assignments = []\n for _ in range(num_requests):\n for name, weight in servers:\n current_weights[name] += weight\n chosen... |
cmsvnghm301yrg4p2nrlkyind | Submission LKYIND | {
"code": "def count_palindromic_substrings_min_length(s, min_length):\n count = 0\n n = len(s)\n for i in range(n):\n for j in range(i + min_length, n + 1):\n sub = s[i:j]\n if sub == sub[::-1]:\n count += 1\n return count",
"input": "count_palindromic_substr... |
cmsvnghm301ysg4p2ftjgc0vu | Submission JGC0VU | {
"code": "def detect_spikes(readings, window, threshold):\n spikes = []\n for i in range(len(readings)):\n start = max(0, i - window)\n history = readings[start:i]\n if not history:\n continue\n avg = sum(history) / len(history)\n if abs(readings[i] - avg) > thresh... |
cmsvnghm301ytg4p2f9zj3gm0 | Submission ZJ3GM0 | {
"code": "def compute_standings(matches):\n table = {}\n for home, away, home_score, away_score in matches:\n for team in (home, away):\n table.setdefault(team, {\"points\": 0, \"gd\": 0})\n if home_score > away_score:\n table[home][\"points\"] += 3\n elif away_score ... |
cmsvnghm301yug4p2z7tiq3lq | Submission TIQ3LQ | {
"code": "def wrap_text(words, width):\n lines = []\n current = []\n current_len = 0\n for word in words:\n extra = len(word) + (1 if current else 0)\n if current_len + extra > width:\n lines.append(\" \".join(current))\n current = [word]\n current_len = len... |
cmsvnghm301yvg4p2gvqpajb4 | Submission QPAJB4 | {
"code": "def order_pick_path(items_by_aisle):\n aisles = sorted(items_by_aisle.keys())\n path = []\n for idx, aisle in enumerate(aisles):\n bins = sorted(items_by_aisle[aisle])\n if idx % 2 == 1:\n bins = bins[::-1]\n for b in bins:\n path.append((aisle, b))\n ... |
cmsvnghm301ywg4p23r5hik5j | Submission 5HIK5J | {
"code": "def rank_word_frequency(text, top_n):\n words = text.lower().split()\n freq = {}\n order = {}\n for i, w in enumerate(words):\n w = w.strip(\".,!?\")\n if w not in freq:\n order[w] = i\n freq[w] = freq.get(w, 0) + 1\n ranked = sorted(freq.items(), key=lambda k... |
cmsvnghm301yxg4p2pmfuckys | Submission FUCKYS | {
"code": "def find_overlapping_shifts(shifts):\n conflicts = []\n sorted_shifts = sorted(shifts, key=lambda s: s[1])\n for i in range(len(sorted_shifts)):\n for j in range(i + 1, len(sorted_shifts)):\n name_i, start_i, end_i = sorted_shifts[i]\n name_j, start_j, end_j = sorted_s... |
cmsvnghm301yyg4p2uno6sesp | Submission O6SESP | {
"code": "def validate_order_transitions(transitions):\n allowed = {\n \"created\": {\"paid\", \"cancelled\"},\n \"paid\": {\"shipped\", \"refunded\"},\n \"shipped\": {\"delivered\", \"returned\"},\n \"delivered\": set(),\n \"cancelled\": set(),\n \"refunded\": set(),\n ... |
cmsvntqa30218g4p2bperzaeg | Submission ERZAEG | {
"code": "def safe_transpose(matrix):\n if not matrix:\n return []\n row_len = len(matrix[0])\n for row in matrix:\n if len(row) != row_len:\n raise ValueError(\"Jagged matrix cannot be transposed\")\n return [[matrix[r][c] for r in range(len(matrix))] for c in range(row_len)]",
... |
cmsvntqa30219g4p29upct5uf | Submission PCT5UF | {
"code": "def count_allowed_requests(timestamps, window_size, max_requests):\n allowed = []\n window = []\n for t in timestamps:\n window = [w for w in window if t - w < window_size]\n if len(window) < max_requests:\n window.append(t)\n allowed.append(t)\n return allow... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.