PromptCode/1 - Revision history

Srakrn at 14:28, 21 April 2026

2026-04-21T14:28:42Z

Srakrn at 09:28, 21 April 2026

2026-04-21T09:28:07Z

Srakrn at 09:23, 20 April 2026

2026-04-20T09:23:37Z

Srakrn at 09:20, 20 April 2026

2026-04-20T09:20:55Z

Srakrn at 09:01, 20 April 2026

2026-04-20T09:01:45Z

Srakrn: Created page with "

 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]))..."

2026-04-20T07:54:54Z

Created page with "<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]))..."

New page

<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: # strictly less: touching intervals are NOT merged
merged[-1] = (prev_start, max(prev_end, end))
else:
merged.append((start, end))

return len(merged) - 1
</pre>

← Older revision		Revision as of 14:28, 21 April 2026
Line 1:		Line 1:
	{{PromptCode Instruction}}		{{PromptCode Instruction}}
		+
		+	(Difficulty: hard)

	<pre>		<pre>

@@ Line 1: / Line 1: @@
-'''PromptCode challenge:'''
+{{PromptCode Instruction}}
 <pre>
@@ Line 15: / Line 6: @@
          return 0
-     sorted_intervals = sorted(intervals, key=lambda x: (x[0], x[1]))
+     sorted_intervals = sorted(intervals)
      merged = [sorted_intervals[0]]

@@ Line 8: / Line 8: @@
 * You can prompt as many time as you want.
 ** Easy mode: conversation style
-** Hard mode: reset to new conversation for every prompt
+** Hard mode: reset to new conversation or 'edit' the message sent to LLM for every prompt
 <pre>

← Older revision		Revision as of 09:20, 20 April 2026
Line 1:		Line 1:
		+	'''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>		<pre>
	def cg(intervals: list[tuple[int, int]]) -> int:		def cg(intervals: list[tuple[int, int]]) -> int:

@@ Line 9: / Line 9: @@
      for start, end in sorted_intervals[1:]:
          prev_start, prev_end = merged[-1]
-         if start < prev_end:  # strictly less: touching intervals are NOT merged
+         if start < prev_end:
              merged[-1] = (prev_start, max(prev_end, end))
          else: