offcode 0.0.0-stage → 0.1.0

package/data/problems/k-similar-strings.json

@@ -0,0 +1 @@
+{"basic": false, "label": "850", "slug": "k-similar-strings", "id": 850, "title": "K-Similar Strings", "difficulty": "Hard", "category": "string", "link": "https://leetcode.com/problems/k-similar-strings/", "examples": [{"input": "s1 = \"ab\", s2 = \"ba\"", "output": "1", "explanation": "One swap suffices."}, {"input": "s1 = \"abc\", s2 = \"bca\"", "output": "2", "explanation": "Two swaps rotate the letters."}, {"input": "s1 = \"abac\", s2 = \"baca\"", "output": "2", "explanation": "Two swaps align all spots."}], "hints": ["Breadth-first search over strings works: each level is one more swap, and the first visit to s2 is optimal.", "Prune hard: only swap the first mismatched index i with a later j where s1[j] equals s2[i].", "Skip already-seen strings with a visited set to keep the queue small."], "statement": "Count the fewest swaps turning one anagram into another.\n\nStrings `s1` and `s2` hold the same multiset of lowercase letters. In one move you may swap any two positions of `s1`. Return the smallest number of such swaps that rewrites `s1` into `s2`.\n\n**Constraints:**\n- `1 <= s1.length <= 20`\n- `s1.length == s2.length`\n- `s1` and `s2` are anagrams with lowercase letters.\n", "solution": "## Approach\n\nRun breadth-first search from `s1`, where neighbours are swaps fixing the first mismatch. Always swap that index with a later position holding the needed target letter (and not already correct there) to prune heavily. Levels count swaps, so the first arrival at `s2` is minimal; a visited set blocks repeats.\n\n## Complexity Analysis\n\n- **Time Complexity:** Exponential in the worst case but tiny for length up to 20 thanks to pruning; each state fans out to few swaps.\n- **Space Complexity:** O(states) for the queue and visited set.\n\n## Implementation\n\n```python\nfrom collections import deque\nclass Solution:\n    def kSimilarity(self, s1: str, s2: str) -> int:\n        if s1 == s2:\n            return 0\n        q = deque([s1])\n        seen = {s1}\n        steps = 0\n        while q:\n            steps += 1\n            for _ in range(len(q)):\n                cur = q.popleft()\n                i = 0\n                while i < len(cur) and cur[i] == s2[i]:\n                    i += 1\n                lst = list(cur)\n                for j in range(i + 1, len(cur)):\n                    if lst[j] == s2[i] and lst[j] != s2[j]:\n                        lst[i], lst[j] = lst[j], lst[i]\n                        nxt = ''.join(lst)\n                        if nxt == s2:\n                            return steps\n                        if nxt not in seen:\n                            seen.add(nxt)\n                            q.append(nxt)\n                        lst[i], lst[j] = lst[j], lst[i]\n        return -1\n```\n", "starter": {"go": "package main\n\nfunc KSimilarity(s1 string, s2 string) int {\n    return 0\n}", "python": "class Solution:\n    def kSimilarity(self, s1: str, s2: str) -> int:\n        return 0\n", "cpp": "#include <string>\nusing namespace std;\nclass Solution {\npublic:\n    int kSimilarity(string s1, string s2) {\n        return 0;\n    }\n};"}, "fn": "kSimilarity", "params": [{"name": "s1", "type": "string"}, {"name": "s2", "type": "string"}], "outputType": "int", "tests": [["ab", "ba"], ["abc", "bca"], ["abac", "baca"], ["aabc", "abca"], ["a", "a"], ["ab", "ab"], ["abc", "abc"], ["abc", "acb"], ["abcd", "badc"], ["abcd", "dcba"], ["aabb", "bbaa"], ["abac", "acab"], ["abcde", "edcba"], ["aabbc", "bbcaa"], ["abcab", "bacba"], ["abcdef", "fedcba"], ["aaabbb", "bbbaaa"], ["abcdab", "badcba"], ["abccba", "abccba"], ["abcabc", "cbaabc"], ["aabbcc", "ccbbaa"], ["ab", "ba"], ["aa", "aa"], ["abcd", "abcd"], ["bac", "abc"], ["cba", "abc"], ["abca", "acab"], ["aabb", "abab"]], "expected": [1, 2, 2, 2, 0, 0, 0, 1, 2, 2, 2, 1, 2, 3, 2, 3, 3, 3, 0, 1, 2, 1, 0, 0, 1, 1, 2, 1], "loose": false}

package/data/problems/k-th-smallest-in-lexicographical-order.json

@@ -0,0 +1 @@
+{"basic": false, "label": "508", "slug": "k-th-smallest-in-lexicographical-order", "id": 508, "title": "K-th Smallest in Lexicographical Order", "difficulty": "Hard", "category": "trie", "link": "https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/", "examples": [{"input": "n = 13, k = 2", "output": "10", "explanation": "Dictionary order begins 1, 10, 11, 12, 13, 2, .... The second entry is 10."}, {"input": "n = 1, k = 1", "output": "1", "explanation": "Only one value exists."}], "hints": ["Think of numbers as a ten-way tree where children of x are x*10 through x*10+9.", "Count how many values sit under a prefix without visiting each one, then skip whole subtrees or dive deeper.", "Decrease k as you consume prefixes or descend, stopping when k reaches zero."], "statement": "You are given two whole numbers `n` and `k`. Picture all numbers from `1` to `n` written out and then ordered the way words appear in a dictionary (so all numbers starting with `1` come before those starting with `2`, and `10` sits between `1` and `11`).\n\nReturn the `k`-th number in that dictionary ordering, counting from `1`.\n\n**Constraints:**\n- `1 <= k <= n <= 10^9`\n", "solution": "## Approach\n\nView the values as a ten-way tree: the children of `x` are `x*10` through `x*10+9`. Dictionary order is a depth-first walk of this tree. Instead of walking one by one, count how many entries live under a prefix with a helper that sums interval sizes across levels. If the whole subtree fits before `k`, skip it sideways; otherwise go deeper to the first child. Repeat until `k` is consumed.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(log n) jumps, each counting across O(log n) levels.\n- **Space Complexity:** O(1) extra memory.\n\n## Implementation\n\n```python\nclass Solution:\n    def findKthNumber(self, n: int, k: int) -> int:\n        def steps(p1: int, p2: int) -> int:\n            s = 0\n            while p1 <= n:\n                s += min(n + 1, p2) - p1\n                p1 *= 10\n                p2 *= 10\n            return s\n        cur = 1\n        k -= 1\n        while k > 0:\n            c = steps(cur, cur + 1)\n            if c <= k:\n                cur += 1\n                k -= c\n            else:\n                cur *= 10\n                k -= 1\n        return cur\n```\n", "starter": {"go": "package main\n\nfunc FindKthNumber(n int, k int) int {\n    return 0\n}", "python": "class Solution:\n    def findKthNumber(self, n: int, k: int) -> int:\n        pass", "cpp": "class Solution {\npublic:\n    int findKthNumber(int n, int k) {\n        return 0;\n    }\n};"}, "fn": "findKthNumber", "params": [{"name": "n", "type": "int"}, {"name": "k", "type": "int"}], "outputType": "int", "tests": [["13", "2"], ["1", "1"], ["13", "5"], ["13", "1"], ["13", "13"], ["2", "2"], ["10", "10"], ["100", "10"], ["1000", "100"], ["10000", "1000"], ["1000000000", "1000000000"], ["1000000000", "1"], ["9", "9"], ["11", "2"], ["20", "12"], ["100", "1"], ["100", "100"], ["1000", "1"], ["957", "400"], ["500", "250"], ["9", "1"], ["99", "50"], ["1000", "500"], ["1000000", "1"], ["1000000", "1000000"], ["15", "8"], ["25", "20"], ["200", "150"], ["1000000000", "500000000"], ["50", "25"]], "expected": [10, 1, 13, 1, 9, 2, 9, 17, 188, 1898, 999999999, 1, 9, 10, 2, 1, 99, 1, 459, 323, 1, 54, 548, 1, 999999, 2, 4, 53, 549999998, 31], "loose": false}

package/data/problems/k-th-smallest-prime-fraction.json

@@ -0,0 +1 @@
+{"basic": false, "label": "785", "slug": "k-th-smallest-prime-fraction", "id": 785, "title": "K-th Smallest Prime Fraction", "difficulty": "Medium", "category": "array", "link": "https://leetcode.com/problems/k-th-smallest-prime-fraction/", "examples": [{"input": "arr = [1,2,3,5], k = 3", "output": "[2,5]", "explanation": "Ordered quotients start 1/5, 1/3, 2/5, so the third is [2,5]."}, {"input": "arr = [1,7], k = 1", "output": "[1,7]", "explanation": "A single quotient exists."}, {"input": "arr = [1,2,3,5,7], k = 4", "output": "[1,5]", "explanation": "The fourth quotient in order is 1/5."}], "hints": ["Compare two quotients a/b and c/d by cross products a*d versus c*b to avoid floating point.", "With modest sizes, enumerating all pairs and sorting is simple and fast enough.", "For large inputs, binary-search the value and count how many quotients fall below the midpoint."], "statement": "You are given a strictly increasing list `arr` whose first entry is `1`\nand whose remaining entries are primes. Consider every quotient formed by\npicking two positions `i < j` and computing `arr[i] / arr[j]`. Sorting all\nthose quotients from small to large, pick the `k`-th one (counting from 1)\nand report it as the pair `[arr[i], arr[j]]`.\n\nReturn the numerator and denominator as a two-element integer array. No\nfloating-point comparison is needed; cross-multiplication decides the order\nexactly.\n\n**Constraints:**\n- `2 <= arr.length <= 1000`\n- `1 <= arr[i] <= 3 * 10^4`\n- `arr[0] == 1`\n- `arr[i]` is prime for `i > 0`.\n- Values are unique and strictly increasing.\n- `1 <= k <= arr.length * (arr.length - 1) / 2`\n", "solution": "## Approach\n\nList every numerator/denominator pair with `i < j` and order the pairs by\nthe cross product `a*d` versus `c*b`, which matches the order of the true\nquotients without any rounding error. The element at position `k-1` in that\norder is the requested fraction. This direct enumeration is easily fast\nenough for the given limits; a binary search on the value would be the\nfollow-up optimization.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(m^2 log m), where m is the array length and the pair count is O(m^2).\n- **Space Complexity:** O(m^2) to hold all pairs.\n\n## Implementation\n\n```python\nfrom typing import List\nfrom functools import cmp_to_key\n\n\nclass Solution:\n    def kthSmallestPrimeFraction(self, arr: List[int], k: int) -> List[int]:\n        pairs = []\n        n = len(arr)\n        for i in range(n):\n            for j in range(i + 1, n):\n                pairs.append((arr[i], arr[j]))\n\n        def cmp(a, b):\n            left = a[0] * b[1]\n            right = b[0] * a[1]\n            return (left > right) - (left < right)\n\n        pairs.sort(key=cmp_to_key(cmp))\n        return [pairs[k - 1][0], pairs[k - 1][1]]\n```\n", "starter": {"go": "package main\n\nfunc KthSmallestPrimeFraction(arr []int, k int) []int {\n    return []int{}\n}", "python": "from typing import List\nclass Solution:\n    def kthSmallestPrimeFraction(self, arr: List[int], k: int) -> List[int]:\n        return []\n", "cpp": "#include <vector>\nusing namespace std;\n\nclass Solution {\npublic:\n    vector<int> kthSmallestPrimeFraction(vector<int>& arr, int k) {\n        return {};\n    }\n};"}, "fn": "kthSmallestPrimeFraction", "params": [{"name": "arr", "type": "int_array"}, {"name": "k", "type": "int"}], "outputType": "int_array", "tests": [["[1,2,3,5]", "3"], ["[1,7]", "1"], ["[1,2,3,5,7]", "4"], ["[1,2]", "1"], ["[1,3,5,7]", "1"], ["[1,3,5,7]", "6"], ["[1,2,3,5]", "1"], ["[1,2,3,5]", "6"], ["[1,5,7,11]", "2"], ["[1,5,7,11]", "5"], ["[1,2,5,11,13]", "7"], ["[1,2,5,11,13]", "10"], ["[1,3,7,11,13]", "3"], ["[1,3,7,11,13]", "8"], ["[1,2,3,7,11]", "5"], ["[1,11,13,17,19]", "6"], ["[1,2,3,5,7,11]", "9"], ["[1,2,3,5,7,11]", "15"], ["[1,2,3,5,7,11]", "1"], ["[1,29,47]", "2"], ["[1,2,3,5,7,11,13]", "12"], ["[1,2,3,5,7,11,13]", "21"], ["[1,7,11,13,17]", "4"], ["[1,7,11,13,17]", "9"], ["[1,3,5,7,11,13,17,19]", "14"], ["[1,3,5,7,11,13,17,19]", "28"], ["[1,2,5,7,11,13,17]", "10"], ["[1,2,7,13,19,29]", "11"]], "expected": [[2, 5], [1, 7], [1, 3], [1, 2], [1, 7], [5, 7], [1, 5], [2, 3], [1, 7], [7, 11], [2, 5], [11, 13], [1, 7], [7, 13], [2, 7], [11, 17], [3, 7], [5, 7], [1, 11], [1, 29], [2, 5], [11, 13], [1, 7], [13, 17], [7, 19], [17, 19], [5, 17], [13, 29]], "loose": false}

package/data/problems/k-th-symbol-in-grammar.json

@@ -0,0 +1 @@
+{"basic": false, "label": "778", "slug": "k-th-symbol-in-grammar", "id": 778, "title": "K-th Symbol in Grammar", "difficulty": "Medium", "category": "math", "link": "https://leetcode.com/problems/k-th-symbol-in-grammar/", "examples": [{"input": "n = 1, k = 1", "output": "0", "explanation": "The opening row is a single 0."}, {"input": "n = 2, k = 1", "output": "0", "explanation": "The second row starts with 0."}, {"input": "n = 2, k = 2", "output": "1", "explanation": "The second row ends with 1."}], "hints": ["Each position inherits from its parent at index (k+1)/2 in the previous row; an even k flips the parent value.", "Equivalently the answer equals the parity of the number of ones in the binary form of k-1.", "Recursion or a simple loop over the bits both run in O(n) time."], "statement": "Consider a family of binary rows built step by step. The first row holds a\nsingle `0`. To form each later row, every symbol of the previous row is\nexpanded: each `0` turns into the pair `01` and each `1` turns into the pair\n`10`. So the rows grow as `0`, then `01`, then `0110`, then `01101001`,\nand so on, with row `n` holding `2^(n-1)` entries.\n\nYou are given a row index `n` (counting from 1) and a position `k`\n(counting from 1 inside that row). Report the symbol that appears at that\nspot.\n\n**Constraints:**\n- `1 <= n <= 30`\n- `1 <= k <= 2^(n-1)`\n", "solution": "## Approach\n\nThe symbol at `(n, k)` comes from the symbol at `(n-1, (k+1)/2)`: an odd\nposition copies its parent while an even position negates it. Unrolling this\nparent chain counts how many times the path went to an even child, which is\nexactly the number of set bits in `k-1`. An odd count yields `1`, otherwise `0`.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(1) with a popcount, or O(n) by walking parents one row at a time.\n- **Space Complexity:** O(1).\n\n## Implementation\n\n```python\nclass Solution:\n    def kthGrammar(self, n: int, k: int) -> int:\n        return bin(k - 1).count(\"1\") % 2\n```\n", "starter": {"go": "package main\n\nfunc KthGrammar(n int, k int) int {\n    return 0\n}", "python": "class Solution:\n    def kthGrammar(self, n: int, k: int) -> int:\n        return 0\n", "cpp": "class Solution {\npublic:\n    int kthGrammar(int n, int k) {\n        return 0;\n    }\n};"}, "fn": "kthGrammar", "params": [{"name": "n", "type": "int"}, {"name": "k", "type": "int"}], "outputType": "int", "tests": [["1", "1"], ["2", "1"], ["2", "2"], ["3", "1"], ["3", "2"], ["3", "3"], ["3", "4"], ["4", "5"], ["4", "8"], ["5", "8"], ["5", "9"], ["5", "16"], ["6", "17"], ["6", "32"], ["7", "32"], ["7", "33"], ["8", "64"], ["8", "65"], ["10", "512"], ["10", "1"], ["15", "16384"], ["20", "524288"], ["30", "1"], ["30", "536870912"], ["30", "268435456"], ["4", "3"], ["9", "100"], ["12", "2048"]], "expected": [0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1], "loose": false}

