srakrn | Wiki - User contributions [th-th]

PromptCode/6

2026-04-21T14:30:51Z

Srakrn:

{{PromptCode Instruction}}

(Difficulty: medium)

<pre>
def sc(lst, t, lo=0, hi=None):
if hi is None:
hi = len(lst) - 1
if lo > hi:
return -1
mid = (lo + hi) // 2
if lst[mid] == t:
return mid
if lst[mid] < t:
return sc(lst, t, mid + 1, hi)
return sc(lst, t, lo, mid - 1)
</pre>

Hint 1: {{censored | The function name is search_sorted}}

PromptCode/5

2026-04-21T14:30:36Z

Srakrn:

{{PromptCode Instruction}}

(Difficulty: medium)

<pre>
def tr(n, memo={}):
if n in memo:
return memo[n]
if n <= 2:
return n
memo[n] = tr(n-1, memo) + tr(n-2, memo) + tr(n-3, memo)
return memo[n]
</pre>

Hint 1: {{censored | The function name is tribonacci }}

Hint 2: {{censored | You need to prompt the LLM to memoise }}

PromptCode/5

2026-04-21T14:30:30Z

Srakrn:

{{PromptCode Instruction}}

(Difficulty: medium)

<pre>
def tr(n, memo={}):
if n in memo:
return memo[n]
if n <= 2:
return n
memo[n] = tr(n-1, memo) + tr(n-2, memo) + tr(n-3, memo)
return memo[n]
</pre>

Hint 1: {{censored | The function name is tribonacci }}
Hint 2: {{censored | You need to prompt the LLM to memoise }}

PromptCode/4

2026-04-21T14:29:59Z

Srakrn:

{{PromptCode Instruction}}

(Difficulty: easy)

<pre>
def if(i, x_0, x_1):
if i == 0:
return x_0
if i == 1:
return x_1
return inv_fib(i - 2, x_0, x_1) - inv_fib(i - 1, x_0, x_1)
</pre>

Hint 1: {{censored | The full function name is inverse_fibonacci}}

PromptCode/3a

2026-04-21T14:29:27Z

Srakrn:

{{PromptCode Instruction}}

<pre>
def f(pairs):
result = {}
for key, value in pairs:
if key not in result:
result[key] = value
return result
</pre>

PromptCode/3

2026-04-21T14:29:11Z

Srakrn:

{{PromptCode Instruction}}

(Difficulty: medium)

<pre>
def f(pairs):
return dict(reversed(pairs))
</pre>

Hint 1: {{censored | The full function name is tuples_to_dict}}

Hint 2: {{censored | Go to [[PromptCode/3a]] for an expanded code}}

PromptCode/2

2026-04-21T14:28:57Z

Srakrn:

{{PromptCode Instruction}}

(Difficulty: easy)

<pre>
def f(numbers):
unique = set(numbers)
reverse_sorted = sorted(unique, reverse=True)
return reverse_sorted[1] if len(reverse_sorted) >= 2 else None
</pre>

Hint 1: {{censored | the function accepts a 1D list of numbers}}

