Datasets:

bigcode
/

humanevalpack

@@ -1,494 +1,494 @@
 [
     {
-        "buggy_solution": "  for (let i = 0; i < numbers.length; i++) {\n    for (let j = 0; j < numbers.length; j++) {\n      if (i != j) {\n        let distance = Math.abs(numbers[i] - numbers[j]);\n        if (distance < threshold) {\n          return true;\n        }\n      }\n    }\n  }\n  return false;\n}\n\n"
     },
     {
-        "buggy_solution": "  var result = [];\n  var current_string = [];\n  var current_depth = 0;\n\n  for (const c of paren_string) {\n    if (c == '(') {\n      current_depth += 1;\n      current_string.push(c);\n    } else if (c == ')') {\n      current_depth -= 1;\n      current_string.push(c);\n      if (current_depth == 0) {\n        result.push(current_string.join(''));\n        current_string = [];\n      }\n    }\n  }\n\n  return result;\n}\n\n"
     },
     {
-        "buggy_solution": "  return number % 1.0;\n}\n\n"
     },
     {
-        "buggy_solution": "  var balance = 0;\n  for (const op of operations) {\n    balance += op;\n    if (balance < 0) {\n      return true;\n    }\n  }\n  return false;\n}\n\n"
     },
     {
-        "buggy_solution": "  var mean = numbers.reduce((prev, item) => {\n    return prev + item;\n  }, 0) / numbers.length;\n  return numbers.reduce((prev, item) => {\n    return prev + Math.abs(item - mean);\n  }, 0) / numbers.length;\n\n}\n\n"
     },
     {
-        "buggy_solution": "  if (!Array.isArray(numbers) || numbers.length == 0)\n    return [];\n  var result = [];\n  for (const n of numbers) {\n    result.push(n, delimeter);\n  }\n  result.pop();\n  return result;\n}\n\n"
     },
     {
-        "buggy_solution": "  var parseParenGroup = function (s) {\n    let depth = 0, max_depth = 0;\n    for (const c of s) {\n      if (c == '(') {\n        depth += 1;\n        max_depth = Math.max(max_depth, depth);\n      } else {\n        depth -= 1;\n      }\n    }\n    return max_depth;\n  }\n  return paren_string.split(' ')\n          .filter(x => x != '')\n          .map(x => parseParenGroup(x));\n}\n\n"
     },
     {
-        "buggy_solution": "  return strings.filter(x => x.indexOf(substring) != -1);\n}\n\n"
     },
     {
-        "buggy_solution": "  var sum_value = 0, prod_value = 1;\n  for (const n of numbers) {\n    sum_value += n;\n    prod_value *= n;\n  }\n  return [sum_value, prod_value];\n}\n\n"
     },
     {
-        "buggy_solution": "  var running_max, result = [];\n  for (const n of numbers) {\n    if (running_max == undefined)\n      running_max = n;\n    else\n      running_max = Math.max(running_max, n);\n    result.push(running_max);\n  }\n  return result;\n}\n\n"
     },
     {
-        "buggy_solution": "  if (string == '')\n    return '';\n  var beginning_of_suffix = 0;\n  while (!isPalindrome(string.slice(beginning_of_suffix)))\n    beginning_of_suffix += 1;\n  return string + string.slice(0, beginning_of_suffix).split('').reverse().join('');\n}\n\n"
     },
     {
-        "buggy_solution": "  var xor = function (i, j) {\n    if (i == j)\n      return '0';\n    else\n      return '1';\n  }\n  return a.split('').map((item, index) => xor(item, b[index])).join('');\n}\n\n"
     },
     {
-        "buggy_solution": "  if (!Array.isArray(strings) || strings.length == 0)\n    return null;\n  var maxlen = Math.max(...strings.map(x => x.length));\n  for (const s of strings) {\n    if (s.length == maxlen) {\n      return s;\n    }\n  }\n}\n\n"
     },
     {
-        "buggy_solution": "  while (b != 0) {\n    let temp = a;\n    a = b;\n    b = temp % b;\n  }\n  return a;\n}\n\n"
     },
     {
-        "buggy_solution": "  var result = [];\n  for (let i = 0; i < string.length; i++) {\n    result.push(string.slice(0, i+1));\n  }\n  return result;\n}\n\n"
     },
     {
-        "buggy_solution": "  return [...Array(n).keys(), n].join(' ')\n}\n\n"
     },
     {
-        "buggy_solution": "  return (new Set(string.toLowerCase())).size;\n\n}\n\n"
     },
     {
-        "buggy_solution": "  const note_map = {'o': 4, 'o|': 2, '.|': 1};\n  return music_string.split(' ').filter(x => x != '').map(x => note_map[x]);\n}\n\n"
     },
     {
-        "buggy_solution": "  var times = 0;\n  for (let i = 0; i < string.length - substring.length + 1; i++) {\n    if (string.slice(i, i+substring.length) == substring) {\n      times += 1;\n    }\n  }\n  return times;\n}\n\n"
     },
     {
-        "buggy_solution": "  const value_map = {\n    'zero': 0,\n    'one': 1,\n    'two': 2,\n    'three': 3,\n    'four': 4,\n    'five': 5,\n    'six': 6,\n    'seven': 7,\n    'eight': 8,\n    'nine': 9\n  };\n  return numbers.split(' ')\n          .filter(x => x != '')\n          .sort((a, b) => value_map[a] - value_map[b])\n          .join(' ');\n}\n\n"
     },
     {
-        "buggy_solution": "  var closest_pair, distance;\n  for (let i = 0; i < numbers.length; i++)\n    for (let j = 0; j < numbers.length; j++)\n      if (i != j) {\n        let a = numbers[i], b = numbers[j];\n        if (distance == null) {\n          distance = Math.abs(a - b);\n          closest_pair = [Math.min(a, b), Math.max(a, b)];\n        } else {\n          let new_distance = Math.abs(a - b);\n          if (new_distance < distance) {\n            distance = new_distance;\n            closest_pair = [Math.min(a, b), Math.max(a, b)];\n          }\n        }\n      }\n  return closest_pair;\n}\n\n"
     },
     {
-        "buggy_solution": "  var min_number = Math.min(...numbers);\n  var max_number = Math.max(...numbers);\n  return numbers.map(x => (x - min_number) / (max_number - min_number));\n}\n\n"
     },
     {
-        "buggy_solution": "  return values.filter(x => Number.isInteger(x));\n}\n\n"
     },
     {
-        "buggy_solution": "  return string.length;\n}\n\n"
     },
     {
-        "buggy_solution": "  for (let i = n - 1; i >= 0; i--)\n    if (n % i == 0)\n      return i;\n}\n\n"
     },
     {
-        "buggy_solution": "  var fact = [], i = 2;\n  while (i <= Math.sqrt(n) + 1) {\n    if (n % i == 0) {\n      fact.push(i);\n      n = n / i;\n    } else {\n      i += 1;\n    }\n  }\n\n  if (n > 1)\n    fact.push(n);\n  return fact;\n}\n\n"
     },
     {
-        "buggy_solution": "  var dict = new Object();\n  for (const num of numbers) {\n    if (num in dict) {\n      dict[num] += 1;\n    } else {\n      dict[num] = 1;\n    }\n  }\n  return numbers.filter(x => dict[x] <= 1);\n}\n\n"
     },
     {
-        "buggy_solution": "  return string.split('')\n          .map(x => (x.toUpperCase() == x ? x.toLowerCase() : x.toUpperCase()))\n          .join('');\n}\n\n"
     },
     {
-        "buggy_solution": "  return strings.join('');\n}\n\n"
     },
     {
-        "buggy_solution": "  return strings.filter(x => x.startsWith(prefix));\n}\n\n"
     },
     {
-        "buggy_solution": "  return l.filter(e => e > 0);\n}\n\n"
     },
     {
-        "buggy_solution": "  if (n < 2)\n    return false;\n  for (let k = 2; k < n - 1; k++)\n    if (n % k == 0)\n      return false;\n  return true;\n}\n\n"
     },
     {
-        "buggy_solution": "  var begin = -1.0, end = 1.0;\n  while (poly(xs, begin) * poly(xs, end) > 0) {\n    begin *= 2.0;\n    end *= 2.0;\n  }\n  while (end - begin > 1e-10) {\n    let center = (begin + end) / 2.0;\n    if (poly(xs, center) * poly(xs, begin) > 0)\n      begin = center;\n    else\n      end = center;\n  }\n  return begin;\n}\n\n"
     },
     {
-        "buggy_solution": "  var three = l.filter((item, index) => index % 3 == 0);\n  three.sort((a, b) => (a - b));\n  return l.map((item, index) => (index % 3 == 0 ? three[index / 3] : item));\n}\n\n"
     },
     {
-        "buggy_solution": "  return Array.from(new Set(l)).sort((a, b) => (a - b));\n}\n\n"
     },
     {
-        "buggy_solution": "  return Math.max(...l);\n}\n\n"
     },
     {
-        "buggy_solution": "  var ns = [], ans = 0;\n  for (let i = 0; i < n; i++)\n    if (i % 11 == 0 || i % 13 == 0)\n      ns.push(i);\n  var s = ns.map(x => x.toString()).join('');\n  for (const c of s)\n    ans += (c == '7');\n  return ans;\n}\n\n"
     },
     {
-        "buggy_solution": "  var even = l.filter((item, index) => index % 2 == 0);\n  even.sort((a, b) => (a - b));\n  return l.map((item, index) => (index % 2 == 0 ? even[index / 2] : item));\n}\n\n"
     },
     {
-        "buggy_solution": "  return encodeCyclic(encodeCyclic(s));\n}\n\n"
     },
     {
-        "buggy_solution": "  var isPrime = function (p) {\n    if (p < 2)\n      return false;\n    for (let k = 2; k < Math.min(Math.floor(Math.sqrt(p)) + 1, p - 1); k++) {\n      if (p % k == 0)\n        return false;\n    }\n    return true;\n  }\n\n  var f = [0, 1];\n  while (true) {\n    f.push(f.at(-1) + f.at(-2));\n    if (isPrime(f.at(-1)))\n      n -= 1;\n    if (n == 0)\n      return f.at(-1);\n  }\n}\n\n"
     },
     {
-        "buggy_solution": "  for (let i = 0; i < l.length; i++)\n    for (let j = i + 1; j < l.length; j++)\n      for (let k = j + 1; k < l.length; k++)\n        if (l[i] + l[j] + l[k] == 0)\n          return true;\n  return false;\n}\n\n"
     },
     {
-        "buggy_solution": "  return Math.pow(n, 2);\n}\n\n"
     },
     {
-        "buggy_solution": "  return l.map(e => e + 1);\n}\n\n"
     },
     {
-        "buggy_solution": "  for (let i = 0; i < l.length; i++)\n    for (let j = i + 1; j < l.length; j++)\n      if (l[i] + l[j] == 0)\n        return true;\n  return false;\n}\n\n"
     },
     {
-        "buggy_solution": "  var ret = \"\";\n  while (x > 0) {\n    ret = (x % base).toString() + ret;\n    x = Math.floor(x / base);\n  }\n  return ret;\n}\n\n"
     },
     {
-        "buggy_solution": "  return a * h / 2.0;\n}\n\n"
     },
     {
-        "buggy_solution": "  var results = [0, 0, 2, 0];\n  if (n < 4)\n    return results[n];\n  for (let i = 4; i < n + 1; i++) {\n    results.push(results.at(-1) + results.at(-2) +\n                results.at(-3) + results.at(-4));\n    results.shift();\n  }\n  return results.pop();\n}\n\n"
     },
     {
-        "buggy_solution": "  l.sort((a, b) => a - b);\n  var len = l.length;\n  if (l.length % 2 == 1)\n    return l[Math.floor(len / 2)];\n  else\n    return (l[len / 2 - 1] + l[len / 2]) / 2.0;\n}\n\n"
     },
     {
-        "buggy_solution": "  for (let i = 0; i < text.length; i++)\n    if (text[i] != text.at(-i-1))\n      return false;\n  return true;\n}\n\n"
     },
     {
-        "buggy_solution": "  var ret = 1;\n  for (let i = 0; i < n; i++)\n    ret = (2 * ret) % p;\n  return ret;\n}\n\n"
     },
     {
-        "buggy_solution": "  return s.split(\"\").map(ch => String.fromCharCode(\n    ((ch.charCodeAt(0) - 5 + 26 - \"a\".charCodeAt(0)) % 26) + \"a\".charCodeAt(0)\n  )).join(\"\");\n}\n\n"
     },
     {
-        "buggy_solution": "  return text.split(\"\")\n             .filter(s => ![\"a\", \"e\", \"i\", \"o\", \"u\"]\n                      .includes(s.toLowerCase())\n                    )\n             .join(\"\")\n}\n\n"
     },
     {
-        "buggy_solution": "  for (const e of l)\n    if (e >= t)\n      return false;\n  return true;\n}\n\n"
     },
     {
-        "buggy_solution": "  return x + y;\n}\n\n"
     },
     {
-        "buggy_solution": "  return JSON.stringify([...new Set(s0)].sort()) === JSON.stringify([...new Set(s1)].sort());\n}\n\n"
     },
     {
-        "buggy_solution": "  if (n == 0)\n    return 0;\n  if (n == 1)\n    return 1;\n  return fib(n - 1) + fib(n - 2);\n}\n\n"
     },
     {
-        "buggy_solution": "  var depth = 0;\n  for (const b of brackets) {\n    if (b == \"<\")\n      depth += 1;\n    else\n      depth -= 1;\n    if (depth < 0)\n      return false;\n  }\n  return depth == 0;\n}\n\n"
     },
     {
-        "buggy_solution": "  var sort1 = [...l].sort((a, b) => a - b);\n  var sort2 = [...l].sort((a, b) => b - a);\n  if (JSON.stringify(l) === JSON.stringify(sort1) ||\n      JSON.stringify(l) === JSON.stringify(sort2))\n    return true;\n  return false;\n}\n\n"
     },
     {
-        "buggy_solution": "  var ret = new Set();\n  for (const e1 of l1)\n    for (const e2 of l2)\n      if (e1 == e2)\n        ret.add(e1);\n  return [...ret].sort();\n}\n\n"
     },
     {
-        "buggy_solution": "  var isPrime = function (k) {\n    if (k < 2)\n      return false;\n    for (let i = 2; i < k - 1; i++)\n      if (k % i == 0)\n        return false;\n    return true;\n  }\n\n  var largest = 1;\n  for (let j = 2; j < n + 1; j++)\n    if (n % j == 0 && isPrime(j))\n      largest = Math.max(largest, j);\n  return largest;\n}\n\n"
     },
     {
-        "buggy_solution": "  return n * (n + 1) / 2;\n}\n\n"
     },
     {
-        "buggy_solution": "  var depth = 0;\n  for (const b of brackets) {\n    if (b == \"(\")\n      depth += 1;\n    else\n      depth -= 1;\n    if (depth < 0)\n      return false;\n  }\n  return depth == 0;\n}\n\n"
     },
     {
-        "buggy_solution": "  return xs.map((x, i) => x * i).slice(1);\n}\n\n"
     },
     {
-        "buggy_solution": "  if (n == 0 || n == 1)\n    return 0;\n  if (n == 2)\n    return 1;\n  return fibfib(n - 1) + fibfib(n - 2) + fibfib(n - 3);\n}\n\n"
     },
     {
-        "buggy_solution": "  var vowels = \"aeiouAEIOU\";\n  var n_vowels = s.split('').reduce((prev, item) => {\n    return prev + (vowels.includes(item));\n  }, 0);\n  if (s.at(-1) == 'y' || s.at(-1) == 'Y')\n    n_vowels += 1;\n  return n_vowels;\n}\n\n"
     },
     {
-        "buggy_solution": "  s = x.toString();\n  if (shift > s.length)\n    return s.split('').reverse().join('');\n  else\n    return s.slice(-shift) + s.slice(0, -shift);\n}\n\n"
     },
     {
-        "buggy_solution": "  if (s == '') return 0;\n  return s.split('').reduce((prev, char) => {\n    let ord_char = char.charCodeAt(0)\n    return prev + (ord_char > 64 && ord_char < 91 ? ord_char : 0);\n  }, 0);\n}\n\n"
     },
     {
-        "buggy_solution": "  var lis = [];\n  for (const i of s.split(\" \"))\n    if (!isNaN(i))\n      lis.push(Number(i))\n  return n - lis.reduce(((prev, item) => prev + item), 0);\n}\n\n"
     },
     {
-        "buggy_solution": "  if (arr.length == 0) return [];\n  var evens = arr.filter(x => x % 2 == 0);\n  if (evens.length == 0) return [];\n  return [Math.min(...evens), arr.indexOf(Math.min(...evens))];\n}\n\n"
     },
     {
-        "buggy_solution": "  var frq = new Array(Math.max(...lst) + 1).fill(0);\n  for (const i of lst)\n    frq[i] += 1;\n  var ans = -1;\n  for (let i = 1; i < frq.length; i++)\n    if (frq[i] >= i)\n      ans = i;\n  return ans;\n}\n\n"
     },
     {
-        "buggy_solution": "  var res = [], sw = true;\n  while (lst.length) {\n    res.push(sw ? Math.min(...lst) : Math.max(...lst));\n    lst.splice(lst.indexOf(res.at(-1)), 1);\n    sw = !sw;\n  }\n  return res;\n}\n\n"
     },
     {
-        "buggy_solution": "  if (a + b <= c || a + c <= b || b + c <= a)\n    return -1;\n  var s = (a + b + c) / 2;\n  var area = Math.pow(s * (s - a) * (s - b) * (s - c), 0.5);\n  area = area.toFixed(2);\n  return area;\n}\n\n"
     },
     {
-        "buggy_solution": "  if (q.reduce(((prev, item) => prev + item), 0) > w)\n    return false;\n  var i = 0, j = q.length - 1;\n  while (i < j) {\n    if (q[i] != q[j])\n      return false;\n    i++;\n    j--;\n  }\n  return true;\n}\n\n"
     },
     {
-        "buggy_solution": "  var ans = 0;\n  for (let i = 0; i < Math.floor(arr.length / 2); i++)\n    if (arr[i] != arr.at(-i - 1))\n      ans++;\n  return ans;\n}\n\n"
     },
     {
-        "buggy_solution": "  var l1 = lst1.reduce(((prev, item) => prev + item.length), 0);\n  var l2 = lst2.reduce(((prev, item) => prev + item.length), 0);\n  if (l1 <= l2)\n    return lst1;\n  else\n    return lst2;\n}\n\n"
     },
     {
-        "buggy_solution": "  var isPrime = function (n) {\n    for (let j = 2; j < n; j++)\n      if (n % j == 0)\n        return false;\n    return true;\n  }\n\n  for (let i = 2; i < 101; i++) {\n    if (!isPrime(i)) continue;\n    for (let j = 2; j < 101; j++) {\n      if (!isPrime(j)) continue;\n      for (let k = 2; k < 101; k++) {\n        if (!isPrime(k)) continue;\n        if (i*j*k == a)\n          return true;\n      }\n    }\n  }\n  return false;\n}\n\n"
     },
     {
-        "buggy_solution": "  if (n == 1)\n    return (x == 1);\n  var power = 1;\n  while (power < x)\n    power = power * n;\n  return (power == x);\n}\n\n"
     },
     {
-        "buggy_solution": "  a = Math.abs(a);\n  return (Math.pow(Math.round(Math.pow(a, 1.0 / 3.0)), 3) == a);\n}\n\n"
     },
     {
-        "buggy_solution": "  var primes = \"2357BD\",\n      total = 0;\n  for (let i = 0; i < num.length; i++)\n    if (primes.includes(num[i]))\n      total++;\n  return total;\n}\n\n"
     },
     {
-        "buggy_solution": "  return \"db\" + decimal.toString(2) + \"db\";\n}\n\n"
     },
     {
-        "buggy_solution": "  if (s.length < 3)\n    return false;\n  for (let i = 0; i < s.length - 2; i++)\n    if (s[i] == s[i+1] || s[i+1] == s[i+2] || s[i] == s[i+2])\n      return false;\n  return true;\n}\n\n"
     },
     {
-        "buggy_solution": "  let letter_grade = []\n  for (let i = 0, len = grades.length; i < len; i++) {\n    let gpa = grades[i]\n    if (gpa == 4.0) {\n      letter_grade.push('A+')\n    } else if (gpa > 3.7) {\n      letter_grade.push('A')\n    } else if (gpa > 3.3) {\n      letter_grade.push('A-')\n    } else if (gpa > 3.0) {\n      letter_grade.push('B+')\n    } else if (gpa > 2.7) {\n      letter_grade.push('B')\n    } else if (gpa > 2.3) {\n      letter_grade.push('B-')\n    } else if (gpa > 2.0) {\n      letter_grade.push('C+')\n    } else if (gpa > 1.7) {\n      letter_grade.push('C')\n    } else if (gpa > 1.3) {\n      letter_grade.push('C-')\n    } else if (gpa > 1.0) {\n      letter_grade.push('D+')\n    } else if (gpa > 0.7) {\n      letter_grade.push('D')\n    } else if (gpa > 0.0) {\n      letter_grade.push('D-')\n    } else {\n      letter_grade.push('E')\n    }\n  }\n  return letter_grade\n}\n\n"
     },
     {
-        "buggy_solution": "  let len = string.length\n  if (len == 1 || len == 0) { return false }\n  for (let i = 2; i * i <= len; i++) {\n    if (len % i == 0) { return false }\n  }\n  return true\n}\n\n"
     },
     {
-        "buggy_solution": "  if (n == 1) { return 1 }\n  let t = 18\n  for (let i = 2; i < n; i++) {\n    t = t * 10\n  }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = 0\n  while (N > 0) {\n    t += N % 10\n    N = (N - N % 10) / 10\n  }\n  return t.toString(2)\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = 0\n  for (let i = 1; i < lst.length; i += 2) {\n    if (lst[i] % 2 == 0) {\n      t += lst[i]\n    }\n  }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  let arr = s.split(/\\s/)\n  for (let i = 0; i < arr.length; i++) {\n    for (let j = 0; j < arr[i].length; j++) {\n      let ind = j\n      for (let k = j + 1; k < arr[i].length; k++) {\n        if (arr[i][k].charCodeAt() < arr[i][ind].charCodeAt()) {\n          ind = k\n        }\n      }\n      if (ind > j) {\n        arr[i] = arr[i].slice(0, j) + arr[i][ind] + arr[i].slice(j + 1, ind) + arr[i][j] + arr[i].slice(ind + 1, arr[i].length)\n      }\n    }\n  }\n  let t = ''\n  for (let i = 0; i < arr.length; i++) {\n    if (i > 0) {\n      t = t + ' '\n    }\n    t = t + arr[i]\n  }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = []\n  for (let i = 0; i < lst.length; i++) {\n    for (let j = lst[i].length - 1; j >= 0; j--) {\n      if (lst[i][j] == x) {\n        t.push((i, j))\n      }\n    }\n  }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  let arr = array\n  let tot = arr[0] + arr[arr.length-1]\n  for (let j = 0; j < arr.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < arr.length; k++) {\n      if ((tot % 2 == 1 && arr[k] < arr[ind]) || (tot % 2 == 0 && arr[k] > arr[ind])) {\n        ind = k\n      }\n    }\n    let tmp = arr[j]\n    arr[j] = arr[ind]\n    arr[ind] = tmp\n  }\n  return arr\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = ''\n  for (let i = 0; i < s.length; i++) {\n    let p = s[i].charCodeAt() + 4\n    if (p > 122) { p -= 26 }\n    t += String.fromCharCode(p)\n  }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  let arr = lst\n  for (let j = 0; j < arr.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < arr.length; k++) {\n      if (arr[k] < arr[ind]) {\n        ind = k\n      }\n    }\n    let tmp = arr[j]\n    arr[j] = arr[ind]\n    arr[ind] = tmp\n  }\n  let smallest = arr[0]\n  let pt = 1\n  while(pt<arr.length){\n    if(arr[pt]>smallest){\n      return arr[pt]\n    }\n    pt++\n  }\n  return null\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = 0\n  if (S[0] == 'I' && S[1] == ' ') { t = 1 }\n  for (let i = 0; i < S.length; i++) {\n    if (S[i] == '.' || S[i] == '!' || S[i] == '?') {\n      if (S[i + 1] == ' ' && S[i + 2] == 'I' && S[i + 3] == ' ') {\n        t++\n      }\n    }\n  }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  if (x % 1 === 0 && y % 1 === 0 && z % 1 === 0 && (x + y === z || x + z === y || x === y + z)) {\n    return true\n  }\n  return false\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = ''\n  for (let i = 0; i < message.length; i++) {\n    let p = message[i].charCodeAt()\n    if (p > 96) { p -= 32 }\n    else if (p!=32 && p < 96) { p += 32 }\n    if (p == 65 || p == 97 || p == 69 || p == 101 || p == 73 || p == 105 || p == 79 || p == 111 || p == 85 || p == 117) { p += 2 }\n    t += String.fromCharCode(p)\n  }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = 0\n  for (let i = 0; i < lst.length; i++) {\n    let p = 1\n    for (let j = 2; j * j <= lst[i]; j++) {\n      if (lst[i] % j == 0) { p = 0; break }\n    }\n    if (p == 1 && lst[i] > t) { t = lst[i] }\n  }\n  let k = 0\n  while (t != 0) {\n    k += t % 10\n    t = (t - t % 10) / 10\n  }\n  return k\n}\n\n"
     },
     {
-        "buggy_solution": "  let c = 0\n  let lo = 1\n  let hi = 1\n  for (let key in dict) {\n    c++\n    for (let i = 0; i < key.length; i++) {\n      if (key[i].charCodeAt() < 65 || key[i].charCodeAt() > 90) { hi = 0 }\n      if (key[i].charCodeAt() < 97 || key[i].charCodeAt() > 122) { lo = 0 }\n    }\n  }\n  if ((lo == 0 && hi == 0) || c == 0) { return false }\n  return true\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = []\n  for (let i = 2; i < n; i++) {\n    let p = 1\n    for (let j = 2; j * j <= i; j++) {\n      if (i % j == 0) { p = 0; break }\n    }\n    if (p == 1) { t.push(i) }\n  }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  if (a < 0) { a = -a }\n  if (b < 0) { b = -b }\n  return (a % 10) * (b % 10)\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = 0\n  for (let i = 0; i < s.length; i += 2) {\n    if (s[i] == 'A' || s[i] == 'E' || s[i] == 'I' || s[i] == 'O' || s[i] == 'U') { p++ }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  value = Number(value)\n  let t = value % 1\n  if (t < 0.5 && t > -0.5) { value -= t }\n  else { value += t }\n  return value\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = []\n  for (let i = n; i < n * 3; i += 2) {\n    t.push(i)\n  }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = ''\n  let p = []\n  let k = 0\n  for (let i = 0; i < s.length; i++) {\n    if (s[i] == ' ' || s[i] == ',') {\n      if (k == 0) {\n        k = 1;\n        p.push(t);\n        t = '';\n      }\n    }\n    else {\n      k = 0;\n      t += s[i]\n    }\n  }\n  if (t != '') {\n    p.push(t);\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  for (let i = y; i >= x; i--) {\n    if (i % 2 == 0) {return i }\n  }\n  return -1\n}\n\n"
     },
     {
-        "buggy_solution": "  if (n > m) { return -1 }\n  let k = (n + m) / 2\n  if (k % 1 != 0) { k = (n + m + 1) / 2 }\n  return '0b' + k.toString(2)\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = []\n  for (let i = 0; i < x.length; i++) {\n    let h = x[i]\n    let boo = 1\n    while (h > 0) {\n      let r = h % 10\n      if (r % 2 == 0) {\n        boo = 0;\n        break;\n      }\n      h = (h - r) / 10\n    }\n    if (boo) {\n      p.push(x[i])\n    }\n  }\n  for (let j = 0; j < p.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < p.length; k++) {\n      if (p[k] < p[ind]) {\n        ind = k\n      }\n    }\n    if (ind > j) {\n      let tmp = p[j]\n      p[j] = p[ind]\n      p[ind] = tmp\n    }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  p = []\n  for (let i = 0; i < arr.length; i++) {\n    if (arr[i] > 0 && arr[i] < 10) { p.push(arr[i]) }\n  }\n  for (let j = 0; j < p.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < p.length; k++) {\n      if (p[k] > p[ind]) {\n        ind = k\n      }\n    }\n    if (ind > j) {\n      let tmp = p[j]\n      p[j] = p[ind]\n      p[ind] = tmp\n    }\n  }\n  let l = ['One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine']\n  let t = []\n  for (let j = 0; j < p.length; j++) {\n    t.push(l[p[j]-1])\n  }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  let f = 1\n  let p = 0\n  let k = []\n  for (let i = 1; i <= n; i++) {\n    p += i;\n    f *= i;\n    if (i % 2 == 0) { k.push(f) }\n    else { k.push(p) }\n  }\n  return k\n}\n\n"
     },
     {
-        "buggy_solution": "  let e = 0\n  let o = 0\n  for (let i = 1; i <= n; i++) {\n    let k = i.toString()\n    let p = 1\n    for (let j = 0; j < k.length; j++) {\n      if (k[j] != k[k.length - j - 1]) {\n        p = 0;\n        break;\n      }\n    }\n    if (p == 1) {\n      if (k % 2 == 0) { e++ }\n      else { o++ }\n    }\n  }\n  return (e, o)\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = 0\n  for (let i = 0; i < arr.length; i++) {\n    let h = arr[i]\n    if (h > 0) {\n      p++;\n      continue;\n    }\n    let k = 0\n    h = -h\n    while (h >= 10) {\n      k += h % 10;\n      h = (h - h % 10) / 10;\n    }\n    k -= h;\n    if (k > 0) { p++ }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  if (arr.length == 0) { return true }\n  let k = 0\n  let len = arr.length\n  for (let i = 0; i < len; i++) {\n    let t = 1;\n    for (let j = 1; j < len; j++) {\n      if (arr[j] < arr[j - 1]) {\n        t = 0;\n        break;\n      }\n    }\n    if (t == 1) {\n      k = 1;\n      break;\n    }\n    arr.push(arr[0]);\n    arr.shift()\n  }\n  if (k == 1) { return true }\n  return false\n}\n\n"
     },
     {
-        "buggy_solution": "  let k = lst1.length\n  let t = 0\n  for (let i = 0; i < lst1.length; i++) {\n    if (lst1[i] % 2 == 0) { t++ }\n  }\n  for (let i = 0; i < lst2.length; i++) {\n    if (lst2[i] % 2 == 0) { t++ }\n  }\n  if (t >= k) { return 'YES' }\n  return 'NO'\n}\n\n"
     },
     {
-        "buggy_solution": "  let d = {}\n  let t = test.split(/\\s/)\n  if (test == '') { t = [] }\n  for (m in t) {\n    if (t[m] in d) {\n      d[t[m]]++\n    }\n    else {\n      d[t[m]] = 1\n    }\n  }\n  s = Object.keys(d).sort(function (a, b) { return - d[a] + d[b]; });\n  if (s.length == 0) { return {} }\n  let g = d[s[0]]\n  let l = {}\n  for (let ss=0; ss<s.length; ss++) {\n    if (d[s[ss]] == g) {\n      l[s[ss]] = d[s[ss]]\n    }\n  }\n  return l\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = ''\n  for (let i = 0; i < s.length; i++) {\n    let y = 1\n    for (let j = 0; j < c.length; j++) {\n      if (s[i] == c[j]) {\n        y = 0\n      }\n    }\n    if (y == 1) {\n      t += s[i]\n    }\n  }\n  let z = 1\n  for (let i = 0; i < t.length; i++) {\n    if (t[i] != t[t.length - i - 1]) {\n      z = 0\n    }\n  }\n  if (z == 0) {\n    return (z, false)\n  }\n  return (z, true)\n}\n\n"
     },
     {
-        "buggy_solution": "  let d = []\n  for (let i = 0; i < lst.length; i++) {\n    let p = 0;\n    let h = lst[i].length\n    for (let j = 0; j < h; j++) {\n      if (lst[i][j].charCodeAt() % 2 == 1) { p++ }\n    }\n    p = p.toString()\n    d.push('the number of odd elements ' + p + 'n the str' + p + 'ng ' + p + ' of the ' + p + 'nput.')\n  }\n  return d\n}\n\n"
     },
     {
-        "buggy_solution": "  let min = nums[0]\n  for (let i = 0; i < nums.length; i++) {\n    for (let j = i + 1; j <= nums.length; j++) {\n      let s = 0;\n      for (let k = i; k < j; k++) {\n        s += nums[k]\n      }\n      if (s < min) { min = s }\n    }\n  }\n  return min\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = 0\n  for (let i = 0; i < grid.length; i++) {\n    let m = 0\n    for (let j = 0; j < grid[i].length; j++) {\n      if (grid[i][j] == 1) { m++ }\n    }\n    while (m > 0) {\n      m -= capacity;\n      p++;\n    }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = arr\n  for (let j = 0; j < p.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < p.length; k++) {\n      let w1 = p[ind].toString(2)\n      let f1 = 0\n      for (let u = 0; u < w1.length; u++) {\n        if (w1[u] == '1') { f1++ }\n      }\n      let w2 = p[k].toString(2)\n      let f2 = 0\n      for (let u = 0; u < w2.length; u++) {\n        if (w2[u] == '1') { f2++ }\n      }\n      if (f2 < f1 || (f1 == f2 && p[k] < p[ind])) {\n        ind = k\n      }\n    }\n    if (ind > j) {\n      let tmp = p[j]\n      p[j] = p[ind]\n      p[ind] = tmp\n    }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = s.split(/\\s/)\n  if (s == '') { return [] }\n  let k = []\n  for (let i = 0; i < t.length; i++) {\n    let l = 0\n    for (let j = 0; j < t[i].length; j++) {\n      if (t[i][j] != 'a' && t[i][j] != 'e' && t[i][j] != 'i' && t[i][j] != 'o' && t[i][j] != 'u' && t[i][j] != 'A' &&\n        t[i][j] != 'U' && t[i][j] != 'O' && t[i][j] != 'I' && t[i][j] != 'E') {\n        l++\n      }\n    }\n    if (l == n) { k.push(t[i]) }\n  }\n  return k\n}\n\n"
     },
     {
-        "buggy_solution": "  for (let i = word.length - 2; i > 0; i--) {\n    if (\n      !(word[i] != 'a' && word[i] != 'e' && word[i] != 'i' && word[i] != 'o' && word[i] != 'u' && word[i] != 'A' &&\n        word[i] != 'U' && word[i] != 'O' && word[i] != 'I' && word[i] != 'E')\n      &&\n      (word[i + 1] != 'a' && word[i + 1] != 'e' && word[i + 1] != 'i' && word[i + 1] != 'o' && word[i + 1] != 'u' && word[i + 1] != 'A' &&\n        word[i + 1] != 'U' && word[i + 1] != 'O' && word[i + 1] != 'I' && word[i + 1] != 'E')\n      &&\n      (word[i - 1] != 'a' && word[i - 1] != 'e' && word[i - 1] != 'i' && word[i - 1] != 'o' && word[i - 1] != 'u' && word[i - 1] != 'A' &&\n        word[i - 1] != 'U' && word[i - 1] != 'O' && word[i - 1] != 'I' && word[i - 1] != 'E')\n    ) {\n      return word[i]\n    }\n  }\n  return ''\n}\n\n"
     },
     {
-        "buggy_solution": "  let w1 = lst[0] + lst[1]\n  let y = 0\n  let u = 1\n  for (let i = 0; i < w1.length; i++) {\n    if (w1[i] == '(') { y++ }\n    else { y-- }\n    if (y < 0) {\n      u = 0;\n      break;\n    }\n  }\n  if (u == 1 && y == 0) { return 'Yes' }\n  w1 = lst[1] + lst[0]\n  y = 0\n  u = 1\n  for (let i = 0; i < w1.length; i++) {\n    if (w1[i] == '(') { y++ }\n    else { y-- }\n    if (y < 0) {\n      u = 0;\n      break;\n    }\n  }\n  if (u == 1 && y == 0) { return 'Yes' }\n  return 'No'\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = arr\n  for (let j = 0; j < p.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < p.length; k++) {\n      if (p[k] < p[ind]) {\n        ind = k\n      }\n    }\n    if (ind > j) {\n      let tmp = p[j]\n      p[j] = p[ind]\n      p[ind] = tmp\n    }\n  }\n  if (k == 0) { return [] }\n  return p.slice(-k)\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = 0\n  for (let i = 0; i < lst.length; i += 2) {\n    if (lst[i] % 2 == 1) {\n      p += lst[i]\n    }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = 0\n  for (let i = 0; i < k; i++) {\n    if (arr[i] < 100 && arr[i] > -100) { p += arr[i] }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = []\n  let t = n\n  while (1) {\n    let u = 0\n    for (let i = 0; i < p.length; i++) {\n      if (t == p[i]) {\n        u = 1\n        break;\n      }\n    }\n    if (u == 1) { break }\n    if (t % 2 == 1) { p.push(t); t = 3 * t + 1 }\n    else { t = t / 2 }\n  }\n  for (let j = 0; j < p.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < p.length; k++) {\n      if (p[k] < p[ind]) {\n        ind = k\n      }\n    }\n    if (ind > j) {\n      let tmp = p[j]\n      p[j] = p[ind]\n      p[ind] = tmp\n    }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = date.split(/-/)\n  if (t.length != 3) { return false }\n  if (t[0] < 1 || t[0] > 12 || t[1] < 1) { return false }\n  if (t[0] == 2 && t[1] > 29) { return false }\n  if ((t[0] == 1 || t[0] == 3 || t[0] == 5 || t[0] == 7 || t[0] == 8 || t[0] == 10 || t[0] == 12) && t[1] > 31) { return false }\n  if ((t[0] == 4 || t[0] == 6 || t[0] == 9 || t[0] == 11) && t[1] > 30) { return false }\n  return true\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = txt.split(/\\s/)\n  if (t.length > 1) {\n    return t\n  } else {\n    t = txt.split(/,/)\n    if (t.length > 1) {\n      return t\n    } else {\n      let p = 0\n      for (let i = 0; i < txt.length; i++) {\n        let m = txt[i].charCodeAt()\n        if (m >= 97 && m <= 122 && m % 2 == 0) {\n          p++\n        }\n      }\n      return p\n    }\n  }\n}\n\n"
     },
     {
-        "buggy_solution": "  if (lst.length == 0) { return true }\n  let dup = 1\n  let pre = lst[0]\n  for (let i = 1; i < lst.length; i++) {\n    if (lst[i] < pre) { return false }\n    if (lst[i] == pre) {\n      dup += 1;\n      if (dup == 3) { return false }\n    } else {\n      pre = lst[i]\n      dup = 1\n    }\n  }\n  return true\n}\n\n"
     },
     {
-        "buggy_solution": "  let lo = interval1[0]\n  if (interval2[0] > lo) { lo = interval2[0] }\n  let hi = interval1[1]\n  if (interval2[1] < hi) { hi = interval2[1] }\n  let len = 0\n  if (hi > lo) { len = hi - lo }\n  if (len == 1 || len == 0) { return 'NO' }\n  for (let i = 2; i * i <= len; i++) {\n    if (len % i == 0) { return 'NO' }\n  }\n  return 'YES'\n}\n\n"
     },
     {
-        "buggy_solution": "  if (arr.length == 0) { return null }\n  let n = 1\n  let s = 0\n  for (let i = 0; i < arr.length; i++) {\n    s += arr[i]\n    if (arr[i] == 0) { return 0 }\n    if (arr[i] < 0) { n = -n; s -= 2 * arr[i] }\n  }\n  return s * n\n}\n\n"
     },
     {
-        "buggy_solution": "  let m = 0\n  let n = 0\n  for (let i = 0; i < grid.length; i++) {\n    for (let j = 0; j < grid.length; j++) {\n      if (grid[i][j] == 1) {\n        m = i;\n        n = j;\n        break;\n      }\n    }\n  }\n  let min = grid.length * grid.length\n  if (m > 0 && grid[m - 1][n] < min) { min = grid[m - 1][n] }\n  if (n > 0 && grid[m][n - 1] < min) { min = grid[m][n - 1] }\n  if (m < grid.length - 1 && grid[m + 1][n] < min) { min = grid[m + 1][n] }\n  if (n < grid.length - 1 && grid[m][n + 1] < min) { min = grid[m][n + 1] }\n  let p = []\n  for (let i = 0; i < k; i++) {\n    if (i % 2 == 0) { p.push(1) }\n    else { p.push(min) }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  if (n == 0) { return [1] }\n  if (n == 1) { return [1, 3] }\n  let p = [1, 3]\n  for (let i = 2; i <= n; i++) {\n    if (i % 2 == 0) {\n      p.push(1 + i / 2)\n    }\n    else {\n      p.push(p[i - 2] + p[i - 1] + 1 + (i + 1) / 2)\n    }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = 1\n  let k = 1\n  while (n > 0) {\n    let y = n % 10\n    if (y % 2 == 1) {\n      p *= y; k = 0;\n    }\n    n = (n - n % 10) / 10\n  }\n  if (k == 0) { return p }\n  return 0\n}\n\n"
     },
     {
-        "buggy_solution": "  let opening_bracket_index = []\n  let closing_bracket_index1 = []\n  for (let i = 0; i < string.length; i++) {\n    if (string[i] == '[') {\n      opening_bracket_index.push(i)\n    }\n    else {\n      closing_bracket_index1.push(i)\n    }\n  }\n  let closing_bracket_index = []\n  for (let i = 0; i < closing_bracket_index1.length; i++) {\n    closing_bracket_index.push(closing_bracket_index1[closing_bracket_index1.length - i - 1])\n  }\n  let cnt = 0\n  let i = 0\n  let l = closing_bracket_index.length\n  for (let k = 0; k < opening_bracket_index.length; k++) {\n    if (i < l && opening_bracket_index[k] < closing_bracket_index[i]) {\n      cnt += 1;\n      i += 1;\n    }\n  }\n  return cnt >= 2\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = 0\n  for (let i = 0; i < lst.length; i++) {\n    let y = lst[i]\n    if (y % 1 != 0) {\n      if (y > 0) { y = y - y % 1 + 1 }\n      else { y = -y; y = y - y % 1 }\n    }\n    p += y * y\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  let len = txt.length\n  if (len == 0) { return false }\n  let y = txt[len - 1].charCodeAt()\n  if (len == 1) {\n    if ((y >= 65 && y <= 90) || (y >= 97 && y <= 122)) { return true }\n    return false\n  }\n  if (txt[len - 2] == ' ' && ((y >= 65 && y <= 90) || (y >= 97 && y <= 122))) { return true }\n  return false\n}\n\n"
     },
     {
-        "buggy_solution": "  if (arr.length == 0) { return -1 }\n  for (let i = arr.length - 1; i > 0; i--) {\n    if (arr[i] < arr[i - 1]) { return i }\n  }\n  return -1\n}\n\n"
     },
     {
-        "buggy_solution": "  let a = Infinity\n  let b = -Infinity\n  for (let i = 0; i < lst.length; i++) {\n    if (lst[i] > 0 && lst[i] < a) { a = lst[i] }\n    if (lst[i] < 0 && lst[i] > b) { b = lst[i] }\n  }\n  if (a == Infinity) { a = null }\n  if (b == -Infinity) { b = null }\n  return (b, a)\n}\n\n"
     },
     {
-        "buggy_solution": "  let aa = Number(a)\n  if (typeof a == 'string') { aa = Number(a.replace(',', '.')) }\n  let bb = Number(b)\n  if (typeof b == 'string') { bb = Number(b.replace(',', '.')) }\n  if (aa > bb) { return a }\n  if (aa < bb) { return b }\n  return null\n}\n\n"
     },
     {
-        "buggy_solution": "  return (n >= 8 && n % 2 == 0)\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = 1;\n  let t = 1;\n  while (n > 1) {\n    let y = p;\n    while (y > 0) {\n      y--;\n      t *= n;\n    }\n    p++;\n    n--;\n  }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = ''\n  let c = 0\n  for (let i = 0; i < text.length; i++) {\n    if (text[i] == ' ') { c++ }\n    else if (c > 0) {\n      if (c == 1) { t += '_' }\n      if (c == 2) { t += '__' }\n      if (c > 2) { t += '-' }\n      t += text[i]\n      c = 0;\n    } else {\n      t += text[i]\n    }\n  }\n  if (c == 1) { t += '_' }\n  if (c == 2) { t += '__' }\n  if (c > 2) { t += '-' }\n  return t\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = file_name.split(/\\./)\n  if (t.length != 2) { return 'No' }\n  if (t[1] != 'txt' && t[1] != 'dll' && t[1] != 'exe') { return 'No' }\n  if (t[0] == '') { return 'No' }\n  let a = t[0][0].charCodeAt()\n  if (!((a >= 65 && a <= 90) || (a >= 97 && a <= 122))) { return 'No' }\n  let y = 0\n  for (let i = 1; i < t[0].length; i++) {\n    if (t[0][i].charCodeAt() >= 48 && t[0][i].charCodeAt() <= 57) { y++ }\n    if (y > 3) { return 'No' }\n  }\n  return 'Yes'\n}\n\n"
     },
     {
-        "buggy_solution": "  let y = 0\n  for (let i = 0; i < lst.length; i++) {\n    if (i % 3 == 0) { y += lst[i] * lst[i] }\n    else if (i % 4 == 0) { y += lst[i] * lst[i] * lst[i] }\n    else { y += lst[i] }\n  }\n  return y\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = sentence.split(/\\s/)\n  let p = ''\n  for (let j = 0; j < t.length; j++) {\n    let len = t[j].length;\n    let u = 1\n    if (len == 1 || len == 0) { continue }\n    for (let i = 2; i * i <= len; i++) {\n      if (len % i == 0) { u = 0 }\n    }\n    if (u == 0) { continue }\n    if (p == '') { p += t[j] }\n    else { p = p + ' ' + t[j] }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  let a = x.split(/\\//)\n  let b = n.split(/\\//)\n  let m = Number(a[0]) * Number(b[0])\n  let r = Number(a[1]) * Number(b[1])\n  return m % r == 0\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = nums\n  for (let j = p.length - 2; j >= 0; j--) {\n    for (let k = 0; k <= j; k++) {\n      let m = 0\n      let n = 0\n      let h = p[k]\n      let d = p[k + 1]\n      let y = 1\n      let u = 1\n      if (h < 0) { y = -1; h = -h; }\n      if (d < 0) { u = -1; d = -d; }\n      while (h >= 10) {\n        m += h % 10;\n        h = (h - h % 10) / 10;\n      }\n      m += y * h\n      while (d >= 10) {\n        n += d % 10;\n        d = (d - d % 10) / 10;\n      }\n      n += u * d\n      if (m > n) {\n        let tmp = p[k]\n        p[k] = p[k + 1]\n        p[k + 1] = tmp\n      }\n    }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = 0\n  for (let i = 0; i < nums.length; i++) {\n    if (nums[i] < 10) { continue }\n    let y = nums[i].toString()\n    if (Number(y[0]) % 2 == 1 && Number(y[y.length - 1]) % 2 == 1) {\n      p++\n    }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  let y = []\n  for (let i = 1; i <= n; i++) {\n    y.push(i * i - i + 1)\n  }\n  let u = 0\n  for (let i = 0; i < n - 2; i++) {\n    for (let j = i + 1; j < n - 1; j++) {\n      for (let k = j + 1; k < n; k++) {\n        if ((y[i] + y[j] + y[k]) % 3 == 0) { u++ }\n      }\n    }\n  }\n  return u\n}\n\n"
     },
     {
-        "buggy_solution": "  let y = ['Mercury', 'Venus', 'Earth', 'Mars', 'Jupiter', 'Saturn', 'Uranus', 'Neptune']\n  let u = []\n  let lo = -1\n  let hi = -1\n  for (let i = 0; i < 8; i++) {\n    if (y[i] == planet1) { lo = i }\n  }\n  for (let i = 0; i < 8; i++) {\n    if (y[i] == planet2) { hi = i }\n  }\n  if (lo == -1 || hi == -1 || lo == hi) { return [] }\n  if (lo > hi) {\n    let tmp = lo;\n    lo = hi;\n    hi = tmp;\n  }\n  for (let i = lo + 1; i < hi; i++) {\n    u.push(y[i])\n  }\n  return u\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = []\n  for (let i = 0; i < lst.length; i++) {\n    if (lst[i].length % 2 == 0) {\n      p.push(lst[i])\n    }\n  }\n  for (let j = p.length - 2; j >= 0; j--) {\n    for (let k = 0; k <= j; k++) {\n      let f = 0\n      if (p[k].length > p[k + 1].length) { f = 1 }\n      if (p[k].length == p[k + 1].length) {\n        let r = p[k].length\n        for (let l = 0; l < r; l++) {\n          if (p[k][l].charCodeAt() > p[k + 1][l].charCodeAt()) {\n            f = 1;\n            break;\n          }\n          if (p[k][l].charCodeAt() < p[k + 1][l].charCodeAt()) {\n            break;\n          }\n        }\n      }\n      if (f == 1) {\n        let tmp = p[k]\n        p[k] = p[k + 1]\n        p[k + 1] = tmp\n      }\n    }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  let len = n\n  if (len == 1 || len == 0) { return y }\n  for (let i = 2; i * i <= len; i++) {\n    if (len % i == 0) { return y }\n  }\n  return x\n}\n\n"
     },
     {
-        "buggy_solution": "  let p = 0\n  for (let i = 0; i < lst.length; i++) {\n    if (lst[i] % 2 == 1 && lst[i] > 0) {\n      p += lst[i] * lst[i]\n    }\n  }\n  return p\n}\n\n"
     },
     {
-        "buggy_solution": "  for (let i = 0; i < guess.length; i++) {\n    game[i] -= guess[i]\n if (game[i]<0)\n game[i]=-game[i];  }\n  return game\n}\n\n"
     },
     {
-        "buggy_solution": "  let u = 0\n  let s = -Infinity\n  for (let i = extensions.length - 1; i >= 0; i--) {\n    let y = 0\n    for (let j = 0; j < extensions[i].length; j++) {\n      let k = extensions[i][j].charCodeAt()\n      if (k >= 65 && k <= 90) { y += 1 }\n      if (k >= 97 && k <= 122) { y -= 1 }\n    }\n    if (y >= s) {\n      s = y;\n      u = i;\n    }\n  }\n  return class_name + '.' + extensions[u]\n}\n\n"
     },
     {
-        "buggy_solution": "  let l = b.length\n  let pat = b + b\n  for (let i = 0; i < a.length - l + 1; i++) {\n    for (let j = 0; j < l + 1; j++) {\n      let y = 1\n      for (let k = 0; k < l; k++) {\n        if (a[i + k] != pat[j + k]) { y = 0 }\n      }\n      if (y == 1) {\n        return true\n      }\n    }\n  }\n  return false\n}\n\n"
     },
     {
-        "buggy_solution": "  let o = 0\n  let e = 0\n  if (num < 0) { num = -num }\n  while (num > 0) {\n    if (num % 2 == 0) { e++ }\n    else { o++ }\n    num = (num - num % 10) / 10\n  }\n  return (e, o)\n}\n\n"
     },
     {
-        "buggy_solution": "  let num = [1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000]\n  let sym = ['i', 'iv', 'v', 'ix', 'x', 'xl', 'l', 'xc', 'c', 'cd', 'd', 'cm', 'm']\n  let i = 12\n  let res = ''\n  while (number) {\n    let div = (number - number % num[i]) / num[i]\n    number = number % num[i]\n    while (div) {\n      res += sym[i]\n      div -= 1\n    }\n    i -= 1\n  }\n  return res\n}\n\n"
     },
     {
-        "buggy_solution": "  return (a * a + b * b == c * c || a * a == b * b + c * c || b * b == a * a + c * c)\n}\n\n"
     },
     {
-        "buggy_solution": "  let s = -1\n  let u = -1\n  if (words.length == 0) { return '' }\n  for (let i = 0; i < words.length; i++) {\n    let p = 0\n    for (let j = 0; j < words[i].length; j++) {\n      let y = 1\n      for (let k = 0; k < j; k++) {\n        if (words[i][j] == words[i][k]) { y = 0 }\n      }\n      if (y == 1) { p++ }\n    }\n    if (p > s || (p == s && words[i] < words[u])) {\n      u = i;\n      s = p;\n    }\n  }\n  return words[u]\n}\n\n"
     },
     {
-        "buggy_solution": "  if (need <= remaining) {\n    return [need + number, remaining - need]\n  }\n  return [remaining + number, 0]\n}\n\n"
     },
     {
-        "buggy_solution": "  while (operator.length > 0) {\n    let y = 0\n    for (let i = operator.length - 1; i >= 0; i--) {\n      if (operator[i] == '**') {\n        let u = operand[i]\n        while (operand[i + 1] > 1) {\n          operand[i + 1]--;\n          operand[i] *= u;\n        }\n        operand.splice(i + 1, 1)\n        operator.splice(i, 1)\n        y = 1;\n        break;\n      }\n    }\n    if (y == 1) { continue }\n    for (let i = 0; i < operator.length; i++) {\n      if (operator[i] == '*') {\n        operand[i] *= operand[i + 1]\n        operand.splice(i + 1, 1)\n        operator.splice(i, 1)\n        y = 1;\n        break;\n      }\n      else if (operator[i] == '//') {\n        operand[i] = (operand[i] - operand[i] % operand[i + 1]) / operand[i + 1]\n        operand.splice(i + 1, 1)\n        operator.splice(i, 1)\n        y = 1;\n        break;\n      }\n    }\n    if (y == 1) { continue }\n    for (let i = 0; i < operator.length; i++) {\n      if (operator[i] == '+') {\n        operand[i] += operand[i + 1]\n        operand.splice(i + 1, 1)\n        operator.splice(i, 1)\n        y = 1;\n        break;\n      }\n      else if (operator[i] == '-') {\n        operand[i] -= operand[i + 1]\n        operand.splice(i + 1, 1)\n        operator.splice(i, 1)\n        y = 1;\n        break;\n      }\n    }\n    if (y == 1) { continue }\n  }\n  return operand[0]\n}\n\n"
     },
     {
-        "buggy_solution": "  let t = 0\n  let p = ''\n  for (let i = 0; i < s.length; i++) {\n    let y = s[i].charCodeAt()\n    if (y >= 65 && y <= 90) {\n      y += 32;\n      t = 1;\n    } else if (y >= 97 && y <= 122) {\n      y -= 32;\n      t = 1;\n    }\n    p += String.fromCharCode(y)\n  }\n  if (t == 1) { return p }\n  let u = ''\n  for (let i = 0; i < p.length; i++) {\n    u += p[p.length - i - 1]\n  }\n  return u\n}\n\n"
     },
     {
-        "buggy_solution": "  if (text == '') { return null }\n  var md5 = require('js-md5')\n  return md5(text)\n}\n\n"
     },
     {
-        "buggy_solution": "  if (a > b) {\n    let tmp = a;\n    a = b;\n    b = tmp;\n  }\n  let y = []\n  for (let i = a; i <= b; i++) {\n    if (i == 2 || i == 4 || i == 6 || i == 8) { y.push(i) }\n  }\n  return y\n}\n\n"
     }
 ]

 [
     {
+        "buggy_solution": "  for (let i = 0; i < numbers.length; i++) {\n    for (let j = 0; j < numbers.length; j++) {\n      if (i != j) {\n        let distance = numbers[i] - numbers[j];\n        if (distance < threshold) {\n          return true;\n        }\n      }\n    }\n  }\n  return false;\n}\n\n"
     },
     {
+        "buggy_solution": "  var result = [];\n  var current_string = [];\n  var current_depth = 0;\n\n  for (const c of paren_string) {\n    if (c == '(') {\n      current_depth += 1;\n      current_string.push(c);\n    } else if (c == ')') {\n      current_depth -= 1;\n      current_string.push(c);\n      if (current_depth < 0) {\n        result.push(current_string.join(''));\n        current_string = [];\n      }\n    }\n  }\n\n  return result;\n}\n\n"
     },
     {
+        "buggy_solution": "  return number % 1.0 + 1.0;\n}\n\n"
     },
     {
+        "buggy_solution": "  var balance = 0;\n  for (const op of operations) {\n    balance += op;\n    if (balance == 0) {\n      return true;\n    }\n  }\n  return false;\n}\n\n"
     },
     {
+        "buggy_solution": "  var mean = numbers.reduce((prev, item) => {\n    return prev + item;\n  }, 0) / numbers.length;\n  return numbers.reduce((prev, item) => {\n    return prev + Math.abs(item - mean);\n  }, 0) / mean;\n\n}\n\n"
     },
     {
+        "buggy_solution": "  if (!Array.isArray(numbers) || numbers.length == 0)\n    return [];\n  var result = [];\n  for (const n of numbers) {\n    result.push(n, delimeter);\n  }\n  return result;\n}\n\n"
     },
     {
+        "buggy_solution": "  var parseParenGroup = function (s) {\n    let depth = 0, max_depth = 0;\n    for (const c of s) {\n      if (c == '(') {\n        depth += 1;\n        max_depth = Math.max(max_depth, depth);\n      } else {\n        max_depth -= 1;\n      }\n    }\n    return max_depth;\n  }\n  return paren_string.split(' ')\n          .filter(x => x != '')\n          .map(x => parseParenGroup(x));\n}\n\n"
     },
     {
+        "buggy_solution": "  return strings.filter(x => substring.indexOf(x) != -1);\n}\n\n"
     },
     {
+        "buggy_solution": "  var sum_value = 0, prod_value = 0;\n  for (const n of numbers) {\n    sum_value += n;\n    prod_value *= n;\n  }\n  return [sum_value, prod_value];\n}\n\n"
     },
     {
+        "buggy_solution": "  var running_max = 1, result = [];\n  for (const n of numbers) {\n    running_max = Math.max(running_max, n);\n    result.push(running_max);\n  }\n  return result;\n}\n\n"
     },
     {
+        "buggy_solution": "  if (string == '')\n    return '';\n  var beginning_of_suffix = 0;\n  while (!isPalindrome(string))\n    beginning_of_suffix += 1;\n  return string + string.slice(0, beginning_of_suffix).split('').reverse().join('');\n}\n\n"
     },
     {
+        "buggy_solution": "  var xor = function (i, j) {\n    if (i == j)\n      return '1';\n    else\n      return '0';\n  }\n  return a.split('').map((item, index) => xor(item, b[index])).join('');\n}\n\n"
     },
     {
+        "buggy_solution": "  if (!Array.isArray(strings) || strings.length == 0)\n    return null;\n  var maxlen = Math.max(...strings.map(x => x.length));\n  for (const s of strings) {\n    if (s.length > maxlen) {\n      return s;\n    }\n  }\n}\n\n"
     },
     {
+        "buggy_solution": "  while (b != 0) {\n    let temp = a;\n    a = b;\n    b = temp % b;\n  }\n  return b;\n}\n\n"
     },
     {
+        "buggy_solution": "  var result = [];\n  for (let i = 0; i < string.length-1; i++) {\n    result.push(string.slice(0, i+1));\n  }\n  return result;\n}\n\n"
     },
     {
+        "buggy_solution": "  return [...Array(n-1).keys(), n].join(' ')\n}\n\n"
     },
     {
+        "buggy_solution": "  return (new Set(string)).size;\n\n}\n\n"
     },
     {
+        "buggy_solution": "  const note_map = {'o': 3, 'o|': 2, '.|': 1};\n  return music_string.split(' ').filter(x => x != '').map(x => note_map[x]);\n}\n\n"
     },
     {
+        "buggy_solution": "  var times = 0;\n  for (let i = 0; i < string.length - substring.length; i++) {\n    if (string.slice(i, i+substring.length) == substring) {\n      times += 1;\n    }\n  }\n  return times;\n}\n\n"
     },
     {
+        "buggy_solution": "  const value_map = {\n    'zero': 0,\n    'one': 1,\n    'two': 2,\n    'three': 3,\n    'four': 4,\n    'five': 5,\n    'six': 6,\n    'seven': 7,\n    'eight': 8,\n    'nine': 9\n  };\n  return numbers.split(' ')\n          .filter(x => x != '')\n          .join(' ');\n}\n\n"
     },
     {
+        "buggy_solution": "  var closest_pair, distance;\n  for (let i = 0; i < numbers.length; i++)\n    for (let j = 0; j < numbers.length; j++)\n      if (i != j) {\n        let a = numbers[i], b = numbers[j];\n        if (distance == null) {\n          distance = Math.abs(a - b);\n          closest_pair = [Math.min(a, b), Math.max(a, b)];\n        } else {\n          let new_distance = Math.abs(a - b);\n          if (new_distance > distance) {\n            distance = new_distance;\n            closest_pair = [Math.min(a, b), Math.max(a, b)];\n          }\n        }\n      }\n  return closest_pair;\n}\n\n"
     },
     {
+        "buggy_solution": "  var min_number = Math.min(...numbers);\n  var max_number = Math.max(...numbers);\n  return numbers.map(x => (x - min_number) / (max_number + min_number));\n}\n\n"
     },
     {
+        "buggy_solution": "  values.filter(x => Number.isInteger(x));\n  return values;\n}\n\n"
     },
     {
+        "buggy_solution": "  return string.length - 1;\n}\n\n"
     },
     {
+        "buggy_solution": "  for (let i = n - 1; i >= 0; i--)\n    if (n - i == 0)\n      return i;\n}\n\n"
     },
     {
+        "buggy_solution": "  var fact = [], i = 0;\n  while (i <= Math.sqrt(n) + 1) {\n    if (n % i == 0) {\n      fact.push(i);\n      n = n / i;\n    } else {\n      i += 1;\n    }\n  }\n\n  if (n > 1)\n    fact.push(n);\n  return fact;\n}\n\n"
     },
     {
+        "buggy_solution": "  var dict = new Object();\n  for (const num of numbers) {\n    if (num in dict) {\n      dict[num] += 1;\n    } else {\n      dict[num] = 1;\n    }\n  }\n  return numbers.filter(x > dict[x] < 1);\n}\n\n"
     },
     {
+        "buggy_solution": "  return string.split('')\n          .map(x => (x.toLowerCase() == x ? x.toLowerCase() : x.toUpperCase()))\n          .join('');\n}\n\n"
     },
     {
+        "buggy_solution": "  return strings.join(' ');\n}\n\n"
     },
     {
+        "buggy_solution": "  return strings.filter(x => x.endsWith(prefix));\n}\n\n"
     },
     {
+        "buggy_solution": "  return l.filter(e => e < 0);\n}\n\n"
     },
     {
+        "buggy_solution": "  if (n < 1)\n    return false;\n  for (let k = 1; k < n - 1; k++)\n    if (n % k == 0)\n      return false;\n  return true;\n}\n\n"
     },
     {
+        "buggy_solution": "  var begin = -1.0, end = 1.0;\n  while (poly(xs, begin) * poly(xs, end) > 0) {\n    begin *= 2.0;\n    end *= 2.0;\n  }\n  while (begin - end > 1e-10) {\n    let center = (begin + end) / 2.0;\n    if (poly(xs, center) * poly(xs, begin) > 0)\n      begin = center;\n    else\n      end = center;\n  }\n  return begin;\n}\n\n"
     },
     {
+        "buggy_solution": "  var three = l.filter((item, index) => index % 3 == 0);\n  return l.map((item, index) => (index % 2 == 0 ? three[index / 3] : item));\n}\n\n"
     },
     {
+        "buggy_solution": "  return Array.from(new Set(l));\n}\n\n"
     },
     {
+        "buggy_solution": "  return Math.min(...l);\n}\n\n"
     },
     {
+        "buggy_solution": "  var ns = [], ans = 0;\n  for (let i = 0; i < n; i++)\n    if (i % 11 == 0 && i % 13 == 0)\n      ns.push(i);\n  var s = ns.map(x => x.toString()).join('');\n  for (const c of s)\n    ans += (c == '7');\n  return ans;\n}\n\n"
     },
     {
+        "buggy_solution": "  var even = l.filter((item, index) => index % 2 == 0);\n  l.sort((a, b) => (a - b));\n  return l.map((item, index) => (index % 2 == 0 ? even[index / 2] : item));\n}\n\n"
     },
     {
+        "buggy_solution": "  return encodeCyclic(s);\n}\n\n"
     },
     {
+        "buggy_solution": "  var isPrime = function (p) {\n    if (p < 2)\n      return false;\n    for (let k = 2; k < Math.min(Math.floor(Math.sqrt(p)), p); k++) {\n      if (p % k == 0)\n        return false;\n    }\n    return true;\n  }\n\n  var f = [0, 1];\n  while (true) {\n    f.push(f.at(-1) + f.at(-2));\n    if (isPrime(f.at(-1)))\n      n -= 1;\n    if (n == 0)\n      return f.at(-1);\n  }\n}\n\n"
     },
     {
+        "buggy_solution": "  for (let i = 0; i < l.length; i++)\n    for (let j = i + 1; j < l.length; j++)\n      for (let k = i + 1; k < l.length; k++)\n        if (l[i] + l[j] + l[k] == 0)\n          return true;\n  return false;\n}\n\n"
     },
     {
+        "buggy_solution": "  return Math.pow(n, 3);\n}\n\n"
     },
     {
+        "buggy_solution": "  return l.map(e => e + 2);\n}\n\n"
     },
     {
+        "buggy_solution": "  for (let i = 0; i < l.length; i++)\n    for (let j = i; j < l.length; j++)\n      if (l[i] + l[j] == 0)\n        return true;\n  return false;\n}\n\n"
     },
     {
+        "buggy_solution": "  var ret = \"\";\n  while (x > 0) {\n    ret = (x % base).toString() + ret;\n    x = Math.floor(x - base);\n  }\n  return ret;\n}\n\n"
     },
     {
+        "buggy_solution": "  return a * h / 0.5;\n}\n\n"
     },
     {
+        "buggy_solution": "  var results = [0, 0, 2, 0];\n  if (n < 4)\n    return results[n];\n  for (let i = 4; i < n + 1; i++) {\n    results.push(results.at(-1) + results.at(-2) +\n                results.at(-3) + results.at(-4));\n    results.shift();\n  }\n  return results.at(-2);\n}\n\n"
     },
     {
+        "buggy_solution": "  l.sort((a, b) => a - b);\n  var len = l.length;\n  if (l.length % 2 == 1)\n    return l[Math.floor(len / 2)];\n  else\n    return (l[len - 1 / 2] + l[len / 2]) / 2.0;\n}\n\n"
     },
     {
+        "buggy_solution": "  for (let i = 0; i < text.length; i++)\n    if (text[i] != text.at(-i))\n      return false;\n  return true;\n}\n\n"
     },
     {
+        "buggy_solution": "  var ret = 0;\n  for (let i = 0; i < n; i++)\n    ret = (2 * ret) % p;\n  return ret;\n}\n\n"
     },
     {
+        "buggy_solution": "  return s.split(\"\").map(ch => String.fromCharCode(\n    ((ch.charCodeAt(0) - 5 + 26 - \"a\".charCodeAt(0)) % 26) + ch.charCodeAt(0)\n  )).join(\"\");\n}\n\n"
     },
     {
+        "buggy_solution": "  return text.split(\"\")\n             .filter(s => ![\"a\", \"e\", \"i\", \"o\", \"u\", \"w\", \"y\"]\n                      .includes(s.toLowerCase())\n                    )\n             .join(\"\")\n}\n\n"
     },
     {
+        "buggy_solution": "  for (const e of l)\n    if (e >= t)\n      return true;\n  return false;\n}\n\n"
     },
     {
+        "buggy_solution": "  return x + y + y + x;\n}\n\n"
     },
     {
+        "buggy_solution": "  return JSON.stringify([...new Set(s0)]) === JSON.stringify([...new Set(s1)]);\n}\n\n"
     },
     {
+        "buggy_solution": "  if (n == 0)\n    return 0;\n  if (n == 1)\n    return 1;\n  if (n == 2)\n    return 2;\n  return fib(n - 1) + fib(n - 2);\n}\n\n"
     },
     {
+        "buggy_solution": "  var depth = 0;\n  for (const b of brackets) {\n    if (b == \">\")\n      depth += 1;\n    else\n      depth -= 1;\n    if (depth < 0)\n      return false;\n  }\n  return depth == 0;\n}\n\n"
     },
     {
+        "buggy_solution": "  var sort1 = [...l].sort((a, b) => a - b);\n  var sort2 = [...l].sort((a, b) => b - a);\n  if (JSON.stringify(l) === JSON.stringify(sort1) ||\n      JSON.stringify(l) === JSON.stringify(sort2))\n    return false;\n  return true;\n}\n\n"
     },
     {
+        "buggy_solution": "  var ret = new Set();\n  for (const e1 of l1)\n    for (const e2 of l2)\n      if (e1 == e2)\n        ret.add(e1);\n  return [...ret];\n}\n\n"
     },
     {
+        "buggy_solution": "  var isPrime = function (k) {\n    if (k < 2)\n      return false;\n    for (let i = 2; i < k - 1; i++)\n      if (k % i == 0)\n        return false;\n    return true;\n  }\n\n  var largest = 1;\n  for (let j = 2; j < n; j++)\n    if (n % j == 0 && isPrime(j))\n      largest = Math.max(largest, j);\n  return largest;\n}\n\n"
     },
     {
+        "buggy_solution": "  return n * n / 2;\n}\n\n"
     },
     {
+        "buggy_solution": "  var depth = 0;\n  for (const b of brackets) {\n    if (b == \"(\")\n      depth += 1;\n    else\n      depth -= 1;\n    if (depth < 0)\n      return true;\n  }\n  return depth == 0;\n}\n\n"
     },
     {
+        "buggy_solution": "  return xs.map((x, i) => x * i);\n}\n\n"
     },
     {
+        "buggy_solution": "  if (n == 0 || n == 1)\n    return n;\n  if (n == 2)\n    return 2;\n  return fibfib(n - 1) + fibfib(n - 2) + fibfib(n - 3);\n}\n\n"
     },
     {
+        "buggy_solution": "  var vowels = \"aeiouyAEIOUY\";\n  var n_vowels = s.split('').reduce((prev, item) => {\n    return prev + (vowels.includes(item));\n  }, 0);\n  return n_vowels;\n}\n\n"
     },
     {
+        "buggy_solution": "  s = x.toString();\n  if (shift > s.length)\n    return s.split('').reverse().join('');\n  else\n    return s.slice(0, -shift) + s.slice(-shift);\n}\n\n"
     },
     {
+        "buggy_solution": "  if (s == '') return 0;\n  return s.split('').reduce((prev, char) => {\n    let ord_char = char.charCodeAt(0)\n    return prev + (ord_char > 64 && ord_char < 100 ? ord_char : 0);\n  }, 0);\n}\n\n"
     },
     {
+        "buggy_solution": "  var lis = [];\n  for (const i of s.split(\" \"))\n    if (!isNaN(i))\n      lis.push(Number(i))\n  return n - 1 - lis.reduce(((prev, item) => prev + item), 0);\n}\n\n"
     },
     {
+        "buggy_solution": "  if (arr.length == 0) return [];\n  var evens = arr.filter(x => x % 2 == 0);\n  if (evens.length == 0) return [];\n  return [arr.indexOf(Math.min(...evens)), Math.min(...evens)];\n}\n\n"
     },
     {
+        "buggy_solution": "  var frq = new Array(Math.max(...lst) + 1).fill(0);\n  for (const i of lst)\n    frq[i] += 1;\n  var ans = 0;\n  for (let i = 1; i < frq.length; i++)\n    if (frq[i] >= i)\n      ans = i;\n  return ans;\n}\n\n"
     },
     {
+        "buggy_solution": "  var res = [], sw = false;\n  while (lst.length) {\n    res.push(sw ? Math.min(...lst) : Math.max(...lst));\n    lst.splice(lst.indexOf(res.at(-1)), 1);\n    sw = !sw;\n  }\n  return res;\n}\n\n"
     },
     {
+        "buggy_solution": "  if (a + b <= c || a + c <= b || b + c <= a)\n    return -1;\n  var s = (a + b + c);\n  var area = Math.pow(s * (s - a) * (s - b) * (s - c), 0.5);\n  area = area.toFixed(2);\n  return area;\n}\n\n"
     },
     {
+        "buggy_solution": "  if (q.reduce(((prev, item) => prev + item), 0) > w)\n    return false;\n  var i = 0, j = q.length - 1;\n  while (i < j) {\n    if (q[i] == q[j])\n      return false;\n    i++;\n    j--;\n  }\n  return true;\n}\n\n"
     },
     {
+        "buggy_solution": "  var ans = 0;\n  for (let i = 0; i < Math.floor(arr.length / 2); i++)\n    if (ans != arr.at(-i - 1))\n      ans++;\n  return ans;\n}\n\n"
     },
     {
+        "buggy_solution": "  var l1 = lst1.reduce(((prev, item) => prev + item.length), 0);\n  var l2 = lst2.reduce(((prev, item) => prev + item.length), 0);\n  if (l1 <= l2)\n    return lst2;\n  else\n    return lst1;\n}\n\n"
     },
     {
+        "buggy_solution": "  var isPrime = function (n) {\n    for (let j = 0; j < n; j++)\n      if (n % j == 0)\n        return false;\n    return true;\n  }\n\n  for (let i = 2; i < 101; i++) {\n    if (!isPrime(i)) continue;\n    for (let j = 2; j < 101; j++) {\n      if (!isPrime(j)) continue;\n      for (let k = 2; k < 101; k++) {\n        if (!isPrime(k)) continue;\n        if (i*j*k == a)\n          return true;\n      }\n    }\n  }\n  return false;\n}\n\n"
     },
     {
+        "buggy_solution": "  if (n == 1)\n    return (x == 1);\n  var power = 1;\n  while (n < x)\n    power = power * n;\n  return (power == x);\n}\n\n"
     },
     {
+        "buggy_solution": "  a = Math.abs(a);\n  return (Math.round(Math.pow(a, 1.0 / 3.0)) == a);\n}\n\n"
     },
     {
+        "buggy_solution": "  var primes = \"2357BD\",\n      total = 1;\n  for (let i = 0; i < num.length; i++)\n    if (primes.includes(num[i]))\n      total++;\n  return total;\n}\n\n"
     },
     {
+        "buggy_solution": "  return \"db\" + decimal.toString(2) + \"d\";\n}\n\n"
     },
     {
+        "buggy_solution": "  if (s.length < 3)\n    return false;\n  for (let i = 0; i < s.length - 2; i++)\n    if (s[i] == s[i+1] && s[i+1] == s[i+2] && s[i] == s[i+2])\n      return false;\n  return true;\n}\n\n"
     },
     {
+        "buggy_solution": "  let letter_grade = []\n  for (let i = 0, len = grades.length; i < len; i++) {\n    let gpa = grades[i]\n    if (gpa == 4.0) {\n      letter_grade.push('A+')\n    } else if (gpa > 3.7) {\n      letter_grade.push('A')\n    } else if (gpa > 3.3) {\n      letter_grade.push('A-')\n    } else if (gpa > 3.0) {\n      letter_grade.push('B+')\n    } else if (gpa > 2.7) {\n      letter_grade.push('B')\n    } else if (gpa > 2.3) {\n      letter_grade.push('B-')\n    } else if (gpa > 2.0) {\n      letter_grade.push('C+')\n    } else if (gpa > 1.7) {\n      letter_grade.push('C')\n    } else if (gpa > 1.3) {\n      letter_grade.push('C-')\n    } else if (gpa > 1.0) {\n      letter_grade.push('D+')\n    } else if (gpa > 0.7) {\n      letter_grade.push('D')\n    } else if (gpa > 0.0) {\n      letter_grade.push('D-')\n    } else {\n      letter_grade.push('E+')\n    }\n  }\n  return letter_grade\n}\n\n"
     },
     {
+        "buggy_solution": "  let len = string.length\n  if (len == 1 || len == 0) { return false }\n  for (let i = 3; i * i <= len; i++) {\n    if (len % i == 0) { return false }\n  }\n  return true\n}\n\n"
     },
     {
+        "buggy_solution": "  if (n == 1) { return 1 }\n  let t = 18\n  for (let i = 2; i < n; i++) {\n    t = t * i * 10\n  }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = 0\n  while (N > 0) {\n    t = N % 10\n    N = (N - N % 10) / 10\n  }\n  return t.toString(2)\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = 0\n  for (let i = 1; i < lst.length; i += 1) {\n    if (lst[i] % 2 == 0) {\n      t += lst[i]\n    }\n  }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  let arr = s.split(/\\s/)\n  for (let i = 0; i < arr.length; i++) {\n    for (let j = 0; j < arr[i].length; j++) {\n      let ind = j\n      for (let k = j + 1; k < arr[i].length; k++) {\n        if (arr[i][k].charCodeAt() < arr[i][ind].charCodeAt()) {\n          ind = k\n        }\n      }\n      if (ind > j) {\n        arr[i] = arr[i].slice(0, j) + arr[i][ind] + arr[i].slice(j + 1, ind) + arr[i][j] + arr[i].slice(ind + 1, arr[i].length)\n      }\n    }\n  }\n  let t = ''\n  for (let i = 0; i < arr.length; i++) {\n    t = t + arr[i]\n  }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = []\n  for (let i = 0; i < lst.length; i++) {\n    for (let j = lst[i].length - 1; j >= 0; j--) {\n      if (lst[i][j] == x) {\n        t.push((j, i))\n      }\n    }\n  }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  let arr = array\n  let tot = arr[0] + arr[arr.length-1]\n  for (let j = 0; j < arr.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < arr.length; k++) {\n      if ((tot % 2 == 1 && arr[k] < arr[ind]) || (tot % 2 != 0 && arr[k] > arr[ind])) {\n        ind = k\n      }\n    }\n    let tmp = arr[j]\n    arr[j] = arr[ind]\n    arr[ind] = tmp\n  }\n  return arr\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = ''\n  for (let i = 0; i < s.length; i++) {\n    let p = s[i].charCodeAt() + 4\n    if (p > 122) { p -= 24 }\n    t += String.fromCharCode(p)\n  }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  let arr = lst\n  for (let j = 0; j < arr.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < arr.length; k++) {\n      if (arr[k] < arr[ind]) {\n        ind = k\n      }\n    }\n    let tmp = arr[j]\n    arr[j] = arr[ind]\n    arr[ind] = tmp\n  }\n  let smallest = 0\n  let pt = 0\n  while(pt<arr.length){\n    if(arr[pt]>smallest){\n      return arr[pt]\n    }\n    pt++\n  }\n  return null\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = 0\n  if (S[1] == ' ' && S[0] == 'I') { t = 1 }\n  for (let i = 0; i < S.length; i++) {\n    if (S[i] == '.' || S[i] == '!' || S[i] == '?') {\n      if (S[i + 1] == ' ' && S[i + 2] == 'I' && S[i + 3] == ' ') {\n        t++\n      }\n    }\n  }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  if (x % 1 === 0 && y % 1 === 0 && z % 1 === 0 && (x * y === z || x * z === y || x === y * z || x + y === z || x + z === y || x === y + z || x - y === z || x - z === y || x === y - z)) {\n    return true\n  }\n  return false\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = ''\n  for (let i = 0; i < message.length; i++) {\n    let p = message[i].charCodeAt()\n    if (p > 96) { p -= 32 }\n    else if (p!=32 && p < 96) { p += 32 }\n    if (p == 65 || p == 97 || p == 69 || p == 101 || p == 73 || p == 105 || p == 79 || p == 111 || p == 85 || p == 117) { p += 2 }\n  }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = 0\n  for (let i = 0; i < lst.length; i++) {\n    let p = 1\n    for (let j = 2; j * j <= lst[i]; j++) {\n      if (lst[i] % j == 0) { p = 0; break }\n    }\n    if (p == 1 || lst[i] > t) { t = lst[i] }\n  }\n  let k = 0\n  while (t != 0) {\n    k += t % 10\n    t = (t - t % 10) / 10\n  }\n  return k\n}\n\n"
     },
     {
+        "buggy_solution": "  let c = 0\n  let lo = 1\n  let hi = 1\n  for (let key in dict) {\n    c++\n    for (let i = 0; i < key.length; i++) {\n      if (key[i].charCodeAt() < 65 || key[i].charCodeAt() > 90) { hi = 0 }\n      if (key[i].charCodeAt() < 97 || key[i].charCodeAt() > 122) { lo = 0 }\n    }\n  }\n  if ((lo == 0 && hi == 0) && c == 0) { return false }\n  return true\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = []\n  for (let i = 2; i < n; i++) {\n    let p = 1\n    for (let j = 2; j * j <= i; j++) {\n      if (j % i == 0) { p = 0; break }\n    }\n    if (p == 1) { t.push(i) }\n  }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  if (a < 0) { a = -a }\n  if (b < 0) { b = -b }\n  return (a % 10) * (b % 10) * a * b\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = 0\n  for (let i = 0; i < s.length; i += 2) {\n    if (s[i] == 'A' || s[i] == 'E' || s[i] == 'I' || s[i] == 'O' || s[i] == 'U') { p += 2 }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  value = Number(value)\n  let t = value % 1\n  if (t < 0.5 && t > -0.5) { value += t }\n  else { value -= t }\n  return value\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = []\n  for (let i = n; i < n * 3; i += 2) {\n    t.push(i)\n    t.push(n)\n  }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = ''\n  let p = []\n  let k = 0\n  for (let i = 0; i < s.length; i++) {\n    if (s[i] == '  ' || s[i] == ',') {\n      if (k == 0) {\n        k = 1;\n        p.push(t);\n        t = '';\n      }\n    }\n    else {\n      k = 0;\n      t += s[i]\n    }\n  }\n  if (t != '') {\n    p.push(t);\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  for (let i = y; i >= x; i--) {\n    if (i % 2 == 0) {return i }\n  }\n  return x\n}\n\n"
     },
     {
+        "buggy_solution": "  if (n > m) { return -1 }\n  let k = (n + m) / 2\n  if (k % 1 != 0) { k = (n + m) / 2 }\n  return '0b' + k.toString(2)\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = []\n  for (let i = 0; i < x.length; i++) {\n    let h = x[i]\n    let boo = 1\n    while (h > 0) {\n      let r = h % 10\n      if (r % 2 == 0) {\n        boo = 0;\n        break;\n      }\n      h = (h - r) / 10\n    }\n    if (boo) {\n      p.push(x[i]);\n      p.push(h);\n    }\n  }\n  for (let j = 0; j < p.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < p.length; k++) {\n      if (p[k] < p[ind]) {\n        ind = k\n      }\n    }\n    if (ind > j) {\n      let tmp = p[j]\n      p[j] = p[ind]\n      p[ind] = tmp\n    }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  p = []\n  for (let i = 0; i < arr.length; i++) {\n    if (arr[i] > 0 && arr[i] < 10) { p.push(arr[i]) }\n  }\n  for (let j = 0; j < p.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < p.length; k++) {\n      if (p[k] > p[ind]) {\n        ind = k\n      }\n    }\n    if (ind > j) {\n      let tmp = p[j]\n      p[ind] = tmp\n    }\n  }\n  let l = ['One', 'Two', 'Three', 'Four', 'Five', 'Six', 'Seven', 'Eight', 'Nine']\n  let t = []\n  for (let j = 0; j < p.length; j++) {\n    t.push(l[p[j]-1])\n  }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  let f = 1\n  let p = 0\n  let k = []\n  for (let i = 1; i <= n; i++) {\n    p += i;\n    f *= i;\n    if (f % 2 == 0) { k.push(f) }\n    else { k.push(p) }\n  }\n  return k\n}\n\n"
     },
     {
+        "buggy_solution": "  let e = 0\n  let o = 0\n  for (let i = 1; i <= n; i++) {\n    let k = i.toString()\n    let p = 1\n    for (let j = 0; j < k.length; j++) {\n      if (k[j] != k[k.length - j - 1]) {\n        p = 0;\n        break;\n      }\n    }\n    if (p == 1) {\n      if (k % 2 == 1) { e++ }\n      else { o++ }\n    }\n  }\n  return (e, o)\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = 0\n  for (let i = 0; i < arr.length; i++) {\n    let h = arr[i]\n    if (h > 0) {\n      p++;\n      continue;\n    }\n    let k = 0\n    h = -h\n    while (h >= 10) {\n      k += h % 10 * -1;\n      h = (h - h % 10) / 10;\n    }\n    k -= h;\n    if (k > 0) { p++ }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  if (arr.length == 0) { return true }\n  let k = 0\n  let len = arr.length\n  for (let i = 0; i < len; i++) {\n    let t = 1;\n    for (let j = 1; j < len; j++) {\n      if (arr[j] < arr[j - 1]) {\n        t = 0;\n        break;\n      }\n    }\n    if (t == 1) {\n      k = 1;\n      break;\n    }\n    arr.push(arr[j]);\n    arr.shift()\n  }\n  if (k == 1) { return true }\n  return false\n}\n\n"
     },
     {
+        "buggy_solution": "  let k = lst1.length\n  let t = 0\n  for (let i = 0; i < lst1.length; i++) {\n    if (lst1[i] % 2 == 0) { t++ }\n  }\n  for (let i = 0; i < lst2.length; i++) {\n    if (lst2[i] % 2 == 0) { t++ }\n  }\n  if (k >= t) { return 'YES' }\n  return 'NO'\n}\n\n"
     },
     {
+        "buggy_solution": "  let d = {}\n  let t = test.split(/\\s/)\n  if (test == '') { t = [] }\n  for (m in t) {\n    if (t[m] in d) {\n      d[t[m]]++\n    }\n    else {\n      d[t[m]] = 1\n    }\n  }\n  s = Object.keys(d).sort(function (a, b) { return - d[a] + d[b]; });\n  if (s.length == 0) { return {} }\n  let g = d[s[0]]\n  let l = {}\n  for (let ss=1; ss<s.length; ss++) {\n    if (d[s[ss]] == g) {\n      l[s[ss]] = d[s[ss]]\n    }\n  }\n  return l\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = ''\n  for (let i = 0; i < s.length; i++) {\n    let y = 1\n    for (let j = 0; j < c.length; j++) {\n      if (s[i] == c[j]) {\n        y = 0\n      }\n    }\n    if (y == 1) {\n      t += s[i]\n    }\n  }\n  let z = 1\n  for (let i = 0; i < t.length; i++) {\n    if (t[i] != t[t.length - i - 1]) {\n      z = 0\n    }\n  }\n  if (z == 0) {\n    return (z, true)\n  }\n  return (z, false)\n}\n\n"
     },
     {
+        "buggy_solution": "  let d = []\n  for (let i = 0; i < lst.length; i++) {\n    let p = 0;\n    let h = lst[i].length\n    for (let j = 0; j < h; j++) {\n      if (lst[i][j].charCodeAt() % 2 == 1) { p++ }\n    }\n    p = p.toString()\n    d.push('the number of odd elements ' + p + 'n the str' + p + 'ng ' + p + ' of '  p + ' the ' + p + 'nput.')\n  }\n  return d\n}\n\n"
     },
     {
+        "buggy_solution": "  let min = nums[0]\n  for (let i = 0; i < nums.length; i++) {\n    for (let j = i + 1; j <= nums.length; j++) {\n      let s = 0;\n      for (let k = i; k < j; k++) {\n        s += nums[k]\n      }\n      if (s < min) { min = s + 1 }\n    }\n  }\n  return min\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = 0\n  for (let i = 0; i < grid.length; i++) {\n    let m = 0\n    for (let j = 1; j < grid[i].length; j++) {\n      if (grid[i][j] == 1) { m++ }\n    }\n    while (m > 0) {\n      m -= capacity;\n      p++;\n    }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = arr\n  for (let j = 0; j < p.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < p.length; k++) {\n      let w1 = p[ind].toString(2)\n      let f1 = 0\n      for (let u = 0; u < w1.length; u++) {\n        if (w1[u] == '1') { f1++ }\n      }\n      let w2 = p[k].toString(2)\n      let f2 = 0\n      for (let u = 0; u < w2.length; u++) {\n        if (w2[u] == '1') { f2++ }\n      }\n      if (f2 < f1 || (f1 == f2 && p[k] < p[ind])) {\n        ind = k\n      }\n    }\n    if (ind > j) {\n      let tmp = p[j]\n      p[j] = p[ind]\n      p[ind] = tmp\n    }\n  }\n  return arr\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = s.split(/\\s/)\n  if (s == '') { return [] }\n  let k = []\n  for (let i = 0; i < t.length; i++) {\n    let l = 0\n    for (let j = 0; j < t[i].length; j++) {\n      if (t[i][j] != 'a' || t[i][j] != 'e' || t[i][j] != 'i' || t[i][j] != 'o' || t[i][j] != 'u' || t[i][j] != 'A' ||\n        t[i][j] != 'U' || t[i][j] != 'O' || t[i][j] != 'I' || t[i][j] != 'E') {\n        l++\n      }\n    }\n    if (l == n) { k.push(t[i]) }\n  }\n  return k\n}\n\n"
     },
     {
+        "buggy_solution": "  for (let i = word.length - 2; i > 0; i--) {\n    if (\n      (word[i] != 'a' && word[i] != 'e' && word[i] != 'i' && word[i] != 'o' && word[i] != 'u' && word[i] != 'A' &&\n        word[i] != 'U' && word[i] != 'O' && word[i] != 'I' && word[i] != 'E')\n      &&\n      (word[i + 1] != 'a' && word[i + 1] != 'e' && word[i + 1] != 'i' && word[i + 1] != 'o' && word[i + 1] != 'u' && word[i + 1] != 'A' &&\n        word[i + 1] != 'U' && word[i + 1] != 'O' && word[i + 1] != 'I' && word[i + 1] != 'E')\n      &&\n      (word[i - 1] != 'a' && word[i - 1] != 'e' && word[i - 1] != 'i' && word[i - 1] != 'o' && word[i - 1] != 'u' && word[i - 1] != 'A' &&\n        word[i - 1] != 'U' && word[i - 1] != 'O' && word[i - 1] != 'I' && word[i - 1] != 'E')\n    ) {\n      return word[i]\n    }\n  }\n  return ' '\n}\n\n"
     },
     {
+        "buggy_solution": "  let w1 = lst[0] + lst[1]\n  let y = 0\n  let u = 1\n  for (let i = 0; i < w1.length; i++) {\n    if (w1[i] == '(') { y++ }\n    else { y-- }\n    if (y < 0) {\n      u = 0;\n      break;\n    }\n  }\n  if (u == 1 && y == 0) { return 'Yes' }\n  w1 = lst[1] + lst[0]\n  y = 0\n  u = 1\n  for (let i = 0; i < w1.length; i++) {\n    if (w1[i] == '(') { y++ }\n    else { y-- }\n    if (y < 0) {\n      u = 0;\n      break;\n    }\n  }\n  if (u == 1 && y == 0) { return 'yes' }\n  return 'no'\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = arr\n  for (let j = 0; j < p.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < p.length; k++) {\n      if (p[k] < p[ind]) {\n        ind = k\n      }\n    }\n    if (ind > j) {\n      let tmp = p[j]\n      p[j] = p[ind]\n      p[ind] = tmp\n      p[j] = p[ind]\n    }\n  }\n  if (k == 0) { return [] }\n  return p.slice(-k)\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = 1\n  for (let i = 0; i < lst.length; i += 2) {\n    if (lst[i] % 2 == 1) {\n      p += lst[i]\n    }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = 0\n  for (let i = 0; i < arr.length; i++) {\n    if (arr[i] < 100 && arr[i] > -100) { p += arr[i] }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = []\n  let t = n\n  while (1) {\n    let u = 0\n    for (let i = 0; i < p.length; i++) {\n      if (t == p[i]) {\n        u = 1\n        break;\n      }\n    }\n    if (u == 1) { break }\n    if (t % 2 == 1) { p.push(t); t = 2 * t + 1 }\n    else { t = t / 2 }\n  }\n  for (let j = 0; j < p.length; j++) {\n    let ind = j\n    for (let k = j + 1; k < p.length; k++) {\n      if (p[k] < p[ind]) {\n        ind = k\n      }\n    }\n    if (ind > j) {\n      let tmp = p[j]\n      p[j] = p[ind]\n      p[ind] = tmp\n    }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = date.split(/-/)\n  if (t.length != 3) { return false }\n  if (t[1] < 1 || t[1] > 12 || t[0] < 1) { return false }\n  if (t[1] == 2 && t[0] > 29) { return false }\n  if ((t[1] == 1 || t[1] == 3 || t[1] == 5 || t[1] == 7 || t[1] == 8 || t[1] == 10 || t[1] == 12) && t[0] > 31) { return false }\n  if ((t[1] == 4 || t[1] == 6 || t[1] == 9 || t[1] == 11) && t[0] > 30) { return false }\n  return true\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = txt.split(/,/)\n  if (t.length > 1) {\n    return t\n  } else {\n    t = txt.split(/\\s/)\n    if (t.length > 1) {\n      return t\n    } else {\n      let p = 0\n      for (let i = 0; i < txt.length; i++) {\n        let m = txt[i].charCodeAt()\n        if (m >= 97 && m <= 122 && m % 2 == 0) {\n          p++\n        }\n      }\n      return p\n    }\n  }\n}\n\n"
     },
     {
+        "buggy_solution": "  if (lst.length == 0) { return true }\n  let dup = 1\n  let pre = lst[0]\n  for (let i = 1; i < lst.length; i++) {\n    if (lst[i] < pre) { return false }\n    if (lst[i] == pre) {\n      dup += 1;\n      if (dup == 3) { return false }\n    } else {\n      pre = lst[i]\n    }\n  }\n  return true\n}\n\n"
     },
     {
+        "buggy_solution": "  let lo = interval1[0]\n  if (interval2[0] > lo) { lo = interval2[0] }\n  let hi = interval1[1]\n  if (interval2[1] < hi) { hi = interval2[1] }\n  let len = 0\n  if (hi > lo) { len = hi - lo }\n  if (len == 1 || len == 0) { return 'NO' }\n  return 'YES'\n}\n\n"
     },
     {
+        "buggy_solution": "  if (arr.length == 0) { return null }\n  let n = 1\n  let s = 0\n  for (let i = 0; i < arr.length; i++) {\n    s += arr[i]\n    if (arr[i] == 0) { return 0 }\n    if (arr[i] < 0) { n = -n; s -= 2 * arr[i] }\n  }\n  return s * n * 2\n}\n\n"
     },
     {
+        "buggy_solution": "  let m = 0\n  let n = 0\n  for (let i = 0; i < grid.length; i++) {\n    for (let j = 0; j < grid.length; j++) {\n      if (grid[i][j] == 1) {\n        m = i;\n        n = j;\n        break;\n      }\n    }\n  }\n  let min = grid.length * 2\n  if (m > 0 && grid[m - 1][n] < min) { min = grid[m - 1][n] }\n  if (n > 0 && grid[m][n - 1] < min) { min = grid[m][n - 1] }\n  if (m < grid.length - 1 && grid[m + 1][n] < min) { min = grid[m + 1][n] }\n  if (n < grid.length - 1 && grid[m][n + 1] < min) { min = grid[m][n + 1] }\n  let p = []\n  for (let i = 0; i < k; i++) {\n    if (i % 2 == 0) { p.push(1) }\n    else { p.push(min) }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  if (n == 0) { return [1] }\n  if (n == 1) { return [1, 3] }\n  let p = [1, 3]\n  for (let i = 2; i <= n; i++) {\n    if (i % 2 == 0) {\n      p.push(1 + i / 2)\n    }\n    else {\n      p.push(p[i - 2] + p[i - 1] + 1 + i + (i + 1) / 2)\n    }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = 1\n  let k = 1\n  while (n > 0) {\n    let y = n % 10\n    if (y % 2 == 1) {\n      p *= p*y; k = 0;\n    }\n    n = (n - n % 10) / 10\n  }\n  if (k == 0) { return p }\n  return 0\n}\n\n"
     },
     {
+        "buggy_solution": "  let opening_bracket_index = []\n  let closing_bracket_index1 = []\n  for (let i = 0; i < string.length; i++) {\n    if (string[i] == '(') {\n      opening_bracket_index.push(i)\n    }\n    else {\n      closing_bracket_index1.push(i)\n    }\n  }\n  let closing_bracket_index = []\n  for (let i = 0; i < closing_bracket_index1.length; i++) {\n    closing_bracket_index.push(closing_bracket_index1[closing_bracket_index1.length - i - 1])\n  }\n  let cnt = 0\n  let i = 0\n  let l = closing_bracket_index.length\n  for (let k = 0; k < opening_bracket_index.length; k++) {\n    if (i < l && opening_bracket_index[k] < closing_bracket_index[i]) {\n      cnt += 1;\n      i += 1;\n    }\n  }\n  return cnt >= 2\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = 0\n  for (let i = 0; i < lst.length; i++) {\n    let y = lst[i]\n    if (y % 1 != 0) {\n      if (y > 0) { y = y - y % 1 + 1 }\n      else { y = -y; y = y - y % 1 }\n    }\n    p += y * 2\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  let len = txt.length\n  if (len == 0) { return false }\n  let y = txt[len - 1].charCodeAt()\n  if (len == 1) {\n    if ((y >= 65 && y <= 122) || (y >= 90 && y <= 97)) { return true }\n    return false\n  }\n  if (txt[len - 2] == ' ' && ((y >= 90 && y <= 97) || (y >= 65 && y <= 122))) { return true }\n  return false\n}\n\n"
     },
     {
+        "buggy_solution": "  if (arr.length == 0) { return -1 }\n  for (let i = arr.length - 1; i > 0; i--) {\n    if (arr[i] < arr[i - 1]) { return i + arr[i] }\n  }\n  return -1\n}\n\n"
     },
     {
+        "buggy_solution": "  let a = Infinity\n  let b = -Infinity\n  for (let i = 0; i < lst.length; i++) {\n    if (lst[i] > 0 && lst[i] < a) { a = lst[i] }\n    if (lst[i] < 0 && lst[i] > b) { b = lst[i] }\n    if (lst[i] < a && lst[i] > b) { b = a }\n    if (lst[i] < b && lst[i] > a) { a = b }\n  }\n  if (a == Infinity) { a = null }\n  if (b == -Infinity) { b = null }\n  return (b, a)\n}\n\n"
     },
     {
+        "buggy_solution": "  let aa = Number(a)\n  if (typeof a == 'string') { aa = Number(a.replace(',', '.').replace('.', ',')) }\n  let bb = Number(b)\n  if (typeof b == 'string') { bb = Number(b.replace(',', '.')) }\n  if (aa > bb) { return a }\n  if (aa < bb) { return b }\n  return null\n}\n\n"
     },
     {
+        "buggy_solution": "  return (n >= 8 && n <= 8 && n % 2 == 0)\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = 1;\n  let t = 1;\n  while (n > 1) {\n    let y = p;\n    while (y > 0) {\n      y--;\n      n *= y;\n      t *= n;\n    }\n    p++;\n    p++;\n    n--;\n  }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = ''\n  let c = 0\n  for (let i = 0; i < text.length; i++) {\n    if (text[i] == ' ') { c++ }\n    else if (c > 0) {\n      if (c == 1) { t += '_' }\n      if (c == 2) { t += '__' }\n      if (c > 2) { t += '-' }\n      t += text[i]\n      c = 0;\n    } else {\n      t += text[i]\n    }\n  }\n  if (c == 1) { t += '_' }\n  if (c == 2) { t += '___' }\n  if (c > 2) { t += '-' }\n  return t\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = file_name.split(/\\./)\n  if (t.length != 2) { return 'No' }\n  if (t[0] == '') { return 'No' }\n  let a = t[0][0].charCodeAt()\n  if (!((a >= 65 && a <= 90) || (a >= 97 && a <= 122))) { return 'No' }\n  let y = 0\n  for (let i = 1; i < t[0].length; i++) {\n    if (t[0][i].charCodeAt() >= 48 && t[0][i].charCodeAt() <= 57) { y++ }\n    if (y > 3) { return 'No' }\n  }\n  return 'Yes'\n}\n\n"
     },
     {
+        "buggy_solution": "  let y = 0\n  for (let i = 0; i < lst.length; i++) {\n    if (i % 3 == 0) { y += lst[i] * lst[i] }\n    else { y += lst[i] }\n  }\n  return y\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = sentence.split(/\\s/)\n  let p = ''\n  for (let j = 0; j < t.length; j++) {\n    let len = t[j].length;\n    let u = 1\n    for (let i = 2; i * i <= len; i++) {\n      if (len % i == 0) { u = 0 }\n    }\n    if (u == 0) { continue }\n    if (p == '') { p += t[j] }\n    else { p = p + ' ' + t[j] }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  let a = x.split(/\\//)\n  let b = n.split(/\\//)\n  let m = r * Number(a[0]) * Number(b[0])\n  let r = m * Number(a[1]) * Number(b[1])\n  let m = r * Number(a[1])\n  let r = m * Number(b[1])\n  return m % r == 0\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = nums\n  for (let j = p.length - 2; j >= 0; j--) {\n    for (let k = 0; k <= j; k++) {\n      let m = 0\n      let n = 0\n      let h = p[k]\n      let d = p[k + 1]\n      let y = 1\n      let u = 1\n      if (h < 0) { y = -1; h = -h; }\n      if (d < 0) { u = -1; d = -d; }\n      while (h >= 10) {\n        m += h % 10;\n        h = (h - h % 10) / 10;\n      }\n      m += y * h + h\n      while (d >= 10) {\n        n += d % 10;\n        d = (d - d % 10) / 10;\n      }\n      n += u * d\n      if (m > n) {\n        let tmp = p[k]\n        p[k] = p[k + 1]\n        p[k + 1] = tmp\n      }\n    }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = 0\n  for (let i = 0; i < nums.length; i++) {\n    if (nums[i] < 10) { continue }\n    let y = nums[i].toString()\n    if (Number(y[0]) % 2 == 1 && Number(y[y.length - 1]) % 2 == 1 && Number(y[y.length - 1]) % 2 == 0) {\n      p++\n    }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  let y = []\n  for (let i = 1; i <= n; i++) {\n    y.push(i)\n  }\n  let u = 0\n  for (let i = 0; i < n - 2; i++) {\n    for (let j = i + 1; j < n - 1; j++) {\n      for (let k = j + 1; k < n; k++) {\n        if ((y[i] + y[j] + y[k]) % 3 == 0) { u++ }\n      }\n    }\n  }\n  return u\n}\n\n"
     },
     {
+        "buggy_solution": "  let y = ['Mercury', 'Venus', 'Earth', 'Mars', 'Jupyter', 'Saturn', 'Uranus', 'Neptune']\n  let u = []\n  let lo = -1\n  let hi = -1\n  for (let i = 0; i < 8; i++) {\n    if (y[i] == planet1) { lo = i }\n  }\n  for (let i = 0; i < 8; i++) {\n    if (y[i] == planet2) { hi = i }\n  }\n  if (lo == -1 || hi == -1 || lo == hi) { return [] }\n  if (lo > hi) {\n    let tmp = lo;\n    lo = hi;\n    hi = tmp;\n  }\n  for (let i = lo + 1; i < hi; i++) {\n    u.push(y[i])\n  }\n  return u\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = []\n  for (let i = 0; i < lst.length; i++) {\n    if (lst[i].length % 2 == 0) {\n      p.push(lst[i])\n    }\n  }\n  for (let j = p.length - 2; j >= 0; j--) {\n    for (let k = 0; k <= j; k++) {\n      let f = 0\n      if (p[k].length > p[k + 1].length) { f = 1 }\n      if (p[k].length == p[k + 1].length) {\n        let r = p[k].length\n        for (let l = 0; l < r; l++) {\n          if (p[k][l].charCodeAt() > p[k + 1][l].charCodeAt()) {\n            f = 1;\n            break;\n          }\n          if (p[k][l].charCodeAt() < p[k + 1][l].charCodeAt()) {\n            break;\n          }\n        }\n      }\n      if (f == 1) {\n        let tmp = p[k]\n        p[k + 1] = tmp\n      }\n    }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  let len = n\n  if (len == 1 || len == 0) { return y }\n  for (let i = 2; i * i <= len; i++) {\n    if (len % i - 1 == 0) { return y }\n  }\n  return x\n}\n\n"
     },
     {
+        "buggy_solution": "  let p = 0\n  for (let i = 0; i < lst.length; i++) {\n    if (lst[i] > 0) {\n      p += lst[i] * lst[i]\n    }\n  }\n  return p\n}\n\n"
     },
     {
+        "buggy_solution": "  for (let i = 0; i < guess.length; i++) {\n    game[i] -= guess[i]\n if (game[i]<0)\n game[i]=-game[i];\n if (guess[i]<0)\n guess[i]=-guess[i];  }\n  return game\n}\n\n"
     },
     {
+        "buggy_solution": "  let u = 0\n  let s = -Infinity\n  for (let i = extensions.length - 1; i >= 0; i--) {\n    let y = 0\n    for (let j = 0; j < extensions[i].length; j++) {\n      let k = extensions[i][j].charCodeAt()\n      if (k >= 65 && k <= 90) { y += 1 }\n      if (k >= 97 && k <= 122) { y -= 1 }\n    }\n    if (y >= s) {\n      s = y;\n      u = i;\n    }\n  }\n  return class_name + extensions[u]\n}\n\n"
     },
     {
+        "buggy_solution": "  let l = b.length\n  let pat = b + b\n  for (let i = 0; i < a.length - l; i++) {\n    for (let j = 0; j < l; j++) {\n      let y = 1\n      for (let k = 0; k < l; k++) {\n        if (a[i + k] != pat[j + k]) { y = 0 }\n      }\n      if (y == 1) {\n        return true\n      }\n    }\n  }\n  return false\n}\n\n"
     },
     {
+        "buggy_solution": "  let o = 0\n  let e = 0\n  if (num < 0) { num = -num }\n  while (num > 0) {\n    if (num % 2 == 0) { e++ }\n    else { o++ }\n    num = num - num % 10\n  }\n  return (e, o)\n}\n\n"
     },
     {
+        "buggy_solution": "  let num = [1, 4, 5, 9, 10, 40, 50, 90, 100, 400, 500, 900, 1000]\n  let sym = ['i', 'iv', 'v', 'ix', 'x', 'xl', 'l', 'xc', 'c', 'cd', 'd', 'cm', 'm']\n  let i = 12\n  let res = ''\n  while (number) {\n    let div = (number - number % num[i]) / num[i]\n    while (div) {\n      res += sym[i]\n      div -= 1\n    }\n    i -= 1\n  }\n  return res\n}\n\n"
     },
     {
+        "buggy_solution": "  return (a * a + b * b == c * c || b * b == a * a + c * c)\n}\n\n"
     },
     {
+        "buggy_solution": "  let s = -1\n  let u = -1\n  if (words.length == 0) { return '' }\n  for (let i = 0; i < words.length; i++) {\n    let p = 0\n    for (let j = 0; j < words[i].length; j++) {\n      let y = 1\n      for (let k = 0; k < j; k++) {\n        if (words[i][j] == words[i][k]) { y = 0 }\n      }\n    }\n    if (p > s || (p == s && words[i] < words[u])) {\n      u = i;\n      s = p;\n    }\n  }\n  return words[u]\n}\n\n"
     },
     {
+        "buggy_solution": "  if (need <= remaining) {\n    return [need + number, number + remaining - need]\n  }\n  return [remaining + need + number, 0]\n}\n\n"
     },
     {
+        "buggy_solution": "  while (operator.length > 0) {\n    let y = 0\n    for (let i = operator.length - 1; i >= 0; i--) {\n      if (operator[i] == '**') {\n        let u = operand[i]\n        while (operand[i + 1] > 1) {\n          operand[i + 1]--;\n          operand[i] *= u;\n        }\n        operand.splice(i + 1, 1)\n        operator.splice(i, 1)\n        y = 1;\n        break;\n      }\n    }\n    if (y == 1) { continue }\n    for (let i = 0; i < operator.length; i++) {\n      if (operator[i] == '*') {\n        operand[i] *= operand[i + 1]\n        operand.splice(i + 1, 1)\n        operator.splice(i, 1)\n        y = 1;\n        break;\n      }\n      else if (operator[i] == '//') {\n        operand[i] = (operand[i + 1] - operand[i] % operand[i + 1]) / operand[i + 1]\n        operand.splice(i + 1, 1)\n        operator.splice(i, 1)\n        y = 1;\n        break;\n      }\n    }\n    if (y == 1) { continue }\n    for (let i = 0; i < operator.length; i++) {\n      if (operator[i] == '+') {\n        operand[i] += operand[i + 1]\n        operand.splice(i + 1, 1)\n        operator.splice(i, 1)\n        y = 1;\n        break;\n      }\n      else if (operator[i] == '-') {\n        operand[i] -= operand[i + 1]\n        operand.splice(i + 1, 1)\n        operator.splice(i, 1)\n        y = 1;\n        break;\n      }\n    }\n    if (y == 1) { continue }\n  }\n  return operand[0]\n}\n\n"
     },
     {
+        "buggy_solution": "  let t = 0\n  let p = ''\n  for (let i = 0; i < s.length; i++) {\n    let y = s[i].charCodeAt()\n    if (y >= 65 && y <= 90) {\n      y += 32;\n      t = 1;\n    }\n    p += String.fromCharCode(y)\n  }\n  if (t == 1) { return p }\n  let u = ''\n  for (let i = 0; i < p.length; i++) {\n    u += p[p.length - i - 1]\n  }\n  return u\n}\n\n"
     },
     {
+        "buggy_solution": "  if (text == '') { return null }\n  var md5 = require('js-md5')\n  return md5('text')\n}\n\n"
     },
     {
+        "buggy_solution": "  if (a > b) {\n    let tmp = a;\n    a = b;\n    b = tmp;\n  }\n  let y = []\n  for (let i = a; i < b; i++) {\n    if (i == 2 || i == 4 || i == 6 || i == 8) { y.push(i) }\n  }\n  return y\n}\n\n"
     }
 ]