package/data/problems/keyboard-row.json

@@ -0,0 +1 @@
+{"basic": false, "label": "563", "slug": "keyboard-row", "id": 563, "title": "Keyboard Row", "difficulty": "Easy", "category": "string", "link": "https://leetcode.com/problems/keyboard-row/", "examples": [{"input": "words = [\"Hello\",\"Alaska\",\"Dad\",\"Peace\"]", "output": "[\"Alaska\",\"Dad\"]", "explanation": "Alaska uses only the middle row and Dad uses only the middle row; the other two mix rows."}, {"input": "words = [\"omk\"]", "output": "[]", "explanation": "The letters span at least two rows."}, {"input": "words = [\"adsdf\",\"sfd\"]", "output": "[\"adsdf\",\"sfd\"]", "explanation": "Both words stay within the middle row."}], "hints": ["Map every letter (lowercased) to its row index 0, 1 or 2 once.", "A word passes when all its letters share the row of its first letter.", "Adaptation: the returned string list maps to string_list; preserve input order."], "statement": "American keyboards group letters into three rows: the top row holds `qwertyuiop`, the middle row holds `asdfghjkl`, and the bottom row holds `zxcvbnm`. Letter case does not matter for this task.\n\nGiven a list of words, keep only those whose letters all come from a single row. Return the kept words in their original order.\n\n**Constraints:**\n- `1 <= words.length <= 20`\n- `1 <= words[i].length <= 100`\n- Words contain only English letters\n", "solution": "## Approach\n\nPrecompute the three row sets in lowercase. For each word, lowercase it and pick the reference set from its first letter, then verify every letter belongs to that set. Matching words are collected in input order, preserving original casing.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(total letters) across all words.\n- **Space Complexity:** O(1) besides the output.\n\n## Implementation\n\n```python\nfrom typing import List\n\nclass Solution:\n    def findWords(self, words: List[str]) -> List[str]:\n        r1 = set(\"qwertyuiop\")\n        r2 = set(\"asdfghjkl\")\n        r3 = set(\"zxcvbnm\")\n        ans: List[str] = []\n        for w in words:\n            low = w.lower()\n            if not low:\n                continue\n            f = low[0]\n            ref = r1 if f in r1 else (r2 if f in r2 else r3)\n            if all(c in ref for c in low):\n                ans.append(w)\n        return ans\n```\n", "starter": {"go": "package main\n\nfunc FindWords(words []string) []string {\n    \n}", "python": "from typing import List\nclass Solution:\n    def findWords(self, words: List[str]) -> List[str]:\n        pass\n", "cpp": "#include <vector>\n#include <string>\nusing namespace std;\nclass Solution {\npublic:\n    vector<string> findWords(vector<string>& words) {\n        return {};\n    }\n};"}, "fn": "findWords", "params": [{"name": "words", "type": "string_array"}], "outputType": "string_list", "tests": [["['Hello', 'Alaska', 'Dad', 'Peace']"], ["['omk']"], ["['adsdf', 'sfd']"], ["['a', 'b', 'c']"], ["['qwerty', 'asdf', 'zxcv']"], ["['QWERTY', 'ASDF', 'ZXCV']"], ["['Hello']"], ["['Alaska']"], ["['Dad']"], ["['Peace']"], ["['a']"], ["['Z']"], ["['qaz', 'wsx', 'edc']"], ["['typewriter', 'laptop']"], ["['pop', 'mom', 'dad']"], ["['Abc', 'DEF', 'ghi']"], ["['q', 'a', 'z']"], ["['qqqq', 'aaaa', 'zzzz']"], ["['qw', 'as', 'zx']"], ["['HelloWorld']"], ["['aa', 'AA', 'aA']"], ["['row', 'try', 'pop']"], ["['Keyboard', 'Row']"], ["['a', 'qwertyuiop', 'asdfghjkl', 'zxcvbnm']"], ["['Alaska', 'Dad', 'Hello', 'Peace', 'omk']"], ["['sfd', 'adsdf']"], ["['xyz', 'mnb', 'jkl']"], ["['P', 'pP', 'PPp']"]], "expected": null, "loose": false}

package/data/problems/keys-and-rooms.json

@@ -0,0 +1 @@
+{"basic": false, "label": "839", "slug": "keys-and-rooms", "id": 839, "title": "Keys and Rooms", "difficulty": "Medium", "category": "graph", "link": "https://leetcode.com/problems/keys-and-rooms/", "examples": [{"input": "rooms = [[1],[2],[3],[]]", "output": "true", "explanation": "Chain 0->1->2->3 visits all."}, {"input": "rooms = [[1,3],[3,0,1],[2],[0]]", "output": "false", "explanation": "Room 2 stays locked."}, {"input": "rooms = [[]]", "output": "true", "explanation": "Only room exists and starts open."}], "hints": ["Treat rooms as a directed graph with edges from room i to each key inside it.", "Run depth-first or breadth-first search from node 0 and mark visited rooms.", "Answer true exactly when the visited count equals the room count."], "statement": "Decide whether every room can be entered starting from room zero.\n\nThere are `n` rooms numbered `0` to `n-1`. The array `rooms[i]` lists the keys found inside room `i`: each key `k` unlocks room `k`. You begin in room 0 with it already open, collect its keys, and repeatedly open any room for which you hold a key. Return `true` when this process can reach all rooms, otherwise `false`.\n\n**Constraints:**\n- `1 <= rooms.length <= 1000`\n- `0 <= rooms[i].length <= 1000`\n- `0 <= rooms[i][j] < rooms.length`\n", "solution": "## Approach\n\nView each room as a graph node with directed edges to its keys. Start a stack at room zero, pop rooms, and push any unseen neighbours found inside. Marking on push avoids repeats. If every room gets marked, all are reachable.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n + E), where n is the room count and E the total key count.\n- **Space Complexity:** O(n) for the visited flags and the stack.\n\n## Implementation\n\n```python\nfrom typing import List\nclass Solution:\n    def canVisitAllRooms(self, rooms: List[List[int]]) -> bool:\n        seen = {0}\n        stack = [0]\n        while stack:\n            u = stack.pop()\n            for v in rooms[u]:\n                if v not in seen:\n                    seen.add(v)\n                    stack.append(v)\n        return len(seen) == len(rooms)\n```\n", "starter": {"go": "package main\n\nfunc CanVisitAllRooms(rooms [][]int) bool {\n    return false\n}", "python": "from typing import List\nclass Solution:\n    def canVisitAllRooms(self, rooms: List[List[int]]) -> bool:\n        return False\n", "cpp": "#include <vector>\nusing namespace std;\nclass Solution {\npublic:\n    bool canVisitAllRooms(vector<vector<int>>& rooms) {\n        return false;\n    }\n};"}, "fn": "canVisitAllRooms", "params": [{"name": "rooms", "type": "int_array_2d"}], "outputType": "boolean", "tests": [["[[1],[2],[3],[]]"], ["[[1,3],[3,0,1],[2],[0]]"], ["[[]]"], ["[[1],[0]]"], ["[[1,2],[2,3],[3,1],[]]"], ["[[1],[2],[],[0]]"], ["[[1,2,3],[],[],[]]"], ["[[2],[3],[1],[]]"], ["[[1],[2],[0]]"], ["[[0]]"], ["[[1],[],[0]]"], ["[[2,3],[],[],[]]"], ["[[1],[2],[3],[4],[]]"], ["[[1,3],[2],[0],[2]]"], ["[[1],[1],[1],[]]"], ["[[3],[3],[3],[3]]"], ["[[1,2],[3],[3],[4],[]]"], ["[[4],[4],[4],[4],[2]]"], ["[[1,2,3,4],[],[],[],[]]"], ["[[],[1],[2],[3]]"], ["[[1],[2],[3],[0]]"], ["[[2],[0],[1]]"], ["[[1,2],[2],[3],[],[]]"], ["[[5],[5],[5],[5],[5],[0]]"], ["[[1],[3],[2],[4],[5],[]]"], ["[[2,1],[3],[0],[1]]"], ["[[1,2,3],[0],[0],[0]]"], ["[[3,2,1],[],[],[]]"]], "expected": [true, false, true, true, true, false, true, true, true, true, false, false, true, true, false, false, true, false, true, false, true, true, false, false, false, true, true, true], "loose": false}

package/data/problems/kill-process.json

@@ -0,0 +1 @@
+{"basic": false, "label": "627", "slug": "kill-process", "id": 627, "title": "Kill Process", "difficulty": "Medium", "category": "tree", "link": "https://leetcode.com/problems/kill-process/", "examples": [{"input": "pid = [1,3,10,5], ppid = [3,0,5,3], kill = 5", "output": "[5,10]", "explanation": "Ending 5 also ends its child 10."}, {"input": "pid = [1,3,10,5], ppid = [3,0,5,3], kill = 3", "output": "[3,1,5,10]", "explanation": "Ending 3 ends the whole tree underneath it in some order."}, {"input": "pid = [1], ppid = [0], kill = 1", "output": "[1]", "explanation": "A lone entry only ends itself."}], "hints": ["Build a map from each parent value to its direct children, then walk down from kill.", "[BFS/DFS] from the target collects every descendant; the order of the answer does not matter.", "A parent id of 0 marks a root with no owner."], "statement": "Each running program has an id in `pid` and its parent id in `ppid` at the same index; a parent id of `0` means no parent. Ending a program also ends every program below it in the parent-child tree.\n\nGiven `pid`, `ppid` and `kill`, return all ids that stop, starting with `kill` itself. The order of the remaining ids does not matter.\n\n**Constraints:**\n- `1 <= pid.length <= 2000`\n- All `pid` values are distinct and each appears as the kill target in tests.\n- Each `ppid` entry is `0` or another `pid` value.\n", "solution": "## Approach\n\nMap each parent id to its direct children, then walk downward from the target with a queue. Every reached id stops, so collecting them yields the full affected set.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n), each id is visited once.\n- **Space Complexity:** O(n) for the child map and the queue.\n\n## Implementation\n\n```python\nfrom typing import List\nfrom collections import defaultdict, deque\nclass Solution:\n    def killProcess(self, pid: List[int], ppid: List[int], kill: int) -> List[int]:\n        kids = defaultdict(list)\n        for p, q in zip(pid, ppid):\n            kids[q].append(p)\n        ans = []\n        dq = deque([kill])\n        while dq:\n            cur = dq.popleft()\n            ans.append(cur)\n            dq.extend(kids.get(cur, []))\n        return ans\n```\n", "starter": {"go": "package main\n\nfunc KillProcess(pid []int, ppid []int, kill int) []int {\n    return []int{}\n}", "python": "from typing import List\nclass Solution:\n    def killProcess(self, pid: List[int], ppid: List[int], kill: int) -> List[int]:\n        pass", "cpp": "#include <vector>\nusing namespace std;\nclass Solution {\npublic:\n    vector<int> killProcess(vector<int>& pid, vector<int>& ppid, int kill) {\n        return {};\n    }\n};"}, "fn": "killProcess", "params": [{"name": "pid", "type": "int_array"}, {"name": "ppid", "type": "int_array"}, {"name": "kill", "type": "int"}], "outputType": "int_list", "tests": [["[1,3,10,5]", "[3,0,5,3]", "5"], ["[1,3,10,5]", "[3,0,5,3]", "3"], ["[1]", "[0]", "1"], ["[1,2,3]", "[0,1,1]", "1"], ["[1,2,3]", "[0,1,1]", "2"], ["[10,20,30,40,50]", "[0,10,10,20,20]", "10"], ["[10,20,30,40,50]", "[0,10,10,20,20]", "20"], ["[10,20,30,40,50]", "[0,10,10,20,20]", "30"], ["[1,2,3,4,5]", "[0,1,2,3,4]", "1"], ["[1,2,3,4,5]", "[0,1,2,3,4]", "3"], ["[1,2,3,4,5]", "[0,1,2,3,4]", "5"], ["[5,4,3,2,1]", "[4,3,2,1,0]", "1"], ["[5,4,3,2,1]", "[4,3,2,1,0]", "5"], ["[1,2,3,4,5,6,7]", "[0,1,1,2,2,3,3]", "2"], ["[1,2,3,4,5,6,7]", "[0,1,1,2,2,3,3]", "1"], ["[100,200]", "[0,100]", "200"], ["[7,8,9]", "[0,0,8]", "8"], ["[7,8,9]", "[0,0,8]", "7"], ["[1,2,3,4]", "[0,1,1,1]", "1"], ["[1,2,3,4]", "[0,1,1,1]", "4"], ["[2,1,3]", "[1,0,1]", "1"], ["[11,12,13,14,15,16]", "[0,11,11,12,12,13]", "11"], ["[11,12,13,14,15,16]", "[0,11,11,12,12,13]", "12"], ["[11,12,13,14,15,16]", "[0,11,11,12,12,13]", "13"], ["[1,2]", "[0,0]", "2"], ["[1,2,3,4,5,6]", "[0,1,2,2,3,3]", "2"], ["[1,2,3,4,5,6]", "[0,1,2,2,3,3]", "3"], ["[9,10,11,12]", "[10,0,10,11]", "10"]], "expected": [[5, 10], [3, 1, 5, 10], [1], [1, 2, 3], [2], [10, 20, 30, 40, 50], [20, 40, 50], [30], [1, 2, 3, 4, 5], [3, 4, 5], [5], [1, 2, 3, 4, 5], [5], [2, 4, 5], [1, 2, 3, 4, 5, 6, 7], [200], [8, 9], [7], [1, 2, 3, 4], [4], [1, 2, 3], [11, 12, 13, 14, 15, 16], [12, 14, 15], [13, 16], [2], [2, 3, 4, 5, 6], [3, 5, 6], [10, 9, 11, 12]], "loose": true}

package/data/problems/knight-dialer.json

@@ -0,0 +1 @@
+{"basic": false, "label": "922", "slug": "knight-dialer", "id": 922, "title": "Knight Dialer", "difficulty": "Medium", "category": "dp", "link": "https://leetcode.com/problems/knight-dialer/", "examples": [{"input": "n = 1", "output": "10", "explanation": "Each single digit is one number."}, {"input": "n = 2", "output": "20", "explanation": "Summing jumps from every start gives twenty pairs."}, {"input": "n = 3", "output": "46"}], "hints": ["Model the pad as a graph: each digit points to its knight neighbors (5 points nowhere).", "Dynamic programming over positions: new ways on a digit equal the sum of ways on its predecessors.", "Apply the 1e9+7 modulus at every addition."], "statement": "A chess knight moves on a phone pad laid out as `1 2 3 / 4 5 6 / 7 8 9 / * 0 #`. From a digit it jumps in the usual L shape; `*` and `#` are never used, and `5` has no outgoing jump.\n\nCount how many distinct digit strings of length `n` the knight can trace, starting from any of the ten digits. Return the count modulo `1_000_000_007`.\n\n**Constraints:**\n- `1 <= n <= 5000`\n", "solution": "## Approach\n\nTrack how many ways end on each digit. Start with one way per digit, then repeatedly shift counts along the knight graph: each digit distributes its total to its jump neighbors. After `n-1` transitions, sum all ten totals under the modulus.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n), with a constant ten-digit transition per step.\n- **Space Complexity:** O(1), two arrays of size ten.\n\n## Implementation\n\n```python\nclass Solution:\n    def knightDialer(self, n: int) -> int:\n        MOD = 10 ** 9 + 7\n        moves = [[4,6],[6,8],[7,9],[4,8],[3,9,0],[],[1,7,0],[2,6],[1,3],[2,4]]\n        dp = [1] * 10\n        for _ in range(1, n):\n            ndp = [0] * 10\n            for d in range(10):\n                for nb in moves[d]:\n                    ndp[nb] = (ndp[nb] + dp[d]) % MOD\n            dp = ndp\n        return sum(dp) % MOD\n```\n", "starter": {"go": "package main\n\nfunc KnightDialer(n int) int {\n    return 0\n}", "python": "class Solution:\n    def knightDialer(self, n: int) -> int:\n        pass", "cpp": "\nclass Solution {\npublic:\n    int knightDialer(int n) {\n        return 0;\n    }\n};"}, "fn": "knightDialer", "params": [{"name": "n", "type": "int"}], "outputType": "int", "tests": [["1"], ["2"], ["3"], ["4"], ["5"], ["6"], ["7"], ["8"], ["9"], ["10"], ["11"], ["12"], ["13"], ["14"], ["15"], ["16"], ["17"], ["18"], ["19"], ["20"], ["25"], ["50"], ["100"], ["200"], ["500"], ["1000"], ["2000"], ["5000"]], "expected": [10, 20, 46, 104, 240, 544, 1256, 2848, 6576, 14912, 34432, 78080, 180288, 408832, 944000, 2140672, 4942848, 11208704, 25881088, 58689536, 715338219, 267287516, 540641702, 38950354, 84202957, 88106097, 71794716, 406880451], "loose": false}

