id
stringlengths
16
16
difficulty
stringclasses
3 values
category
stringclasses
11 values
problem
stringclasses
25 values
signature
stringclasses
25 values
reasoning
stringclasses
25 values
code
stringclasses
25 values
tests
stringlengths
106
815
verified
bool
1 class
language
stringclasses
1 value
code_hash
stringclasses
25 values
sft_text
stringclasses
25 values
meta
stringlengths
11
47
vcr_3997cf580c49
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [3, 4, 5, 7, 19, 21, 24, 26, 32], "target": 33}, "output": 9}, {"input": {"nums": [7, 14, 15, 18, 20, 28, 32, 39], "target": 24}, "output": 5}, {"input": {"nums": [4, 16, 21, 22, 39], "target": 39}, "output": 4}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "a40cd6556bcefff9"}
vcr_194334f17cb6
medium
hashmap
Group anagrams by sorted character signature. Return sorted group sizes.
def anagram_group_sizes(strs: list[str]) -> list[int]:
Signature is sorted characters. Bucket words, then emit sorted sizes.
def anagram_group_sizes(strs: list[str]) -> list[int]: from collections import defaultdict g = defaultdict(list) for w in strs: g[''.join(sorted(w))].append(w) return sorted(len(v) for v in g.values())
[{"input": {"strs": ["bc", "acbc", "bc", "bbcc", "cb"]}, "output": [1, 1, 3]}, {"input": {"strs": ["bbb", "bba", "bba", "aba", "aab", "bbb", "aaa"]}, "output": [1, 2, 2, 2]}, {"input": {"strs": ["aab", "bab", "baa"]}, "output": [1, 2]}]
true
python
98cc167af301acd0
### Problem Group anagrams by sorted character signature. Return sorted group sizes. ### Reasoning Signature is sorted characters. Bucket words, then emit sorted sizes. ### Solution ```python def anagram_group_sizes(strs: list[str]) -> list[int]: from collections import defaultdict g = defaultdict(list) f...
{"v": "ok", "content_hash": "6f09ed1260492806"}
vcr_59837127ca95
easy
string
Reverse the order of words in s (words separated by single spaces).
def reverse_words(s: str) -> str:
Split on whitespace, reverse the list, join with spaces.
def reverse_words(s: str) -> str: return ' '.join(reversed(s.split()))
[{"input": {"s": "dadbb d e"}, "output": "e d dadbb"}, {"input": {"s": "bba baab baa aaa"}, "output": "aaa baa baab bba"}, {"input": {"s": "b abb b aaa ba"}, "output": "ba aaa b abb b"}]
true
python
e27e5a0fb61b865a
### Problem Reverse the order of words in s (words separated by single spaces). ### Reasoning Split on whitespace, reverse the list, join with spaces. ### Solution ```python def reverse_words(s: str) -> str: return ' '.join(reversed(s.split())) ```
{"v": "ok", "content_hash": "c6801480759fe00d"}
vcr_fc58ee17bff2
easy
array
Return running sum where out[i] = nums[0] + ... + nums[i].
def running_sum(nums: list[int]) -> list[int]:
Accumulate once left to right. O(n).
def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out
[{"input": {"nums": [-8, -18, 20]}, "output": [-8, -26, -6]}, {"input": {"nums": [15, -4, 8, 11, -8, 16, -1, 9, 12]}, "output": [15, 11, 19, 30, 22, 38, 37, 46, 58]}, {"input": {"nums": [-5, 7, -12]}, "output": [-5, 2, -10]}]
true
python
9222adfde6ffe86d
### Problem Return running sum where out[i] = nums[0] + ... + nums[i]. ### Reasoning Accumulate once left to right. O(n). ### Solution ```python def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out ```
{"v": "ok", "content_hash": "5efb3a87e8a1eb81"}
vcr_4b0eb617fbf7
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [5, 7, 16, 22, 42], "target": 40}, "output": 4}, {"input": {"nums": [0, 1, 4, 10, 11, 16, 17, 33, 34, 37, 39], "target": 7}, "output": 3}, {"input": {"nums": [4, 8, 10, 22, 34], "target": 4}, "output": 0}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "16947ad87686d9e0"}
vcr_7e224d4238ef
easy
hashmap
Return True if any value appears at least twice in nums.
def contains_duplicate(nums: list[int]) -> bool:
Duplicates exist if and only if len(list) > len(set). O(n).
def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums))
[{"input": {"nums": [40, 196, 198, 46, 184, 88, 80, 161]}, "output": false}, {"input": {"nums": [1, 11, 2, 24, 15, 0, 25, 7, 10, 24]}, "output": true}, {"input": {"nums": [9, 1, 1, 10, 24, 18, 2, 3, 18]}, "output": true}]
true
python
f35d656879667375
### Problem Return True if any value appears at least twice in nums. ### Reasoning Duplicates exist if and only if len(list) > len(set). O(n). ### Solution ```python def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums)) ```
{"v": "ok", "content_hash": "9743295e492df429"}
vcr_50022d9359a5
easy
greedy
Daily stock prices. Max profit from one buy and one later sell (0 if impossible).
def max_profit(prices: list[int]) -> int:
Track the minimum price so far. Maximize price minus that minimum.
def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, x - lo) lo = min(lo, x) return best
[{"input": {"prices": [18, 36, 30, 11, 22, 58]}, "output": 47}, {"input": {"prices": [12, 39, 8, 16, 14, 11, 25, 7]}, "output": 27}, {"input": {"prices": [4, 27, 24]}, "output": 23}]
true
python
b40e7d74850552a7
### Problem Daily stock prices. Max profit from one buy and one later sell (0 if impossible). ### Reasoning Track the minimum price so far. Maximize price minus that minimum. ### Solution ```python def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, ...
{"v": "ok", "content_hash": "ce29460eef363f13"}
vcr_3e5c632bf4e4
easy
bit
Every element appears twice except one. Find the single element using XOR.
def single_number(nums: list[int]) -> int:
XOR cancels pairs. The remaining value is the single number.
def single_number(nums: list[int]) -> int: x = 0 for v in nums: x ^= v return x
[{"input": {"nums": [21, 10, 24, 38, 24, 13, 18, 10, 25, 38, 31, 13, 31, 18, 25, 21, 73]}, "output": 73}, {"input": {"nums": [29, 3, 5, 28, 28, 29, 3, 5, 4, 4, 48]}, "output": 48}, {"input": {"nums": [44, 14, 3, 3, 17, 1, 21, 17, 21, 13, 13, 1, 14]}, "output": 44}]
true
python
f76c1da3c46d529e
### Problem Every element appears twice except one. Find the single element using XOR. ### Reasoning XOR cancels pairs. The remaining value is the single number. ### Solution ```python def single_number(nums: list[int]) -> int: x = 0 for v in nums: x ^= v return x ```
{"v": "ok", "content_hash": "92540411140e1d7f"}
vcr_efa942bcc227
medium
dp
Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount.
def rob(nums: list[int]) -> int:
DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space.
def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, prev2 + x) return prev1
[{"input": {"nums": [12, 16, 28, 28, 16, 16, 1, 23, 0, 5]}, "output": 88}, {"input": {"nums": [17, 4, 5, 17, 6, 8]}, "output": 42}, {"input": {"nums": [19, 4, 6, 5, 11]}, "output": 36}]
true
python
adc43e90c6cebcb1
### Problem Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount. ### Reasoning DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space. ### Solution ```python def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, p...
{"v": "ok", "content_hash": "bb99838300d71a97"}
vcr_db86ccd1750f
easy
math
Return the greatest common divisor of positive integers a and b.
def gcd(a: int, b: int) -> int:
Euclidean algorithm: replace (a, b) with (b, a % b) until b is 0.
def gcd(a: int, b: int) -> int: while b: a, b = b, a % b return a
[{"input": {"a": 249, "b": 3}, "output": 3}, {"input": {"a": 27, "b": 81}, "output": 27}, {"input": {"a": 129, "b": 120}, "output": 3}]
true
python
0a8801b251631b1d
### Problem Return the greatest common divisor of positive integers a and b. ### Reasoning Euclidean algorithm: replace (a, b) with (b, a % b) until b is 0. ### Solution ```python def gcd(a: int, b: int) -> int: while b: a, b = b, a % b return a ```
{"v": "ok", "content_hash": "c911a4663a2e1014"}
vcr_eddba4183dcd
medium
array
Maximum sum of any non-empty contiguous subarray (Kadane, O(n)).
def max_subarray(nums: list[int]) -> int:
At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays.
def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) best = max(best, cur) return best
[{"input": {"nums": [9, 16, -15, -13, 20, -12, 3]}, "output": 25}, {"input": {"nums": [-5, -5, -9]}, "output": -5}, {"input": {"nums": [-8, -3, 6, 6, 11, 13]}, "output": 36}]
true
python
ec0ac96e944ed958
### Problem Maximum sum of any non-empty contiguous subarray (Kadane, O(n)). ### Reasoning At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays. ### Solution ```python def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) ...
{"v": "ok", "content_hash": "41a57ff2f82a098d"}
vcr_7485717fd504
medium
two_pointers
Sorted nums: find indices i < j with nums[i] + nums[j] = target using O(n) two pointers.
def two_sum_sorted(nums: list[int], target: int) -> list[int]:
Start at both ends. Move the pointer that brings the sum closer to target.
def two_sum_sorted(nums: list[int], target: int) -> list[int]: i, j = 0, len(nums) - 1 while i < j: s = nums[i] + nums[j] if s == target: return [i, j] if s < target: i += 1 else: j -= 1 return []
[{"input": {"nums": [-30, -20, -13, -2, 4, 8, 29], "target": 6}, "output": [3, 5]}, {"input": {"nums": [-12, 9, 15, 27, 32], "target": 24}, "output": [1, 2]}, {"input": {"nums": [11, 19, 23, 35], "target": 46}, "output": [0, 3]}]
true
python
0fdf37b1be7420d0
### Problem Sorted nums: find indices i < j with nums[i] + nums[j] = target using O(n) two pointers. ### Reasoning Start at both ends. Move the pointer that brings the sum closer to target. ### Solution ```python def two_sum_sorted(nums: list[int], target: int) -> list[int]: i, j = 0, len(nums) - 1 while i < ...
{"v": "ok", "content_hash": "7ebd88143523ffc3"}
vcr_2f5a5961c6bc
medium
array
out[i] is product of all elements except nums[i]. O(n) without division.
def product_except_self(nums: list[int]) -> list[int]:
Build prefix products, then multiply by suffix products in a reverse pass.
def product_except_self(nums: list[int]) -> list[int]: n = len(nums) out = [1] * n left = 1 for i in range(n): out[i] = left left *= nums[i] right = 1 for i in range(n - 1, -1, -1): out[i] *= right right *= nums[i] return out
[{"input": {"nums": [5, 5, 1, 2, 6, 7, 6, 2]}, "output": [5040, 5040, 25200, 12600, 4200, 3600, 4200, 12600]}, {"input": {"nums": [3, 4, 4, 5, 2]}, "output": [160, 120, 120, 96, 240]}, {"input": {"nums": [5, 5, 5]}, "output": [25, 25, 25]}]
true
python
e6962ae39100e8b1
### Problem out[i] is product of all elements except nums[i]. O(n) without division. ### Reasoning Build prefix products, then multiply by suffix products in a reverse pass. ### Solution ```python def product_except_self(nums: list[int]) -> list[int]: n = len(nums) out = [1] * n left = 1 for i in rang...
{"v": "ok", "content_hash": "fef87b4e9963e4a0"}
vcr_cd8c0b38d23e
easy
array
Rotate nums to the right by k steps (k may be larger than n). Return a new list.
def rotate(nums: list[int], k: int) -> list[int]:
Reduce k modulo n. Last k elements move to the front.
def rotate(nums: list[int], k: int) -> list[int]: n = len(nums) k %= n if k == 0: return list(nums) return nums[-k:] + nums[:-k]
[{"input": {"nums": [1, -6, 5, 8, 17, 6, 18, 1, 5], "k": 13}, "output": [6, 18, 1, 5, 1, -6, 5, 8, 17]}, {"input": {"nums": [2, 1, -4, 9, -3, -9, -3, -4, -2, 3], "k": 9}, "output": [1, -4, 9, -3, -9, -3, -4, -2, 3, 2]}, {"input": {"nums": [2, -9, -9, 9, -7, 4, 0, -2, -4], "k": 19}, "output": [-4, 2, -9, -9, 9, -7, 4, 0...
true
python
132c4800a39464fd
### Problem Rotate nums to the right by k steps (k may be larger than n). Return a new list. ### Reasoning Reduce k modulo n. Last k elements move to the front. ### Solution ```python def rotate(nums: list[int], k: int) -> list[int]: n = len(nums) k %= n if k == 0: return list(nums) return num...
{"v": "ok", "content_hash": "609d19e1636e0ba5"}
vcr_d3fe7298ad3b
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [2, 24, 32, 40, 43, 44], "target": 35}, "output": 3}, {"input": {"nums": [0, 2, 4, 6, 12, 14, 15, 18, 21, 29, 37, 39], "target": 33}, "output": 10}, {"input": {"nums": [1, 27, 31], "target": 22}, "output": 1}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "5c464ef05616695b"}
vcr_d1d4b19863e3
easy
string
Reverse the order of words in s (words separated by single spaces).
def reverse_words(s: str) -> str:
Split on whitespace, reverse the list, join with spaces.
def reverse_words(s: str) -> str: return ' '.join(reversed(s.split()))
[{"input": {"s": "ea cdbbdd acc caba ebeb eabb dcadba"}, "output": "dcadba eabb ebeb caba acc cdbbdd ea"}, {"input": {"s": "a b"}, "output": "b a"}, {"input": {"s": "aa b b a a"}, "output": "a a b b aa"}]
true
python
e27e5a0fb61b865a
### Problem Reverse the order of words in s (words separated by single spaces). ### Reasoning Split on whitespace, reverse the list, join with spaces. ### Solution ```python def reverse_words(s: str) -> str: return ' '.join(reversed(s.split())) ```
{"v": "ok", "content_hash": "74c3945f54536f5b"}
vcr_5be8d0a9d8e5
easy
string
Reverse the order of words in s (words separated by single spaces).
def reverse_words(s: str) -> str:
Split on whitespace, reverse the list, join with spaces.
def reverse_words(s: str) -> str: return ' '.join(reversed(s.split()))
[{"input": {"s": "ddebba a bcdb"}, "output": "bcdb a ddebba"}, {"input": {"s": "bb bbb bba aaa"}, "output": "aaa bba bbb bb"}, {"input": {"s": "b bbbb abaa aa aaa"}, "output": "aaa aa abaa bbbb b"}]
true
python
e27e5a0fb61b865a
### Problem Reverse the order of words in s (words separated by single spaces). ### Reasoning Split on whitespace, reverse the list, join with spaces. ### Solution ```python def reverse_words(s: str) -> str: return ' '.join(reversed(s.split())) ```
{"v": "ok", "content_hash": "35eb13efb3544e0a"}
vcr_656f474a4f91
easy
greedy
Daily stock prices. Max profit from one buy and one later sell (0 if impossible).
def max_profit(prices: list[int]) -> int:
Track the minimum price so far. Maximize price minus that minimum.
def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, x - lo) lo = min(lo, x) return best
[{"input": {"prices": [34, 18, 42, 21, 24, 56, 52]}, "output": 38}, {"input": {"prices": [8, 14, 2, 24, 30, 38, 11, 11]}, "output": 36}, {"input": {"prices": [34, 18, 37, 3, 5]}, "output": 19}]
true
python
b40e7d74850552a7
### Problem Daily stock prices. Max profit from one buy and one later sell (0 if impossible). ### Reasoning Track the minimum price so far. Maximize price minus that minimum. ### Solution ```python def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, ...
{"v": "ok", "content_hash": "10c9910596bf4029"}
vcr_b064c4883e5f
medium
array
Maximum sum of any non-empty contiguous subarray (Kadane, O(n)).
def max_subarray(nums: list[int]) -> int:
At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays.
def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) best = max(best, cur) return best
[{"input": {"nums": [1, 16, 18, -8, 17, 14, 21, 17, 10, 11, 13]}, "output": 130}, {"input": {"nums": [-5, 4, -2, 3, 0, 4, 4, -4]}, "output": 13}, {"input": {"nums": [12, 1, 6, 6, 13, -6, -9, -7, -1, -3]}, "output": 38}]
true
python
ec0ac96e944ed958
### Problem Maximum sum of any non-empty contiguous subarray (Kadane, O(n)). ### Reasoning At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays. ### Solution ```python def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) ...
{"v": "ok", "content_hash": "459fa51323e799cb"}
vcr_0a6b4ce6e279
medium
greedy
From index 0 you may jump at most nums[i] steps. Return True if the last index is reachable.
def can_jump(nums: list[int]) -> bool:
Track the farthest reachable index. If the current index exceeds it, fail.
def can_jump(nums: list[int]) -> bool: reach = 0 for i, x in enumerate(nums): if i > reach: return False reach = max(reach, i + x) if reach >= len(nums) - 1: return True return reach >= len(nums) - 1
[{"input": {"nums": [2, 1, 4, 4, 0, 3, 4, 1, 0, 0]}, "output": true}, {"input": {"nums": [3, 3, 1, 2, 0, 3, 3, 1, 2]}, "output": true}, {"input": {"nums": [1, 2, 0, 2, 3, 2, 3, 3, 0]}, "output": true}]
true
python
b6a822bf8a6dd0fa
### Problem From index 0 you may jump at most nums[i] steps. Return True if the last index is reachable. ### Reasoning Track the farthest reachable index. If the current index exceeds it, fail. ### Solution ```python def can_jump(nums: list[int]) -> bool: reach = 0 for i, x in enumerate(nums): if i > ...
{"v": "ok", "content_hash": "1d615e5d4ed69580"}
vcr_eee078d41982
easy
two_pointers
Return True if lowercase string s is a palindrome.
def is_palindrome(s: str) -> bool:
Two pointers from both ends. Any mismatch means False. O(n) time, O(1) space.
def is_palindrome(s: str) -> bool: i, j = 0, len(s) - 1 while i < j: if s[i] != s[j]: return False i += 1 j -= 1 return True
[{"input": {"s": "daadbbdccb"}, "output": false}, {"input": {"s": "accc"}, "output": false}, {"input": {"s": "ccabbb"}, "output": false}]
true
python
9742b2c402b3548d
### Problem Return True if lowercase string s is a palindrome. ### Reasoning Two pointers from both ends. Any mismatch means False. O(n) time, O(1) space. ### Solution ```python def is_palindrome(s: str) -> bool: i, j = 0, len(s) - 1 while i < j: if s[i] != s[j]: return False i += ...
{"v": "ok", "content_hash": "0d01e8074364e480"}
vcr_da595b6ac243
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [1, 31, 39, 41, 46], "target": 43}, "output": 4}, {"input": {"nums": [21, 23, 33, 39], "target": 5}, "output": 0}, {"input": {"nums": [1, 2, 6, 10, 12, 17, 18, 20, 26, 28, 32, 39], "target": 32}, "output": 10}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "d440c7475e7f0b2a"}
vcr_374815daa72b
medium
dp
Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount.
def rob(nums: list[int]) -> int:
DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space.
def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, prev2 + x) return prev1
[{"input": {"nums": [0, 5, 0, 8]}, "output": 13}, {"input": {"nums": [1, 7, 1, 2]}, "output": 9}, {"input": {"nums": [9, 3, 10, 13, 19, 0, 16, 8, 6, 5]}, "output": 60}]
true
python
adc43e90c6cebcb1
### Problem Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount. ### Reasoning DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space. ### Solution ```python def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, p...
{"v": "ok", "content_hash": "590021a9e5b83b13"}
vcr_9c5d9fba9071
medium
array
Maximum sum of any non-empty contiguous subarray (Kadane, O(n)).
def max_subarray(nums: list[int]) -> int:
At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays.
def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) best = max(best, cur) return best
[{"input": {"nums": [21, -13, 22, 11, 10, -17]}, "output": 51}, {"input": {"nums": [-1, -3, 8, 2, -8, 4, -9, 9]}, "output": 10}, {"input": {"nums": [-3, 13, 14, -4, -11]}, "output": 27}]
true
python
ec0ac96e944ed958
### Problem Maximum sum of any non-empty contiguous subarray (Kadane, O(n)). ### Reasoning At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays. ### Solution ```python def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) ...
{"v": "ok", "content_hash": "584dc6108c92ef56"}
vcr_928d07793e3e
easy
greedy
Daily stock prices. Max profit from one buy and one later sell (0 if impossible).
def max_profit(prices: list[int]) -> int:
Track the minimum price so far. Maximize price minus that minimum.
def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, x - lo) lo = min(lo, x) return best
[{"input": {"prices": [39, 14, 37, 21, 4, 33, 60, 33, 44, 31, 42, 24, 11, 25]}, "output": 56}, {"input": {"prices": [8, 22, 10, 11, 29, 40, 6, 19]}, "output": 32}, {"input": {"prices": [40, 17, 40, 5, 12, 32, 35, 24, 18, 3]}, "output": 30}]
true
python
b40e7d74850552a7
### Problem Daily stock prices. Max profit from one buy and one later sell (0 if impossible). ### Reasoning Track the minimum price so far. Maximize price minus that minimum. ### Solution ```python def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, ...
{"v": "ok", "content_hash": "863c48b3487443d8"}
vcr_1ae38c854b17
medium
dp
Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount.
def rob(nums: list[int]) -> int:
DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space.
def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, prev2 + x) return prev1
[{"input": {"nums": [12, 23, 22, 6, 23, 6, 30, 11, 14, 4]}, "output": 101}, {"input": {"nums": [17, 15, 4, 10]}, "output": 27}, {"input": {"nums": [8, 10, 17, 6, 14, 8]}, "output": 39}]
true
python
adc43e90c6cebcb1
### Problem Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount. ### Reasoning DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space. ### Solution ```python def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, p...
{"v": "ok", "content_hash": "ca6f3c7d5c12fa50"}
vcr_2667284a1121
medium
dp
Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount.
def rob(nums: list[int]) -> int:
DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space.
def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, prev2 + x) return prev1
[{"input": {"nums": [22, 4, 28, 16, 26, 5, 0, 24, 1]}, "output": 100}, {"input": {"nums": [7, 6, 9, 11, 12, 13, 6, 8, 8]}, "output": 42}, {"input": {"nums": [2, 16, 20]}, "output": 22}]
true
python
adc43e90c6cebcb1
### Problem Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount. ### Reasoning DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space. ### Solution ```python def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, p...
{"v": "ok", "content_hash": "a41189b6d516333f"}
vcr_d0fd35f96c70
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [3, 15, 19, 21, 36, 43], "target": 7}, "output": 1}, {"input": {"nums": [0, 2, 5, 9, 15, 21, 37], "target": 2}, "output": 1}, {"input": {"nums": [1, 16, 17], "target": 19}, "output": 3}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "b6338d8096828b00"}
vcr_780e5cf61de9
medium
greedy
From index 0 you may jump at most nums[i] steps. Return True if the last index is reachable.
def can_jump(nums: list[int]) -> bool:
Track the farthest reachable index. If the current index exceeds it, fail.
def can_jump(nums: list[int]) -> bool: reach = 0 for i, x in enumerate(nums): if i > reach: return False reach = max(reach, i + x) if reach >= len(nums) - 1: return True return reach >= len(nums) - 1
[{"input": {"nums": [3, 3, 4, 3, 3, 4, 1, 0, 0]}, "output": true}, {"input": {"nums": [1, 3, 1, 3, 0, 2, 0, 3]}, "output": true}, {"input": {"nums": [0, 3, 2, 1, 3]}, "output": false}]
true
python
b6a822bf8a6dd0fa
### Problem From index 0 you may jump at most nums[i] steps. Return True if the last index is reachable. ### Reasoning Track the farthest reachable index. If the current index exceeds it, fail. ### Solution ```python def can_jump(nums: list[int]) -> bool: reach = 0 for i, x in enumerate(nums): if i > ...
{"v": "ok", "content_hash": "5969ff963da52fb5"}
vcr_1291baffef7a
medium
greedy
From index 0 you may jump at most nums[i] steps. Return True if the last index is reachable.
def can_jump(nums: list[int]) -> bool:
Track the farthest reachable index. If the current index exceeds it, fail.
def can_jump(nums: list[int]) -> bool: reach = 0 for i, x in enumerate(nums): if i > reach: return False reach = max(reach, i + x) if reach >= len(nums) - 1: return True return reach >= len(nums) - 1
[{"input": {"nums": [2, 2, 4, 0, 1, 3, 0]}, "output": true}, {"input": {"nums": [2, 0, 2, 3]}, "output": true}, {"input": {"nums": [2, 3, 3]}, "output": true}]
true
python
b6a822bf8a6dd0fa
### Problem From index 0 you may jump at most nums[i] steps. Return True if the last index is reachable. ### Reasoning Track the farthest reachable index. If the current index exceeds it, fail. ### Solution ```python def can_jump(nums: list[int]) -> bool: reach = 0 for i, x in enumerate(nums): if i > ...
{"v": "ok", "content_hash": "9e5d2c1fdabe895a"}
vcr_65d5df30c8e4
easy
array
Return running sum where out[i] = nums[0] + ... + nums[i].
def running_sum(nums: list[int]) -> list[int]:
Accumulate once left to right. O(n).
def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out
[{"input": {"nums": [15, -3, -24, 6, -8, -24, 27, 5, -18, -19, -2, -9, 16]}, "output": [15, 12, -12, -6, -14, -38, -11, -6, -24, -43, -45, -54, -38]}, {"input": {"nums": [-6, -3, 16, 0]}, "output": [-6, -9, 7, 7]}, {"input": {"nums": [-12, 16, 10, -10, -3, 1, 5, 16, -3, 3]}, "output": [-12, 4, 14, 4, 1, 2, 7, 23, 20, 2...
true
python
9222adfde6ffe86d
### Problem Return running sum where out[i] = nums[0] + ... + nums[i]. ### Reasoning Accumulate once left to right. O(n). ### Solution ```python def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out ```
{"v": "ok", "content_hash": "75949d2cee325e46"}
vcr_4f7c972d48bb
medium
array
Maximum sum of any non-empty contiguous subarray (Kadane, O(n)).
def max_subarray(nums: list[int]) -> int:
At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays.
def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) best = max(best, cur) return best
[{"input": {"nums": [-10, -14, -11, 14, -12, -14, 1, -8, -5, 10, 18, 5, 7, -7]}, "output": 40}, {"input": {"nums": [-12, 1, 11]}, "output": 12}, {"input": {"nums": [7, 12, 7]}, "output": 26}]
true
python
ec0ac96e944ed958
### Problem Maximum sum of any non-empty contiguous subarray (Kadane, O(n)). ### Reasoning At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays. ### Solution ```python def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) ...
{"v": "ok", "content_hash": "a91afdc4f2f0b77b"}
vcr_06c1f40bee51
easy
two_pointers
Return True if lowercase string s is a palindrome.
def is_palindrome(s: str) -> bool:
Two pointers from both ends. Any mismatch means False. O(n) time, O(1) space.
def is_palindrome(s: str) -> bool: i, j = 0, len(s) - 1 while i < j: if s[i] != s[j]: return False i += 1 j -= 1 return True
[{"input": {"s": "bddcbcccbcddb"}, "output": true}, {"input": {"s": "cc"}, "output": true}, {"input": {"s": "cbabbb"}, "output": false}]
true
python
9742b2c402b3548d
### Problem Return True if lowercase string s is a palindrome. ### Reasoning Two pointers from both ends. Any mismatch means False. O(n) time, O(1) space. ### Solution ```python def is_palindrome(s: str) -> bool: i, j = 0, len(s) - 1 while i < j: if s[i] != s[j]: return False i += ...
{"v": "ok", "content_hash": "1f0436bd08882908"}
vcr_713692d95f24
medium
array
Maximum sum of any non-empty contiguous subarray (Kadane, O(n)).
def max_subarray(nums: list[int]) -> int:
At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays.
def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) best = max(best, cur) return best
[{"input": {"nums": [-5, 15, -10, -3, 5, -10, 14, -18, 17, 3, 11, 22]}, "output": 53}, {"input": {"nums": [6, 8, -5, -1, 12, 11, -7, 14, 8]}, "output": 46}, {"input": {"nums": [10, 12, 14, -4, -8, 9, -11]}, "output": 36}]
true
python
ec0ac96e944ed958
### Problem Maximum sum of any non-empty contiguous subarray (Kadane, O(n)). ### Reasoning At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays. ### Solution ```python def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) ...
{"v": "ok", "content_hash": "23ff3e8baf614f46"}
vcr_b52012e1a13a
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [1, 14, 15, 21, 29, 32, 34, 38, 40, 43, 47, 48, 49], "target": 12}, "output": 1}, {"input": {"nums": [16, 19, 21, 22, 26, 30, 31, 32, 34, 35, 37], "target": 24}, "output": 4}, {"input": {"nums": [18, 22, 23, 31, 33], "target": 9}, "output": 0}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "ff1c70527ecbb59d"}
vcr_3312ff6ce755
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [5, 13, 18, 20, 27, 28, 33, 37, 43, 45, 49], "target": 32}, "output": 6}, {"input": {"nums": [0, 3, 5, 10, 12, 15, 18, 23, 28, 32, 35, 37], "target": 24}, "output": 8}, {"input": {"nums": [2, 6, 24], "target": 3}, "output": 1}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "5e7b2fe3700cf36a"}
vcr_60319d24ec52
medium
hashmap
Group anagrams by sorted character signature. Return sorted group sizes.
def anagram_group_sizes(strs: list[str]) -> list[int]:
Signature is sorted characters. Bucket words, then emit sorted sizes.
def anagram_group_sizes(strs: list[str]) -> list[int]: from collections import defaultdict g = defaultdict(list) for w in strs: g[''.join(sorted(w))].append(w) return sorted(len(v) for v in g.values())
[{"input": {"strs": ["ccaa", "abc", "ab", "bcab", "cca", "cb", "ca", "cb", "ab"]}, "output": [1, 1, 1, 1, 1, 2, 2]}, {"input": {"strs": ["abb", "bab", "bbb", "bbb"]}, "output": [2, 2]}, {"input": {"strs": ["bba", "bbb", "bba", "aba", "bab", "bba"]}, "output": [1, 1, 4]}]
true
python
98cc167af301acd0
### Problem Group anagrams by sorted character signature. Return sorted group sizes. ### Reasoning Signature is sorted characters. Bucket words, then emit sorted sizes. ### Solution ```python def anagram_group_sizes(strs: list[str]) -> list[int]: from collections import defaultdict g = defaultdict(list) f...
{"v": "ok", "content_hash": "73cb21c0c091c4c1"}
vcr_f4c209cbeac9
medium
array
Maximum sum of any non-empty contiguous subarray (Kadane, O(n)).
def max_subarray(nums: list[int]) -> int:
At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays.
def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) best = max(best, cur) return best
[{"input": {"nums": [-18, -13, 7, 13, 13]}, "output": 33}, {"input": {"nums": [-10, -5, 10]}, "output": 10}, {"input": {"nums": [6, 10, -6, 9, 10]}, "output": 29}]
true
python
ec0ac96e944ed958
### Problem Maximum sum of any non-empty contiguous subarray (Kadane, O(n)). ### Reasoning At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays. ### Solution ```python def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) ...
{"v": "ok", "content_hash": "a316724edc8a004c"}
vcr_e783367812b3
medium
array
out[i] is product of all elements except nums[i]. O(n) without division.
def product_except_self(nums: list[int]) -> list[int]:
Build prefix products, then multiply by suffix products in a reverse pass.
def product_except_self(nums: list[int]) -> list[int]: n = len(nums) out = [1] * n left = 1 for i in range(n): out[i] = left left *= nums[i] right = 1 for i in range(n - 1, -1, -1): out[i] *= right right *= nums[i] return out
[{"input": {"nums": [4, 3, 2, 7, 0]}, "output": [0, 0, 0, 0, 168]}, {"input": {"nums": [1, 5, 2, 4, 2, 1, 1]}, "output": [80, 16, 40, 20, 40, 80, 80]}, {"input": {"nums": [1, 2, 1]}, "output": [2, 1, 2]}]
true
python
e6962ae39100e8b1
### Problem out[i] is product of all elements except nums[i]. O(n) without division. ### Reasoning Build prefix products, then multiply by suffix products in a reverse pass. ### Solution ```python def product_except_self(nums: list[int]) -> list[int]: n = len(nums) out = [1] * n left = 1 for i in rang...
{"v": "ok", "content_hash": "462a669aefa38d61"}
vcr_316f8d6f0299
easy
hashmap
Return True if any value appears at least twice in nums.
def contains_duplicate(nums: list[int]) -> bool:
Duplicates exist if and only if len(list) > len(set). O(n).
def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums))
[{"input": {"nums": [32, 105, 161, 29, 82, 146, 39]}, "output": false}, {"input": {"nums": [7, 15, 12, 14, 16, 18, 5]}, "output": false}, {"input": {"nums": [15, 18, 16, 22, 0, 2]}, "output": false}]
true
python
f35d656879667375
### Problem Return True if any value appears at least twice in nums. ### Reasoning Duplicates exist if and only if len(list) > len(set). O(n). ### Solution ```python def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums)) ```
{"v": "ok", "content_hash": "282c6f853b0c7fcd"}
vcr_981120f32571
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [4, 21, 28, 31, 39, 41, 49], "target": 24}, "output": 2}, {"input": {"nums": [1, 4, 6, 13, 14, 26, 27, 29, 33, 36], "target": 11}, "output": 3}, {"input": {"nums": [9, 11, 15, 18, 22, 23, 25, 28, 30, 34], "target": 10}, "output": 1}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "dc8a32702a4f9eee"}
vcr_1a9e99e3a2bc
easy
math
Return the greatest common divisor of positive integers a and b.
def gcd(a: int, b: int) -> int:
Euclidean algorithm: replace (a, b) with (b, a % b) until b is 0.
def gcd(a: int, b: int) -> int: while b: a, b = b, a % b return a
[{"input": {"a": 85, "b": 54}, "output": 1}, {"input": {"a": 49, "b": 166}, "output": 1}, {"input": {"a": 18, "b": 86}, "output": 2}]
true
python
0a8801b251631b1d
### Problem Return the greatest common divisor of positive integers a and b. ### Reasoning Euclidean algorithm: replace (a, b) with (b, a % b) until b is 0. ### Solution ```python def gcd(a: int, b: int) -> int: while b: a, b = b, a % b return a ```
{"v": "ok", "content_hash": "2e0ec1b3431ce309"}
vcr_3950a5b85de6
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [0, 17, 18, 20, 23, 25, 30, 31, 40, 41, 45], "target": 13}, "output": 1}, {"input": {"nums": [1, 4, 13, 14, 15, 17, 20, 33, 34, 35, 37], "target": 38}, "output": 11}, {"input": {"nums": [11, 12, 24, 27, 28], "target": 7}, "output": 0}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "aba60609f2d01594"}
vcr_2ca12a0631ad
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [3, 11, 14, 15, 16, 18, 20, 23, 41], "target": 15}, "output": 3}, {"input": {"nums": [4, 6, 12, 16, 26, 28, 31, 33, 34, 38, 39], "target": 32}, "output": 7}, {"input": {"nums": [0, 7, 8, 10, 20, 21, 22, 23, 27, 28, 30], "target": 13}, "output": 4}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "a8c2bc977a22f08b"}
vcr_ecd806de1a84
easy
array
Rotate nums to the right by k steps (k may be larger than n). Return a new list.
def rotate(nums: list[int], k: int) -> list[int]:
Reduce k modulo n. Last k elements move to the front.
def rotate(nums: list[int], k: int) -> list[int]: n = len(nums) k %= n if k == 0: return list(nums) return nums[-k:] + nums[:-k]
[{"input": {"nums": [-3, 4, -9, 14, -6], "k": 7}, "output": [14, -6, -3, 4, -9]}, {"input": {"nums": [-4, 6, 5, 8, -1, 4, 6, -2], "k": 15}, "output": [6, 5, 8, -1, 4, 6, -2, -4]}, {"input": {"nums": [10, 1, -3], "k": 12}, "output": [10, 1, -3]}]
true
python
132c4800a39464fd
### Problem Rotate nums to the right by k steps (k may be larger than n). Return a new list. ### Reasoning Reduce k modulo n. Last k elements move to the front. ### Solution ```python def rotate(nums: list[int], k: int) -> list[int]: n = len(nums) k %= n if k == 0: return list(nums) return num...
{"v": "ok", "content_hash": "ca6279d85b38d6f1"}
vcr_93d531e1dcdd
easy
array
Return running sum where out[i] = nums[0] + ... + nums[i].
def running_sum(nums: list[int]) -> list[int]:
Accumulate once left to right. O(n).
def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out
[{"input": {"nums": [18, -25, -10, 2, -1, 21, -21, -6, -12, 26, 18]}, "output": [18, -7, -17, -15, -16, 5, -16, -22, -34, -8, 10]}, {"input": {"nums": [1, -12, 3, 1, 14, -11, 7]}, "output": [1, -11, -8, -7, 7, -4, 3]}, {"input": {"nums": [17, 18, -3, -8, -7, -12, -6, -3, 11]}, "output": [17, 35, 32, 24, 17, 5, -1, -4, ...
true
python
9222adfde6ffe86d
### Problem Return running sum where out[i] = nums[0] + ... + nums[i]. ### Reasoning Accumulate once left to right. O(n). ### Solution ```python def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out ```
{"v": "ok", "content_hash": "644c79dfad291ee1"}
vcr_229002527fcd
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [11, 15, 23, 29, 36, 40, 43, 47], "target": 39}, "output": 5}, {"input": {"nums": [3, 7, 12, 15, 19, 20, 28, 29, 30, 32, 34, 37], "target": 9}, "output": 2}, {"input": {"nums": [11, 13, 14, 16, 17, 18, 19, 24, 30, 31], "target": 21}, "output": 7}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "0aac541746317125"}
vcr_02b7621bead3
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [0, 7, 17, 28, 36], "target": 17}, "output": 2}, {"input": {"nums": [6, 34, 35], "target": 1}, "output": 0}, {"input": {"nums": [17, 22, 36, 37, 38, 39], "target": 0}, "output": 0}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "2c06da7a8f023c97"}
vcr_397d0c2d52ed
medium
array
Maximum sum of any non-empty contiguous subarray (Kadane, O(n)).
def max_subarray(nums: list[int]) -> int:
At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays.
def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) best = max(best, cur) return best
[{"input": {"nums": [19, -9, 21, 3, 22, 13, 22]}, "output": 91}, {"input": {"nums": [0, -8, -2, -1, -9, 11, -12]}, "output": 11}, {"input": {"nums": [2, -10, 13, 5]}, "output": 18}]
true
python
ec0ac96e944ed958
### Problem Maximum sum of any non-empty contiguous subarray (Kadane, O(n)). ### Reasoning At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays. ### Solution ```python def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) ...
{"v": "ok", "content_hash": "3e189cfa6c457eda"}
vcr_d8db94cbcef3
medium
two_pointers
Sorted nums: find indices i < j with nums[i] + nums[j] = target using O(n) two pointers.
def two_sum_sorted(nums: list[int], target: int) -> list[int]:
Start at both ends. Move the pointer that brings the sum closer to target.
def two_sum_sorted(nums: list[int], target: int) -> list[int]: i, j = 0, len(nums) - 1 while i < j: s = nums[i] + nums[j] if s == target: return [i, j] if s < target: i += 1 else: j -= 1 return []
[{"input": {"nums": [-19, -16, 12, 31, 32], "target": 13}, "output": [0, 4]}, {"input": {"nums": [-20, -18, -16, -9, -2, 0, 15, 23], "target": -3}, "output": [1, 6]}, {"input": {"nums": [-4, -1, 4, 35, 36], "target": 3}, "output": [1, 2]}]
true
python
0fdf37b1be7420d0
### Problem Sorted nums: find indices i < j with nums[i] + nums[j] = target using O(n) two pointers. ### Reasoning Start at both ends. Move the pointer that brings the sum closer to target. ### Solution ```python def two_sum_sorted(nums: list[int], target: int) -> list[int]: i, j = 0, len(nums) - 1 while i < ...
{"v": "ok", "content_hash": "cb7c8c2f7fc1ab9b"}
vcr_12dfe3423d0b
easy
two_pointers
Sorted nums may contain duplicates. Return unique values in order as a new list.
def remove_duplicates_sorted(nums: list[int]) -> list[int]:
Scan left to right. Append only when the value differs from the last kept value.
def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [nums[0]] for x in nums[1:]: if x != out[-1]: out.append(x) return out
[{"input": {"nums": [1, 1, 3, 5, 6, 10, 12, 13]}, "output": [1, 3, 5, 6, 10, 12, 13]}, {"input": {"nums": [0, 1, 6, 8, 8, 9, 11, 12]}, "output": [0, 1, 6, 8, 9, 11, 12]}, {"input": {"nums": [0, 1, 4, 5, 9, 12]}, "output": [0, 1, 4, 5, 9, 12]}]
true
python
9a3cff9b9f3d1889
### Problem Sorted nums may contain duplicates. Return unique values in order as a new list. ### Reasoning Scan left to right. Append only when the value differs from the last kept value. ### Solution ```python def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [n...
{"v": "ok", "content_hash": "1de8be1c76622cd8"}
vcr_cc7afe286be9
medium
array
out[i] is product of all elements except nums[i]. O(n) without division.
def product_except_self(nums: list[int]) -> list[int]:
Build prefix products, then multiply by suffix products in a reverse pass.
def product_except_self(nums: list[int]) -> list[int]: n = len(nums) out = [1] * n left = 1 for i in range(n): out[i] = left left *= nums[i] right = 1 for i in range(n - 1, -1, -1): out[i] *= right right *= nums[i] return out
[{"input": {"nums": [2, 2, 7, 4, 5, 1]}, "output": [280, 280, 80, 140, 112, 560]}, {"input": {"nums": [2, 2, 1, 3, 5]}, "output": [30, 30, 60, 20, 12]}, {"input": {"nums": [4, 1, 2]}, "output": [2, 8, 4]}]
true
python
e6962ae39100e8b1
### Problem out[i] is product of all elements except nums[i]. O(n) without division. ### Reasoning Build prefix products, then multiply by suffix products in a reverse pass. ### Solution ```python def product_except_self(nums: list[int]) -> list[int]: n = len(nums) out = [1] * n left = 1 for i in rang...
{"v": "ok", "content_hash": "2d95bdde4d608311"}
vcr_402b0428aaca
medium
array
Maximum sum of any non-empty contiguous subarray (Kadane, O(n)).
def max_subarray(nums: list[int]) -> int:
At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays.
def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) best = max(best, cur) return best
[{"input": {"nums": [-7, -16, -4, -7, 3, 1, -14]}, "output": 4}, {"input": {"nums": [0, 0, 9, 14, -8, 12, -1, 0, -4]}, "output": 27}, {"input": {"nums": [14, -6, 5, -6, -11, 8]}, "output": 14}]
true
python
ec0ac96e944ed958
### Problem Maximum sum of any non-empty contiguous subarray (Kadane, O(n)). ### Reasoning At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays. ### Solution ```python def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) ...
{"v": "ok", "content_hash": "132604cfe6360cfb"}
vcr_66d8c8ea0f11
medium
dp
Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount.
def rob(nums: list[int]) -> int:
DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space.
def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, prev2 + x) return prev1
[{"input": {"nums": [28, 29, 21, 20, 3]}, "output": 52}, {"input": {"nums": [4, 3, 2, 19]}, "output": 23}, {"input": {"nums": [13, 1]}, "output": 13}]
true
python
adc43e90c6cebcb1
### Problem Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount. ### Reasoning DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space. ### Solution ```python def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, p...
{"v": "ok", "content_hash": "7a7b789ddf6835c0"}
vcr_16b909c692fe
easy
greedy
Daily stock prices. Max profit from one buy and one later sell (0 if impossible).
def max_profit(prices: list[int]) -> int:
Track the minimum price so far. Maximize price minus that minimum.
def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, x - lo) lo = min(lo, x) return best
[{"input": {"prices": [5, 44, 3, 51, 18, 35, 60]}, "output": 57}, {"input": {"prices": [6, 18, 40]}, "output": 34}, {"input": {"prices": [28, 5, 40, 39, 14, 15, 4, 28, 34, 4, 28, 12]}, "output": 35}]
true
python
b40e7d74850552a7
### Problem Daily stock prices. Max profit from one buy and one later sell (0 if impossible). ### Reasoning Track the minimum price so far. Maximize price minus that minimum. ### Solution ```python def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, ...
{"v": "ok", "content_hash": "f1fd5976570d886d"}
vcr_bb4ff52475c3
medium
dp
Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount.
def rob(nums: list[int]) -> int:
DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space.
def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, prev2 + x) return prev1
[{"input": {"nums": [19, 27, 11, 11, 7, 24, 0, 28]}, "output": 90}, {"input": {"nums": [3, 17, 2]}, "output": 17}, {"input": {"nums": [16, 18, 1, 0]}, "output": 18}]
true
python
adc43e90c6cebcb1
### Problem Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount. ### Reasoning DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space. ### Solution ```python def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, p...
{"v": "ok", "content_hash": "cb3076473eaa809b"}
vcr_30431ea9d6bd
medium
array
out[i] is product of all elements except nums[i]. O(n) without division.
def product_except_self(nums: list[int]) -> list[int]:
Build prefix products, then multiply by suffix products in a reverse pass.
def product_except_self(nums: list[int]) -> list[int]: n = len(nums) out = [1] * n left = 1 for i in range(n): out[i] = left left *= nums[i] right = 1 for i in range(n - 1, -1, -1): out[i] *= right right *= nums[i] return out
[{"input": {"nums": [4, 3, 4, 6, 4]}, "output": [288, 384, 288, 192, 288]}, {"input": {"nums": [3, 5, 4]}, "output": [20, 12, 15]}, {"input": {"nums": [5, 3, 1, 1, 1, 4, 1]}, "output": [12, 20, 60, 60, 60, 15, 60]}]
true
python
e6962ae39100e8b1
### Problem out[i] is product of all elements except nums[i]. O(n) without division. ### Reasoning Build prefix products, then multiply by suffix products in a reverse pass. ### Solution ```python def product_except_self(nums: list[int]) -> list[int]: n = len(nums) out = [1] * n left = 1 for i in rang...
{"v": "ok", "content_hash": "ec121dfb2236a318"}
vcr_3b8ed64b1d33
easy
bit
Return the number of set bits in non-negative integer n (Hamming weight).
def hamming_weight(n: int) -> int:
Count the least bit with n & 1, then shift right until n is 0.
def hamming_weight(n: int) -> int: c = 0 while n: c += n & 1 n >>= 1 return c
[{"input": {"n": 16929}, "output": 4}, {"input": {"n": 16109}, "output": 11}, {"input": {"n": 9942}, "output": 8}]
true
python
24a3439f03888452
### Problem Return the number of set bits in non-negative integer n (Hamming weight). ### Reasoning Count the least bit with n & 1, then shift right until n is 0. ### Solution ```python def hamming_weight(n: int) -> int: c = 0 while n: c += n & 1 n >>= 1 return c ```
{"v": "ok", "content_hash": "e2d2b2b5ab3cc539"}
vcr_623c49aa0568
medium
hashmap
Group anagrams by sorted character signature. Return sorted group sizes.
def anagram_group_sizes(strs: list[str]) -> list[int]:
Signature is sorted characters. Bucket words, then emit sorted sizes.
def anagram_group_sizes(strs: list[str]) -> list[int]: from collections import defaultdict g = defaultdict(list) for w in strs: g[''.join(sorted(w))].append(w) return sorted(len(v) for v in g.values())
[{"input": {"strs": ["acca", "ac", "bb", "abb", "cbcb", "ac", "ccbb", "babc", "ca"]}, "output": [1, 1, 1, 1, 2, 3]}, {"input": {"strs": ["aaa", "bab", "baa", "bbb"]}, "output": [1, 1, 1, 1]}, {"input": {"strs": ["abb", "baa", "baa", "bab", "aba", "baa"]}, "output": [2, 4]}]
true
python
98cc167af301acd0
### Problem Group anagrams by sorted character signature. Return sorted group sizes. ### Reasoning Signature is sorted characters. Bucket words, then emit sorted sizes. ### Solution ```python def anagram_group_sizes(strs: list[str]) -> list[int]: from collections import defaultdict g = defaultdict(list) f...
{"v": "ok", "content_hash": "591868f46db8c89d"}
vcr_f3889ed39154
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [4, 8, 11, 16, 18, 22, 33, 34, 37, 39, 43], "target": 4}, "output": 0}, {"input": {"nums": [7, 21, 30, 34], "target": 36}, "output": 4}, {"input": {"nums": [7, 13, 16, 23, 28, 33], "target": 29}, "output": 5}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "f15771dc6ce7d338"}
vcr_ea12950c3605
medium
two_pointers
Sorted nums: find indices i < j with nums[i] + nums[j] = target using O(n) two pointers.
def two_sum_sorted(nums: list[int], target: int) -> list[int]:
Start at both ends. Move the pointer that brings the sum closer to target.
def two_sum_sorted(nums: list[int], target: int) -> list[int]: i, j = 0, len(nums) - 1 while i < j: s = nums[i] + nums[j] if s == target: return [i, j] if s < target: i += 1 else: j -= 1 return []
[{"input": {"nums": [-30, -23, -15, -7, 8, 13, 23, 29], "target": -7}, "output": [0, 6]}, {"input": {"nums": [-20, -15, -13, 11, 19, 26, 28, 39], "target": 4}, "output": [1, 4]}, {"input": {"nums": [-6, -5, 0, 2, 9, 27], "target": -11}, "output": [0, 1]}]
true
python
0fdf37b1be7420d0
### Problem Sorted nums: find indices i < j with nums[i] + nums[j] = target using O(n) two pointers. ### Reasoning Start at both ends. Move the pointer that brings the sum closer to target. ### Solution ```python def two_sum_sorted(nums: list[int], target: int) -> list[int]: i, j = 0, len(nums) - 1 while i < ...
{"v": "ok", "content_hash": "30f811e0ca21a6ce"}
vcr_220d54248532
easy
array
Rotate nums to the right by k steps (k may be larger than n). Return a new list.
def rotate(nums: list[int], k: int) -> list[int]:
Reduce k modulo n. Last k elements move to the front.
def rotate(nums: list[int], k: int) -> list[int]: n = len(nums) k %= n if k == 0: return list(nums) return nums[-k:] + nums[:-k]
[{"input": {"nums": [13, 16, 3, -7], "k": 12}, "output": [13, 16, 3, -7]}, {"input": {"nums": [-4, -10, -3, 10, 4, 10, 7, -10], "k": 16}, "output": [-4, -10, -3, 10, 4, 10, 7, -10]}, {"input": {"nums": [-10, 3, 6, 5, -6, 2, -4, 2], "k": 7}, "output": [3, 6, 5, -6, 2, -4, 2, -10]}]
true
python
132c4800a39464fd
### Problem Rotate nums to the right by k steps (k may be larger than n). Return a new list. ### Reasoning Reduce k modulo n. Last k elements move to the front. ### Solution ```python def rotate(nums: list[int], k: int) -> list[int]: n = len(nums) k %= n if k == 0: return list(nums) return num...
{"v": "ok", "content_hash": "3194bbd36fb34439"}
vcr_4bc4fc758b78
easy
bit
Return the number of set bits in non-negative integer n (Hamming weight).
def hamming_weight(n: int) -> int:
Count the least bit with n & 1, then shift right until n is 0.
def hamming_weight(n: int) -> int: c = 0 while n: c += n & 1 n >>= 1 return c
[{"input": {"n": 43595}, "output": 8}, {"input": {"n": 8875}, "output": 7}, {"input": {"n": 417}, "output": 4}]
true
python
24a3439f03888452
### Problem Return the number of set bits in non-negative integer n (Hamming weight). ### Reasoning Count the least bit with n & 1, then shift right until n is 0. ### Solution ```python def hamming_weight(n: int) -> int: c = 0 while n: c += n & 1 n >>= 1 return c ```
{"v": "ok", "content_hash": "f0a7f5ff66a581a3"}
vcr_2539c0b848d8
easy
bit
Every element appears twice except one. Find the single element using XOR.
def single_number(nums: list[int]) -> int:
XOR cancels pairs. The remaining value is the single number.
def single_number(nums: list[int]) -> int: x = 0 for v in nums: x ^= v return x
[{"input": {"nums": [33, 33, 18, 21, 34, 12, 34, 79, 21, 7, 22, 24, 18, 24, 12, 22, 7]}, "output": 79}, {"input": {"nums": [1, 51, 1, 27, 5, 27, 5]}, "output": 51}, {"input": {"nums": [9, 16, 11, 41, 9, 25, 25, 4, 15, 16, 15, 4, 11]}, "output": 41}]
true
python
f76c1da3c46d529e
### Problem Every element appears twice except one. Find the single element using XOR. ### Reasoning XOR cancels pairs. The remaining value is the single number. ### Solution ```python def single_number(nums: list[int]) -> int: x = 0 for v in nums: x ^= v return x ```
{"v": "ok", "content_hash": "3f2180f625fb2a78"}
vcr_2f2e568b0472
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [0, 4, 8, 10, 13, 16, 17, 27, 32, 33, 39, 42, 43, 47], "target": 42}, "output": 11}, {"input": {"nums": [2, 9, 27], "target": 14}, "output": 2}, {"input": {"nums": [1, 5, 16], "target": 31}, "output": 3}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "e060b7baf9e34066"}
vcr_23e061a772fd
easy
hashmap
Return True if any value appears at least twice in nums.
def contains_duplicate(nums: list[int]) -> bool:
Duplicates exist if and only if len(list) > len(set). O(n).
def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums))
[{"input": {"nums": [37, 152, 176, 79, 29, 84, 5, 170, 73, 15, 62, 30, 27]}, "output": false}, {"input": {"nums": [21, 0, 10, 2, 7, 7, 2]}, "output": true}, {"input": {"nums": [16, 7, 20, 19]}, "output": false}]
true
python
f35d656879667375
### Problem Return True if any value appears at least twice in nums. ### Reasoning Duplicates exist if and only if len(list) > len(set). O(n). ### Solution ```python def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums)) ```
{"v": "ok", "content_hash": "4940cfc4f5813a56"}
vcr_a98b7c6840bc
easy
string
Reverse the order of words in s (words separated by single spaces).
def reverse_words(s: str) -> str:
Split on whitespace, reverse the list, join with spaces.
def reverse_words(s: str) -> str: return ' '.join(reversed(s.split()))
[{"input": {"s": "baac d cbbe"}, "output": "cbbe d baac"}, {"input": {"s": "bb baa abaa bb"}, "output": "bb abaa baa bb"}, {"input": {"s": "b aa"}, "output": "aa b"}]
true
python
e27e5a0fb61b865a
### Problem Reverse the order of words in s (words separated by single spaces). ### Reasoning Split on whitespace, reverse the list, join with spaces. ### Solution ```python def reverse_words(s: str) -> str: return ' '.join(reversed(s.split())) ```
{"v": "ok", "content_hash": "a9e18b67418d4080"}
vcr_a913af44f8a2
easy
two_pointers
Sorted nums may contain duplicates. Return unique values in order as a new list.
def remove_duplicates_sorted(nums: list[int]) -> list[int]:
Scan left to right. Append only when the value differs from the last kept value.
def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [nums[0]] for x in nums[1:]: if x != out[-1]: out.append(x) return out
[{"input": {"nums": [1, 4, 5, 6, 7, 7, 12, 13]}, "output": [1, 4, 5, 6, 7, 12, 13]}, {"input": {"nums": [0, 1, 2, 3, 4, 5, 11]}, "output": [0, 1, 2, 3, 4, 5, 11]}, {"input": {"nums": [0, 3, 3, 6, 6, 7, 8, 8, 9]}, "output": [0, 3, 6, 7, 8, 9]}]
true
python
9a3cff9b9f3d1889
### Problem Sorted nums may contain duplicates. Return unique values in order as a new list. ### Reasoning Scan left to right. Append only when the value differs from the last kept value. ### Solution ```python def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [n...
{"v": "ok", "content_hash": "a6df33dccb1492d3"}
vcr_a34226f84ae7
easy
greedy
Daily stock prices. Max profit from one buy and one later sell (0 if impossible).
def max_profit(prices: list[int]) -> int:
Track the minimum price so far. Maximize price minus that minimum.
def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, x - lo) lo = min(lo, x) return best
[{"input": {"prices": [59, 22, 2, 26, 10, 43, 11, 23, 27, 10, 4]}, "output": 41}, {"input": {"prices": [2, 27, 39, 23, 40, 12, 35, 23, 40, 20, 23, 33]}, "output": 38}, {"input": {"prices": [2, 27, 28, 24, 4, 5, 10, 36, 32, 21]}, "output": 34}]
true
python
b40e7d74850552a7
### Problem Daily stock prices. Max profit from one buy and one later sell (0 if impossible). ### Reasoning Track the minimum price so far. Maximize price minus that minimum. ### Solution ```python def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, ...
{"v": "ok", "content_hash": "ee130517797f09de"}
vcr_8fc8440c7631
easy
hashmap
Return True if any value appears at least twice in nums.
def contains_duplicate(nums: list[int]) -> bool:
Duplicates exist if and only if len(list) > len(set). O(n).
def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums))
[{"input": {"nums": [39, 40, 27, 1, 33, 2, 15, 15, 39, 0, 37, 39, 18]}, "output": true}, {"input": {"nums": [18, 16, 23, 14, 9, 13]}, "output": false}, {"input": {"nums": [7, 24, 5, 8, 10]}, "output": false}]
true
python
f35d656879667375
### Problem Return True if any value appears at least twice in nums. ### Reasoning Duplicates exist if and only if len(list) > len(set). O(n). ### Solution ```python def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums)) ```
{"v": "ok", "content_hash": "c6550df1aed0b51b"}
vcr_324eddeb0410
easy
hashmap
Return ascending indices of the two numbers in nums that add up to target. Exactly one solution exists.
def two_sum(nums: list[int], target: int) -> list[int]:
1) Find i, j with nums[i] + nums[j] = target. 2) Store value to index in a hash map while scanning. 3) For each x, look up target - x; if present, return sorted indices. 4) Time O(n), space O(n).
def two_sum(nums: list[int], target: int) -> list[int]: seen = {} for i, x in enumerate(nums): need = target - x if need in seen: a, b = seen[need], i return [a, b] if a < b else [b, a] seen[x] = i return []
[{"input": {"nums": [6, -30, 26, -26, 62, 55, -39, -10, -35, 14, 35], "target": 90}, "output": [5, 10]}, {"input": {"nums": [-23, -29, 48, 5, -21, 39, 25, 0, 22, -22], "target": -45}, "output": [0, 9]}, {"input": {"nums": [49, 19, 6, 39, -5, 16], "target": 68}, "output": [0, 1]}]
true
python
98882f4a63a35075
### Problem Return ascending indices of the two numbers in nums that add up to target. Exactly one solution exists. ### Reasoning 1) Find i, j with nums[i] + nums[j] = target. 2) Store value to index in a hash map while scanning. 3) For each x, look up target - x; if present, return sorted indices. 4) Time O(n), space...
{"v": "ok", "content_hash": "6c8990aa90cdaa54"}
vcr_22b6af9bf7b6
medium
array
Maximum sum of any non-empty contiguous subarray (Kadane, O(n)).
def max_subarray(nums: list[int]) -> int:
At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays.
def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) best = max(best, cur) return best
[{"input": {"nums": [5, -2, 2, 19, 22, 11, 0, 8, 15]}, "output": 80}, {"input": {"nums": [-4, 3, -6, -2, 1, -3, -2, 3]}, "output": 3}, {"input": {"nums": [14, -4, 13, 6, 9, 9, -10]}, "output": 47}]
true
python
ec0ac96e944ed958
### Problem Maximum sum of any non-empty contiguous subarray (Kadane, O(n)). ### Reasoning At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays. ### Solution ```python def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) ...
{"v": "ok", "content_hash": "75946f1a001f9813"}
vcr_aaf219f1d896
easy
two_pointers
Return True if lowercase string s is a palindrome.
def is_palindrome(s: str) -> bool:
Two pointers from both ends. Any mismatch means False. O(n) time, O(1) space.
def is_palindrome(s: str) -> bool: i, j = 0, len(s) - 1 while i < j: if s[i] != s[j]: return False i += 1 j -= 1 return True
[{"input": {"s": "dabbacadccbc"}, "output": false}, {"input": {"s": "cabbbaa"}, "output": false}, {"input": {"s": "cac"}, "output": true}]
true
python
9742b2c402b3548d
### Problem Return True if lowercase string s is a palindrome. ### Reasoning Two pointers from both ends. Any mismatch means False. O(n) time, O(1) space. ### Solution ```python def is_palindrome(s: str) -> bool: i, j = 0, len(s) - 1 while i < j: if s[i] != s[j]: return False i += ...
{"v": "ok", "content_hash": "76b670b69f9ce766"}
vcr_1ac15f8f019d
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [0, 2, 7, 9, 20, 23, 27, 34, 36, 38, 39], "target": 49}, "output": 11}, {"input": {"nums": [4, 12, 13, 21, 39], "target": 9}, "output": 1}, {"input": {"nums": [3, 8, 12, 16, 20, 22, 23, 34], "target": 30}, "output": 7}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "054e351d82567592"}
vcr_2257b7a78cae
medium
binary_search
Sorted distinct nums. Return index of target, or the insertion index if missing.
def search_insert(nums: list[int], target: int) -> int:
Binary search for the lower bound of target.
def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nums[mid] < target: lo = mid + 1 else: hi = mid return lo
[{"input": {"nums": [0, 2, 3, 10, 14, 19, 20, 21, 25, 31, 36, 41, 45, 46], "target": 20}, "output": 6}, {"input": {"nums": [3, 10, 13, 14, 19, 24, 27, 31, 33, 39], "target": 14}, "output": 3}, {"input": {"nums": [3, 9, 10, 14, 17, 18, 26, 37], "target": 22}, "output": 6}]
true
python
97339c7a2a724cba
### Problem Sorted distinct nums. Return index of target, or the insertion index if missing. ### Reasoning Binary search for the lower bound of target. ### Solution ```python def search_insert(nums: list[int], target: int) -> int: lo, hi = 0, len(nums) while lo < hi: mid = (lo + hi) // 2 if nu...
{"v": "ok", "content_hash": "32d94852304eb3f0"}
vcr_c5c586a8253b
medium
dp
Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount.
def rob(nums: list[int]) -> int:
DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space.
def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, prev2 + x) return prev1
[{"input": {"nums": [30, 11, 4, 14, 12, 29, 10]}, "output": 73}, {"input": {"nums": [11, 12, 1, 8, 5, 11, 1, 16]}, "output": 47}, {"input": {"nums": [0, 6]}, "output": 6}]
true
python
adc43e90c6cebcb1
### Problem Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount. ### Reasoning DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space. ### Solution ```python def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, p...
{"v": "ok", "content_hash": "9a991f6603cc6152"}
vcr_34153667b1b0
hard
two_pointers
Return True if lowercase string s is a palindrome.
def is_palindrome(s: str) -> bool:
Two pointers from both ends. Any mismatch means False. O(n) time, O(1) space.
def is_palindrome(s: str) -> bool: i, j = 0, len(s) - 1 while i < j: if s[i] != s[j]: return False i += 1 j -= 1 return True
[{"input": {"s": "dacbbddda"}, "output": false}, {"input": {"s": "cabbbac"}, "output": true}, {"input": {"s": "ccc"}, "output": true}]
true
python
9742b2c402b3548d
### Problem Return True if lowercase string s is a palindrome. ### Reasoning Two pointers from both ends. Any mismatch means False. O(n) time, O(1) space. ### Solution ```python def is_palindrome(s: str) -> bool: i, j = 0, len(s) - 1 while i < j: if s[i] != s[j]: return False i += ...
{"v": "ok", "content_hash": "270041d5da844dfe"}
vcr_c29a5301bae7
medium
two_pointers
Sorted nums: find indices i < j with nums[i] + nums[j] = target using O(n) two pointers.
def two_sum_sorted(nums: list[int], target: int) -> list[int]:
Start at both ends. Move the pointer that brings the sum closer to target.
def two_sum_sorted(nums: list[int], target: int) -> list[int]: i, j = 0, len(nums) - 1 while i < j: s = nums[i] + nums[j] if s == target: return [i, j] if s < target: i += 1 else: j -= 1 return []
[{"input": {"nums": [-24, -12, 10, 19, 21, 39, 42], "target": -14}, "output": [0, 2]}, {"input": {"nums": [-18, -11, -8, -7, -5, 7, 20, 22, 29], "target": 11}, "output": [0, 8]}, {"input": {"nums": [-16, 1, 9, 20, 23, 24, 28, 33, 38], "target": 37}, "output": [2, 6]}]
true
python
0fdf37b1be7420d0
### Problem Sorted nums: find indices i < j with nums[i] + nums[j] = target using O(n) two pointers. ### Reasoning Start at both ends. Move the pointer that brings the sum closer to target. ### Solution ```python def two_sum_sorted(nums: list[int], target: int) -> list[int]: i, j = 0, len(nums) - 1 while i < ...
{"v": "ok", "content_hash": "c4e83ec92e3633e5"}
vcr_e63f2e6e9c8a
medium
dp
Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount.
def rob(nums: list[int]) -> int:
DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space.
def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, prev2 + x) return prev1
[{"input": {"nums": [13, 23, 8, 20, 0, 9, 5, 27, 7, 29, 27]}, "output": 108}, {"input": {"nums": [17, 17, 1, 1, 5, 11, 17, 9, 17]}, "output": 57}, {"input": {"nums": [4, 5, 19, 1, 19, 6, 19, 17, 1]}, "output": 62}]
true
python
adc43e90c6cebcb1
### Problem Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount. ### Reasoning DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space. ### Solution ```python def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, p...
{"v": "ok", "content_hash": "fcd70f75e872b9a8"}
vcr_dc64c0fd59d5
easy
greedy
Daily stock prices. Max profit from one buy and one later sell (0 if impossible).
def max_profit(prices: list[int]) -> int:
Track the minimum price so far. Maximize price minus that minimum.
def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, x - lo) lo = min(lo, x) return best
[{"input": {"prices": [26, 23, 49, 41, 43, 31, 5, 60, 24, 2, 41, 47, 54, 44, 44]}, "output": 55}, {"input": {"prices": [23, 1, 15, 4, 9, 12, 33, 18]}, "output": 32}, {"input": {"prices": [3, 11, 33, 9, 34, 8, 13, 33]}, "output": 31}]
true
python
b40e7d74850552a7
### Problem Daily stock prices. Max profit from one buy and one later sell (0 if impossible). ### Reasoning Track the minimum price so far. Maximize price minus that minimum. ### Solution ```python def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, ...
{"v": "ok", "content_hash": "d97c498f7bac183b"}
vcr_f13327a152ad
easy
bit
Every element appears twice except one. Find the single element using XOR.
def single_number(nums: list[int]) -> int:
XOR cancels pairs. The remaining value is the single number.
def single_number(nums: list[int]) -> int: x = 0 for v in nums: x ^= v return x
[{"input": {"nums": [26, 29, 29, 34, 34, 35, 26, 35, 65]}, "output": 65}, {"input": {"nums": [20, 20, 18, 18, 45, 23, 23]}, "output": 45}, {"input": {"nums": [13, 21, 12, 13, 6, 9, 24, 9, 6, 42, 21, 12, 24]}, "output": 42}]
true
python
f76c1da3c46d529e
### Problem Every element appears twice except one. Find the single element using XOR. ### Reasoning XOR cancels pairs. The remaining value is the single number. ### Solution ```python def single_number(nums: list[int]) -> int: x = 0 for v in nums: x ^= v return x ```
{"v": "ok", "content_hash": "822e2273ab0aea48"}
vcr_d190d47eeed4
medium
array
Maximum sum of any non-empty contiguous subarray (Kadane, O(n)).
def max_subarray(nums: list[int]) -> int:
At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays.
def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) best = max(best, cur) return best
[{"input": {"nums": [-14, -11, 3, 21, 3]}, "output": 27}, {"input": {"nums": [1, 1, 3, -4, -1, 2, 11, 11]}, "output": 24}, {"input": {"nums": [-4, 14, 12, -5, -10, -12, 8, -2, 6, -7, 4]}, "output": 26}]
true
python
ec0ac96e944ed958
### Problem Maximum sum of any non-empty contiguous subarray (Kadane, O(n)). ### Reasoning At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays. ### Solution ```python def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) ...
{"v": "ok", "content_hash": "89dc5f1a3b344271"}
vcr_34b916c2c545
medium
two_pointers
Sorted nums: find indices i < j with nums[i] + nums[j] = target using O(n) two pointers.
def two_sum_sorted(nums: list[int], target: int) -> list[int]:
Start at both ends. Move the pointer that brings the sum closer to target.
def two_sum_sorted(nums: list[int], target: int) -> list[int]: i, j = 0, len(nums) - 1 while i < j: s = nums[i] + nums[j] if s == target: return [i, j] if s < target: i += 1 else: j -= 1 return []
[{"input": {"nums": [-23, -21, -11, 1, 10, 15, 21, 32, 33, 38], "target": 25}, "output": [4, 5]}, {"input": {"nums": [-19, -14, -9, -8, -2, 4, 6, 16, 22, 29, 31], "target": 47}, "output": [7, 10]}, {"input": {"nums": [-20, -19, -11, -9, -4, 7, 12, 21, 30, 33, 37], "target": -31}, "output": [0, 2]}]
true
python
0fdf37b1be7420d0
### Problem Sorted nums: find indices i < j with nums[i] + nums[j] = target using O(n) two pointers. ### Reasoning Start at both ends. Move the pointer that brings the sum closer to target. ### Solution ```python def two_sum_sorted(nums: list[int], target: int) -> list[int]: i, j = 0, len(nums) - 1 while i < ...
{"v": "ok", "content_hash": "5e983240d7410688"}
vcr_6c8f07c14115
easy
array
Return running sum where out[i] = nums[0] + ... + nums[i].
def running_sum(nums: list[int]) -> list[int]:
Accumulate once left to right. O(n).
def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out
[{"input": {"nums": [-9, 4, 4, 17, 20, 13, 15, 10, 26, 13, 3, 3, 9, 27]}, "output": [-9, -5, -1, 16, 36, 49, 64, 74, 100, 113, 116, 119, 128, 155]}, {"input": {"nums": [2, 15, 9, -12, -11, 17, 7, 17, 3]}, "output": [2, 17, 26, 14, 3, 20, 27, 44, 47]}, {"input": {"nums": [-4, 13, 9, 13, 16]}, "output": [-4, 9, 18, 31, 4...
true
python
9222adfde6ffe86d
### Problem Return running sum where out[i] = nums[0] + ... + nums[i]. ### Reasoning Accumulate once left to right. O(n). ### Solution ```python def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out ```
{"v": "ok", "content_hash": "0354aa78fe17a9c0"}
vcr_7d2e4afdfb1f
easy
string
Reverse the order of words in s (words separated by single spaces).
def reverse_words(s: str) -> str:
Split on whitespace, reverse the list, join with spaces.
def reverse_words(s: str) -> str: return ' '.join(reversed(s.split()))
[{"input": {"s": "ec cad"}, "output": "cad ec"}, {"input": {"s": "bb bba b ab aa"}, "output": "aa ab b bba bb"}, {"input": {"s": "aaba aaa"}, "output": "aaa aaba"}]
true
python
e27e5a0fb61b865a
### Problem Reverse the order of words in s (words separated by single spaces). ### Reasoning Split on whitespace, reverse the list, join with spaces. ### Solution ```python def reverse_words(s: str) -> str: return ' '.join(reversed(s.split())) ```
{"v": "ok", "content_hash": "2724f57d1e1f8a00"}
vcr_8c63efe8b738
easy
array
Return running sum where out[i] = nums[0] + ... + nums[i].
def running_sum(nums: list[int]) -> list[int]:
Accumulate once left to right. O(n).
def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out
[{"input": {"nums": [26, 6, -16, -19, 33, 12, 8, 22, 3, 9, -25]}, "output": [26, 32, 16, -3, 30, 42, 50, 72, 75, 84, 59]}, {"input": {"nums": [11, -9, 0, 17, -1, -12, 17, -6, 9]}, "output": [11, 2, 2, 19, 18, 6, 23, 17, 26]}, {"input": {"nums": [16, -8, -2, 15, -4]}, "output": [16, 8, 6, 21, 17]}]
true
python
9222adfde6ffe86d
### Problem Return running sum where out[i] = nums[0] + ... + nums[i]. ### Reasoning Accumulate once left to right. O(n). ### Solution ```python def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out ```
{"v": "ok", "content_hash": "6c7d770ef1781274"}
vcr_5d64da65592a
medium
array
Maximum sum of any non-empty contiguous subarray (Kadane, O(n)).
def max_subarray(nums: list[int]) -> int:
At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays.
def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) best = max(best, cur) return best
[{"input": {"nums": [17, 1, -16, 17, 3, 12, 2, -6, -10, 3, 9, 5]}, "output": 37}, {"input": {"nums": [8, 6, -7, -6, -5, -2, 3]}, "output": 14}, {"input": {"nums": [7, -11, 1, -9, -7, 9, -5, 2, -10]}, "output": 9}]
true
python
ec0ac96e944ed958
### Problem Maximum sum of any non-empty contiguous subarray (Kadane, O(n)). ### Reasoning At each step cur = max(x, cur+x). Track global best. Handles all-negative arrays. ### Solution ```python def max_subarray(nums: list[int]) -> int: best = cur = nums[0] for x in nums[1:]: cur = max(x, cur + x) ...
{"v": "ok", "content_hash": "0f086a4b804be9c1"}
vcr_0f2e18220f2d
easy
greedy
Daily stock prices. Max profit from one buy and one later sell (0 if impossible).
def max_profit(prices: list[int]) -> int:
Track the minimum price so far. Maximize price minus that minimum.
def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, x - lo) lo = min(lo, x) return best
[{"input": {"prices": [3, 55, 44, 49, 9, 2, 28]}, "output": 52}, {"input": {"prices": [24, 32, 12, 19, 3, 2, 10, 37, 37]}, "output": 35}, {"input": {"prices": [32, 10, 14, 14, 28, 12, 9, 4, 17]}, "output": 18}]
true
python
b40e7d74850552a7
### Problem Daily stock prices. Max profit from one buy and one later sell (0 if impossible). ### Reasoning Track the minimum price so far. Maximize price minus that minimum. ### Solution ```python def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, ...
{"v": "ok", "content_hash": "65d6c3948cbda082"}
vcr_4b5ef8c3ef44
medium
hashmap
Return ascending indices of the two numbers in nums that add up to target. Exactly one solution exists.
def two_sum(nums: list[int], target: int) -> list[int]:
1) Find i, j with nums[i] + nums[j] = target. 2) Store value to index in a hash map while scanning. 3) For each x, look up target - x; if present, return sorted indices. 4) Time O(n), space O(n).
def two_sum(nums: list[int], target: int) -> list[int]: seen = {} for i, x in enumerate(nums): need = target - x if need in seen: a, b = seen[need], i return [a, b] if a < b else [b, a] seen[x] = i return []
[{"input": {"nums": [49, -1, 50, 12, 29, -39, -16, 34, -26, 38, -15, 39, 57, 76], "target": 18}, "output": [6, 7]}, {"input": {"nums": [0, -23, -19, 26, 49, 10, -9], "target": 59}, "output": [4, 5]}, {"input": {"nums": [18, 46, 41, 42], "target": 60}, "output": [0, 3]}]
true
python
98882f4a63a35075
### Problem Return ascending indices of the two numbers in nums that add up to target. Exactly one solution exists. ### Reasoning 1) Find i, j with nums[i] + nums[j] = target. 2) Store value to index in a hash map while scanning. 3) For each x, look up target - x; if present, return sorted indices. 4) Time O(n), space...
{"v": "ok", "content_hash": "6de6dfbd9b3703f4"}
vcr_af71b379f077
easy
two_pointers
Sorted nums may contain duplicates. Return unique values in order as a new list.
def remove_duplicates_sorted(nums: list[int]) -> list[int]:
Scan left to right. Append only when the value differs from the last kept value.
def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [nums[0]] for x in nums[1:]: if x != out[-1]: out.append(x) return out
[{"input": {"nums": [0, 1, 3, 5, 5, 6, 8, 9, 11, 12, 12, 12]}, "output": [0, 1, 3, 5, 6, 8, 9, 11, 12]}, {"input": {"nums": [2, 5, 7, 8, 8, 10, 10, 12]}, "output": [2, 5, 7, 8, 10, 12]}, {"input": {"nums": [3, 3, 4, 11]}, "output": [3, 4, 11]}]
true
python
9a3cff9b9f3d1889
### Problem Sorted nums may contain duplicates. Return unique values in order as a new list. ### Reasoning Scan left to right. Append only when the value differs from the last kept value. ### Solution ```python def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [n...
{"v": "ok", "content_hash": "6846935409875523"}
vcr_685128d7b6ec
easy
array
Return running sum where out[i] = nums[0] + ... + nums[i].
def running_sum(nums: list[int]) -> list[int]:
Accumulate once left to right. O(n).
def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out
[{"input": {"nums": [35, -11, 9, 5, 18, 27, -22]}, "output": [35, 24, 33, 38, 56, 83, 61]}, {"input": {"nums": [11, 0, 13, 6, 9, 13]}, "output": [11, 11, 24, 30, 39, 52]}, {"input": {"nums": [1, -3, 2, 3, 10, -7, 9, -12, 0]}, "output": [1, -2, 0, 3, 13, 6, 15, 3, 3]}]
true
python
9222adfde6ffe86d
### Problem Return running sum where out[i] = nums[0] + ... + nums[i]. ### Reasoning Accumulate once left to right. O(n). ### Solution ```python def running_sum(nums: list[int]) -> list[int]: acc, out = 0, [] for x in nums: acc += x out.append(acc) return out ```
{"v": "ok", "content_hash": "af8e5d1f3dc9d26f"}
vcr_b2661832b3cf
easy
two_pointers
Sorted nums may contain duplicates. Return unique values in order as a new list.
def remove_duplicates_sorted(nums: list[int]) -> list[int]:
Scan left to right. Append only when the value differs from the last kept value.
def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [nums[0]] for x in nums[1:]: if x != out[-1]: out.append(x) return out
[{"input": {"nums": [2, 2, 3, 9, 10, 10, 10, 11, 13, 13, 14, 15]}, "output": [2, 3, 9, 10, 11, 13, 14, 15]}, {"input": {"nums": [1, 3, 3, 4, 4, 4, 6, 8, 10, 11, 11]}, "output": [1, 3, 4, 6, 8, 10, 11]}, {"input": {"nums": [3, 3, 3, 5, 6, 7, 7, 9, 12]}, "output": [3, 5, 6, 7, 9, 12]}]
true
python
9a3cff9b9f3d1889
### Problem Sorted nums may contain duplicates. Return unique values in order as a new list. ### Reasoning Scan left to right. Append only when the value differs from the last kept value. ### Solution ```python def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [n...
{"v": "ok", "content_hash": "0118a8ba271fe209"}
vcr_6184c22693ce
easy
bit
Return the number of set bits in non-negative integer n (Hamming weight).
def hamming_weight(n: int) -> int:
Count the least bit with n & 1, then shift right until n is 0.
def hamming_weight(n: int) -> int: c = 0 while n: c += n & 1 n >>= 1 return c
[{"input": {"n": 31860}, "output": 9}, {"input": {"n": 8495}, "output": 7}, {"input": {"n": 5930}, "output": 7}]
true
python
24a3439f03888452
### Problem Return the number of set bits in non-negative integer n (Hamming weight). ### Reasoning Count the least bit with n & 1, then shift right until n is 0. ### Solution ```python def hamming_weight(n: int) -> int: c = 0 while n: c += n & 1 n >>= 1 return c ```
{"v": "ok", "content_hash": "f58f4636df794b76"}
vcr_155f6b8913d5
easy
two_pointers
Sorted nums may contain duplicates. Return unique values in order as a new list.
def remove_duplicates_sorted(nums: list[int]) -> list[int]:
Scan left to right. Append only when the value differs from the last kept value.
def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [nums[0]] for x in nums[1:]: if x != out[-1]: out.append(x) return out
[{"input": {"nums": [6, 6, 9, 9, 11, 12, 12, 13, 14]}, "output": [6, 9, 11, 12, 13, 14]}, {"input": {"nums": [0, 0, 2, 2, 3, 5, 11, 11]}, "output": [0, 2, 3, 5, 11]}, {"input": {"nums": [5, 7, 8, 10]}, "output": [5, 7, 8, 10]}]
true
python
9a3cff9b9f3d1889
### Problem Sorted nums may contain duplicates. Return unique values in order as a new list. ### Reasoning Scan left to right. Append only when the value differs from the last kept value. ### Solution ```python def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [n...
{"v": "ok", "content_hash": "130d6613dff3fde7"}
vcr_f7499926554b
medium
dp
Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount.
def rob(nums: list[int]) -> int:
DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space.
def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, prev2 + x) return prev1
[{"input": {"nums": [19, 7, 20, 4, 1, 21, 29]}, "output": 69}, {"input": {"nums": [17, 4, 15, 1, 4]}, "output": 36}, {"input": {"nums": [6, 18, 12, 3]}, "output": 21}]
true
python
adc43e90c6cebcb1
### Problem Houses in a line with values nums. Cannot rob adjacent houses. Maximum amount. ### Reasoning DP: for each house choose max(skip, take + prev2). O(n) time, O(1) space. ### Solution ```python def rob(nums: list[int]) -> int: prev2 = prev1 = 0 for x in nums: prev2, prev1 = prev1, max(prev1, p...
{"v": "ok", "content_hash": "d1bffbcea80965e1"}
vcr_ecb92c64ff50
easy
two_pointers
Sorted nums may contain duplicates. Return unique values in order as a new list.
def remove_duplicates_sorted(nums: list[int]) -> list[int]:
Scan left to right. Append only when the value differs from the last kept value.
def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [nums[0]] for x in nums[1:]: if x != out[-1]: out.append(x) return out
[{"input": {"nums": [2, 6, 8, 9, 10, 10, 12, 15]}, "output": [2, 6, 8, 9, 10, 12, 15]}, {"input": {"nums": [0, 0, 5, 6, 6, 7, 8, 9, 10, 11]}, "output": [0, 5, 6, 7, 8, 9, 10, 11]}, {"input": {"nums": [0, 2, 2, 5, 5, 6, 7, 8, 8, 11]}, "output": [0, 2, 5, 6, 7, 8, 11]}]
true
python
9a3cff9b9f3d1889
### Problem Sorted nums may contain duplicates. Return unique values in order as a new list. ### Reasoning Scan left to right. Append only when the value differs from the last kept value. ### Solution ```python def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [n...
{"v": "ok", "content_hash": "260630712051cbcf"}
vcr_de6e10cb0b57
easy
two_pointers
Sorted nums may contain duplicates. Return unique values in order as a new list.
def remove_duplicates_sorted(nums: list[int]) -> list[int]:
Scan left to right. Append only when the value differs from the last kept value.
def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [nums[0]] for x in nums[1:]: if x != out[-1]: out.append(x) return out
[{"input": {"nums": [1, 8, 9, 11, 13, 14, 14, 15, 15]}, "output": [1, 8, 9, 11, 13, 14, 15]}, {"input": {"nums": [2, 5, 7, 8, 9, 9, 10, 10, 10, 12]}, "output": [2, 5, 7, 8, 9, 10, 12]}, {"input": {"nums": [0, 0, 1, 3, 3, 3, 3, 7, 10, 11]}, "output": [0, 1, 3, 7, 10, 11]}]
true
python
9a3cff9b9f3d1889
### Problem Sorted nums may contain duplicates. Return unique values in order as a new list. ### Reasoning Scan left to right. Append only when the value differs from the last kept value. ### Solution ```python def remove_duplicates_sorted(nums: list[int]) -> list[int]: if not nums: return [] out = [n...
{"v": "ok", "content_hash": "2ebc54e65915159f"}
vcr_39e6506f7f36
easy
hashmap
Return True if any value appears at least twice in nums.
def contains_duplicate(nums: list[int]) -> bool:
Duplicates exist if and only if len(list) > len(set). O(n).
def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums))
[{"input": {"nums": [49, 5, 40, 10, 0, 20, 45, 48, 46, 48, 18, 17, 16]}, "output": true}, {"input": {"nums": [3, 11, 4]}, "output": false}, {"input": {"nums": [25, 17, 25, 0]}, "output": true}]
true
python
f35d656879667375
### Problem Return True if any value appears at least twice in nums. ### Reasoning Duplicates exist if and only if len(list) > len(set). O(n). ### Solution ```python def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums)) ```
{"v": "ok", "content_hash": "40d4d3c2098942ad"}
vcr_9a1bbb041a9c
easy
hashmap
Return True if any value appears at least twice in nums.
def contains_duplicate(nums: list[int]) -> bool:
Duplicates exist if and only if len(list) > len(set). O(n).
def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums))
[{"input": {"nums": [21, 46, 42, 6, 44, 2, 14, 15, 14, 42, 50, 18, 50, 34, 47, 33, 1]}, "output": true}, {"input": {"nums": [9, 13, 0, 10, 22, 14, 2, 14]}, "output": true}, {"input": {"nums": [15, 4, 20, 1, 15, 18, 1, 21, 6, 2]}, "output": true}]
true
python
f35d656879667375
### Problem Return True if any value appears at least twice in nums. ### Reasoning Duplicates exist if and only if len(list) > len(set). O(n). ### Solution ```python def contains_duplicate(nums: list[int]) -> bool: return len(nums) != len(set(nums)) ```
{"v": "ok", "content_hash": "816a5e830d855036"}
vcr_e4eccf385c5d
easy
greedy
Daily stock prices. Max profit from one buy and one later sell (0 if impossible).
def max_profit(prices: list[int]) -> int:
Track the minimum price so far. Maximize price minus that minimum.
def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, x - lo) lo = min(lo, x) return best
[{"input": {"prices": [19, 35, 1, 31, 58, 12, 27, 40, 9, 54, 6, 42]}, "output": 57}, {"input": {"prices": [9, 22, 34, 31, 5, 37, 21, 27, 10, 20, 18]}, "output": 32}, {"input": {"prices": [20, 6, 11, 17, 16, 33, 6, 30, 17, 7, 9, 34]}, "output": 28}]
true
python
b40e7d74850552a7
### Problem Daily stock prices. Max profit from one buy and one later sell (0 if impossible). ### Reasoning Track the minimum price so far. Maximize price minus that minimum. ### Solution ```python def max_profit(prices: list[int]) -> int: best, lo = 0, prices[0] for x in prices[1:]: best = max(best, ...
{"v": "ok", "content_hash": "12f9d1a5317ce364"}