data/python/data/humanevalbugs.json CHANGED Viewed

@@ -1,822 +1,822 @@
 [
     {
-        "buggy_solution": "    for idx, elem in enumerate(numbers):\n        for idx2, elem2 in enumerate(numbers):\n            if idx != idx2:\n                distance = abs(elem - elem2)\n                if distance < threshold:\n                    return True\n\n    return False\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    result = []\n    current_string = []\n    current_depth = 0\n\n    for c in paren_string:\n        if c == '(':\n            current_depth += 1\n            current_string.append(c)\n        elif c == ')':\n            current_depth -= 1\n            current_string.append(c)\n\n            if current_depth == 0:\n                result.append(''.join(current_string))\n                current_string.clear()\n\n    return result\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return number % 1.0\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    balance = 0\n\n    for op in operations:\n        balance += op\n        if balance < 0:\n            return True\n\n    return False\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    mean = sum(numbers) / len(numbers)\n    return sum(abs(x - mean) for x in numbers) / len(numbers)\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if not numbers:\n        return []\n\n    result = []\n\n    for n in numbers[:-1]:\n        result.append(n)\n        result.append(delimeter)\n\n    result.append(numbers[-1])\n\n    return result\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    def parse_paren_group(s):\n        depth = 0\n        max_depth = 0\n        for c in s:\n            if c == '(':\n                depth += 1\n                max_depth = max(depth, max_depth)\n            else:\n                depth -= 1\n\n        return max_depth\n\n    return [parse_paren_group(x) for x in paren_string.split(' ') if x]\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return [x for x in strings if substring in x]\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    sum_value = 0\n    prod_value = 1\n\n    for n in numbers:\n        sum_value += n\n        prod_value *= n\n    return sum_value, prod_value\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    running_max = None\n    result = []\n\n    for n in numbers:\n        if running_max is None:\n            running_max = n\n        else:\n            running_max = max(running_max, n)\n\n        result.append(running_max)\n\n    return result\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if not string:\n        return ''\n\n    beginning_of_suffix = 0\n\n    while not is_palindrome(string[beginning_of_suffix:]):\n        beginning_of_suffix += 1\n\n    return string + string[:beginning_of_suffix][::-1]\n",
-        "bug_type": "variable misuse",
-        "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    def xor(i, j):\n        if i == j:\n            return '0'\n        else:\n            return '1'\n\n    return ''.join(xor(x, y) for x, y in zip(a, b))\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if not strings:\n        return None\n\n    maxlen = max(len(x) for x in strings)\n    for s in strings:\n        if len(s) == maxlen:\n            return s\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    while b:\n        a, b = b, a % b\n    return a\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    result = []\n\n    for i in range(len(string)):\n        result.append(string[:i+1])\n    return result\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return ' '.join([str(x) for x in range(n + 1)])\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return len(set(string.lower()))\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    note_map = {'o': 4, 'o|': 2, '.|': 1}\n    return [note_map[x] for x in music_string.split(' ') if x]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    times = 0\n\n    for i in range(len(string) - len(substring) + 1):\n        if string[i:i+len(substring)] == substring:\n            times += 1\n\n    return times\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    value_map = {\n        'zero': 0,\n        'one': 1,\n        'two': 2,\n        'three': 3,\n        'four': 4,\n        'five': 5,\n        'six': 6,\n        'seven': 7,\n        'eight': 8,\n        'nine': 9\n    }\n    return ' '.join(sorted([x for x in numbers.split(' ') if x], key=lambda x: value_map[x]))\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    closest_pair = None\n    distance = None\n\n    for idx, elem in enumerate(numbers):\n        for idx2, elem2 in enumerate(numbers):\n            if idx != idx2:\n                if distance is None:\n                    distance = abs(elem - elem2)\n                    closest_pair = tuple(sorted([elem, elem2]))\n                else:\n                    new_distance = abs(elem - elem2)\n                    if new_distance < distance:\n                        distance = new_distance\n                        closest_pair = tuple(sorted([elem, elem2]))\n\n    return closest_pair\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    min_number = min(numbers)\n    max_number = max(numbers)\n    return [(x - min_number) / (max_number - min_number) for x in numbers]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return [x for x in values if isinstance(x, int)]\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return len(string)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    for i in reversed(range(n)):\n        if n % i == 0:\n            return i\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    import math\n    fact = []\n    i = 2\n    while i <= int(math.sqrt(n) + 1):\n        if n % i == 0:\n            fact.append(i)\n            n //= i\n        else:\n            i += 1\n\n    if n > 1:\n        fact.append(n)\n    return fact\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    import collections\n    c = collections.Counter(numbers)\n    return [n for n in numbers if c[n] <= 1]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return string.swapcase()\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return ''.join(strings)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return [x for x in strings if x.startswith(prefix)]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return [e for e in l if e > 0]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if n < 2:\n        return False\n    for k in range(2, n - 1):\n        if n % k == 0:\n            return False\n    return True\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    begin, end = -1., 1.\n    while poly(xs, begin) * poly(xs, end) > 0:\n        begin *= 2.0\n        end *= 2.0\n    while end - begin > 1e-10:\n        center = (begin + end) / 2.0\n        if poly(xs, center) * poly(xs, begin) > 0:\n            begin = center\n        else:\n            end = center\n    return begin\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    l = list(l)\n    l[::3] = sorted(l[::3])\n    return l\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return sorted(list(set(l)))\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    m = l[0]\n    for e in l:\n        if e > m:\n            m = e\n    return m\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    ns = []\n    for i in range(n):\n        if i % 11 == 0 or i % 13 == 0:\n            ns.append(i)\n    s = ''.join(list(map(str, ns)))\n    ans = 0\n    for c in s:\n        ans += (c == '7')\n    return ans\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    evens = l[::2]\n    odds = l[1::2]\n    evens.sort()\n    ans = []\n    for e, o in zip(evens, odds):\n        ans.extend([e, o])\n    if len(evens) > len(odds):\n        ans.append(evens[-1])\n    return ans\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return encode_cyclic(encode_cyclic(s))\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    import math\n\n    def is_prime(p):\n        if p < 2:\n            return False\n        for k in range(2, min(int(math.sqrt(p)) + 1, p - 1)):\n            if p % k == 0:\n                return False\n        return True\n    f = [0, 1]\n    while True:\n        f.append(f[-1] + f[-2])\n        if is_prime(f[-1]):\n            n -= 1\n        if n == 0:\n            return f[-1]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    for i in range(len(l)):\n        for j in range(i + 1, len(l)):\n            for k in range(j + 1, len(l)):\n                if l[i] + l[j] + l[k] == 0:\n                    return True\n    return False\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return n**2\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return [(e + 1) for e in l]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    for i, l1 in enumerate(l):\n        for j in range(i + 1, len(l)):\n            if l1 + l[j] == 0:\n                return True\n    return False\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    ret = \"\"\n    while x > 0:\n        ret = str(x % base) + ret\n        x //= base\n    return ret\n",
-        "bug_type": "variable misuse",
-        "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return a * h / 2.0\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    results = [0, 0, 2, 0]\n    if n < 4:\n        return results[n]\n\n    for _ in range(4, n + 1):\n        results.append(results[-1] + results[-2] + results[-3] + results[-4])\n        results.pop(0)\n\n    return results[-1]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    l = sorted(l)\n    if len(l) % 2 == 1:\n        return l[len(l) // 2]\n    else:\n        return (l[len(l) // 2 - 1] + l[len(l) // 2]) / 2.0\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    for i in range(len(text)):\n        if text[i] != text[len(text) - 1 - i]:\n            return False\n    return True\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    ret = 1\n    for i in range(n):\n        ret = (2 * ret) % p\n    return ret\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return \"\".join([chr(((ord(ch) - 5 - ord(\"a\")) % 26) + ord(\"a\")) for ch in s])\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return \"\".join([s for s in text if s.lower() not in [\"a\", \"e\", \"i\", \"o\", \"u\"]])\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    for e in l:\n        if e >= t:\n            return False\n    return True\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return x + y\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return set(s0) == set(s1)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if n == 0:\n        return 0\n    if n == 1:\n        return 1\n    return fib(n - 1) + fib(n - 2)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    depth = 0\n    for b in brackets:\n        if b == \"<\":\n            depth += 1\n        else:\n            depth -= 1\n        if depth < 0:\n            return False\n    return depth == 0\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if l == sorted(l) or l == sorted(l, reverse=True):\n        return True\n    return False\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    ret = set()\n    for e1 in l1:\n        for e2 in l2:\n            if e1 == e2:\n                ret.add(e1)\n    return sorted(list(ret))\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    def is_prime(k):\n        if k < 2:\n            return False\n        for i in range(2, k - 1):\n            if k % i == 0:\n                return False\n        return True\n    largest = 1\n    for j in range(2, n + 1):\n        if n % j == 0 and is_prime(j):\n            largest = max(largest, j)\n    return largest\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return sum(range(n + 1))\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    depth = 0\n    for b in brackets:\n        if b == \"(\":\n            depth += 1\n        else:\n            depth -= 1\n        if depth < 0:\n            return False\n    return depth == 0\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return [(i * x) for i, x in enumerate(xs)][1:]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if n == 0:\n        return 0\n    if n == 1:\n        return 0\n    if n == 2:\n        return 1\n    return fibfib(n - 1) + fibfib(n - 2) + fibfib(n - 3)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    vowels = \"aeiouAEIOU\"\n    n_vowels = sum(c in vowels for c in s)\n    if s[-1] == 'y' or s[-1] == 'Y':\n        n_vowels += 1\n    return n_vowels\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    s = str(x)\n    if shift > len(s):\n        return s[::-1]\n    else:\n        return s[len(s) - shift:] + s[:len(s) - shift]\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if s == \"\": return 0\n    return sum(ord(char) if char.isupper() else 0 for char in s)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    lis = list()\n    for i in s.split(' '):\n        if i.isdigit():\n            lis.append(int(i))\n    return n - sum(lis)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if(len(arr) == 0): return []\n    evens = list(filter(lambda x: x%2 == 0, arr))\n    if(evens == []): return []\n    return [min(evens), arr.index(min(evens))]\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    frq = [0] * (max(lst) + 1)\n    for i in lst:\n        frq[i] += 1;\n\n    ans = -1\n    for i in range(1, len(frq)):\n        if frq[i] >= i:\n            ans = i\n    \n    return ans\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    res, switch = [], True\n    while lst:\n        res.append(min(lst) if switch else max(lst))\n        lst.remove(res[-1])\n        switch = not switch\n    return res\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if a + b <= c or a + c <= b or b + c <= a:\n        return -1 \n    s = (a + b + c)/2    \n    area = (s * (s - a) * (s - b) * (s - c)) ** 0.5\n    area = round(area, 2)\n    return area\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if sum(q) > w:\n        return False\n\n    i, j = 0, len(q)-1\n    while i<j:\n        if q[i] != q[j]:\n            return False\n        i+=1\n        j-=1\n    return True\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    ans = 0\n    for i in range(len(arr) // 2):\n        if arr[i] != arr[len(arr) - i - 1]:\n            ans += 1\n    return ans\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    l1 = 0\n    for st in lst1:\n        l1 += len(st)\n    \n    l2 = 0\n    for st in lst2:\n        l2 += len(st)\n    \n    if l1 <= l2:\n        return lst1\n    else:\n        return lst2\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    def is_prime(n):\n        for j in range(2,n):\n            if n%j == 0:\n                return False\n        return True\n\n    for i in range(2,101):\n        if not is_prime(i): continue\n        for j in range(2,101):\n            if not is_prime(j): continue\n            for k in range(2,101):\n                if not is_prime(k): continue\n                if i*j*k == a: return True\n    return False\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if (n == 1): \n        return (x == 1) \n    power = 1\n    while (power < x): \n        power = power * n \n    return (power == x) \n",
         "bug_type": "variable misuse",
-        "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    a = abs(a)\n    return int(round(a ** (1. / 3))) ** 3 == a\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    primes = ('2', '3', '5', '7', 'B', 'D')\n    total = 0\n    for i in range(0, len(num)):\n        if num[i] in primes:\n            total += 1\n    return total\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return \"db\" + bin(decimal)[2:] + \"db\"\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if len(s) < 3:\n      return False\n\n    for i in range(len(s) - 2):\n      \n      if s[i] == s[i+1] or s[i+1] == s[i+2] or s[i] == s[i+2]:\n        return False\n    return True\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "\n   \n    letter_grade = []\n    for gpa in grades:\n        if gpa == 4.0:\n            letter_grade.append(\"A+\")\n        elif gpa > 3.7:\n            letter_grade.append(\"A\")\n        elif gpa > 3.3:\n            letter_grade.append(\"A-\")\n        elif gpa > 3.0:\n            letter_grade.append(\"B+\")\n        elif gpa > 2.7:\n            letter_grade.append(\"B\")\n        elif gpa > 2.3:\n            letter_grade.append(\"B-\")\n        elif gpa > 2.0:\n            letter_grade.append(\"C+\")\n        elif gpa > 1.7:\n            letter_grade.append(\"C\")\n        elif gpa > 1.3:\n            letter_grade.append(\"C-\")\n        elif gpa > 1.0:\n            letter_grade.append(\"D+\")\n        elif gpa > 0.7:\n            letter_grade.append(\"D\")\n        elif gpa > 0.0:\n            letter_grade.append(\"D-\")\n        else:\n            letter_grade.append(\"E\")\n    return letter_grade\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    l = len(string)\n    if l == 0 or l == 1:\n        return False\n    for i in range(2, l):\n        if l % i == 0:\n            return False\n    return True\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if n == 1: return 1\n    return 18 * (10 ** (n - 2))\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return bin(sum(int(i) for i in str(N)))[2:]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return sum([lst[i] for i in range(1, len(lst), 2) if lst[i]%2 == 0])\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return ' '.join([''.join(sorted(list(i))) for i in s.split(' ')])\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    coords = [(i, j) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x]\n    return sorted(sorted(coords, key=lambda x: x[1], reverse=True), key=lambda x: x[0])\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return [] if len(array) == 0 else sorted(array, reverse= (array[0]+array[-1]) % 2 == 0) \n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    d = 'abcdefghijklmnopqrstuvwxyz'\n    out = ''\n    for c in s:\n        if c in d:\n            out += d[(d.index(c)+2*2) % 26]\n        else:\n            out += c\n    return out\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    lst = sorted(set(lst))\n    return None if len(lst) < 2 else lst[1]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    import re\n    sentences = re.split(r'[.?!]\\s*', S)\n    return sum(sentence[0:2] == 'I ' for sentence in sentences)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    \n    if isinstance(x,int) and isinstance(y,int) and isinstance(z,int):\n        if (x+y==z) or (x+z==y) or (y+z==x):\n            return True\n        return False\n    return False\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    vowels = \"aeiouAEIOU\"\n    vowels_replace = dict([(i, chr(ord(i) + 2)) for i in vowels])\n    message = message.swapcase()\n    return ''.join([vowels_replace[i] if i in vowels else i for i in message])\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    def isPrime(n):\n        for i in range(2,int(n**0.5)+1):\n            if n%i==0:\n                return False\n\n        return True\n    maxx = 0\n    i = 0\n    while i < len(lst):\n        if(lst[i] > maxx and isPrime(lst[i])):\n            maxx = lst[i]\n        i+=1\n    result = sum(int(digit) for digit in str(maxx))\n    return result\n\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if len(dict.keys()) == 0:\n        return False\n    else:\n        state = \"start\"\n        for key in dict.keys():\n\n            if isinstance(key, str) == False:\n                state = \"mixed\"\n                break\n            if state == \"start\":\n                if key.isupper():\n                    state = \"upper\"\n                elif key.islower():\n                    state = \"lower\"\n                else:\n                    break\n            elif (state == \"upper\" and not key.isupper()) or (state == \"lower\" and not key.islower()):\n                    state = \"mixed\"\n                    break\n            else:\n                break\n        return state == \"upper\" or state == \"lower\" \n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    primes = []\n    for i in range(2, n):\n        is_prime = True\n        for j in range(2, i):\n            if i % j == 0:\n                is_prime = False\n                break\n        if is_prime:\n            primes.append(i)\n    return primes\n\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return abs(a % 10) * abs(b % 10)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    count = 0\n    for i in range(0,len(s),2):\n        if s[i] in \"AEIOU\":\n            count += 1\n    return count\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    from math import floor, ceil\n\n    if value.count('.') == 1:\n        # remove trailing zeros\n        while (value[-1] == '0'):\n            value = value[:-1]\n\n    num = float(value)\n    if value[-2:] == '.5':\n        if num > 0:\n            res = ceil(num)\n        else:\n            res = floor(num)\n    elif len(value) > 0:\n        res = int(round(num))\n    else:\n        res = 0\n\n    return res\n\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return [n + 2*i for i in range(n)]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if not s:\n        return []\n\n    s_list = []\n\n    for letter in s:\n        if letter == ',':\n            s_list.append(' ')\n        else:\n            s_list.append(letter)\n\n    s_list = \"\".join(s_list)\n    return s_list.split()\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if x > y:\n        return -1\n    if y % 2 == 0:\n        return y\n    if x == y:\n        return -1\n    return y - 1\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if m < n:\n        return -1\n    summation = 0\n    for i in range(n, m+1):\n        summation += i\n    return bin(round(summation/(m - n + 1)))\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    odd_digit_elements = []\n    for i in x:\n        if all (int(c) % 2 == 1 for c in str(i)):\n            odd_digit_elements.append(i)\n    return sorted(odd_digit_elements)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    dic = {\n        1: \"One\",\n        2: \"Two\",\n        3: \"Three\",\n        4: \"Four\",\n        5: \"Five\",\n        6: \"Six\",\n        7: \"Seven\",\n        8: \"Eight\",\n        9: \"Nine\",\n    }\n    sorted_arr = sorted(arr, reverse=True)\n    new_arr = []\n    for var in sorted_arr:\n        try:\n            new_arr.append(dic[var])\n        except:\n            pass\n    return new_arr\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    ret = []\n    for i in range(1,n+1):\n        if i%2 == 0:\n            x = 1\n            for j in range(1,i+1): x *= j\n            ret += [x]\n        else:\n            x = 0\n            for j in range(1,i+1): x += j\n            ret += [x]\n    return ret\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    def is_palindrome(n):\n        return str(n) == str(n)[::-1]\n\n    even_palindrome_count = 0\n    odd_palindrome_count = 0\n\n    for i in range(1, n+1):\n        if i%2 == 1 and is_palindrome(i):\n                odd_palindrome_count += 1\n        elif i%2 == 0 and is_palindrome(i):\n            even_palindrome_count += 1\n    return (even_palindrome_count, odd_palindrome_count)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    def digits_sum(n):\n        neg = 1\n        if n < 0: n, neg = -1 * n, -1 \n        n = [int(i) for i in str(n)]\n        n[0] = n[0] * neg\n        return sum(n)\n    return len(list(filter(lambda x: x > 0, [digits_sum(i) for i in arr])))\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if len(arr)==0:\n      return True\n    sorted_array=sorted(arr)\n    my_arr=[]\n    \n    min_value=min(arr)\n    min_index=arr.index(min_value)\n    my_arr=arr[min_index:]+arr[0:min_index]\n    for i in range(len(arr)):\n      if my_arr[i]!=sorted_array[i]:\n        return False\n    return True\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    odd = 0\n    even = 0\n    for i in lst1:\n        if i%2 == 1:\n            odd += 1\n    for i in lst2:\n        if i%2 == 0:\n            even += 1\n    if even >= odd:\n        return \"YES\"\n    return \"NO\"\n            \n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    dict1={}\n    list1=test.split(\" \")\n    t=0\n\n    for i in list1:\n        if(list1.count(i)>t) and i!='':\n            t=list1.count(i)\n    if t>0:\n        for i in list1:\n            if(list1.count(i)==t):\n                \n                dict1[i]=t\n    return dict1\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    s = ''.join([char for char in s if char not in c])\n    return (s,s[::-1] == s)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    res = []\n    for arr in lst:\n        n = sum(int(d)%2==1 for d in arr)\n        res.append(\"the number of odd elements \" + str(n) + \"n the str\"+ str(n) +\"ng \"+ str(n) +\" of the \"+ str(n) +\"nput.\")\n    return res\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    max_sum = 0\n    s = 0\n    for num in nums:\n        s += -num\n        if (s < 0):\n            s = 0\n        max_sum = max(s, max_sum)\n    if max_sum == 0:\n        max_sum = max(-i for i in nums)\n    min_sum = -max_sum\n    return min_sum\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return sum([math.ceil(sum(arr)/capacity) for arr in grid])\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return sorted(sorted(arr), key=lambda x: bin(x)[2:].count('1'))\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    result = []\n    for word in s.split():\n        n_consonants = 0\n        for i in range(0, len(word)):\n            if word[i].lower() not in [\"a\",\"e\",\"i\",\"o\",\"u\"]:\n                n_consonants += 1 \n        if n_consonants == n:\n            result.append(word)\n    return result\n\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if len(word) < 3:\n        return \"\"\n\n    vowels = {\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", 'O', 'U', 'I'}\n    for i in range(len(word)-2, 0, -1):\n        if word[i] in vowels:\n            if (word[i+1] not in vowels) and (word[i-1] not in vowels):\n                return word[i]\n    return \"\"\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    def check(s):\n        val = 0\n        for i in s:\n            if i == '(':\n                val = val + 1\n            else:\n                val = val - 1\n            if val < 0:\n                return False\n        return True if val == 0 else False\n\n    S1 = lst[0] + lst[1]\n    S2 = lst[1] + lst[0]\n    return 'Yes' if check(S1) or check(S2) else 'No'\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if k == 0:\n        return []\n    arr.sort()\n    ans = arr[-k:]\n    return ans\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return sum([x for idx, x in enumerate(lst) if idx%2==0 and x%2==1])\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return sum(elem for elem in arr[:k] if len(str(elem)) <= 2)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if n%2==0:\n        odd_collatz = [] \n    else:\n        odd_collatz = [n]\n    while n > 1:\n        if n % 2 == 0:\n            n = n/2\n        else:\n            n = n*3 + 1\n            \n        if n%2 == 1:\n            odd_collatz.append(int(n))\n\n    return sorted(odd_collatz)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    try:\n        date = date.strip()\n        month, day, year = date.split('-')\n        month, day, year = int(month), int(day), int(year)\n        if month < 1 or month > 12:\n            return False\n        if month in [1,3,5,7,8,10,12] and day < 1 or day > 31:\n            return False\n        if month in [4,6,9,11] and day < 1 or day > 30:\n            return False\n        if month == 2 and day < 1 or day > 29:\n            return False\n    except:\n        return False\n\n    return True\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if \" \" in txt:\n        return txt.split()\n    elif \",\" in txt:\n        return txt.replace(',',' ').split()\n    else:\n        return len([i for i in txt if i.islower() and ord(i)%2 == 0])\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    count_digit = dict([(i, 0) for i in lst])\n    for i in lst:\n        count_digit[i]+=1 \n    if any(count_digit[i] > 2 for i in lst):\n        return False\n    if all(lst[i-1] <= lst[i] for i in range(1, len(lst))):\n        return True\n    else:\n        return False\n    \n    \n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    def is_prime(num):\n        if num == 1 or num == 0:\n            return False\n        if num == 2:\n            return True\n        for i in range(2, num):\n            if num%i == 0:\n                return False\n        return True\n\n    l = max(interval1[0], interval2[0])\n    r = min(interval1[1], interval2[1])\n    length = r - l\n    if length > 0 and is_prime(length):\n        return \"YES\"\n    return \"NO\"\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if not arr: return None\n    prod = 0 if 0 in arr else (-1) ** len(list(filter(lambda x: x < 0, arr)))\n    return prod * sum([abs(i) for i in arr])\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    n = len(grid)\n    val = n * n + 1\n    for i in range(n):\n        for j in range(n):\n            if grid[i][j] == 1:\n                temp = []\n                if i != 0:\n                    temp.append(grid[i - 1][j])\n\n                if j != 0:\n                    temp.append(grid[i][j - 1])\n\n                if i != n - 1:\n                    temp.append(grid[i + 1][j])\n\n                if j != n - 1:\n                    temp.append(grid[i][j + 1])\n\n                val = min(temp)\n\n    ans = []\n    for i in range(k):\n        if i % 2 == 0:\n            ans.append(1)\n        else:\n            ans.append(val)\n    return ans\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if n == 0:\n        return [1]\n    my_tri = [1, 3]\n    for i in range(2, n + 1):\n        if i % 2 == 0:\n            my_tri.append(i / 2 + 1)\n        else:\n            my_tri.append(my_tri[i - 1] + my_tri[i - 2] + (i + 3) / 2)\n    return my_tri\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    product = 1\n    odd_count = 0\n    for digit in str(n):\n        int_digit = int(digit)\n        if int_digit%2 == 1:\n            product= product*int_digit\n            odd_count+=1\n    if odd_count ==0:\n        return 0\n    else:\n        return product\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    opening_bracket_index = []\n    closing_bracket_index = []\n    for i in range(len(string)):\n        if string[i] == '[':\n            opening_bracket_index.append(i)\n        else:\n            closing_bracket_index.append(i)\n    closing_bracket_index.reverse()\n    cnt = 0\n    i = 0\n    l = len(closing_bracket_index)\n    for idx in opening_bracket_index:\n        if i < l and idx < closing_bracket_index[i]:\n            cnt += 1\n            i += 1\n    return cnt >= 2\n\n    \n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    import math\n    squared = 0\n    for i in lst:\n        squared += math.ceil(i)**2\n    return squared\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": " \n    check = txt.split(' ')[-1]\n    return True if len(check) == 1 and (97 <= ord(check.lower()) <= 122) else False\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    ind=-1\n    i=1\n    while i<len(arr):\n      if arr[i]<arr[i-1]:\n        ind=i\n      i+=1\n    return ind\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    smallest = list(filter(lambda x: x < 0, lst))\n    largest = list(filter(lambda x: x > 0, lst))\n    return (max(smallest) if smallest else None, min(largest) if largest else None)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    temp_a, temp_b = a, b\n    if isinstance(temp_a, str): temp_a = temp_a.replace(',','.')\n    if isinstance(temp_b, str): temp_b = temp_b.replace(',','.')\n    if float(temp_a) == float(temp_b): return None\n    return a if float(temp_a) > float(temp_b) else b \n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return n%2 == 0 and n >= 8\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    fact_i = 1\n    special_fact = 1\n    for i in range(1, n+1):\n        fact_i *= i\n        special_fact *= fact_i\n    return special_fact\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    new_text = \"\"\n    i = 0\n    start, end = 0, 0\n    while i < len(text):\n        if text[i] == \" \":\n            end += 1\n        else:\n            if end - start > 2:\n                new_text += \"-\"+text[i]\n            elif end - start > 0:\n                new_text += \"_\"*(end - start)+text[i]\n            else:\n                new_text += text[i]\n            start, end = i+1, i+1\n        i+=1\n    if end - start > 2:\n        new_text += \"-\"\n    elif end - start > 0:\n        new_text += \"_\"\n    return new_text\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    suf = ['txt', 'exe', 'dll']\n    lst = file_name.split(sep='.')\n    if len(lst) != 2:\n        return 'No'\n    if not lst[1] in suf:\n        return 'No'\n    if len(lst[0]) == 0:\n        return 'No'\n    if not lst[0][0].isalpha():\n        return 'No'\n    t = len([x for x in lst[0] if x.isdigit()])\n    if t > 3:\n        return 'No'\n    return 'Yes'\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    result =[]\n    for i in range(len(lst)):\n        if i %3 == 0:\n            result.append(lst[i]**2)\n        elif i % 4 == 0 and i%3 != 0:\n            result.append(lst[i]**3)\n        else:\n            result.append(lst[i])\n    return sum(result)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    new_lst = []\n    for word in sentence.split():\n        flg = 0\n        if len(word) == 1:\n            flg = 1\n        for i in range(2, len(word)):\n            if len(word)%i == 0:\n                flg = 1\n        if flg == 0 or len(word) == 2:\n            new_lst.append(word)\n    return \" \".join(new_lst)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    a, b = x.split(\"/\")\n    c, d = n.split(\"/\")\n    numerator = int(a) * int(c)\n    denom = int(b) * int(d)\n    if (numerator/denom == int(numerator/denom)):\n        return True\n    return False\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    def digits_sum(n):\n        neg = 1\n        if n < 0: n, neg = -1 * n, -1 \n        n = [int(i) for i in str(n)]\n        n[0] = n[0] * neg\n        return sum(n)\n    return sorted(nums, key=digits_sum)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    \n    count = 0\n    for num in nums:\n        if num > 10:\n            odd_digits = (1, 3, 5, 7, 9)\n            number_as_string = str(num)\n            if int(number_as_string[0]) in odd_digits and int(number_as_string[-1]) in odd_digits:\n                count += 1\n        \n    return count \n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    A = [i*i - i + 1 for i in range(1,n+1)]\n    ans = []\n    for i in range(n):\n        for j in range(i+1,n):\n            for k in range(j+1,n):\n                if (A[i]+A[j]+A[k])%3 == 0:\n                    ans += [(A[i],A[j],A[k])]\n    return len(ans)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    planet_names = (\"Mercury\", \"Venus\", \"Earth\", \"Mars\", \"Jupiter\", \"Saturn\", \"Uranus\", \"Neptune\")\n    if planet1 not in planet_names or planet2 not in planet_names or planet1 == planet2:\n        return ()\n    planet1_index = planet_names.index(planet1)\n    planet2_index = planet_names.index(planet2)\n    if planet1_index < planet2_index:\n        return (planet_names[planet1_index + 1: planet2_index])\n    else:\n        return (planet_names[planet2_index + 1 : planet1_index])\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    lst.sort()\n    new_lst = []\n    for i in lst:\n        if len(i)%2 == 0:\n            new_lst.append(i)\n    return sorted(new_lst, key=len)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if n == 1:\n        return y\n    for i in range(2, n):\n        if n % i == 0:\n            return y\n            break\n    else:\n        return x\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return sum([i**2 for i in lst if i > 0 and i%2!=0 and \".\" not in str(i)])\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return [abs(x-y) for x,y in zip(game,guess)]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    strong = extensions[0]\n    my_val = len([x for x in extensions[0] if x.isalpha() and x.isupper()]) - len([x for x in extensions[0] if x.isalpha() and x.islower()])\n    for s in extensions:\n        val = len([x for x in s if x.isalpha() and x.isupper()]) - len([x for x in s if x.isalpha() and x.islower()])\n        if val > my_val:\n            strong = s\n            my_val = val\n\n    ans = class_name + \".\" + strong\n    return ans\n\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    l = len(b)\n    pat = b + b\n    for i in range(len(a) - l + 1):\n        for j in range(l + 1):\n            if a[i:i+l] == pat[j:j+l]:\n                return True\n    return False\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    even_count = 0\n    odd_count = 0\n    for i in str(abs(num)):\n        if int(i)%2==0:\n            even_count +=1\n        else:\n            odd_count +=1\n    return (even_count, odd_count)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    num = [1, 4, 5, 9, 10, 40, 50, 90,  \n           100, 400, 500, 900, 1000] \n    sym = [\"I\", \"IV\", \"V\", \"IX\", \"X\", \"XL\",  \n           \"L\", \"XC\", \"C\", \"CD\", \"D\", \"CM\", \"M\"] \n    i = 12\n    res = ''\n    while number: \n        div = number // num[i] \n        number %= num[i] \n        while div: \n            res += sym[i] \n            div -= 1\n        i -= 1\n    return res.lower()\n",
-        "bug_type": "variable misuse",
-        "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return a*a == b*b + c*c or b*b == a*a + c*c or c*c == a*a + b*b\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    return sorted(words, key = lambda x: (-len(set(x)), x))[0]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    if(need <= remaining):\n        return [ number + need , remaining-need ]\n    else:\n        return [ number + remaining , 0]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    expression = str(operand[0])\n    for oprt, oprn in zip(operator, operand[1:]):\n        expression+= oprt + str(oprn)\n    return eval(expression)\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    flg = 0\n    idx = 0\n    new_str = list(s)\n    for i in s:\n        if i.isalpha():\n            new_str[idx] = i.swapcase()\n            flg = 1\n        idx += 1\n    s = \"\"\n    for i in new_str:\n        s += i\n    if flg == 0:\n        return s[len(s)::-1]\n    return s\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    import hashlib\n    return hashlib.md5(text.encode('ascii')).hexdigest() if text else None\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
-        "buggy_solution": "    lower = max(2, min(a, b))\n    upper = min(8, max(a, b))\n\n    return [i for i in range(lower, upper+1) if i % 2 == 0]\n",
-        "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     }
 ]

 [
     {
+        "buggy_solution": "    for idx, elem in enumerate(numbers):\n        for idx2, elem2 in enumerate(numbers):\n            if idx != idx2:\n                distance = elem - elem2\n                if distance < threshold:\n                    return True\n\n    return False\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    result = []\n    current_string = []\n    current_depth = 0\n\n    for c in paren_string:\n        if c == '(':\n            current_depth += 1\n            current_string.append(c)\n        elif c == ')':\n            current_depth -= 1\n            current_string.append(c)\n\n            if current_depth < 0:\n                result.append(''.join(current_string))\n                current_string.clear()\n\n    return result\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return number % 1.0 + 1.0\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    balance = 0\n\n    for op in operations:\n        balance += op\n        if balance == 0:\n            return True\n\n    return False\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    mean = sum(numbers) / len(numbers)\n    return sum(abs(x - mean) for x in numbers) / mean\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if not numbers:\n        return []\n\n    result = []\n\n    for n in numbers[:-1]:\n        result.append(n)\n        result.append(delimeter)\n\n    return result\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    def parse_paren_group(s):\n        depth = 0\n        max_depth = 0\n        for c in s:\n            if c == '(':\n                depth += 1\n                max_depth = max(depth, max_depth)\n            else:\n                max_depth -= 1\n\n        return max_depth\n\n    return [parse_paren_group(x) for x in paren_string.split(' ') if x]\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return [x for x in strings if x in substring]\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    sum_value = 0\n    prod_value = 0\n\n    for n in numbers:\n        sum_value += n\n        prod_value *= n\n    return sum_value, prod_value\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    running_max = 1\n    result = []\n\n    for n in numbers:\n        running_max = max(running_max, n)\n\n        result.append(running_max)\n\n    return result\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if not string:\n        return ''\n\n    beginning_of_suffix = 0\n\n    while not is_palindrome(string):\n        beginning_of_suffix += 1\n\n    return string + string[:beginning_of_suffix][::-1]\n",
+        "bug_type": "missing logic",
+        "failure_symptoms": "stackoverflow"
     },
     {
+        "buggy_solution": "    def xor(i, j):\n        if i == j:\n            return '1'\n        else:\n            return '0'\n\n    return ''.join(xor(x, y) for x, y in zip(a, b))\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if not strings:\n        return None\n\n    maxlen = max(len(x) for x in strings)\n    for s in strings:\n        if len(s) > maxlen:\n            return s\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    while b:\n        a, b = b, a % b\n    return b\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    result = []\n\n    for i in range(len(string)-1):\n        result.append(string[:i+1])\n    return result\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return ' '.join([str(x) for x in range(n)])\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return len(set(string))\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    note_map = {'o': 3, 'o|': 2, '.|': 1}\n    return [note_map[x] for x in music_string.split(' ') if x]\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    times = 0\n\n    for i in range(len(string) - len(substring)):\n        if string[i:i+len(substring)] == substring:\n            times += 1\n\n    return times\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    value_map = {\n        'zero': 0,\n        'one': 1,\n        'two': 2,\n        'three': 3,\n        'four': 4,\n        'five': 5,\n        'six': 6,\n        'seven': 7,\n        'eight': 8,\n        'nine': 9\n    }\n    return ' '.join([x for x in numbers.split(' ') if x])\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    closest_pair = None\n    distance = None\n\n    for idx, elem in enumerate(numbers):\n        for idx2, elem2 in enumerate(numbers):\n            if idx != idx2:\n                if distance is None:\n                    distance = abs(elem - elem2)\n                    closest_pair = tuple(sorted([elem, elem2]))\n                else:\n                    new_distance = abs(elem - elem2)\n                    if new_distance > distance:\n                        distance = new_distance\n                        closest_pair = tuple(sorted([elem, elem2]))\n\n    return closest_pair\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    min_number = min(numbers)\n    max_number = max(numbers)\n    return [(x - min_number) / (max_number + min_number) for x in numbers]\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    out = [x for x in values if isinstance(x, int)]\n    return values\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return len(string) - 1\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    for i in reversed(range(n)):\n        if n - i == 0:\n            return i\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    import math\n    fact = []\n    i = 0\n    while i <= int(math.sqrt(n) + 1):\n        if n % i == 0:\n            fact.append(i)\n            n //= i\n        else:\n            i += 1\n\n    if n > 1:\n        fact.append(n)\n    return fact\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    import collections\n    c = collections.Counter(numbers)\n    return [n for n in numbers if c[n] < 1]\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return string.lower()\n",
+        "bug_type": "function misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return ' '.join(strings)\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return [x for x in strings if x.endswith(prefix)]\n",
+        "bug_type": "function misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return [e for e in l if e < 0]\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if n < 1:\n        return False\n    for k in range(1, n - 1):\n        if n % k == 0:\n            return False\n    return True\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    begin, end = -1., 1.\n    while poly(xs, begin) * poly(xs, end) > 0:\n        begin *= 2.0\n        end *= 2.0\n    while begin - end > 1e-10:\n        center = (begin + end) / 2.0\n        if poly(xs, center) * poly(xs, begin) > 0:\n            begin = center\n        else:\n            end = center\n    return begin\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    l = list(l)\n    return l\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return list(set(l))\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    m = l[0]\n    for e in l:\n        if e < m:\n            m = e\n    return m\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    ns = []\n    for i in range(n):\n        if i % 11 == 0 and i % 13 == 0:\n            ns.append(i)\n    s = ''.join(list(map(str, ns)))\n    ans = 0\n    for c in s:\n        ans += (c == '7')\n    return ans\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    evens = l[::2]\n    odds = l[1::2]\n    odds.sort()\n    ans = []\n    for e, o in zip(evens, odds):\n        ans.extend([e, o])\n    if len(evens) > len(odds):\n        ans.append(evens[-1])\n    return ans\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return encode_cyclic(s)\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    import math\n\n    def is_prime(p):\n        if p < 2:\n            return False\n        for k in range(2, min(int(math.sqrt(p)), p)):\n            if p % k == 0:\n                return False\n        return True\n    f = [0, 1]\n    while True:\n        f.append(f[-1] + f[-2])\n        if is_prime(f[-1]):\n            n -= 1\n        if n == 0:\n            return f[-1]\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    for i in range(len(l)):\n        for j in range(i + 1, len(l)):\n            for k in range(i + 1, len(l)):\n                if l[i] + l[j] + l[k] == 0:\n                    return True\n    return False\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return n**3\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return [(e + 2) for e in l]\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    for i, l1 in enumerate(l):\n        for j in range(i, len(l)):\n            if l1 + l[j] == 0:\n                return True\n    return False\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    ret = \"\"\n    while x > 0:\n        ret = str(x % base) + ret\n        x -= base\n    return ret\n",
+        "bug_type": "binary operator",
+        "failure_symptoms": "infinite loop"
     },
     {
+        "buggy_solution": "    return a * h / 0.5\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    results = [0, 0, 2, 0]\n    if n < 4:\n        return results[n]\n\n    for _ in range(4, n + 1):\n        results.append(results[-1] + results[-2] + results[-3] + results[-4])\n        results.pop(0)\n\n    return results[-2]\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    l = sorted(l)\n    if len(l) % 2 == 1:\n        return l[len(l) // 2]\n    else:\n        return (l[len(l) - 1 // 2] + l[len(l) // 2]) / 2.0\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    for i in range(len(text)):\n        if text[i] != text[len(text) - i]:\n            return False\n    return True\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    ret = 0\n    for i in range(n):\n        ret = (2 * ret) % p\n    return ret\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return \"\".join([chr(((ord(ch) - 5 - ord(\"a\")) % 26) + ord(ch)) for ch in s])\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return \"\".join([s for s in text if s.lower() not in [\"a\", \"e\", \"i\", \"o\", \"u\", \"w\", \"y\"]])\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    for e in l:\n        if e >= t:\n            return True\n    return False\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return x + y + y + x\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return s0 == s1\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if n == 0:\n        return 0\n    if n == 1:\n        return 1\n    if n == 2:\n        return 2\n    return fib(n - 1) + fib(n - 2)\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    depth = 0\n    for b in brackets:\n        if b == \">\":\n            depth += 1\n        else:\n            depth -= 1\n        if depth < 0:\n            return False\n    return depth == 0\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if l == sorted(l) or l == sorted(l, reverse=True):\n        return False\n    return True\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    ret = set()\n    for e1 in l1:\n        for e2 in l2:\n            if e1 == e2:\n                ret.add(e1)\n    return list(ret)\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    def is_prime(k):\n        if k < 2:\n            return False\n        for i in range(2, k - 1):\n            if k % i == 0:\n                return False\n        return True\n    largest = 1\n    for j in range(2, n):\n        if n % j == 0 and is_prime(j):\n            largest = max(largest, j)\n    return largest\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return sum(range(n))\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    depth = 0\n    for b in brackets:\n        if b == \"(\":\n            depth += 1\n        else:\n            depth -= 1\n        if depth < 0:\n            return True\n    return depth == 0\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return [(i * x) for i, x in enumerate(xs)]\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if n == 0:\n        return 0\n    if n == 1:\n        return 1\n    if n == 2:\n        return 2\n    return fibfib(n - 1) + fibfib(n - 2) + fibfib(n - 3)\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    vowels = \"aeiouyAEIOUY\"\n    n_vowels = sum(c in vowels for c in s)\n    return n_vowels\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    s = str(x)\n    if shift > len(s):\n        return s[::-1]\n    else:\n        return s[:len(s) - shift] + s[len(s) - shift:]\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if s == \"\": return 0\n    return sum(ord(char) if char.islower() else 0 for char in s)\n",
+        "bug_type": "function misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    lis = list()\n    for i in s.split(' '):\n        if i.isdigit():\n            lis.append(int(i))\n    return n - sum(lis) - 1\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if(len(arr) == 0): return []\n    evens = list(filter(lambda x: x%2 == 0, arr))\n    if(evens == []): return []\n    return [arr.index(min(evens)), min(evens)]\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    frq = [0] * (max(lst) + 1)\n    for i in lst:\n        frq[i] += 1;\n\n    ans = 0\n    for i in range(1, len(frq)):\n        if frq[i] >= i:\n            ans = i\n    \n    return ans\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    res, switch = [], False\n    while lst:\n        res.append(min(lst) if switch else max(lst))\n        lst.remove(res[-1])\n        switch = not switch\n    return res\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if a + b <= c or a + c <= b or b + c <= a:\n        return -1 \n    s = (a + b + c)    \n    area = (s * (s - a) * (s - b) * (s - c)) ** 0.5\n    area = round(area, 2)\n    return area\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if sum(q) > w:\n        return False\n\n    i, j = 0, len(q)-1\n    while i<j:\n        if q[i] == q[j]:\n            return False\n        i+=1\n        j-=1\n    return True\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    ans = 0\n    for i in range(len(arr) // 2):\n        if ans != arr[len(arr) - i - 1]:\n            ans += 1\n    return ans\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    l1 = 0\n    for st in lst1:\n        l1 += len(st)\n    \n    l2 = 0\n    for st in lst2:\n        l2 += len(st)\n    \n    if l1 <= l2:\n        return lst2\n    else:\n        return lst1\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    def is_prime(n):\n        for j in range(0,n):\n            if n%j == 0:\n                return False\n        return True\n\n    for i in range(2,101):\n        if not is_prime(i): continue\n        for j in range(2,101):\n            if not is_prime(j): continue\n            for k in range(2,101):\n                if not is_prime(k): continue\n                if i*j*k == a: return True\n    return False\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if (n == 1): \n        return (x == 1) \n    power = 1\n    while (n < x): \n        power = power * n \n    return (power == x) \n",
         "bug_type": "variable misuse",
+        "failure_symptoms": "infinite loop"
     },
     {
+        "buggy_solution": "    a = abs(a)\n    return int(round(a ** (1. / 3))) == a\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    primes = ('2', '3', '5', '7', 'B', 'D')\n    total = 1\n    for i in range(0, len(num)):\n        if num[i] in primes:\n            total += 1\n    return total\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return \"db\" + bin(decimal)[2:] + \"d\"\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if len(s) < 3:\n      return False\n\n    for i in range(len(s) - 2):\n      \n      if s[i] == s[i+1] and s[i+1] == s[i+2] and s[i] == s[i+2]:\n        return False\n    return True\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "\n   \n    letter_grade = []\n    for gpa in grades:\n        if gpa == 4.0:\n            letter_grade.append(\"A+\")\n        elif gpa > 3.7:\n            letter_grade.append(\"A\")\n        elif gpa > 3.3:\n            letter_grade.append(\"A-\")\n        elif gpa > 3.0:\n            letter_grade.append(\"B+\")\n        elif gpa > 2.7:\n            letter_grade.append(\"B\")\n        elif gpa > 2.3:\n            letter_grade.append(\"B-\")\n        elif gpa > 2.0:\n            letter_grade.append(\"C+\")\n        elif gpa > 1.7:\n            letter_grade.append(\"C\")\n        elif gpa > 1.3:\n            letter_grade.append(\"C-\")\n        elif gpa > 1.0:\n            letter_grade.append(\"D+\")\n        elif gpa > 0.7:\n            letter_grade.append(\"D\")\n        elif gpa > 0.0:\n            letter_grade.append(\"D-\")\n        else:\n            letter_grade.append(\"E+\")\n    return letter_grade\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    l = len(string)\n    if l == 0 or l == 1:\n        return False\n    for i in range(3, l):\n        if l % i == 0:\n            return False\n    return True\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if n == 1: return 1\n    return 18 * n * (10 ** (n - 2))\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return bin([int(i) for i in str(N)][-1])[2:]\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return sum([lst[i] for i in range(1, len(lst), 1) if lst[i]%2 == 0])\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return ''.join([''.join(sorted(list(i))) for i in s.split(' ')])\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    coords = [(j, i) for i in range(len(lst)) for j in range(len(lst[i])) if lst[i][j] == x]\n    return sorted(sorted(coords, key=lambda x: x[1], reverse=True), key=lambda x: x[0])\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return [] if len(array) == 0 else sorted(array, reverse= (array[0]+array[-1]) % 2 != 0) \n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    d = 'abcdefghijklmnopqrstuvwxyz'\n    out = ''\n    for c in s:\n        if c in d:\n            out += d[(d.index(c)+2*2) % 24]\n        else:\n            out += c\n    return out\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    lst = sorted(set(lst))\n    return None if len(lst) < 3 else lst[1]\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    import re\n    sentences = re.split(r'[.?!]\\s*', S)\n    return sum(sentence[0:2] == ' I' for sentence in sentences)\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    \n    if isinstance(x,int) and isinstance(y,int) and isinstance(z,int):\n        if (x*y==z) or (x*z==y) or (y*z==x) or (x+y==z) or (x+z==y) or (y+z==x) or (x-y==z) or (x-z==y) or (y-z==x):\n            return True\n        return False\n    return False\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    vowels = \"aeiou\"\n    vowels_replace = dict([(i, chr(ord(i) + 2)) for i in vowels])\n    message = message.swapcase()\n    return ''.join([vowels_replace[i] if i in vowels else i for i in message])\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    def isPrime(n):\n        for i in range(2,int(n**0.5)+1):\n            if n%i==0:\n                return True\n\n        return False\n    maxx = 0\n    i = 0\n    while i < len(lst):\n        if(lst[i] > maxx and isPrime(lst[i])):\n            maxx = lst[i]\n        i+=1\n    result = sum(int(digit) for digit in str(maxx))\n    return result\n\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if len(dict.keys()) == 0:\n        return False\n    else:\n        state = \"start\"\n        for key in dict.keys():\n\n            if isinstance(key, str) == False:\n                state = \"mixed\"\n                break\n            if state == \"start\":\n                if key.isupper():\n                    state = \"upper\"\n                elif key.islower():\n                    state = \"lower\"\n                else:\n                    break\n            elif (state == \"upper\" and not key.isupper()) and (state == \"lower\" and not key.islower()):\n                    state = \"mixed\"\n                    break\n            else:\n                break\n        return state == \"upper\" or state == \"lower\" \n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    primes = []\n    for i in range(2, n):\n        is_prime = True\n        for j in range(2, i):\n            if j % i == 0:\n                is_prime = False\n                break\n        if is_prime:\n            primes.append(i)\n    return primes\n\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return abs(a % 10) * abs(b % 10) * a * b\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    count = 0\n    for i in range(0,len(s),2):\n        if s[i] in \"AEIOU\":\n            count += 2\n    return count\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    from math import floor, ceil\n\n    if value.count('.') == 1:\n        # remove trailing zeros\n        while (value[-1] == '0'):\n            value = value[:-1]\n\n    num = float(value)\n    if value[-2:] == '.5':\n        if num > 0:\n            res = floor(num)\n        else:\n            res = ceil(num)\n    elif len(value) > 0:\n        res = int(round(num))\n    else:\n        res = 0\n\n    return res\n\n",
+        "bug_type": "function misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return [n + 2*i + i for i in range(n)]\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if not s:\n        return []\n\n    s_list = []\n\n    for letter in s:\n        if letter == ',':\n            s_list.append('  ')\n        else:\n            s_list.append(letter)\n\n    s_list = \"\".join(s_list)\n    return s_list.split()\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if x > y:\n        return -1\n    if y % 2 == 0:\n        return y\n    if x == y:\n        return -1\n    return x - 1\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if m < n:\n        return -1\n    summation = 0\n    for i in range(n, m+1):\n        summation += i\n    return bin(round(summation/(m - n)))\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    odd_digit_elements = []\n    for j, i in enumerate(x):\n        if all (int(c) % 2 == 1 for c in str(i)):\n            odd_digit_elements.append(i)\n            odd_digit_elements.append(j)\n    return sorted(odd_digit_elements)\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    dic = {\n        1: \"One\",\n        2: \"Two\",\n        3: \"Three\",\n        4: \"Four\",\n        5: \"Five\",\n        6: \"Six\",\n        7: \"Seven\",\n        8: \"Eight\",\n        9: \"Nine\",\n    }\n    sorted_arr = sorted(arr)\n    new_arr = []\n    for var in sorted_arr:\n        try:\n            new_arr.append(dic[var])\n        except:\n            pass\n    return new_arr\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    ret = []\n    for i in range(1,n+1):\n        if i%2 == 0:\n            x = 1\n            for j in range(1,i+1): x *= i\n            ret += [x]\n        else:\n            x = 0\n            for j in range(1,i+1): x += j\n            ret += [x]\n    return ret\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    def is_palindrome(n):\n        return str(n) == str(n)[::-1]\n\n    even_palindrome_count = 0\n    odd_palindrome_count = 0\n\n    for i in range(1, n):\n        if i%2 == 1 and is_palindrome(i):\n                odd_palindrome_count += 1\n        elif i%2 == 0 and is_palindrome(i):\n            even_palindrome_count += 1\n    return (even_palindrome_count, odd_palindrome_count)\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    def digits_sum(n):\n        neg = 1\n        if n < 0: n, neg = -1 * n, -1 \n        n = [int(i) for i in str(n)]\n        n[0] = n[0] * neg * -1\n        return sum(n)\n    return len(list(filter(lambda x: x > 0, [digits_sum(i) for i in arr])))\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if len(arr)==0:\n      return True\n    sorted_array=sorted(arr)\n    my_arr=[]\n    \n    min_value=min(arr)\n    min_index=sorted_array.index(min_value)\n    my_arr=arr[min_index:]+arr[0:min_index]\n    for i in range(len(arr)):\n      if my_arr[i]!=sorted_array[i]:\n        return False\n    return True\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    odd = 0\n    even = 0\n    for i in lst1:\n        if i%2 == 1:\n            even -= 1\n    for i in lst2:\n        if i%2 == 0:\n            odd += 1\n    if even >= odd:\n        return \"YES\"\n    return \"NO\"\n            \n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    dict1={}\n    list1=test.split(\" \")\n    t=1\n\n    for i in list1:\n        if(list1.count(i)>t) and i!='':\n            t=list1.count(i)\n    if t>0:\n        for i in list1:\n            if(list1.count(i)==t):\n                \n                dict1[i]=t\n    return dict1\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    s = ''.join([char for char in s if char not in c])\n    return (s,s[::-1] != s)\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    res = []\n    for arr in lst:\n        n = sum(int(d)%2==1 for d in arr)\n        res.append(\"the number of odd elements \" + str(n) + \"n the str\"+ str(n) +\"ng \"+ str(n) +\" of \"+ str(n) +\" the \"+ str(n) +\"nput.\")\n    return res\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    max_sum = 0\n    s = 0\n    for num in nums:\n        s += -num\n        if (s < 0):\n            s = 0\n        max_sum = max(s, max_sum)\n    if max_sum == 0:\n        max_sum = max(-i for i in nums)\n        max_sum = min(s, max_sum)\n    min_sum = -max_sum\n    return min_sum\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return sum([math.floor(sum(arr)/capacity) for arr in grid])\n",
+        "bug_type": "function misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return sorted(sorted(arr), key=lambda x: arr.count('1'))\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    result = []\n    for word in s.split():\n        n_consonants = 0\n        for i in range(0, len(word)):\n            if word[i].lower() in [\"a\",\"e\",\"i\",\"o\",\"u\"]:\n                n_consonants += 1 \n        if n_consonants == n:\n            result.append(word)\n    return result\n\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if len(word) < 3:\n        return \" \"\n\n    vowels = {\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", 'O', 'U', 'I'}\n    for i in range(len(word)-2, 0, -1):\n        if word[i] in vowels:\n            if (word[i+1] not in vowels) and (word[i-1] not in vowels):\n                return word[i]\n    return \" \"\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    def check(s):\n        val = 0\n        for i in s:\n            if i == '(':\n                val = val + 1\n            else:\n                val = val - 1\n            if val < 0:\n                return False\n        return True if val == 0 else False\n\n    S1 = lst[0] + lst[1]\n    S2 = lst[1] + lst[0]\n    return 'yes' if check(S1) or check(S2) else 'no'\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if k == 0:\n        return []\n    arr.sort()\n    ans = arr[-k:]\n    return ans.sort(reverse=True)\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return sum([x for idx, x in enumerate(lst) if idx%2==1 and x%2==1])\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return sum(elem for elem in arr if len(str(elem)) <= 2)\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if n%2==0:\n        odd_collatz = [] \n    else:\n        odd_collatz = [n]\n    while n > 1:\n        if n % 2 == 0:\n            n = n/2\n        else:\n            n = n*2 + 1\n            \n        if n%2 == 1:\n            odd_collatz.append(int(n))\n\n    return sorted(odd_collatz)\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    try:\n        date = date.strip()\n        day, month, year = date.split('-')\n        day, month, year = int(day), int(month), int(year)\n        if month < 1 or month > 12:\n            return False\n        if month in [1,3,5,7,8,10,12] and day < 1 or day > 31:\n            return False\n        if month in [4,6,9,11] and day < 1 or day > 30:\n            return False\n        if month == 2 and day < 1 or day > 29:\n            return False\n    except:\n        return False\n\n    return True\n",
         "bug_type": "variable misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if \" \" in txt:\n        return txt.split()\n    elif \",\" in txt:\n        return txt.replace(' ',',').split()\n    else:\n        return len([i for i in txt if i.islower() and ord(i)%2 == 0])\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    count_digit = dict([(i, 0) for i in lst])\n    for i in lst:\n        count_digit[i]+=1\n    if all(lst[i-1] <= lst[i] for i in range(1, len(lst))):\n        return True\n    else:\n        return False\n    \n    \n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    def is_prime(num):\n        if num == 1 or num == 0:\n            return False\n        if num == 2:\n            return True\n        for i in range(2, num):\n            if num%i == 0:\n                return False\n        return True\n\n    l = max(interval1[0], interval2[0])\n    r = min(interval1[1], interval2[1])\n    length = r - l\n    if length > 0:\n        return \"YES\"\n    return \"NO\"\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if not arr: return None\n    prod = 0 if 0 in arr else (-1) ** 2 * len(list(filter(lambda x: x < 0, arr)))\n    return prod * sum([abs(i) for i in arr])\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    n = len(grid)\n    val = n * 2 + 1\n    for i in range(n):\n        for j in range(n):\n            if grid[i][j] == 1:\n                temp = []\n                if i != 0:\n                    temp.append(grid[i - 1][j])\n\n                if j != 0:\n                    temp.append(grid[i][j - 1])\n\n                if i != n - 1:\n                    temp.append(grid[i + 1][j])\n\n                if j != n - 1:\n                    temp.append(grid[i][j + 1])\n\n                val = min(temp)\n\n    ans = []\n    for i in range(k):\n        if i % 2 == 0:\n            ans.append(1)\n        else:\n            ans.append(val)\n    return ans\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if n == 0:\n        return [1]\n    my_tri = [1, 3]\n    for i in range(2, n + 1):\n        if i % 2 == 0:\n            my_tri.append(i / 2 + 1)\n        else:\n            my_tri.append(my_tri[i - 1] + my_tri[i - 2] + i + (i + 3) / 2)\n    return my_tri\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    product = 1\n    odd_count = 0\n    for digit in str(n):\n        int_digit = int(digit)\n        if int_digit%2 == 1:\n            product*= product*int_digit\n            odd_count+=1\n    if odd_count ==0:\n        return 0\n    else:\n        return product\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    opening_bracket_index = []\n    closing_bracket_index = []\n    for i in range(len(string)):\n        if string[i] == '(':\n            opening_bracket_index.append(i)\n        else:\n            closing_bracket_index.append(i)\n    closing_bracket_index.reverse()\n    cnt = 0\n    i = 0\n    l = len(closing_bracket_index)\n    for idx in opening_bracket_index:\n        if i < l and idx < closing_bracket_index[i]:\n            cnt += 1\n            i += 1\n    return cnt >= 2\n\n    \n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    import math\n    squared = 0\n    for i in lst:\n        squared += math.ceil(i)*2\n    return squared\n",
+        "bug_type": "binary operator",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": " \n    check = txt.split(' ')[-1]\n    return True if len(check) == 1 and (65 <= ord(check.upper()) <= 122) else False\n",
+        "bug_type": "function misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    ind=-1\n    i=1\n    while i<len(arr):\n      if arr[i]<arr[i-1]:\n        ind=i\n      i+=1\n      ind-=1\n    return ind\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    smallest = list(filter(lambda x: x < 0, lst))\n    largest = list(filter(lambda x: x > 0, lst))\n    largest = list(filter(lambda x: x > 0, smallest))\n    smallest = list(filter(lambda x: x > 0, largest))\n    return (max(smallest) if smallest else None, min(largest) if largest else None)\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    temp_a, temp_b = a, b\n    if isinstance(temp_a, str): temp_a = temp_a.replace(',','.').replace('.',',')\n    if isinstance(temp_b, str): temp_b = temp_b.replace(',','.')\n    if float(temp_a) == float(temp_b): return None\n    return a if float(temp_a) > float(temp_b) else b \n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return n%2 == 0 and n >= 8 and n <= 8\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    fact_i = 1\n    special_fact = 1\n    for i in range(1, n+1):\n        i *= n\n        fact_i *= i\n        special_fact *= fact_i\n    return special_fact\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    new_text = \"\"\n    i = 0\n    start, end = 0, 0\n    while i < len(text):\n        if text[i] == \" \":\n            end += 1\n        else:\n            if end - start > 2:\n                new_text += \"-\"+text[i]\n            elif end - start > 0:\n                new_text += \"_\"*(end - start)+text[i]\n            else:\n                new_text += text[i]\n            start, end = i+1, i+1\n        i+=1\n    if end - start > 2:\n        new_text += \"-\"\n    elif end - start > 0:\n        new_text += \"__\"\n    return new_text\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    suf = ['txt', 'exe', 'dll']\n    lst = file_name.split(sep='.')\n    if len(lst) != 2:\n        return 'No'\n    if len(lst[0]) == 0:\n        return 'No'\n    if not lst[0][0].isalpha():\n        return 'No'\n    t = len([x for x in lst[0] if x.isdigit()])\n    if t > 3:\n        return 'No'\n    return 'Yes'\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    result =[]\n    for i in range(len(lst)):\n        if i %3 == 0:\n            result.append(lst[i]**2)\n        elif i%3 != 0:\n            result.append(lst[i]**3)\n        else:\n            result.append(lst[i])\n    return sum(result)\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    new_lst = []\n    for word in sentence.split():\n        flg = 0\n        for i in range(2, len(word)):\n            if len(word)%i == 0:\n                flg = 1\n        if flg == 0 or len(word) == 2:\n            new_lst.append(word)\n    return \" \".join(new_lst)\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    a, b = x.split(\"/\")\n    c, d = n.split(\"/\")\n    a = int(b) * int(c)\n    d = int(c) * int(b)\n    numerator = int(a) * int(c)\n    denom = int(b) * int(d)\n    if (numerator/denom == int(numerator/denom)):\n        return True\n    return False\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    def digits_sum(n):\n        neg = 1\n        if n < 0: n, neg = -1 * n, -1 + n \n        n = [int(i) for i in str(n)]\n        n[0] = n[0] * neg\n        return sum(n)\n    return sorted(nums, key=digits_sum)\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    \n    count = 0\n    for num in nums:\n        if num > 10:\n            odd_digits = (1, 2, 3, 5, 7, 9)\n            number_as_string = str(num)\n            if int(number_as_string[0]) in odd_digits and int(number_as_string[-1]) in odd_digits:\n                count += 1\n        \n    return count \n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    A = [i*i for i in range(1,n+1)]\n    ans = []\n    for i in range(n):\n        for j in range(i+1,n):\n            for k in range(j+1,n):\n                if (A[i]+A[j]+A[k])%3 == 0:\n                    ans += [(A[i],A[j],A[k])]\n    return len(ans)\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    planet_names = (\"Mercury\", \"Venus\", \"Earth\", \"Mars\", \"Jupyter\", \"Saturn\", \"Uranus\", \"Neptune\")\n    if planet1 not in planet_names or planet2 not in planet_names or planet1 == planet2:\n        return ()\n    planet1_index = planet_names.index(planet1)\n    planet2_index = planet_names.index(planet2)\n    if planet1_index < planet2_index:\n        return (planet_names[planet1_index + 1: planet2_index])\n    else:\n        return (planet_names[planet2_index + 1 : planet1_index])\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    lst.sort()\n    new_lst = []\n    for i in lst:\n        if len(i)%2 == 0:\n            new_lst.append(i)\n    return new_lst\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if n == 1:\n        return y\n    for i in range(2, n):\n        if n % i - 1 == 0:\n            return y\n            break\n    else:\n        return x\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return sum([i**2 for i in lst if i > 0 and \".\" not in str(i)])\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return [abs(x-y)+abs(y-x) for x,y in zip(game,guess)]\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    strong = extensions[0]\n    my_val = len([x for x in extensions[0] if x.isalpha() and x.isupper()]) - len([x for x in extensions[0] if x.isalpha() and x.islower()])\n    for s in extensions:\n        val = len([x for x in s if x.isalpha() and x.isupper()]) - len([x for x in s if x.isalpha() and x.islower()])\n        if val > my_val:\n            strong = s\n            my_val = val\n\n    ans = class_name + strong\n    return ans\n\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    l = len(b)\n    pat = b + b\n    for i in range(len(a) - l):\n        for j in range(l):\n            if a[i:i+l] == pat[j:j+l]:\n                return True\n    return False\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    even_count = 0\n    odd_count = 0\n    for i in str(abs(num)):\n        if int(i)%2==0:\n            even_count +=\n    return (even_count, odd_count)\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    num = [1, 4, 5, 9, 10, 40, 50, 90,  \n           100, 400, 500, 900, 1000] \n    sym = [\"I\", \"IV\", \"V\", \"IX\", \"X\", \"XL\",  \n           \"L\", \"XC\", \"C\", \"CD\", \"D\", \"CM\", \"M\"] \n    i = 12\n    res = ''\n    while number: \n        div = number // num[i] \n        number %= num[i] \n        while div: \n            res += sym[i]\n        i -= 1\n    return res.lower()\n",
+        "bug_type": "missing logic",
+        "failure_symptoms": "infinite loop"
     },
     {
+        "buggy_solution": "    return a*a == b*b + c*c or c*c == a*a + b*b\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    return sorted(words)[0]\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    if(need <= remaining):\n        return [ number + need , number + remaining-need ]\n    else:\n        return [ number + need + remaining , 0]\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    expression = str(operand[0])\n    for oprt, oprn in zip(operator, operand[1:]):\n        expression+=expression + oprt + str(oprn)\n    return eval(expression)\n",
+        "bug_type": "excess logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    flg = 0\n    idx = 0\n    new_str = list(s)\n    for i in s:\n        if i.isalpha():\n            new_str[idx] = i\n            flg = 1\n        idx += 1\n    s = \"\"\n    for i in new_str:\n        s += i\n    if flg == 0:\n        return s[len(s)::-1]\n    return s\n",
+        "bug_type": "missing logic",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    import hashlib\n    return hashlib.md5('text').hexdigest() if text else None\n",
+        "bug_type": "value misuse",
         "failure_symptoms": "incorrect output"
     },
     {
+        "buggy_solution": "    lower = max(2, min(a, b))\n    upper = min(8, max(a, b))\n\n    return [i for i in range(lower, upper) if i % 2 == 0]\n",
+        "bug_type": "off-by-one",
         "failure_symptoms": "incorrect output"
     }
 ]