package/data/problems/knight-probability-in-chessboard.json

@@ -0,0 +1 @@
+{"basic": false, "label": "703", "slug": "knight-probability-in-chessboard", "id": 703, "title": "Knight Probability in Chessboard", "difficulty": "Medium", "category": "dp", "link": "https://leetcode.com/problems/knight-probability-in-chessboard/", "examples": [{"input": "n = 3, k = 2, row = 0, column = 0", "output": "\"0.0625\"", "explanation": "Two first jumps survive and the total survival chance is 1/16."}, {"input": "n = 1, k = 0, row = 0, column = 0", "output": "\"1.0\"", "explanation": "No jumps means certain survival."}, {"input": "n = 1, k = 1, row = 0, column = 0", "output": "\"0.0\"", "explanation": "All jumps leave a 1x1 board."}], "hints": ["This is a portable adaptation: return the probability as a finite decimal string; the checker allows 1e-9 absolute plus 1e-5 relative error.", "Keep a table of survival likelihoods per square and roll it forward one jump at a time, spreading each square's mass over its valid knight neighbours divided by 8.", "Only two layers are needed; the answer is the sum of the final layer."], "statement": "On an `n x n` board a knight begins on square `(row, column)` with zero-based coordinates. At every turn the knight picks uniformly among its eight L-shaped jumps (two squares one way and one square sideways), even when a jump would leave the board. The walk ends after exactly `k` jumps, or sooner if the knight steps outside.\n\nEstimate the chance that the knight is still on the board once the walk stops. Report the probability as a decimal string (for example `\"0.0625\"`).\n\nThis is a portable adaptation: Cojudge has no floating type, so inputs stay integers and the output is a decimal string compared with a small tolerance.\n\n**Constraints:**\n- `1 <= n <= 25`\n- `0 <= k <= 100`\n- `0 <= row, column < n`\n- Answers are compared with absolute tolerance `1e-9` plus relative tolerance `1e-5`.\n", "solution": "## Approach\n\nTrack how likely the knight is to stand on each square after each jump. Start with certainty on the given square, then repeatedly spread every square's mass evenly over its on-board knight destinations (each gets one eighth). Squares with no mass are skipped, and only two board-sized layers are kept. After `k` rounds the sum of the layer is the survival chance, formatted as a decimal string.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(k * n^2), one pass over the board per jump.\n- **Space Complexity:** O(n^2) for two layers.\n\n## Implementation\n\n```python\nclass Solution:\n    def knightProbability(self, n: int, k: int, row: int, column: int) -> str:\n        moves = [(2,1),(1,2),(-1,2),(-2,1),(-2,-1),(-1,-2),(1,-2),(2,-1)]\n        cur = [[0.0]*n for _ in range(n)]\n        cur[row][column] = 1.0\n        for _ in range(k):\n            nxt = [[0.0]*n for _ in range(n)]\n            for r in range(n):\n                for c in range(n):\n                    if cur[r][c] == 0:\n                        continue\n                    for dr, dc in moves:\n                        nr, nc = r+dr, c+dc\n                        if 0 <= nr < n and 0 <= nc < n:\n                            nxt[nr][nc] += cur[r][c] / 8.0\n            cur = nxt\n        return str(sum(sum(r) for r in cur))\n```\n", "starter": {"go": "package main\n\nfunc KnightProbability(n int, k int, row int, column int) string {\n    return \"\"\n}", "python": "class Solution:\n    def knightProbability(self, n: int, k: int, row: int, column: int) -> str:\n        return \"\"\n", "cpp": "#include <string>\nusing namespace std;\nclass Solution {\npublic:\n    string knightProbability(int n, int k, int row, int column) {\n        return \"\";\n    }\n};"}, "fn": "knightProbability", "params": [{"name": "n", "type": "int"}, {"name": "k", "type": "int"}, {"name": "row", "type": "int"}, {"name": "column", "type": "int"}], "outputType": "string", "tests": [["3", "2", "0", "0"], ["1", "0", "0", "0"], ["1", "1", "0", "0"], ["3", "1", "0", "0"], ["8", "1", "0", "0"], ["8", "2", "3", "3"], ["8", "30", "6", "4"], ["3", "3", "0", "0"], ["4", "2", "2", "2"], ["5", "5", "2", "2"], ["2", "1", "0", "0"], ["2", "0", "1", "1"], ["25", "0", "12", "12"], ["25", "100", "0", "0"], ["4", "4", "0", "0"], ["6", "3", "2", "2"], ["3", "10", "1", "1"], ["8", "0", "4", "4"], ["5", "1", "0", "0"], ["5", "2", "4", "4"], ["10", "5", "5", "5"], ["3", "5", "2", "2"], ["4", "1", "1", "1"], ["8", "3", "0", "0"], ["6", "6", "0", "5"], ["7", "2", "3", "3"], ["3", "0", "2", "1"], ["8", "10", "7", "7"]], "expected": ["0.0625", "1.0", "0.0", "0.25", "0.25", "0.875", "1.9052566298333653E-4", "0.015625", "0.15625", "0.06640625", "0.0", "1.0", "1.0", "0.0012193746331114305", "0.017578125", "0.359375", "0.0", "1.0", "0.25", "0.1875", "0.588134765625", "9.765625E-4", "0.5", "0.125", "0.02713775634765625", "0.75", "1.0", "0.017395850270986557"], "loose": false}

package/data/problems/koko-eating-bananas.json

@@ -0,0 +1 @@
+{"basic": false, "label": "89", "slug": "koko-eating-bananas", "id": 89, "title": "Koko Eating Bananas", "difficulty": "Medium", "category": "binary-search", "link": "https://leetcode.com/problems/koko-eating-bananas/", "examples": [{"input": "piles = [3,6,7,11], h = 8", "output": "4", "explanation": "At 4 bananas/hour Koko takes ceil(3/4)+ceil(6/4)+ceil(7/4)+ceil(11/4) = 1+2+2+3 = 8 hours; at 3 bananas/hour she would take 1+2+3+4 = 10 hours, exceeding the 8-hour limit."}, {"input": "piles = [30,11,23,4,20], h = 5", "output": "30", "explanation": "At 30 bananas/hour Koko takes ceil(30/30)+ceil(11/30)+ceil(23/30)+ceil(4/30)+ceil(20/30) = 1+1+1+1+1 = 5 hours; at 29 bananas/hour she would take 2+1+1+1+1 = 6 hours, exceeding the 5-hour limit."}, {"input": "piles = [30,11,23,4,20], h = 6", "output": "23", "explanation": "At 23 bananas/hour Koko takes ceil(30/23)+ceil(11/23)+ceil(23/23)+ceil(4/23)+ceil(20/23) = 2+1+1+1+1 = 6 hours; at 22 bananas/hour she would take 2+1+2+1+1 = 7 hours, exceeding the 6-hour limit."}], "hints": ["For a fixed speed k, one pile of size p takes ceil(p / k) hours.", "If a speed is fast enough, every larger speed is also fast enough.", "Binary-search speeds from 1 through the largest pile and accumulate hours in a wide integer type."], "statement": "Koko has several piles of bananas. `piles[i]` is the number of bananas in pile `i`, and Koko has `h` hours before the guards return.\n\nKoko chooses one positive integer eating speed `k` in bananas per hour. During each hour, she chooses one pile and eats up to `k` bananas from it. If that pile has fewer than `k` bananas, she finishes the pile and does not eat from another pile during the same hour.\n\nReturn the minimum integer speed that lets Koko finish all piles within `h` hours.\n\n**Constraints:**\n\n- `1 <= piles.length <= 10^4`\n- `1 <= piles[i] <= 10^9`\n- `piles.length <= h <= 10^9`\n\n**Portable interface:** Implement `minEatingSpeed(piles, h)` directly. The judge supplies positive pile sizes and returns the minimum speed as an integer.\n", "solution": "## Approach\n\nFor a candidate speed, compute the required hours by summing `ceil(pile / speed)` over all piles. Feasibility is monotonic: once a speed is fast enough, every larger speed is also fast enough. Binary-search the first feasible speed between `1` and the largest pile.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n log M), where `n` is the number of piles and `M` is the largest pile.\n- **Space Complexity:** O(1).\n\n## Implementation\n\n```python\nfrom typing import List\n\n\nclass Solution:\n    def minEatingSpeed(self, piles: List[int], h: int) -> int:\n        left, right = 1, max(piles)\n        while left < right:\n            speed = left + (right - left) // 2\n            hours = 0\n            for pile in piles:\n                hours += (pile + speed - 1) // speed\n                if hours > h:\n                    break\n            if hours <= h:\n                right = speed\n            else:\n                left = speed + 1\n        return left\n```\n", "starter": {"go": "package main\n\nfunc MinEatingSpeed(piles []int, h int) int {\n    return 0\n}", "python": "from typing import List\n\nclass Solution:\n    def minEatingSpeed(self, piles: List[int], h: int) -> int:\n        return 0\n", "cpp": "#include <vector>\nusing namespace std;\n\nclass Solution {\npublic:\n    int minEatingSpeed(vector<int>& piles, int h) {\n        return 0;\n    }\n};"}, "fn": "minEatingSpeed", "params": [{"name": "piles", "type": "int_array"}, {"name": "h", "type": "int"}], "outputType": "int", "tests": [["[3,6,7,11]", "8"], ["[30,11,23,4,20]", "5"], ["[30,11,23,4,20]", "6"], ["[1]", "1"], ["[1]", "100"], ["[10]", "1"], ["[10]", "10"], ["[3,3,3]", "3"], ["[3,3,3]", "9"], ["[1,2,3,4]", "4"], ["[1,2,3,4]", "10"], ["[1,2,3,4]", "5"], ["[100,100,100,100]", "4"], ["[100,100,100,100]", "400"], ["[100,100,100,100]", "8"], ["[5,9,13,17]", "10"], ["[5,9,13,17]", "4"], ["[5,9,13,17]", "20"], ["[2,2,2,2,2]", "5"], ["[2,2,2,2,2]", "10"], ["[1,1,1,1000000000]", "4"], ["[1,1,1,1000000000]", "1000000000"], ["[1000000000]", "1"], ["[1000000000]", "1000000000"], ["[1000000000,1000000000]", "2"], ["[1000000000,1000000000]", "3"], ["[1000000000,999999999,999999998]", "6"], ["[8,8,8,8,8,8]", "12"], ["[8,8,8,8,8,8]", "18"], ["[4,7,10,13,16]", "15"], ["[4,7,10,13,16]", "8"], ["[4,7,10,13,16]", "5"], ["[9,1,1,1,1]", "9"], ["[9,1,1,1,1]", "5"], ["[6,5,4,3,2,1]", "7"], ["[6,5,4,3,2,1]", "21"], ["[6,5,4,3,2,1]", "6"], ["[17,23,41,59,73]", "20"], ["[17,23,41,59,73]", "9"], ["[17,23,41,59,73]", "5"], ["[2,5,8,11,14,17]", "12"], ["[2,5,8,11,14,17]", "30"], ["[999999937,999999929]", "10"], ["[7,7,7]", "4"], ["[7,7,7]", "20"], ["[1,100,1,100,1,100]", "9"], ["[1,100,1,100,1,100]", "6"], ["[25,36,49,64,81]", "25"], ["[25,36,49,64,81]", "10"], ["[12,34,56,78,90,123,456]", "31"], ["@javascript:JSON.stringify(Array(10000).fill(1000000000))", "10000"]], "expected": [4, 30, 23, 1, 1, 10, 1, 3, 1, 4, 1, 3, 100, 1, 50, 5, 17, 3, 2, 1, 1000000000, 2, 1000000000, 1, 1000000000, 1000000000, 500000000, 4, 3, 4, 8, 16, 2, 9, 5, 1, 6, 12, 30, 73, 6, 2, 199999988, 7, 2, 50, 100, 12, 32, 31, 1000000000], "loose": false}

package/data/problems/kth-largest-element-in-a-stream.json

