><> (Fish), 171 bytes (3.9% reduction), cracks Generate Parentheses

^{Hover over any symbol to see what it does}

In plaintext:

i>:?v~l2,b2.
10-1<.02}}
:?v~{{l2,06.
v-\&'('o:2*[{1+}]$:
\:?v~$}}&1-b2.
')'/.321o
>:?v;
1+&\&:2*[{1-:}]?v:@&:&l2,-+?!v$
{{&>:?v~}}50ao./~0}]
.61-1&>1-&:2*[{/>1{{69!.|.!7f<

Try it

• Time: 2023-07-26 14:58:41Z (updated 15:42:38)
• Time complexity \$O(n!)\$ (same as cops' answer)

Rust, 184 bytes (4.6% reduction), cracks Generate Parentheses

fn f(z:i32)->Vec<String>{if z<1{vec!["".into()]}else{(0..z).flat_map(|i|->Vec<_>{let b=f(z-i-1);f(i).iter().flat_map(|c|b.iter().map(move|d|format!("({c})")+d)).collect()}).collect()}}

Attempt This Online!

• Time: 2023-07-21 05:06:39Z
• Time complexity \$O(n!)\$ (same as cops' answer)

Python, 122 bytes (1.6% reduction), cracks Edit Distance

lambda a,b:(d:=range(len(b)+1),[d:=[x:=d[(j:=0)]+1]+[x:=1+min(x,d[(j:=j+1)],d[j-1]-(i==k))for k in b]for i in a])and d[-1]

A bit of a cheap crack.

Time: 2023-07-25 02:11:18Z

Python 3, 112 bytes (5% reduction), cracks Simplify Path, 2023-07-20 18:02 UTC

Just some minor golfs like realizing elif isn't needed and tweaking the string used to construct the final output. -1 by The Thonnu

def f(p):
 s=[]
 for x in p.split('/'):
  if x=='..'and s:s.pop()
  if x not in'..':s+=x,
 return'/'+'/'.join(s)

Try it online!

C (GCC), 66 bytes (7.04% reduction), cracks Sum of Scores for buit strings

f(s,l,i)char*s;{for(i=0;s[i]&&s[l+i]==s[i];++i);s=l?i+f(s,l-1):i;}

Attempt This Online!

Based on This C tip from G B

C (GCC), 44 bytes (6.4% reduction), cracks Removing Stars From a String

i;f(char*s){for(i=0;s[i-=*s++-42?0:2]=*s;);}

Attempt This Online!

-2 bytes thanks to c-- (original cop).

I think this involves undefined behavior. I'm not exactly sure. But it works in the exact compiler version.

It doesn't work for empty strings, but the specification says 1 <= s.length <= 10⁵.

• UTC: 2023-07-20 18:38:43Z; 2023-07-21 03:55:34Z
• Time complexity \$O(n)\$ (same as cops' answer)

Go, 168 bytes (2.9% reduction), cracks Count and Say

import."fmt"
func g(n int)string{s:="1"
for;n>1;n--{c,o,f,k:=1,"",rune(s[0]),s[1:]+"_"
for _,r:=range k{if r==f{c++}else{o+=Sprintf("%d%c",c,f);f,c=r,1}}
s=o}
return s}

Attempt This Online!

• Time: 2023-07-20 21:46:57Z
• Time complexity (same as cops' answer)

Python 3, 125 bytes (13% reduction), cracks Longest Substring Without Repeating Characters

def f(s):
 m=x=0;c=set()
 for y in s:
  if y in c:
   while s[x]!=y:c-={s[x]};x+=1
   x+=1
  c|={y};m=max(m,len(c))
 return m

Try it online!

• UTC: 18:40
• Time complexity \$O(n)\$ (same as cops')

Python, 145 bytes (18% reduction), cracks Concatenated Words

lambda z:[i for i in z if any(q&z==q for q in g(i,0))]
def g(a,b=1):
 if b:yield{a}
 for i in range(1,len(a)):
  for j in g(a[i:]):yield{a[:i]}|j

Attempt This Online!

• UTC: 14:39
• Time complexity \$O(n)\$ (same as the cops')

Python, 44 bytes (6.4% reduction), cracks Reverse words in a string

lambda g:print(*filter(str,g.split()[::-1]))

Attempt This Online!

• UTC: 14:04 (updated 14:18)
• Time complexity \$O(n)\$ (same as cops' answer)

Python, 84 bytes (35.4% reduction), cracks ATOI string to integer

lambda s:min(max(L:=-2**31,int([*re.findall("^ *([+-]?\d+)",s),0][0])),~L)
import re

Attempt This Online!

• UTC: 09:28 (updated 09:38)
• Same time complexity as the cops' answer I think.