Hint 2: {{censored | the function's full name is second_max }}

PromptCode/1

2026-04-21T14:28:42Z

Srakrn:

{{PromptCode Instruction}}

(Difficulty: hard)

<pre>
def cg(intervals: list[tuple[int, int]]) -> int:
if len(intervals) <= 1:
return 0

sorted_intervals = sorted(intervals)

merged = [sorted_intervals[0]]
for start, end in sorted_intervals[1:]:
prev_start, prev_end = merged[-1]
if start < prev_end:
merged[-1] = (prev_start, max(prev_end, end))
else:
merged.append((start, end))

return len(merged) - 1
</pre>

PromptCode

2026-04-21T14:26:43Z

Srakrn:

{{PromptCode Instruction}}

== Browse Problems ==

'''Browse only problem with integers in the name (e.g. 3, but not 3a). 3a is 3 but with more 'hints'!'''

{{Special:PrefixIndex/PromptCode/}}

PromptCode

2026-04-21T14:26:16Z

Srakrn:

{{PromptCode Instruction}}

== Browse Problems ==

{{Special:PrefixIndex/PromptCode/}}

PromptCode

2026-04-21T14:25:52Z

Srakrn:

PromptCode

2026-04-21T14:25:45Z

Srakrn: Created page with "{{PromptCode Instructions}}"

PromptCode/6

2026-04-21T14:24:38Z

Srakrn: Created page with "{{PromptCode Instruction}} <pre> def sc(lst, t, lo=0, hi=None): if hi is None: hi = len(lst) - 1 if lo > hi: return -1 mid = (lo + hi) // 2 if..."

{{PromptCode Instruction}}

<pre>
def sc(lst, t, lo=0, hi=None):
if hi is None:
hi = len(lst) - 1
if lo > hi:
return -1
mid = (lo + hi) // 2
if lst[mid] == t:
return mid
if lst[mid] < t:
return sc(lst, t, mid + 1, hi)
return sc(lst, t, lo, mid - 1)
</pre>

Hint 1: {{censored | The function name is search_sorted}}

PromptCode/5

2026-04-21T14:23:57Z

Srakrn: Created page with "{{PromptCode Instruction}} <pre> def tr(n, memo={}): if n in memo: return memo[n] if n <= 2: return n memo[n] = tr(n-1, memo) + tr(n-2, memo) + tr..."

{{PromptCode Instruction}}

<pre>
def tr(n, memo={}):
if n in memo:
return memo[n]
if n <= 2:
return n
memo[n] = tr(n-1, memo) + tr(n-2, memo) + tr(n-3, memo)
return memo[n]
</pre>

Hint 1: {{censored | The function name is tribonacci }}

Hint 2: {{censored | It is like Fibonacci but sums three previous terms }}

PromptCode/2

2026-04-21T14:23:35Z

Srakrn:

{{PromptCode Instruction}}

<pre>
def f(numbers):
unique = set(numbers)
reverse_sorted = sorted(unique, reverse=True)
return reverse_sorted[1] if len(reverse_sorted) >= 2 else None
</pre>

Hint 1: {{censored | the function accepts a 1D list of numbers}}

Hint 2: {{censored | the function's full name is second_max }}

Template:PromptCode Instruction

2026-04-21T14:21:04Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't ''cheat'', which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style, LLM keeps continuing with the context from its earlier message.
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt.
* Highlight the black censored text for hint.
 
<hr/>

PromptCode/1

2026-04-21T09:28:07Z

Srakrn:

{{PromptCode Instruction}}

<pre>
def cg(intervals: list[tuple[int, int]]) -> int:
if len(intervals) <= 1:
return 0

sorted_intervals = sorted(intervals)

merged = [sorted_intervals[0]]
for start, end in sorted_intervals[1:]:
prev_start, prev_end = merged[-1]
if start < prev_end:
merged[-1] = (prev_start, max(prev_end, end))
else:
merged.append((start, end))

return len(merged) - 1
</pre>

PromptCode/2

2026-04-21T09:04:51Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def f(numbers):
unique = set(numbers)
reverse_sorted = sorted(unique, reverse=True)
return reverse_sorted[1] if len(reverse_sorted) >= 2 else None
</pre>

Hint 1: {{censored | the function accepts a 1D list of numbers}}

Hint 2: {{censored | the function's full name is second_max }}

PromptCode/4

2026-04-21T08:59:50Z

Srakrn:

{{PromptCode Instruction}}

<pre>
def inv_fib(i, x_0, x_1):
if i == 0:
return x_0
if i == 1:
return x_1
return inv_fib(i - 2, x_0, x_1) - inv_fib(i - 1, x_0, x_1)
</pre>

Hint 1: {{censored | The full function name is inverse_fibonacci}}

Template:PromptCode Instruction

2026-04-21T08:58:51Z

Srakrn:

'''''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt''

<hr/>

Template:PromptCode Instruction

2026-04-21T08:58:38Z

Srakrn:

PromptCode/3

2026-04-21T08:58:27Z

Srakrn:

{{PromptCode Instruction}}

<pre>
def f(pairs):
return dict(reversed(pairs))
</pre>

Hint 1: {{censored | The full function name is tuples_to_dict}}

Hint 2: {{censored | Go to [[PromptCode/3a]] for an expanded code}}

PromptCode/3

2026-04-21T08:58:08Z

Srakrn:

{{PromptCode Instruction}}

Hint 1: {{censored | The full function name is tuples_to_dict}}

Hint 2: {{censored | Go to [[PromptCode/3a]] for an expanded code}}

Template:PromptCode Instruction

2026-04-21T08:57:57Z

Srakrn: Created page with "'''PromptCode challenge:''' * Given the following code, use an LLM to generate a snippet of code that will function the same. * You can't cheat, which are basically: ** Feed..."

MediaWiki:Common.css

2026-04-21T08:52:16Z

Srakrn:

/* CSS placed here will be applied to all skins */

/*
.censored:hover {
color: inherit;
background-color: inherit !important;
}

.censored:hover {
background-color: inherit;
line-height: inherit;
color: inherit;
}
*/

.censored {
background-color: black;
padding: 1px;
background-color: #000;
line-height: inherit;
color: #000;
transition: all .2s ease;
-webkit-transition: all .2s ease;
}

PromptCode/2

2026-04-21T08:51:51Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def f(numbers):
unique = sorted(set(numbers), reverse=True)
return unique[1] if len(unique) >= 2 else None
</pre>

Hint 1: {{censored | the function accepts a 1D list of numbers}}

Hint 2: {{censored | the function's full name is second_max }}

PromptCode/2

2026-04-21T08:51:46Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def f(numbers):
unique = sorted(set(numbers), reverse=True)
return unique[1] if len(unique) >= 2 else None
</pre>

Hint 1: {{censored | the function accepts a 1D list of numbers}}
Hint 2: {{censored | the function's full name is second_max }}

PromptCode/3

2026-04-21T08:47:11Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def f(pairs):
return dict(reversed(pairs))
</pre>

Hint 1: {{censored | The full function name is tuples_to_dict}}

Hint 2: {{censored | Go to [[PromptCode/3a]] for an expanded code}}

PromptCode/3a

2026-04-21T08:47:02Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def f(pairs):
result = {}
for key, value in pairs:
if key not in result:
result[key] = value
return result
</pre>

MediaWiki:Common.css

2026-04-21T08:46:45Z

Srakrn:

/* CSS placed here will be applied to all skins */

.censored:hover {
color: inherit;
background-color: inherit !important;
}

.censored:hover {
background-color: inherit;
line-height: inherit;
color: inherit;
}

.censored {
background-color: black;
padding: 1px;
background-color: #000;
line-height: inherit;
color: #000;
transition: all .2s ease;
-webkit-transition: all .2s ease;
}

MediaWiki:Common.css

2026-04-21T08:46:23Z

Srakrn:

/* CSS placed here will be applied to all skins */

.censored:hover {
color: inherit;
background-color: inherit !important;
}

.censored:hover {
background-color: inherit;
line-height: inherit;
color: inherit;
}

.censored {
color: black;
background-color: black;
padding: 1px;
background-color: #000;
line-height: inherit;
color: #000;
transition: all .2s ease;
-webkit-transition: all .2s ease;
}

PromptCode/3a

2026-04-21T08:45:26Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def f(pairs):
result = {}
for key, value in pairs:
if key not in result:
result[key] = value
return result
</pre>

Hint 1: {{censored | The full function name is tuples_to_dict}}

Hint 2: {{censored | Go to [[PromptCode/3a]] for an expanded code}}

PromptCode/3a

2026-04-21T08:45:17Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def f(pairs):
result = {}
for key, value in pairs:
if key not in result:
result[key] = value
return result
</pre>

Hint 1: {{censored | The full function name is tuples_to_dict}}

Hint 2: {{censored | Go to [PromptCode/3a] for an expanded code}}

Template:Censored

2026-04-21T08:45:03Z

Srakrn:

{{{1|}}}<noinclude>{{Censored|ข้อความนี้ถูกเซ็นเซอร์ ซึ่งในปัจจุบัน [[การใส่ลิงก์ภายในที่ไม่มีบทความอยู่]] จะถูกเซ็นเซอร์ไปด้วย แต่{{t|ห้ามใช้แม่แบบที่ทำทูลทิป|แม่แบบ:t}} เพราะจะไม่ถูกเซ็นเซอร์}}</noinclude>

PromptCode/3a

2026-04-21T08:44:29Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def f(pairs):
result = {}
for key, value in pairs:
if key not in result:
result[key] = value
return result
</pre>

Hint 1: {{censored | The full function name is tuples_to_dict}}
Hint 2: {{censored | Go to [PromptCode/3a] for an expanded code}}

MediaWiki:Common.css

2026-04-21T08:43:08Z

Srakrn: Created page with "/* CSS placed here will be applied to all skins */ .censored:hover { color: inherit; background-color: inherit !important; } .censored:hover { background-color: inheri..."

/* CSS placed here will be applied to all skins */

.censored:hover {
color: inherit;
background-color: inherit !important;
}

.censored:hover {
background-color: inherit;
line-height: inherit;
color: inherit;
}

.censored {
color: black;
background-color: black;
padding: 1px;
}

.censored, .censored a {
background-color: #000;
line-height: inherit;
color: #000;
transition: all .2s ease;
-webkit-transition: all .2s ease;
}

Template:Censored

2026-04-21T08:41:01Z

Srakrn:

{{{1|}}}

<noinclude>
{{Censored|ข้อความนี้ถูกเซ็นเซอร์ ซึ่งในปัจจุบัน [[การใส่ลิงก์ภายในที่ไม่มีบทความอยู่]] จะถูกเซ็นเซอร์ไปด้วย แต่{{t|ห้ามใช้แม่แบบที่ทำทูลทิป|แม่แบบ:t}} เพราะจะไม่ถูกเซ็นเซอร์}}
</noinclude>

Template:Censored

2026-04-21T08:40:50Z

Srakrn: Created page with "{{{1|}}} <noinclude> {{C|ข้อความนี้ถูกเซ็นเซอร์ ซึ่งในปัจจุบัน กา..."

{{{1|}}}

<noinclude>
{{C|ข้อความนี้ถูกเซ็นเซอร์ ซึ่งในปัจจุบัน [[การใส่ลิงก์ภายในที่ไม่มีบทความอยู่]] จะถูกเซ็นเซอร์ไปด้วย แต่{{t|ห้ามใช้แม่แบบที่ทำทูลทิป|แม่แบบ:t}} เพราะจะไม่ถูกเซ็นเซอร์}}
</noinclude>

PromptCode/4

2026-04-21T08:36:04Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def inv_fib(i, x_0, x_1):
if i == 0:
return x_0
if i == 1:
return x_1
return inv_fib(i - 2, x_0, x_1) - inv_fib(i - 1, x_0, x_1)
</pre>

PromptCode/3a

2026-04-21T08:34:47Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def f(pairs):
result = {}
for key, value in pairs:
if key not in result:
result[key] = value
return result
</pre>

PromptCode/3

2026-04-21T08:34:36Z

Srakrn:

PromptCode/2

2026-04-21T08:34:15Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def f(numbers):
unique = sorted(set(numbers), reverse=True)
return unique[1] if len(unique) >= 2 else None
</pre>

PromptCode/4

2026-04-20T09:33:06Z

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def inv_fib(i, x_0, x_1):
if i == 0:
return x_0
if i == 1:
return x_1
return inv_fib(i - 2) - inv_fib(i - 1)
</pre>

PromptCode/1

2026-04-20T09:23:37Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt

<pre>
def cg(intervals: list[tuple[int, int]]) -> int:
if len(intervals) <= 1:
return 0

sorted_intervals = sorted(intervals, key=lambda x: (x[0], x[1]))

merged = [sorted_intervals[0]]
for start, end in sorted_intervals[1:]:
prev_start, prev_end = merged[-1]
if start < prev_end:
merged[-1] = (prev_start, max(prev_end, end))
else:
merged.append((start, end))

return len(merged) - 1
</pre>

PromptCode/1

2026-04-20T09:20:55Z

Srakrn:

'''PromptCode challenge:'''

* Given the following code, use an LLM to generate a snippet of code that will function the same.
* You can't cheat, which are basically:
** Feed this code to an LLM and ask it to output the exact same thing.
** Write this code in other languages and ask an LLM to rewrite in Python.
** Prompt LLM the logic of this code line-by-line.
* You can prompt as many time as you want.
** Easy mode: conversation style
** Hard mode: reset to new conversation for every prompt

<pre>
def cg(intervals: list[tuple[int, int]]) -> int:
if len(intervals) <= 1:
return 0

sorted_intervals = sorted(intervals, key=lambda x: (x[0], x[1]))

merged = [sorted_intervals[0]]
for start, end in sorted_intervals[1:]:
prev_start, prev_end = merged[-1]
if start < prev_end:
merged[-1] = (prev_start, max(prev_end, end))
else:
merged.append((start, end))

return len(merged) - 1
</pre>

PromptCode/1

2026-04-20T09:01:45Z

Srakrn:

<pre>
def cg(intervals: list[tuple[int, int]]) -> int:
if len(intervals) <= 1:
return 0

sorted_intervals = sorted(intervals, key=lambda x: (x[0], x[1]))

merged = [sorted_intervals[0]]
for start, end in sorted_intervals[1:]:
prev_start, prev_end = merged[-1]
if start < prev_end:
merged[-1] = (prev_start, max(prev_end, end))
else:
merged.append((start, end))

return len(merged) - 1
</pre>

PromptCode/3a

2026-04-20T08:25:15Z

Srakrn:

<pre>
def f(pairs):
result = {}
for key, value in pairs:
if key not in result:
result[key] = value
return result
</pre>

PromptCode/3a

2026-04-20T08:25:05Z

Srakrn: Created page with "def f(pairs): result = {} for key, value in pairs: if key not in result: result[key] = value return result"

def f(pairs):
result = {}
for key, value in pairs:
if key not in result:
result[key] = value
return result

PromptCode/3

2026-04-20T08:24:41Z

Srakrn: Created page with "<pre> def f(pairs): return dict(reversed(pairs)) </pre>"

<pre>
def f(pairs):
return dict(reversed(pairs))
</pre>

PromptCode/2

2026-04-20T07:58:43Z

Srakrn: Created page with "<pre> def f(numbers): unique = sorted(set(numbers), reverse=True) return unique[1] if len(unique) >= 2 else None </pre>"

<pre>
def f(numbers):
unique = sorted(set(numbers), reverse=True)
return unique[1] if len(unique) >= 2 else None
</pre>