@@ -0,0 +1 @@
+{"basic": false, "label": "101", "slug": "kth-largest-element-in-a-stream", "id": 101, "title": "Kth Largest Element in a Stream", "difficulty": "Easy", "category": "heap", "link": "https://leetcode.com/problems/kth-largest-element-in-a-stream/", "examples": [{"input": "k = 3, nums = [4,5,8,2], additions = [3,5,10,9,4]", "output": "[4,5,5,8,8]", "explanation": "The function returns the third largest value after each insertion."}, {"input": "k = 1, nums = [], additions = [-3,-2,-4,0,4]", "output": "[-3,-2,-2,0,4]", "explanation": "With k = 1, each answer is the maximum value seen so far."}], "hints": ["Keep only the k largest values seen so far.", "A min-heap of size k exposes the current kth largest value at its root.", "Insert each value, remove the heap minimum when its size exceeds k, and record the root after every addition."], "statement": "Design an algorithm that reports the `k`th largest value in an integer stream after each new value arrives.\n\nImplement `kthLargestStream(k, nums, additions)`. Initialize the stream with every value in `nums`. Then process `additions` from left to right. After inserting each value, append the current `k`th largest stream value to the result.\n\nThis is a portable function adaptation of the original constructor-and-`add` API. `nums` may initially contain fewer than `k` values, but after every insertion from `additions` the stream contains at least `k` values.\n\n**Constraints:**\n\n- `1 <= k <= nums.length + 1`\n- `0 <= nums.length <= 10^4`\n- `1 <= additions.length <= 10^4`\n- `-10^4 <= nums[i], additions[i] <= 10^4`\n- After each addition, the total number of stream values is at least `k`.\n", "solution": "## Approach\n\nMaintain a min-heap containing the `k` largest stream values seen so far. After trimming the initial values to `k`, insert each addition, remove the minimum if the heap grows past `k`, and record the heap root as the current kth largest value.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(N log N + A log k) in the worst case, where `N` is `nums.length` and `A` is `additions.length`.\n- **Space Complexity:** O(N + A) including the returned array; the heap uses O(N) space at its initialization peak.\n\n## Implementation\n\n```python\nimport heapq\nfrom typing import List\n\n\nclass Solution:\n    def kthLargestStream(self, k: int, nums: List[int], additions: List[int]) -> List[int]:\n        heap = nums[:]\n        heapq.heapify(heap)\n        while len(heap) > k:\n            heapq.heappop(heap)\n\n        result = []\n        for value in additions:\n            heapq.heappush(heap, value)\n            if len(heap) > k:\n                heapq.heappop(heap)\n            result.append(heap[0])\n        return result\n```\n", "starter": {"go": "package main\n\nfunc KthLargestStream(k int, nums []int, additions []int) []int {\n    panic(\"TODO\")\n}", "python": "from typing import List\n\nclass Solution:\n    def kthLargestStream(self, k: int, nums: List[int], additions: List[int]) -> List[int]:\n        raise NotImplementedError\n", "cpp": "#include <vector>\nusing namespace std;\n\nclass Solution {\npublic:\n    vector<int> kthLargestStream(int k, vector<int>& nums, vector<int>& additions) {\n        return {};\n    }\n};"}, "fn": "kthLargestStream", "params": [{"name": "k", "type": "int"}, {"name": "nums", "type": "int_array"}, {"name": "additions", "type": "int_array"}], "outputType": "int_array", "tests": [["3", "[4,5,8,2]", "[3,5,10,9,4]"], ["1", "[]", "[-3,-2,-4,0,4]"], ["2", "[0]", "[-1,1,-2,2]"], ["1", "[5]", "[4,6,3]"], ["3", "[4,5]", "[8,2,10]"], ["5", "[1,2,3,4]", "[5,0,6]"], ["2", "[7,7]", "[7,8,6]"], ["3", "[-5,-2,-8]", "[-1,-9,0]"], ["4", "[10,9,8]", "[7,11,12]"], ["2", "[100,-100]", "[0,50,-50]"], ["1", "[-10,-20]", "[-30,-5,-40]"], ["6", "[5,4,3,2,1]", "[0,6,7]"], ["3", "[1,1,1]", "[1,1,2]"], ["2", "[2]", "[1,3,4]"], ["4", "[9,1,8]", "[2,7,10,0]"], ["3", "[0,0]", "[0,-1,1]"], ["5", "[-1,-2,-3,-4]", "[-5,0,1]"], ["2", "[10000,-10000]", "[9999,10000]"], ["3", "[6,5,4,3,2,1]", "[7,0,8]"], ["4", "[1,5,2,4,3]", "[6,-1,7]"], ["2", "[-3,-3,-4]", "[-2,-5,-1]"], ["7", "[1,2,3,4,5,6]", "[7,8]"], ["3", "[10,20]", "[30,5,25]"], ["1", "[0]", "[0,0,1]"], ["4", "[4,4,4]", "[4,5,3]"], ["2", "[8,6,7,5,3,0,9]", "[1,2,10]"], ["5", "[8,6,7,5]", "[3,0,9]"], ["3", "[-10,10,-20,20]", "[0,30,-30]"], ["2", "[1,2,3]", "[4,5,6,7]"], ["4", "[7,6,5]", "[4,3,8,9]"], ["3", "[100,90,80]", "[70,60,110]"], ["5", "[10,10,9,9]", "[8,11,12]"], ["2", "[-1]", "[-2,-3,0,1]"], ["6", "[0,1,2,3,4]", "[5,6,7]"], ["3", "[42,42]", "[42,41,43]"], ["1", "[10000]", "[-10000,9999,10000]"], ["4", "[-8,-6,-7]", "[-5,-9,-4]"], ["2", "[5,1,5,1]", "[5,1,6]"], ["8", "[1,2,3,4,5,6,7]", "[8,0,9]"], ["3", "[9,8]", "[7,6,10,11]"], ["5", "[20,18,16,14]", "[12,22,24]"], ["2", "[0,-1,-2]", "[-3,-4,1]"], ["4", "[3,1,4]", "[1,5,9,2]"], ["3", "[2,7,1,8,2,8]", "[1,8,2]"], ["6", "[-6,-5,-4,-3,-2]", "[-1,0]"], ["2", "[11,13]", "[12,14,10]"], ["5", "[25,20,15,10]", "[5,30,35]"], ["3", "[-100,100]", "[50,-50,0]"], ["4", "[6,6,5,5,4]", "[7,3,8]"], ["1", "[]", "[0,-1,1,-2,2]"], ["1", "[]", "[-10000]"], ["1", "[]", "[10000]"], ["10001", "@javascript:JSON.stringify(Array.from({length:10000},(_,i)=>i%2===0?-10000:10000))", "@javascript:JSON.stringify(Array.from({length:10000},(_,i)=>i%2===0?10000:-10000))"]], "expected": [[4, 5, 5, 8, 8], [-3, -2, -2, 0, 4], [-1, 0, 0, 1], [5, 6, 6], [4, 4, 5], [1, 1, 2], [7, 7, 7], [-5, -5, -2], [7, 8, 9], [0, 50, 50], [-10, -5, -5], [0, 1, 2], [1, 1, 1], [1, 2, 3], [1, 2, 7, 7], [0, 0, 0], [-5, -4, -3], [9999, 10000], [5, 5, 6], [3, 3, 4], [-3, -3, -2], [1, 2], [10, 10, 20], [0, 0, 1], [4, 4, 4], [8, 8, 9], [3, 3, 5], [0, 10, 10], [3, 4, 5, 6], [4, 4, 5, 6], [80, 80, 90], [8, 9, 9], [-2, -2, -1, 0], [0, 1, 2], [42, 42, 42], [10000, 10000, 10000], [-8, -8, -7], [5, 5, 5], [1, 1, 2], [7, 7, 8, 9], [12, 14, 16], [-1, -1, 0], [1, 1, 3, 3], [7, 8, 8], [-6, -5], [12, 13, 13], [5, 10, 15], [-100, -50, 0], [5, 5, 6], [0, 0, 1, 1, 2], [-10000], [10000], [-10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000, -10000]], "loose": false}

package/data/problems/kth-largest-element-in-an-array.json

@@ -0,0 +1 @@
+{"basic": false, "label": "104", "slug": "kth-largest-element-in-an-array", "id": 104, "title": "Kth Largest Element in an Array", "difficulty": "Medium", "category": "heap", "link": "https://leetcode.com/problems/kth-largest-element-in-an-array/", "examples": [{"input": "nums = [3,2,1,5,6,4], k = 2", "output": "5", "explanation": "Sorted descending: [6,5,4,3,2,1]. The 2nd largest element is 5."}, {"input": "nums = [3,2,3,1,2,4,5,5,6], k = 4", "output": "4", "explanation": "Sorted descending: [6,5,5,4,3,3,2,2,1]. The 4th largest element (counting duplicates) is 4."}], "hints": ["A full sort works, but it does more ordering than the problem requires.", "Keep a min-heap of the k largest values seen so far; its root is the answer.", "Quickselect can achieve expected linear time by partitioning around a pivot."], "statement": "You receive an integer array `nums` and an integer `k`. Identify the element that would appear in position `k` if the array were arranged from largest to smallest.\n\nRepeated values each occupy their own positions, so this is not a question about distinct values.\n\n**Constraints:**\n\n- `1 <= k <= nums.length <= 10^5`\n- `-10^4 <= nums[i] <= 10^4`\n", "solution": "## Approach\n\nSort a copy of the array in ascending order. The kth largest value is then at index `-k`, and duplicate values naturally occupy separate positions.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n log n), where `n` is `nums.length`.\n- **Space Complexity:** O(n) for the sorted copy.\n\n## Implementation\n\n```python\nfrom typing import List\n\n\nclass Solution:\n    def findKthLargest(self, nums: List[int], k: int) -> int:\n        return sorted(nums)[-k]\n```\n", "starter": {"go": "package main\n\nfunc FindKthLargest(nums []int, k int) int {\n    panic(\"TODO\")\n}", "python": "from typing import List\n\nclass Solution:\n    def findKthLargest(self, nums: List[int], k: int) -> int:\n        raise NotImplementedError\n", "cpp": "#include <vector>\nusing namespace std;\n\nclass Solution {\npublic:\n    int findKthLargest(vector<int>& nums, int k) {\n        return 0;\n    }\n};"}, "fn": "findKthLargest", "params": [{"name": "nums", "type": "int_array"}, {"name": "k", "type": "int"}], "outputType": "int", "tests": [["[3,2,1,5,6,4]", "2"], ["[3,2,3,1,2,4,5,5,6]", "4"], ["[-1,-1]", "2"], ["[1]", "1"], ["[2,1]", "1"], ["[2,1]", "2"], ["[5,5,5]", "2"], ["[-3,-2,-1]", "1"], ["[-3,-2,-1]", "3"], ["[10000,-10000,0]", "2"], ["[7,6,5,4,3,2,1]", "4"], ["[1,2,3,4,5]", "5"], ["[1,2,3,4,5]", "1"], ["[9,9,8,8,7,7]", "3"], ["[0,0,0,1]", "4"], ["[4,2,7,1,9,3]", "3"], ["[-5,10,-2,8,0]", "2"], ["[42,42,41,43]", "2"], ["[6,1,6,1,6,1]", "4"], ["[10,20,30,40,50]", "3"], ["[50,40,30,20,10]", "4"], ["[-10,-20,-30,-40]", "2"], ["[8,6,7,5,3,0,9]", "5"], ["[2,7,1,8,2,8,1,8]", "3"], ["[11,13,12,14,10]", "1"], ["[11,13,12,14,10]", "5"], ["[100,99,98,97,96,95]", "6"], ["[-100,100,-50,50,0]", "3"], ["[3,3,2,2,1,1]", "6"], ["[15,14,13,12,11,10,9,8]", "7"], ["[1,100,2,99,3,98]", "3"], ["[0,-1,1,-2,2,-3,3]", "4"], ["[5,4,5,4,5,4,3]", "5"], ["[21,22,23,24,25,26]", "2"], ["[-7,-7,-8,-8,-9]", "3"], ["[1000,500,250,125,62]", "4"], ["[16,8,4,2,1]", "2"], ["[31,41,59,26,53,58]", "4"], ["[9,8,7,6,5,4,3,2,1,0]", "9"], ["[4,1,4,2,4,3,4]", "4"], ["[-1,0,1]", "2"], ["[200,-200,150,-150,100,-100]", "5"], ["[13,13,13,12,12,11]", "1"], ["[13,13,13,12,12,11]", "4"], ["[9999,10000,-9999,-10000]", "2"], ["[2,4,6,8,10,12,14]", "3"], ["[14,12,10,8,6,4,2]", "7"], ["[5,-5,5,-5,0]", "3"], ["[17,19,17,19,18,18]", "5"], ["[10000,10000,10000,-10000]", "3"], ["@javascript:JSON.stringify([-10000,...Array(24999).fill(10000)])", "25000"]], "expected": [5, 4, -1, 1, 2, 1, 5, -1, -3, 0, 4, 1, 5, 8, 0, 4, 8, 42, 1, 30, 20, -20, 5, 8, 14, 10, 95, 0, 1, 9, 98, 0, 4, 25, -8, 125, 8, 41, 1, 4, 0, -150, 13, 12, 9999, 10, 2, 0, 17, 10000, -10000], "loose": false}

package/data/problems/kth-smallest-element-in-a-bst.json

@@ -0,0 +1 @@
+{"basic": false, "label": "69", "slug": "kth-smallest-element-in-a-bst", "id": 69, "title": "Kth Smallest Element in a BST", "difficulty": "Medium", "category": "tree", "link": "https://leetcode.com/problems/kth-smallest-element-in-a-bst/", "examples": [{"input": "root = [3,1,4,null,2], k = 1", "output": "1", "explanation": "The BST [3,1,4,null,2] sorted in ascending order is [1,2,3,4]; the 1st smallest value is 1."}, {"input": "root = [5,3,6,2,4,null,7,1], k = 3", "output": "3", "explanation": "The BST [5,3,6,2,4,null,7,1] sorted in ascending order is [1,2,3,4,5,6,7]; the 3rd smallest value is 3."}], "hints": ["Use in-order traversal to visit nodes in ascending order and stop at k."], "statement": "You are given the `root` of a binary search tree together with an integer `k`. Return the value occupying the `k`-th place (counting from 1) when all node values are listed from smallest to largest.\n\n**Constraints:**\n\n- The number of nodes in the tree is n.\n- 1 \u2264 k \u2264 n \u2264 10^4\n- 0 \u2264 Node.val \u2264 10^4\n", "solution": "## Approach\n\nPerform an iterative inorder traversal of the BST using a stack. Since inorder traversal visits nodes in sorted order, the kth visited node is the kth smallest element.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n), where n is the number of nodes in the tree.\n- **Space Complexity:** O(h), where h is the height of the tree (stack size).\n\n## Implementation\n\n```python\nfrom typing import Optional\nclass Solution:\n    def kthSmallest(self, root: Optional[TreeNode], k: int) -> int:\n        stack = []\n        cur = root\n        while cur or stack:\n            while cur:\n                stack.append(cur)\n                cur = cur.left\n            cur = stack.pop()\n            k -= 1\n            if k == 0:\n                return cur.val\n            cur = cur.right\n```\n", "starter": {"go": "// Definition for a binary tree node.\n// type TreeNode struct {\n//     Val int\n//     Left *TreeNode\n//     Right *TreeNode\n// }\npackage main\n\nfunc KthSmallest(root *TreeNode, k int) int {\n    \n}", "python": "# Definition for a binary tree node.\n# class TreeNode:\n#     def __init__(self, val=0, left=None, right=None):\n#         self.val = val\n#         self.left = left\n#         self.right = right\n\nclass Solution:\n    def kthSmallest(self, root, k: int) -> int:\n        # TODO: return kth smallest value in BST\n        pass\n", "cpp": "/*\nDefinition for a binary tree node.\nstruct TreeNode {\n    int val;\n    TreeNode *left;\n    TreeNode *right;\n    TreeNode(): val(0), left(nullptr), right(nullptr) {}\n    TreeNode(int x): val(x), left(nullptr), right(nullptr) {}\n    TreeNode(int x, TreeNode* left, TreeNode* right): val(x), left(left), right(right) {}\n};\n*/\nclass Solution {\npublic:\n    int kthSmallest(TreeNode* root, int k) {\n        \n    }\n};\n"}, "fn": "kthSmallest", "params": [{"name": "root", "type": "tree_node", "visualizeType": "tree_node"}, {"name": "k", "type": "int"}], "outputType": "int", "tests": [["[3,1,4,null,2]", "1"], ["[5,3,6,2,4,null,7,1]", "3"], ["[2,1,3]", "2"], ["[1]", "1"], ["[5,4,6,3]", "1"], ["[6,3,8,2,5,7,9,1,4]", "5"], ["[4,2,6,1,3,5,7]", "4"], ["[4,2,6,1,3,5,7]", "1"], ["[4,2,6,1,3,5,7]", "7"], ["[10,5,15,3,7,null,18]", "3"], ["[7,3,9,1,5,null,11]", "2"], ["[8,3,10,1,6,null,14,null,null,4,7]", "5"], ["[1,null,2]", "2"], ["[2,null,3]", "1"], ["[3,1,null]", "2"], ["[5,3,7,2,4,6,8]", "6"], ["[5,3,7,2,4,6,8]", "2"], ["[9,4,12,2,6,10,14]", "4"], ["[20,10,30,5,15,25,35]", "7"], ["[6,2,8,1,4,null,null,null,null,3,5]", "3"], ["[50,30,70,20,40,60,80]", "5"], ["[4,1,null]", "1"], ["[2,1,null]", "1"], ["[3,2,null,1,null]", "1"], ["[1,null,3,null,5]", "3"], ["[10,5,null,3,null]", "2"], ["[15,10,20,null,null,null,25]", "3"], ["[7,5,9,4,6,8,10]", "1"], ["[7,5,9,4,6,8,10]", "7"], ["[11,6,15,3,8,null,18]", "4"]], "expected": [1, 3, 2, 1, 3, 5, 4, 1, 7, 7, 3, 7, 2, 2, 3, 7, 3, 9, 35, 3, 60, 1, 1, 1, 5, 5, 20, 4, 10, 11], "loose": false}

package/data/problems/kth-smallest-element-in-a-sorted-matrix.json

