Difference between revisions of "PromptCode/3a"
Jump to navigation
Jump to search
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
| − | + | {{PromptCode Instruction}} | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
<pre> | <pre> | ||
| Line 18: | Line 9: | ||
return result | return result | ||
</pre> | </pre> | ||
| − | |||
| − | |||
| − | |||
| − | |||
Latest revision as of 21:29, 21 April 2026
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.
def f(pairs):
result = {}
for key, value in pairs:
if key not in result:
result[key] = value
return result