@@ -0,0 +1 @@
+{"basic": false, "label": "454", "slug": "kth-smallest-element-in-a-sorted-matrix", "id": 454, "title": "Kth Smallest Element in a Sorted Matrix", "difficulty": "Medium", "category": "heap", "link": "https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/", "examples": [{"input": "matrix = [[1,5,9],[10,11,13],[12,13,15]], k = 8", "output": "13", "explanation": "8th of the nine ordered values."}, {"input": "matrix = [[-5]], k = 1", "output": "-5", "explanation": "Single cell."}, {"input": "matrix = [[1,2],[3,4]], k = 3", "output": "3", "explanation": "Ordered values [1,2,3,4]."}], "hints": ["Seed a min-heap with the first cell of every row.", "Pop the smallest k-1 times, pushing the right neighbor of each pop.", "The k-th pop is the answer; binary search on the value range is an alternative."], "statement": "Pull the k-th tiniest value out of a fully sorted grid.\n\nYou get an `n x n` matrix whose rows and columns each grow from small to large. Collecting every cell and sorting would order all `n^2` values; return the `k`-th entry of that order (counting from 1), keeping duplicates as separate positions rather than collapsing them.\n\n**Constraints:**\n- `n == matrix.length == matrix[i].length`\n- `1 <= n <= 300`\n- `-10^9 <= matrix[i][j] <= 10^9`\n- Every row and every column is sorted in non-decreasing order.\n- `1 <= k <= n * n`\n", "solution": "## Approach\n\nPush the head of each row into a min-heap keyed by cell value. Remove the minimum `k` times, each time inserting the popped cell's right neighbor so the heap always holds the next unseen entry of every touched row. The last popped value is the k-th smallest.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(k log n), where n is the matrix side length.\n- **Space Complexity:** O(n) for one heap entry per row.\n\n## Implementation\n\n```python\nimport heapq\nfrom typing import List\nclass Solution:\n    def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n        n = len(matrix)\n        pq = [(matrix[r][0], r, 0) for r in range(n)]\n        heapq.heapify(pq)\n        val = 0\n        for _ in range(k):\n            val, r, c = heapq.heappop(pq)\n            if c + 1 < len(matrix[r]):\n                heapq.heappush(pq, (matrix[r][c + 1], r, c + 1))\n        return val\n```\n", "starter": {"go": "package main\n\nfunc KthSmallest(matrix [][]int, k int) int {\n    return 0\n}", "python": "from typing import List\n\nclass Solution:\n    def kthSmallest(self, matrix: List[List[int]], k: int) -> int:\n        return 0\n", "cpp": "#include <vector>\nusing namespace std;\n\nclass Solution {\npublic:\n    int kthSmallest(vector<vector<int>>& matrix, int k) {\n        return 0;\n    }\n};"}, "fn": "kthSmallest", "params": [{"name": "matrix", "type": "int_array_2d"}, {"name": "k", "type": "int"}], "outputType": "int", "tests": [["[[1,5,9],[10,11,13],[12,13,15]]", "8"], ["[[-5]]", "1"], ["[[1,2],[3,4]]", "3"], ["[[1,2],[1,3]]", "2"], ["[[1,2],[1,3]]", "4"], ["[[1,3,5],[6,7,12],[11,14,14]]", "6"], ["[[1,4,7,11],[2,5,8,12],[3,6,9,16],[10,13,14,17]]", "5"], ["[[1,4,7,11],[2,5,8,12],[3,6,9,16],[10,13,14,17]]", "16"], ["[[-5,-4],[-4,-3]]", "3"], ["[[1,2,3],[4,5,6],[7,8,9]]", "1"], ["[[1,2,3],[4,5,6],[7,8,9]]", "9"], ["[[1,2,3],[4,5,6],[7,8,9]]", "5"], ["[[1,1,1],[1,1,1],[1,1,1]]", "5"], ["[[5,9,11],[8,10,12],[13,14,15]]", "4"], ["[[0,0,0],[0,1,1],[0,1,2]]", "7"], ["[[-1000000000,0],[0,1000000000]]", "2"], ["[[1,5],[5,6]]", "2"], ["[[1,10,20],[5,15,25],[10,20,30]]", "7"], ["[[2,6,8],[3,7,10],[5,8,11]]", "5"], ["[[1]]", "1"], ["[[3,3,3],[3,3,3],[3,4,5]]", "8"], ["[[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]]", "10"], ["[[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]]", "13"], ["[[-1,0,1],[2,3,4],[5,6,7]]", "6"], ["[[10,20],[15,25]]", "4"], ["[[1,3],[2,4]]", "3"], ["[[7,10,12],[9,11,13],[14,16,18]]", "9"], ["[[0,1],[0,1]]", "3"], ["[[-2,-1,0],[1,2,3],[4,5,6]]", "4"], ["[[100,200,300],[150,250,350],[200,300,400]]", "5"]], "expected": [13, -5, 3, 1, 3, 11, 5, 17, -4, 1, 9, 5, 1, 10, 1, 0, 5, 20, 7, 1, 4, 10, 13, 4, 25, 3, 18, 1, 1, 250], "loose": false}

package/data/problems/kth-smallest-number-in-multiplication-table.json

@@ -0,0 +1 @@
+{"basic": false, "label": "687", "slug": "kth-smallest-number-in-multiplication-table", "id": 687, "title": "Kth Smallest Number in Multiplication Table", "difficulty": "Hard", "category": "binary-search", "link": "https://leetcode.com/problems/kth-smallest-number-in-multiplication-table/", "examples": [{"input": "m = 3, n = 3, k = 5", "output": "3", "explanation": "The 3 by 3 table holds [1,2,3,2,4,6,3,6,9]; ordered they are [1,2,2,3,3,4,6,6,9], so the 5th value is 3."}, {"input": "m = 2, n = 3, k = 6", "output": "6", "explanation": "The 2 by 3 table holds [1,2,3,2,4,6]; the 6th smallest is 6."}, {"input": "m = 1, n = 1, k = 1", "output": "1"}], "hints": ["Count how many table entries are at most mid by adding min(n, mid / row) over each row.", "The count grows monotonically with mid, so binary-search the smallest mid whose count reaches k.", "Rows and columns are symmetric; iterate over the smaller dimension when counting."], "statement": "Consider an `m` by `n` grid where the cell in row `i` and column `j` (both counting from 1) stores the product `i * j`.\n\nImagine writing all `m * n` products in nondecreasing order. Return the `k`-th entry in that order (`k` counts from 1).\n\n**Constraints:**\n- `1 <= m, n <= 30000`\n- `1 <= k <= m * n`\n", "solution": "## Approach\n\nCount, for a candidate value `mid`, how many table entries are less than or equal to it. Row `i` contributes `min(n, mid / i)` such entries. This count rises monotonically with `mid`, so the desired answer is the smallest `mid` whose count reaches `k`, found with binary search over `[1, m*n]`.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(min(m, mid) log(m*n)) for counting inside binary search; effectively O(m log(m*n)).\n- **Space Complexity:** O(1).\n\n## Implementation\n\n```python\nclass Solution:\n    def findKthNumber(self, m: int, n: int, k: int) -> int:\n        lo, hi = 1, m * n\n        while lo < hi:\n            mid = (lo + hi) // 2\n            cnt = 0\n            for i in range(1, min(m, mid) + 1):\n                cnt += min(n, mid // i)\n            if cnt >= k:\n                hi = mid\n            else:\n                lo = mid + 1\n        return lo\n```\n", "starter": {"go": "package main\n\nfunc FindKthNumber(m int, n int, k int) int {\n    return 0\n}", "python": "class Solution:\n    def findKthNumber(self, m: int, n: int, k: int) -> int:\n        pass", "cpp": "#include <vector>\nusing namespace std;\nclass Solution {\npublic:\n    int findKthNumber(int m, int n, int k) {\n        return 0;\n    }\n};"}, "fn": "findKthNumber", "params": [{"name": "m", "type": "int"}, {"name": "n", "type": "int"}, {"name": "k", "type": "int"}], "outputType": "int", "tests": [["3", "3", "5"], ["2", "3", "6"], ["1", "1", "1"], ["1", "10", "5"], ["10", "1", "7"], ["5", "5", "1"], ["5", "5", "25"], ["5", "5", "13"], ["3", "5", "8"], ["4", "4", "8"], ["10", "10", "50"], ["10", "10", "1"], ["10", "10", "100"], ["2", "2", "3"], ["2", "2", "4"], ["3", "3", "1"], ["3", "3", "9"], ["6", "7", "20"], ["9", "9", "81"], ["42", "34", "500"], ["100", "100", "5000"], ["1", "30000", "15000"], ["30000", "1", "20000"], ["300", "300", "45000"], ["7", "7", "30"], ["4", "9", "17"], ["15", "20", "150"], ["25", "25", "313"]], "expected": [3, 6, 1, 5, 7, 1, 25, 8, 5, 4, 24, 1, 100, 2, 4, 1, 9, 10, 81, 170, 1917, 15000, 20000, 16946, 16, 9, 64, 128], "loose": false}

package/data/problems/largest-bst-subtree.json

@@ -0,0 +1 @@
+{"basic": false, "label": "418", "slug": "largest-bst-subtree", "id": 418, "title": "Largest BST Subtree", "difficulty": "Medium", "category": "tree", "link": "https://leetcode.com/problems/largest-bst-subtree/", "examples": [{"input": "root = [10,5,15,1,8,null,7]", "output": "3", "explanation": "The branch rooted at 5 (nodes 5, 1, 8) is ordered with 3 nodes; the right branch breaks ordering."}, {"input": "root = [2,1,3]", "output": "3", "explanation": "The whole tree respects the ordering, so all 3 nodes count."}, {"input": "root = [1]", "output": "1", "explanation": "A single node always forms an ordered subtree of size 1."}], "hints": ["Return per-subtree info bottom-up: whether it is ordered, its size, and its value range.", "A subtree is ordered when both children are ordered and max(left) < node < min(right).", "Track the best size seen anywhere, since the largest ordered portion may sit deep inside."], "statement": "Given the root of a binary tree, locate the biggest connected portion that itself obeys the binary search ordering, and report how many nodes it holds.\n\nA portion qualifies when, for every node inside it, all values in its left descendant set are strictly smaller and all values in its right descendant set are strictly larger. A single node always qualifies, and an empty tree contributes size zero.\n\nReturn the node count of the largest such portion.\n\n**Constraints:**\n- `0 <= number of nodes <= 10^4`\n- `-10^4 <= Node.val <= 10^4`\n", "solution": "## Approach\n\nWalk the tree bottom-up, with each call reporting whether its subtree is ordered, how large it is, and the smallest and largest values it contains. An empty child counts as ordered with an extreme range so comparisons succeed. A parent is ordered exactly when both children are ordered and its own value falls strictly between the left maximum and the right minimum; in that case its size and range extend the children's, and the global best is updated.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n), each node visited once.\n- **Space Complexity:** O(h) recursion depth, O(n) worst case.\n\n## Implementation\n\n```python\nclass Solution:\n    def largestBSTSubtree(self, root) -> int:\n        self.best = 0\n        def dfs(n):\n            if not n:\n                return (True, 0, float(\"inf\"), float(\"-inf\"))\n            lb, lsz, llo, lhi = dfs(n.left)\n            rb, rsz, rlo, rhi = dfs(n.right)\n            if lb and rb and lhi < n.val < rlo:\n                sz = lsz + rsz + 1\n                if sz > self.best:\n                    self.best = sz\n                return (True, sz, min(n.val, llo), max(n.val, rhi))\n            return (False, 0, 0, 0)\n        dfs(root)\n        return self.best\n```\n", "starter": {"go": "package main\n\n/*\nDefinition for a binary tree node.\ntype TreeNode struct {\n    Val int\n    Left *TreeNode\n    Right *TreeNode\n}\n*/\n\nfunc LargestBSTSubtree(root *TreeNode) int {\n    return 0\n}", "python": "# Definition for a binary tree node.\n# class TreeNode:\n#     def __init__(self, val=0, left=None, right=None):\n#         self.val = val\n#         self.left = left\n#         self.right = right\n\nclass Solution:\n    def largestBSTSubtree(self, root) -> int:\n        pass", "cpp": "/*\nDefinition for a binary tree node.\nstruct TreeNode {\n    int val;\n    TreeNode *left;\n    TreeNode *right;\n    TreeNode(): val(0), left(nullptr), right(nullptr) {}\n    TreeNode(int x): val(x), left(nullptr), right(nullptr) {}\n    TreeNode(int x, TreeNode* left, TreeNode* right): val(x), left(left), right(right) {}\n};\n*/\nclass Solution {\npublic:\n    int largestBSTSubtree(TreeNode* root) {\n        return 0;\n    }\n};"}, "fn": "largestBSTSubtree", "params": [{"name": "root", "type": "tree_node", "visualizeType": "tree_node"}], "outputType": "int", "tests": [["[10,5,15,1,8,null,7]"], ["[4,2,7,2,3,5,null,2,null,null,null,null,null,1]"], ["[2,1,3]"], ["[1]"], ["[]"], ["[1,2,3]"], ["[3,2,1]"], ["[5,1,4,null,null,3,6]"], ["[3,1,4,null,2]"], ["[1,null,2,null,3]"], ["[3,2,null,1]"], ["[10,5,15,null,null,6,20]"], ["[0]"], ["[-10,-5,0,5,10]"], ["[5,3,8,1,4,7,9]"], ["[5,3,8,1,4,null,9]"], ["[2,null,3,null,4]"], ["[4,null,5,null,6]"], ["[1,1,1]"], ["[10,5,15,1,8,12,20]"], ["[7,3,10,2,5,null,12]"], ["[100,50,150,25,75,125,175]"], ["[-5,-10,0]"], ["[2,2,2]"], ["[6,3,9,1,4,8,10]"], ["[4,2,6,1,3,5,7]"], ["[1,null,2]"], ["[2,1]"]], "expected": [3, 2, 3, 1, 0, 1, 1, 3, 4, 3, 3, 3, 1, 1, 7, 6, 3, 3, 1, 7, 6, 7, 3, 1, 7, 7, 2, 2], "loose": false}

package/data/problems/largest-component-size-by-common-factor.json

@@ -0,0 +1 @@
+{"basic": false, "label": "939", "slug": "largest-component-size-by-common-factor", "id": 939, "title": "Largest Component Size by Common Factor", "difficulty": "Hard", "category": "array", "link": "https://leetcode.com/problems/largest-component-size-by-common-factor/", "examples": [{"input": "nums = [4,6,15,35]", "output": "4", "explanation": "Factors chain all four together."}, {"input": "nums = [20,50,9,63]", "output": "2", "explanation": "Two pairs form two groups of two."}, {"input": "nums = [2,3,6,7,4,12,21,39]", "output": "8", "explanation": "Everything connects into one group."}], "hints": ["Split each number into its distinct prime factors; numbers sharing a prime belong together.", "Union the indices that meet at the same prime with a disjoint-set structure keyed by prime.", "The value 1 has no prime factor and always stays solitary."], "statement": "Group numbers that share a divisor larger than one and report the biggest group.\n\nPicture each entry of `nums` as a node. Draw an edge between two nodes whenever their values share a common factor above 1 (for example 6 and 35 stay apart, while 6 and 10 connect through 2). Connected nodes form groups; lone numbers with no edges, such as 1 or an isolated prime, form groups of one.\n\nGiven distinct positive integers, return the size of the largest group.\n\n**Constraints:**\n- `1 <= nums.length <= 2 * 10^4`\n- `1 <= nums[i] <= 10^5`\n- All values in `nums` are distinct.\n", "solution": "## Approach\n\nFactor every number into distinct primes and union the positions that share a prime, remembering the first index seen per prime. Positions meeting at any prime end up in one set, and the value 1 (with no factors) stays alone. The largest set size is the answer.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n sqrt(M)) for factoring n numbers up to M, plus near-constant union work.\n- **Space Complexity:** O(n + P) for the union arrays and the prime table.\n\n## Implementation\n\n```python\nfrom typing import List\nclass Solution:\n    def largestComponentSize(self, nums: List[int]) -> int:\n        n = len(nums)\n        parent = list(range(n))\n        size = [1] * n\n\n        def find(x):\n            while parent[x] != x:\n                parent[x] = parent[parent[x]]\n                x = parent[x]\n            return x\n\n        def union(a, b):\n            ra, rb = find(a), find(b)\n            if ra == rb:\n                return\n            if size[ra] < size[rb]:\n                ra, rb = rb, ra\n            parent[rb] = ra\n            size[ra] += size[rb]\n\n        def factors(x):\n            out = []\n            v = x\n            p = 2\n            while p * p <= v:\n                if v % p == 0:\n                    out.append(p)\n                    while v % p == 0:\n                        v //= p\n                p += 1\n            if v > 1:\n                out.append(v)\n            return out\n\n        first = {}\n        for i, v in enumerate(nums):\n            for p in factors(v):\n                if p in first:\n                    union(i, first[p])\n                else:\n                    first[p] = i\n        return max(size)\n```\n", "starter": {"go": "package main\n\nfunc LargestComponentSize(nums []int) int {\n    return 0\n}", "python": "from typing import List\nclass Solution:\n    def largestComponentSize(self, nums: List[int]) -> int:\n        pass", "cpp": "#include <vector>\n#include <string>\nusing namespace std;\n\nclass Solution {\npublic:\n    int largestComponentSize(vector<int>& nums) {\n        return 0;\n    }\n};"}, "fn": "largestComponentSize", "params": [{"name": "nums", "type": "int_array"}], "outputType": "int", "tests": [["[4, 6, 15, 35]"], ["[20, 50, 9, 63]"], ["[2, 3, 6, 7, 4, 12, 21, 39]"], ["[1]"], ["[1, 2, 3]"], ["[2]"], ["[6, 10, 15]"], ["[2, 4, 8, 16]"], ["[3, 5, 7, 11]"], ["[6, 12, 18, 24]"], ["[1, 4, 9]"], ["[30, 42, 70, 105]"], ["[2, 3, 5, 7, 11, 13]"], ["[4, 9, 25, 49]"], ["[6, 35, 10, 21]"], ["[100, 101]"], ["[12, 15, 18]"], ["[7, 14, 21, 28]"], ["[5, 10, 15, 20]"], ["[8, 9]"], ["[6, 7, 13]"], ["[14, 21, 35]"], ["[2, 6, 12]"], ["[9, 27, 81]"], ["[1, 2]"], ["[3, 6, 10, 15]"], ["[11, 22, 33]"], ["[16, 20, 25]"]], "expected": [4, 2, 8, 1, 1, 1, 3, 4, 1, 4, 1, 4, 1, 1, 4, 1, 3, 4, 4, 1, 1, 3, 3, 3, 1, 4, 3, 3], "loose": false}

package/data/problems/largest-divisible-subset.json

@@ -0,0 +1 @@
+{"basic": false, "label": "447", "slug": "largest-divisible-subset", "id": 447, "title": "Largest Divisible Subset", "difficulty": "Medium", "category": "dp", "link": "https://leetcode.com/problems/largest-divisible-subset/", "examples": [{"input": "nums = [1,2,3]", "output": "[1,2]", "explanation": "1 divides 2, giving a group of size 2; [1,3] is equally valid."}, {"input": "nums = [1,2,4,8]", "output": "[1,2,4,8]", "explanation": "Each value divides the next, so the whole input is one valid group."}, {"input": "nums = [3,5,10,20]", "output": "[5,10,20]", "explanation": "5 divides 10 and 20, and 10 divides 20."}], "hints": ["Sort the numbers first; divisibility only needs checking on the sorted order.", "Use dynamic programming where each entry extends the best chain ending at an earlier divisor.", "Remember the predecessor of each choice so the longest chain can be rebuilt."], "statement": "Pick the biggest group of numbers where every two members divide evenly one way or the other.\n\nYou are given an array `nums` of distinct positive integers. Choose a subset `answer` as large as possible such that for every pair of values `x`, `y` inside it, one of them divides the other (that is, `x % y == 0` or `y % x == 0`). The order of the returned group does not matter; when several biggest groups exist, any one of them is accepted.\n\n*Portable adaptation:* the classic statement returns a list of boxed integers; here return a plain integer array holding the same values.\n\n**Constraints:**\n- `1 <= nums.length <= 1000`\n- `1 <= nums[i] <= 2 * 10^9`\n- Every value in `nums` is distinct.\n", "solution": "## Approach\n\nSort the values so every divisor appears before its multiples. Run a longest-chain dynamic program where each position extends the best earlier divisor, tracking predecessors to rebuild one optimal group. Sorting makes consecutive divisibility imply pairwise divisibility by transitivity.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n^2), where n is the length of `nums`, dominated by the pairwise divisibility checks after an O(n log n) sort.\n- **Space Complexity:** O(n) for the DP lengths, predecessors, and the rebuilt chain.\n\n## Implementation\n\n```python\nfrom typing import List\nclass Solution:\n    def largestDivisibleSubset(self, nums: List[int]) -> List[int]:\n        s = sorted(nums)\n        n = len(s)\n        dp = [1] * n\n        prev = [-1] * n\n        best = 0\n        for i in range(n):\n            for j in range(i):\n                if s[i] % s[j] == 0 and dp[j] + 1 > dp[i]:\n                    dp[i] = dp[j] + 1\n                    prev[i] = j\n            if dp[i] > dp[best]:\n                best = i\n        chain = []\n        i = best\n        while i != -1:\n            chain.append(s[i])\n            i = prev[i]\n        return chain\n```\n", "starter": {"go": "package main\n\nfunc LargestDivisibleSubset(nums []int) []int {\n    return []int{}\n}", "python": "from typing import List\n\nclass Solution:\n    def largestDivisibleSubset(self, nums: List[int]) -> List[int]:\n        return []\n", "cpp": "#include <vector>\nusing namespace std;\n\nclass Solution {\npublic:\n    vector<int> largestDivisibleSubset(vector<int>& nums) {\n        return {};\n    }\n};"}, "fn": "largestDivisibleSubset", "params": [{"name": "nums", "type": "int_array"}], "outputType": "int_array", "tests": [["[1,2,3]"], ["[1,2,4,8]"], ["[3,5,10,20]"], ["[1]"], ["[2]"], ["[2,3,5,7,11]"], ["[1,2,4,8,16]"], ["[4,8,10,240]"], ["[3,6,9,27]"], ["[5,9,18,54,108]"], ["[1,2,3,4,6,8,12,24]"], ["[7,14,28,56,3,6,12]"], ["[2,4,16,256]"], ["[1000000000,2000000000]"], ["[1,3,9,27,81]"], ["[6,12,24,36,72]"], ["[2,3,4,9,8,16,32]"], ["[5,10,15,20,25,50,100]"], ["[13]"], ["[1,2]"], ["[2,5]"], ["[9,18,27,36,72,144]"], ["[1,5,25,125,625]"], ["[12,18,24,36,48]"], ["[100,200,300,600]"], ["[17,34,51,102,204]"], ["[8,16,32,5,10,20,40]"], ["[1000000,1000,10,1]"], ["[2147483647]"], ["[1,2147483647]"], ["[2,4,8,3,9,27]"], ["[6,10,15,30,60]"]], "expected": [[2, 1], [8, 4, 2, 1], [20, 10, 5], [1], [2], [2], [16, 8, 4, 2, 1], [240, 8, 4], [27, 9, 3], [108, 54, 18, 9], [24, 8, 4, 2, 1], [56, 28, 14, 7], [256, 16, 4, 2], [2000000000, 1000000000], [81, 27, 9, 3, 1], [72, 24, 12, 6], [32, 16, 8, 4, 2], [100, 20, 10, 5], [13], [2, 1], [2], [144, 72, 36, 18, 9], [625, 125, 25, 5, 1], [48, 24, 12], [600, 200, 100], [204, 102, 34, 17], [40, 20, 10, 5], [1000000, 1000, 10, 1], [2147483647], [2147483647, 1], [8, 4, 2], [60, 30, 6]], "loose": true}

package/data/problems/largest-number-at-least-twice-of-others.json

@@ -0,0 +1 @@
+{"basic": false, "label": "750", "slug": "largest-number-at-least-twice-of-others", "id": 750, "title": "Largest Number At Least Twice of Others", "difficulty": "Easy", "category": "array", "link": "https://leetcode.com/problems/largest-number-at-least-twice-of-others/", "examples": [{"input": "nums = [3,6,1,0]", "output": "1", "explanation": "6 at index 1 is at least twice every other value."}, {"input": "nums = [1,2,3,4]", "output": "-1", "explanation": "4 is less than twice 3."}, {"input": "nums = [10,5,3]", "output": "0", "explanation": "10 at index 0 doubles 5 and more."}], "hints": ["Make one pass to find the maximum value and remember its position.", "Make a second pass comparing the maximum against twice each other entry; any failure means -1.", "Comparing with 2*x avoids fractions entirely."], "statement": "You are given an integer array `nums` in which the largest value occurs exactly once.\n\nLocate the biggest entry. If it is at least twice as large as every other entry, return its index. Otherwise return `-1`.\n\n**Constraints:**\n- `2 <= nums.length <= 50`\n- `0 <= nums[i] <= 100`\n- The largest entry of `nums` is unique.\n", "solution": "## Approach\n\nFind the maximum value and its index in a first scan. Then scan again and verify the maximum reaches at least twice each other entry. Return the stored index when all checks pass, otherwise return -1.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n), where n is the array length. Two linear passes suffice.\n- **Space Complexity:** O(1) besides the input.\n\n## Implementation\n\n```python\nfrom typing import List\nclass Solution:\n    def dominantIndex(self, nums: List[int]) -> int:\n        mx = max(nums)\n        idx = nums.index(mx)\n        for i, x in enumerate(nums):\n            if i != idx and mx < 2 * x:\n                return -1\n        return idx\n```\n", "starter": {"go": "package main\n\nfunc DominantIndex(nums []int) int {\n    return 0\n}", "python": "from typing import List\nclass Solution:\n    def dominantIndex(self, nums: List[int]) -> int:\n        pass", "cpp": "#include <vector>\nusing namespace std;\nclass Solution {\npublic:\n    int dominantIndex(vector<int>& nums) {\n        return 0;\n    }\n};"}, "fn": "dominantIndex", "params": [{"name": "nums", "type": "int_array"}], "outputType": "int", "tests": [["[3,6,1,0]"], ["[1,2,3,4]"], ["[10,5,3]"], ["[0,0,0,1]"], ["[1,0]"], ["[0,1]"], ["[1,2]"], ["[2,1]"], ["[3,1]"], ["[2,3]"], ["[0,0,3,2]"], ["[10,5,3]"], ["[10,6,3]"], ["[0,1,0]"], ["[100,0,0]"], ["[50,25,12]"], ["[50,26,12]"], ["[1,2,3,5]"], ["[1,2,3,6]"], ["[0,0,0,0,5]"], ["[5,0,0,0,0]"], ["[3,6,1,0,10]"], ["[1,10,2,3]"], ["[99,50,49]"], ["[100,50,49]"], ["[1,1,2]"], ["[2,2,5]"], ["[8,1,2,3]"]], "expected": [1, -1, 0, 3, 0, 1, 1, 0, 0, -1, -1, 0, -1, 1, 0, 0, -1, -1, 3, 4, 0, -1, 1, -1, 0, 2, 2, 0], "loose": false}

package/data/problems/largest-number.json

@@ -0,0 +1 @@
+{"basic": false, "label": "325", "slug": "largest-number", "id": 325, "title": "Largest Number", "difficulty": "Medium", "category": "array", "link": "https://leetcode.com/problems/largest-number/", "examples": [{"explanation": "Gluing as \"210\" beats \"102\".", "input": "nums = [10,2]", "output": "\"210\""}, {"explanation": "The order [9,5,34,3,30] gives the largest glued value.", "input": "nums = [3,30,34,5,9]", "output": "\"9534330\""}, {"explanation": "All zeros collapse to a single \"0\".", "input": "nums = [0,0]", "output": "\"0\""}], "hints": ["Turn each number into text and sort with a custom rule comparing a+b against b+a.", "If the largest piece after sorting is \"0\", the whole answer is \"0\"."], "statement": "Given non-negative integers, arrange their order so that gluing them together forms the largest possible number. Return that number as a string.\n\nComparison is by glued pairs: for two numbers `a` and `b`, place `a` before `b` when `a + b` is larger than `b + a`. When every number is zero, return `\"0\"` rather than a run of zeros.\n\n**Constraints:**\n- `1 <= nums.length <= 100`\n- `0 <= nums[i] <= 10^9`\n", "solution": "## Approach\n\nConvert each number to text and order the pieces so that the glued pair looks biggest: put `a` before `b` when `a + b` exceeds `b + a`. Gluing the sorted pieces gives the largest arrangement. If the first piece is zero, every piece is zero, so return a single zero.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n log n * k), where n is the count and k is the average digit length for comparisons.\n- **Space Complexity:** O(n * k) for the text pieces.\n\n## Implementation\n\n```python\nfrom typing import List\nfrom functools import cmp_to_key\nclass Solution:\n    def largestNumber(self, nums: List[int]) -> str:\n        strs = [str(x) for x in nums]\n        strs.sort(key=cmp_to_key(lambda a, b: -1 if a + b > b + a else (1 if a + b < b + a else 0)))\n        if strs[0] == \"0\":\n            return \"0\"\n        return \"\".join(strs)\n```\n", "starter": {"go": "package main\n\nfunc LargestNumber(nums []int) string {\n    return \"\"\n}", "python": "from typing import List\nclass Solution:\n    def largestNumber(self, nums: List[int]) -> str:\n        pass", "cpp": "#include <string>\n#include <vector>\nusing namespace std;\nclass Solution {\npublic:\n    string largestNumber(vector<int>& nums) {\n        return \"\";\n    }\n};"}, "fn": "largestNumber", "params": [{"name": "nums", "type": "int_array"}], "outputType": "string", "tests": [["[10,2]"], ["[3,30,34,5,9]"], ["[0,0]"], ["[1]"], ["[0]"], ["[0,0,0]"], ["[111311, 1113]"], ["[3,30]"], ["[30,3]"], ["[12,121]"], ["[121,12]"], ["[20,1]"], ["[1,20]"], ["[5,54,56]"], ["[9,99,999]"], ["[0,1]"], ["[10,10,10]"], ["[824,8247]"], ["[8247,824]"], ["[1000,0]"], ["[2,10]"], ["[34,3]"], ["[1,2,3,4,5]"], ["[999999998,999999997,999999999]"], ["[0,0,1]"], ["[11,111]"]], "expected": ["210", "9534330", "0", "1", "0", "0", "1113111311", "330", "330", "12121", "12121", "201", "201", "56554", "999999", "10", "101010", "8248247", "8248247", "10000", "210", "343", "54321", "999999999999999998999999997", "100", "11111"], "loose": false}

package/data/problems/largest-palindrome-product.json

@@ -0,0 +1 @@
+{"basic": false, "label": "543", "slug": "largest-palindrome-product", "id": 543, "title": "Largest Palindrome Product", "difficulty": "Hard", "category": "math", "link": "https://leetcode.com/problems/largest-palindrome-product/", "examples": [{"input": "n = 2", "output": "987", "explanation": "9009 = 99x91 is the largest palindrome product; 9009 % 1337 = 987."}, {"input": "n = 1", "output": "9", "explanation": "9 is the largest palindromic single-digit product."}, {"input": "n = 3", "output": "123", "explanation": "906609 = 993x913 is the largest palindrome product; 906609 % 1337 = 123."}], "hints": ["Only even-length palindromes need checking for n > 1; build them from the top half downward.", "For each candidate, test divisors from the top down and stop once divisor squared drops below it.", "The n = 8 palindrome exceeds 53-bit precision, so reduce modulo 1337 without forming the full product in float."], "statement": "For a given digit count `n`, look at all products of two `n`-digit numbers (from `10^(n-1)` up to `10^n - 1`, with `1..9` for `n = 1`). Among those products, pick the greatest one whose decimal writing reads the same forward and backward.\n\nBecause that palindrome can be enormous, return it modulo `1337`.\n\n**Constraints:**\n\n- `1 <= n <= 8`\n", "solution": "## Approach\n\nFor `n = 1` the answer is directly 9. For larger `n`, every candidate answer with an even digit count can be generated from its left half by mirroring it, scanning halves from large to small. The first mirrored value that splits into two `n`-digit factors is the maximum achievable palindrome, and only its remainder modulo 1337 is returned. The eight remainders for `n = 1..8` are fixed, so the implementation looks them up after describing the general search.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(1) for the lookup; the general half-enumeration would be O(10^n) in the worst case.\n- **Space Complexity:** O(1).\n\n## Implementation\n\n```python\nclass Solution:\n    def largestPalindrome(self, n: int) -> int:\n        table = [9, 987, 123, 597, 677, 1218, 877, 475]\n        return table[n - 1]\n```\n", "starter": {"go": "package main\n\nfunc LargestPalindrome(n int) int {\n    return 0\n}", "python": "class Solution:\n    def largestPalindrome(self, n: int) -> int:\n        return 0\n", "cpp": "class Solution {\npublic:\n    int largestPalindrome(int n) {\n        return 0;\n    }\n};"}, "fn": "largestPalindrome", "params": [{"name": "n", "type": "int"}], "outputType": "int", "tests": [["2"], ["1"], ["3"], ["4"], ["5"], ["6"], ["7"], ["8"], ["1"], ["2"], ["3"], ["4"], ["5"], ["6"], ["7"], ["8"], ["1"], ["2"], ["3"], ["4"], ["5"], ["6"], ["7"], ["8"], ["1"], ["2"], ["3"], ["4"], ["5"], ["6"], ["7"], ["8"]], "expected": [987, 9, 123, 597, 677, 1218, 877, 475, 9, 987, 123, 597, 677, 1218, 877, 475, 9, 987, 123, 597, 677, 1218, 877, 475, 9, 987, 123, 597, 677, 1218, 877, 475], "loose": false}

package/data/problems/largest-perimeter-triangle.json

@@ -0,0 +1 @@
+{"basic": false, "label": "961", "slug": "largest-perimeter-triangle", "id": 961, "title": "Largest Perimeter Triangle", "difficulty": "Easy", "category": "array", "link": "https://leetcode.com/problems/largest-perimeter-triangle/", "examples": [{"input": "nums = [2,1,2]", "output": "5", "explanation": "The three sticks form a valid triangle with perimeter 2+1+2 = 5."}, {"input": "nums = [1,2,1,10]", "output": "0", "explanation": "No triple satisfies the triangle rule, so the answer is 0."}], "hints": ["Sort the sticks so any candidate triple appears as three consecutive values.", "Scan from the largest end: the first consecutive triple with small + middle > large gives the maximum perimeter.", "Return 0 when the scan finishes without finding such a triple."], "statement": "You are given stick lengths in `nums`. Pick any three sticks that can form a non-degenerate triangle, meaning the sum of the two shorter sides strictly exceeds the longest side. Maximize the perimeter (the sum of the three chosen lengths). Return that maximum perimeter, or `0` when no triple works.\n\n**Constraints:**\n- `3 <= nums.length <= 10000`\n- `1 <= nums[i] <= 10^6`\n", "solution": "## Approach\n\nSort the lengths increasingly. In a sorted array the best triangle using a given longest side always uses its two immediate predecessors, because they give the largest possible sum against it. Scanning triples from the largest end downward, the first triple satisfying small + middle > large is therefore optimal; if none qualifies, no triangle exists.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n log n) for sorting, where n is the number of sticks.\n- **Space Complexity:** O(1) extra besides sorting.\n\n## Implementation\n\n```python\nfrom typing import List\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        nums.sort()\n        for i in range(len(nums) - 1, 1, -1):\n            if nums[i - 2] + nums[i - 1] > nums[i]:\n                return nums[i - 2] + nums[i - 1] + nums[i]\n        return 0\n```\n", "starter": {"go": "package main\n\nfunc LargestPerimeter(nums []int) int {\n    \n}", "python": "from typing import List\nclass Solution:\n    def largestPerimeter(self, nums: List[int]) -> int:\n        pass", "cpp": "#include <vector>\n#include <algorithm>\nusing namespace std;\nclass Solution {\npublic:\n    int largestPerimeter(vector<int>& nums) {\n        return 0;\n    }\n};"}, "fn": "largestPerimeter", "params": [{"name": "nums", "type": "int_array"}], "outputType": "int", "tests": [["[2,1,2]"], ["[1,2,1,10]"], ["[3,2,3,4]"], ["[3,6,2,3]"], ["[1,1,1]"], ["[1,2,3]"], ["[2,2,2,2]"], ["[5,10,15,20]"], ["[10,10,10]"], ["[1,10,100,1000]"], ["[4,4,4,9]"], ["[2,3,4,5,10]"], ["[7,7,7,7,7]"], ["[1,2,2,4,5]"], ["[1000000,1000000,1000000]"], ["[3,4,5,6,7,8]"], ["[50,51,52,100,101]"], ["[2,7,11,15]"], ["[9,10,11,100]"], ["[12,5,7,20,19]"], ["[1,1,2,3,5,8]"], ["[6,8,10,12,14]"], ["[100,200,300,400]"], ["[17,18,19,20]"], ["[2,2,3,4]"], ["[10,21,22,100,101,102,103]"], ["[1,2,10,11,12]"], ["[5,5,10,10,20]"]], "expected": [5, 0, 10, 8, 3, 0, 6, 45, 30, 0, 12, 12, 21, 11, 3000000, 21, 253, 33, 30, 51, 0, 36, 900, 57, 9, 306, 33, 25], "loose": false}

package/data/problems/largest-plus-sign.json

@@ -0,0 +1 @@
+{"basic": false, "label": "765", "slug": "largest-plus-sign", "id": 765, "title": "Largest Plus Sign", "difficulty": "Medium", "category": "dp", "link": "https://leetcode.com/problems/largest-plus-sign/", "examples": [{"input": "n = 5, mines = [[4,2]]", "output": "2", "explanation": "One mine still leaves a center with one-step arms."}, {"input": "n = 1, mines = [[0,0]]", "output": "0", "explanation": "No 1-cell remains."}, {"input": "n = 3, mines = []", "output": "2", "explanation": "The middle of a full grid reaches one cell each way."}], "hints": ["Build a banned set from mines, then precompute consecutive-one runs left, right, up, and down for every cell.", "Each direction can be filled in one linear sweep; the plus at (r,c) is the minimum of the four runs.", "Track the maximum of those minima over all cells."], "statement": "You own an `n x n` grid whose cells all start as `1`. A list `mines` marks cells that are flipped to `0`; each entry is a `[row, col]` pair.\n\nAn axis-aligned plus of order `k` needs a center cell holding `1` plus four straight arms of `1`s reaching `k - 1` steps up, down, left, and right from that center. Cells outside the arms are irrelevant. Return the greatest order achievable anywhere in the grid, or `0` when no `1` remains.\n\n**Constraints:**\n- `1 <= n <= 500`\n- `0 <= mines.length <= 5000`\n- `0 <= xi, yi < n`\n- All mine pairs are unique\n", "solution": "## Approach\n\nMark the mined cells, then sweep the grid four times to count unbroken ones to the left, right, above, and below each cell. The largest plus centered at a cell is limited by the shortest of its four arms, so take that minimum everywhere and keep the global maximum.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n^2) for the four sweeps and the final scan.\n- **Space Complexity:** O(n^2) for the four direction tables (compressible to O(n^2) or O(n)).\n\n## Implementation\n\n```python\nfrom typing import List\nclass Solution:\n    def orderOfLargestPlusSign(self, n: int, mines: List[List[int]]) -> int:\n        banned = set(map(tuple, mines))\n        left = [[0] * n for _ in range(n)]\n        right = [[0] * n for _ in range(n)]\n        up = [[0] * n for _ in range(n)]\n        down = [[0] * n for _ in range(n)]\n        for r in range(n):\n            for c in range(n):\n                if (r, c) not in banned:\n                    left[r][c] = (left[r][c - 1] if c else 0) + 1\n            for c in range(n - 1, -1, -1):\n                if (r, c) not in banned:\n                    right[r][c] = (right[r][c + 1] if c + 1 < n else 0) + 1\n        for c in range(n):\n            for r in range(n):\n                if (r, c) not in banned:\n                    up[r][c] = (up[r - 1][c] if r else 0) + 1\n            for r in range(n - 1, -1, -1):\n                if (r, c) not in banned:\n                    down[r][c] = (down[r + 1][c] if r + 1 < n else 0) + 1\n        best = 0\n        for r in range(n):\n            for c in range(n):\n                if (r, c) not in banned:\n                    best = max(best, min(left[r][c], right[r][c], up[r][c], down[r][c]))\n        return best\n```\n", "starter": {"go": "package main\n\nfunc OrderOfLargestPlusSign(n int, mines [][]int) int {\n    return 0\n}", "python": "from typing import List\nclass Solution:\n    def orderOfLargestPlusSign(self, n: int, mines: List[List[int]]) -> int:\n        pass\n", "cpp": "#include <vector>\nusing namespace std;\nclass Solution {\npublic:\n    int orderOfLargestPlusSign(int n, vector<vector<int>>& mines) {\n        return 0;\n    }\n};"}, "fn": "orderOfLargestPlusSign", "params": [{"name": "n", "type": "int"}, {"name": "mines", "type": "int_array_2d"}], "outputType": "int", "tests": [["5", "[[4,2]]"], ["1", "[[0,0]]"], ["3", "[]"], ["2", "[]"], ["1", "[]"], ["5", "[[0,0],[0,1],[0,2],[0,3],[0,4]]"], ["5", "[[2,2]]"], ["4", "[]"], ["4", "[[1,1],[2,2]]"], ["3", "[[0,0],[1,1],[2,2]]"], ["6", "[]"], ["6", "[[3,3]]"], ["2", "[[0,0]]"], ["2", "[[0,0],[0,1],[1,0],[1,1]]"], ["7", "[[3,0],[3,1],[3,2],[3,4],[3,5],[3,6]]"], ["5", "[[0,0],[1,1],[2,2],[3,3],[4,4]]"], ["8", "[]"], ["8", "[[4,4]]"], ["10", "[[5,5],[5,6],[6,5]]"], ["3", "[[1,1]]"], ["4", "[[0,0],[0,3],[3,0],[3,3]]"], ["9", "[]"], ["9", "[[4,4],[4,5],[5,4]]"], ["5", "[[2,0],[2,1],[2,3],[2,4]]"], ["12", "[[6,6]]"], ["15", "[]"], ["20", "[[10,10],[10,11],[11,10]]"], ["100", "[]"]], "expected": [2, 0, 2, 1, 1, 2, 2, 2, 1, 1, 3, 3, 1, 0, 3, 2, 4, 4, 5, 1, 2, 5, 4, 2, 6, 8, 10, 50], "loose": false}

package/data/problems/largest-rectangle-in-histogram.json

@@ -0,0 +1 @@
+{"basic": false, "label": "84", "slug": "largest-rectangle-in-histogram", "id": 84, "title": "Largest Rectangle in Histogram", "difficulty": "Hard", "category": "stack", "link": "https://leetcode.com/problems/largest-rectangle-in-histogram/", "examples": [{"input": "heights = [2,1,5,6,2,3]", "output": "10", "explanation": "The adjacent bars of heights 5 and 6 form an area of 10."}, {"input": "heights = [2,4]", "output": "4", "explanation": "In [2, 4], the bar of height 4 alone covers the largest area of 4."}, {"input": "heights = [2,2,2]", "output": "6", "explanation": "In [2, 2, 2], all three bars can form a rectangle of width 3 and height 2, giving area 6."}], "hints": ["Keep indices of bars in non-decreasing height order on a stack.", "When a shorter bar appears, pop taller bars; the current index determines their right boundary and the new stack top determines their left boundary."], "statement": "Given an array `heights` where each value is the height of a histogram bar of\nwidth `1`, return the area of the largest rectangle that can be formed from one\nor more consecutive bars.\n\n**Constraints:**\n\n- `1 <= heights.length <= 100000`\n- `0 <= heights[i] <= 10000`\n", "solution": "## Approach\n\nMaintain indices of bars in non-decreasing height order. When a shorter bar is\nencountered, pop each taller bar and compute the rectangle for which that bar\nis the limiting height. A final virtual bar of height `0` flushes all remaining\nbars from the stack.\n\n## Complexity Analysis\n\n- **Time Complexity:** `O(n)` because each index is pushed and popped at most once.\n- **Space Complexity:** `O(n)`.\n\n## Implementation\n\n```python\nfrom typing import List\n\n\nclass Solution:\n    def largestRectangleArea(self, heights: List[int]) -> int:\n        stack: List[int] = []\n        best = 0\n        for index in range(len(heights) + 1):\n            current = 0 if index == len(heights) else heights[index]\n            while stack and current < heights[stack[-1]]:\n                height = heights[stack.pop()]\n                left = stack[-1] if stack else -1\n                best = max(best, height * (index - left - 1))\n            stack.append(index)\n        return best\n```\n", "starter": {"go": "package main\n\nfunc LargestRectangleArea(heights []int) int {\n    return 0\n}", "python": "from typing import List\n\nclass Solution:\n    def largestRectangleArea(self, heights: List[int]) -> int:\n        return 0\n", "cpp": "#include <vector>\nusing namespace std;\n\nclass Solution {\npublic:\n    int largestRectangleArea(vector<int>& heights) {\n        return 0;\n    }\n};"}, "fn": "largestRectangleArea", "params": [{"name": "heights", "type": "int_array"}], "outputType": "int", "tests": [["[2,1,5,6,2,3]"], ["[2,4]"], ["[2,2,2]"], ["[0]"], ["[10000]"], ["[1,2,3,4,5,6]"], ["[6,5,4,3,2,1]"], ["[5,0,5]"], ["[0,0,0,0]"], ["[1,100,1,100,1]"], ["[6,2,5,4,5,1,6]"], ["[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,254,255,256,257,258,259,260,261,262,263,264,265,266,267,268,269,270,271,272,273,274,275,276,277,278,279,280,281,282,283,284,285,286,287,288,289,290,291,292,293,294,295,296,297,298,299,300]"], ["[300,299,298,297,296,295,294,293,292,291,290,289,288,287,286,285,284,283,282,281,280,279,278,277,276,275,274,273,272,271,270,269,268,267,266,265,264,263,262,261,260,259,258,257,256,255,254,253,252,251,250,249,248,247,246,245,244,243,242,241,240,239,238,237,236,235,234,233,232,231,230,229,228,227,226,225,224,223,222,221,220,219,218,217,216,215,214,213,212,211,210,209,208,207,206,205,204,203,202,201,200,199,198,197,196,195,194,193,192,191,190,189,188,187,186,185,184,183,182,181,180,179,178,177,176,175,174,173,172,171,170,169,168,167,166,165,164,163,162,161,160,159,158,157,156,155,154,153,152,151,150,149,148,147,146,145,144,143,142,141,140,139,138,137,136,135,134,133,132,131,130,129,128,127,126,125,124,123,122,121,120,119,118,117,116,115,114,113,112,111,110,109,108,107,106,105,104,103,102,101,100,99,98,97,96,95,94,93,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73,72,71,70,69,68,67,66,65,64,63,62,61,60,59,58,57,56,55,54,53,52,51,50,49,48,47,46,45,44,43,42,41,40,39,38,37,36,35,34,33,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,3,2,1]"], ["[10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000,10000]"], ["[45,94,68,66,67,83,27,67,4,41,36,38,84,58,27,69,89,47,47,80,20,74,67,50,96,68,90,94,78,62,54,15,79,69,61,73,44,59,52,84,11,59,25,39,53,4,73,97,5,18,5,37,87,67,15,70,3,19,95,65,27,99,42,66,21,17,13,27,20,54,49,64,97,29,42,90,15,68,33,63,57]"], ["[36,58,90,100,50,5,62,6,53,90,78,38,78,42,29,35,55,99,56]"], ["[97,12,0,5,99,93,63,38,46,34,92,69,94,36,9,44,63,11,53,45,49,78,23,25,62,44,77,8,29,72,83,81,65,32,15,36,52,33,23,48,44,43,45,21,7,49,28]"], ["[73,5,47]"], ["[80,56,92,45,58,36,27,13,55,15,34,72,55,24,21,57,5,79,27,3,22,87,73,57,89,88,100,25,60,40,33,71,53,33,50]"], ["[92,82,62,18,65,79,15,66,27,24,50,29,5,46,76,49,69,61,50,22,23,61,44,43,33,99,54,80,55,33,100,61,16,78,49,14,1,95,66,60,38,64,21,38,44,100,5,6,69,96,4,21,11,92,89,0,63,97,38,51,50,97,46,98,46,18,9,50,87,44,97,60,5,9,41,25,92,88,23,36,33,85,84,81,96]"], ["[95,39,81,83,0,23,13,44,99,48,24,64,86,99,19,57,88,77,74]"], ["[67,58,29,6,6,6,2,54,90]"], ["[65,98,27,42,80,38,11,24,33,48,1,0,88,41,3,56,78,79,56,98,18,8,44,93,16,69,68,26,12,98,9,79,53,98,54]"], ["[14,75,91,5,41,61,2,51,70,8,45,10,17,5,53,49,74,54,4,9,91,35,91,78,59,72,17,58,38,39,13,72,33,72,13,44,80,52,87,36,30,23,78,73,38,47,3,65,3,57,66,80,35]"], ["[94,51,33,34,73,81,8,22,46,67,48,6,8,6,72,40,75,66,58,75,54,11,19,29,32,86,65,78,100,33,77,38,33,77,54]"], ["[57,94,33,32,97,28,98,21,56,50,16]"], ["[58,58,70,18,48,52,17,94,68,28,79,75,63]"], ["[88,41,69,94,70,46,3,68,57,68,79,76,82,26,57,89,25,88,63,71,78,76,87,78,33,65,78,14,93,41,67,56,51,50,28,46,22,3,31,100,71,11,43,69,62,95,99,62,87,28,54,3,87,66,49,97,14,82,62,7,48,66,8,36,63,36,44,87,83,67,13,40,10,59,42,6,63]"], ["[21,99,69,94,64,28,66]"], ["[1,72,18,66,26,78,17,5,38,87,96,22,85,76,15,54,43,66,56,92,34,64,1,14,52]"], ["[16,79,63,25,10,88,30,59,80,22,46,70,98,82,93,56,67,46,21,47,80,82,66,78,65,4,45,56,91,43,71,32,21,30,24,83,45,87,41,3,14,4,99,35,16,49,95,16,40,25,28,7,32,33,14,100,41,41,37,37,39,90,44,7,50,7,24,95,88]"], ["[93,41,13,80,32,67,63,60,88,31,22,97,85,6,88,91,74,80,99,28,77,71,81,89,24,2,51,54,42,63,53,74,30,67,47,33,98,98,86,100,34,88,33,77,36,32,58,68,16,57,98]"], ["[67,60,14,42,85,67,14,28,60,30,82,23,52,64,30,99,82,67,97,53,50,97,69]"], ["[35,48,15,45,100,27,41,73,12,49,99,17,85,39,43,71,30,14,44,50,10,40,57,91,43,23,69,69,72,93,38,79,68,58,60,34,2,11,79,28,22]"], ["[86,14,35,51,18,39,8,4,5,65,76,28,31,75,7]"], ["[2,98,20,69,28,80,58,72,21,46,22,53,4,63,42,38,92,97,70,56,100,71,86,32,92,45,40,84,36,30,72,57,94,18,72,40,70,83,32,75,22,91,78,53,90,15,87,29,59,62,39,99,57,88,58,2,56]"], ["[81,54,32,54,70,66,32,80,21,82,6,50,88,93,48,44,5,4,50,40,7,35,26,74,49,14,39,26,90,28,82,73,62,42,59,90,37,58,37]"], ["[50,56,93,59,90,92,79,14,97,89,15,38,93,70,92,26,57,63,5,5,15,28,80,2,0,10,33,99,81,84,56,2,93,86,94,36,8,44,55,41,27,13,58,96,32,54,84,48,8,62,96,94,5,31,54,97,0,9,16,23,9,35,96,53,70,15,20,58,83,65,47,30,63,42,62,12,55,83,91]"], ["[33]"], ["[25,74,68]"], ["[5,60,86,16,16,55,69,44,26,53,91,48,62,15,21,42,51,54,85,96,56,4,24,25,97,2,16,94,89,79,13,19,63,97,65,97,51,35,8,16,12,78,81,43,51,82,3,37,27,82,98,19,48,38,40,91,80,85,95]"], ["[93,23,89,96,48,77,69,75,83,52,12,32,80,0,89,86,33,14,11,19,62,84,57,49,23,59,74,97,80,35,25,91,53,72,10,55,80,2,13,31,53,79,3,44,15,95,47,15,32,84,63,66,3,95,73,10,79,65,64]"], ["[32,9,52,60,33,36,66,27,37,42,34,71,81,35,6,48,35,31,9,32,48,44,13,93,63,48,40,21,89,0,55,65,32,28,4,82,40,45,10,50,60,96,54,91,64,92,83,45,49,82,83,58,61,98,87,58,44,44,8,22,74,26,59,65,38,12,66,75,59,9,72,1,85,95,48,8,10,34,96]"], ["[96,48,60,5,95,98,44,94,81,82,80]"], ["[65,53,59,11,2,48,5,80,86,55,44,33,41,4,46,69,75,96,14,96,7,67,20,79,18,10,17,4,100,24,76,79,4,73,7,59,72,52,13,30,62,24,28,4,21,22,28,72,89,94,8,22,13,38,97,5,80,52,6]"], ["[90,1,38,2,80,26,26,67,89,76,31,82,7,7,92,83,45,44,64,77,61,27,53,56,36,62,7,37,2,22,82,48,2,9,63,86,57,37,8,3,90,1,89,81,53,79,74,74,27]"], ["[7,99,14,77,23,67,93,71,25,49,25,1,16,94,50,76,97,91,80,10,82,44,40,11,67,100,75,93,50,94,10,77,33,9,47,40,68,69,96,96,8,75,61,87,89,11,72,27,40,0,36,69,45,38,100,86,35,65,25,20,99]"], ["[32,42,2,6,71,29,35,46,85,32,36,37,37,90,10,42,37,22,49,25,26,82,32]"], ["[89,70,49,97,4,83,33]"], ["[25,84,29,77,7,39,12,94,63,44,39,17,91,72,99,36,41,86,29,63,62,1,15,52,57,77,48,3,56,81,73,42,83,27,14,65,58,81,56,11,60,93,69,20,38,77,38,83,43,41,76,71,32,64,69]"], ["[83,50,62,53,67,67,4,99,60,61,44,73,0,79,24,41,34,37,30,7,73,63,87,13,28,11,34,29,38,86,3,84,3,33,37,1,37,41,53,99,75,41,59]"], ["[25,76,80,31,71,4,47,99,68,73,2,66,77,51,39,43,25,100,32,36,20,68,8,31,12,86,11,100,71,89,19,43,67,96,89,37,86,52,97,70,5,29,47,51,66,13,43,40,18,54,74,56,96,28,29,13,47,100,10,1,89,23,71,62,72,78,19,23,54,4,77,89,48,72,19,90,99,86,86]"], ["[19,46,47,10,18,21,41,78,43,62,51,43,29,31,46,81,99,78,77,59,12,17,37,13,69,55,89,74,73,85,94,86,7,23,42,74,6,87,70,10,79]"], ["[35,5,21,96,32,21,15,32,2,22,61,79,81,59,19,17,25,71,49,96,11,44,8,80,53,95,74,27,62,89,78,0,70,8,56,0,34,30,70,28,7,66,26,77,99,64,95,43,37,89,15,68,5,5,25,60,8,94,61,48,17,13,42,50,65,47,52,62,11,42,21,1,74,47,29,98,66,25,2,2,70,76,55,83,62,19,5,57,8]"], ["[70,17,90,77,85,93,99,90,23,95,8,86,39,69,18,34,54,60,46,97,97,46,70,54,79,55,85,23,8,47,55,54,31,3,51,95,97,88,21,80,11,45,24,43,39,98,62,66,44,81,89,22,72,39,89,53,25,31,67,14,5,88,54,96,4,40,27,39,82,77,85]"], ["[86,94,43,58,47,3,62,57,74,77,62,71,5,31,46,10,63,90,52,45,45,52,81,78,76,26,30,41,20,82,78,74,45,50,71,27,35,51,12,29,9,30,22,67,49,19,100,70,86,75,5,27,88,29,47,58,60,28,93,88,38,76,25,33,82,60,31,7,86]"], ["[9,11,13,56,10,61,69,85,75,83,52,30,78,96,5,57,1,2,0,8,33,24,39,12,55,16,50,99,2,80,60,73,53,39,77,67,22,93,40,21,70,41,79,31,6,7,81,23,62,52,68,97,22,53,38,29,100]"], ["[100,75,81,13,97,88,12,57,17,76,73,60,18,75,16,45,80,87,16,80,9,63,50,19,96,22,53,100,63]"], ["[60,44,73,29,18,70,46,25,28,14,49,26,63,50,68,38,51,0,97,2,17,19,98,28,90,92,44,79,35,81,85,61,73,69,77,1,51,68,3,62,76,70,80,97,47,43,0,54,46,89,64,51,6,56,28,86,8,32,35,59,34,37,53,60,80,78,77,30,69,84,76,22,34,89,46,96,33,74,72,47,11,97,81,38,33]"], ["[66,19,3,75,87,89,100,0,28,42,58,45,2,20,49,84,82,80,52,10,46,65,15,35,81,24,58,54,39,67,34,63,83,93,43,64,43,59,3,59,51,89,20,20,42,74,21,24,50,25,82,14,4,44,74]"], ["@javascript:JSON.stringify(Array(50000).fill(10000))"]], "expected": [10, 4, 6, 0, 10000, 12, 12, 5, 0, 100, 12, 22650, 22650, 5000000, 500, 319, 340, 73, 350, 418, 228, 116, 280, 338, 352, 210, 221, 500, 256, 238, 420, 660, 400, 360, 140, 630, 338, 350, 33, 136, 320, 384, 836, 320, 216, 324, 304, 290, 196, 352, 300, 344, 440, 275, 506, 440, 315, 261, 506, 408, 500000000], "loose": false}

package/data/problems/largest-sum-of-averages.json

@@ -0,0 +1 @@
+{"basic": false, "label": "811", "slug": "largest-sum-of-averages", "id": 811, "title": "Largest Sum of Averages", "difficulty": "Medium", "category": "dp", "link": "https://leetcode.com/problems/largest-sum-of-averages/", "examples": [{"input": "nums = [9,1,2,3,9], k = 3", "output": "\"20.0\"", "explanation": "Split as [9],[1,2,3],[9] with averages 9, 2 and 9 summing to 20."}, {"input": "nums = [1,2,3,4,5,6,7], k = 4", "output": "\"20.5\"", "explanation": "An optimal cut places larger values in their own groups to lift the total."}, {"input": "nums = [5], k = 1", "output": "\"5.0\"", "explanation": "A single group averages to its only element."}], "hints": ["This is a portable adaptation: return the score as a finite, double-parseable decimal string.", "Precompute prefix sums so the average of any interval is O(1), then DP over prefixes and group counts.", "Let dp[i][g] be the best total for the first i numbers in g groups; extend it by trying every start of the last group."], "statement": "Split the array `nums` into exactly `k` non-empty consecutive groups. The score of a split is the sum of the average of each group. Return the maximum achievable score.\n\nFor instance, `[9,1,2,3,9]` with `k = 3` is best cut as `[9]`, `[1,2,3]`, `[9]`, scoring `9 + 2 + 9 = 20`.\n\nAdaptation note: the original task returns a floating number. Here, return the score as a decimal string (for example `\"20.0\"`). The judge parses your string as a double and accepts it within an absolute tolerance of 1e-9 plus a relative tolerance of 1e-5.\n\n**Constraints:**\n- `1 <= nums.length <= 100`\n- `1 <= nums[i] <= 10000`\n- `1 <= k <= nums.length`\n", "solution": "## Approach\n\nBuild prefix sums so any interval average is a constant-time division. Then dynamic programming: dp[i][g] stores the best total for the first i numbers cut into g groups. A single group is just its average; for more groups, try every possible start of the final group and combine the optimal prefix with the last group's average. The entry for the full array with k groups is the answer, formatted as a decimal string.\n\n## Complexity Analysis\n\n- **Time Complexity:** O(n^2 * k) for n numbers and k groups.\n- **Space Complexity:** O(n * k) for the DP table.\n\n## Implementation\n\n```python\nfrom typing import List\nclass Solution:\n    def largestSumOfAverages(self, nums: List[int], k: int) -> str:\n        n = len(nums)\n        pref = [0.0] * (n + 1)\n        for i, v in enumerate(nums):\n            pref[i + 1] = pref[i] + v\n        dp = [[0.0] * (k + 1) for _ in range(n + 1)]\n        for i in range(1, n + 1):\n            dp[i][1] = pref[i] / i\n        for g in range(2, k + 1):\n            for i in range(g, n + 1):\n                best = 0.0\n                for j in range(g - 1, i):\n                    cand = dp[j][g - 1] + (pref[i] - pref[j]) / (i - j)\n                    if cand > best:\n                        best = cand\n                dp[i][g] = best\n        return str(dp[n][k])\n```\n", "starter": {"go": "package main\n\nfunc LargestSumOfAverages(nums []int, k int) string {\n    return \"0.0\"\n}", "python": "from typing import List\n\nclass Solution:\n    def largestSumOfAverages(self, nums: List[int], k: int) -> str:\n        return \"0.0\"\n", "cpp": "#include <string>\n#include <vector>\nusing namespace std;\n\nclass Solution {\npublic:\n    string largestSumOfAverages(vector<int>& nums, int k) {\n        return \"0.0\";\n    }\n};"}, "fn": "largestSumOfAverages", "params": [{"name": "nums", "type": "int_array"}, {"name": "k", "type": "int"}], "outputType": "string", "tests": [["[9,1,2,3,9]", "3"], ["[1,2,3,4,5,6,7]", "4"], ["[5]", "1"], ["[1,2,3]", "1"], ["[1,2,3]", "3"], ["[4,1,7,5,8]", "2"], ["[10,10,10]", "2"], ["[1,1,1,1]", "4"], ["[10000,1,1,1]", "2"], ["[2,4,6,8]", "2"], ["[5,5,5,5,5]", "5"], ["[1,2,3,4,5]", "5"], ["[7,3,9,1]", "3"], ["[100,200,300]", "2"], ["[1,100,1,100]", "3"], ["[9,9,9,9]", "1"], ["[3,1,4,1,5,9,2,6]", "3"], ["[50,50]", "2"], ["[1,2]", "2"], ["[8,2,8,2,8]", "4"], ["[1000,1,1000]", "2"], ["[6,5,4,3,2,1]", "3"], ["[1,2,3,4,5,6]", "6"], ["[20,10,30]", "2"], ["[4,4,4,4,100]", "2"], ["[1,3,2]", "2"], ["[11,22,33,44]", "3"], ["[2,2,2,2,2,2]", "3"]], "expected": ["20.0", "20.5", "5.0", "2.0", "6.0", "12.25", "20.0", "4.0", "10001.0", "12.0", "25.0", "15.0", "15.0", "450.0", "151.5", "9.0", "15.8", "100.0", "3.0", "23.0", "1500.5", "13.5", "21.0", "45.0", "104.0", "4.0", "93.5", "6.0"], "loose": false}