Samuel
@samuel.fm
Leetle #7 2/6 14:44
[19 lines]
🟩🟩🟩🟩🟩🟥
🟩🟩🟩🟩🟩🟩
leetle.app
pretty pleased with that one
3 34
David Buchananafter submitting my smart solution I had a great idea for a dumb-but-works solution - iteratively .replace() pairs until the string stops getting shorter, then see if it's empty
1 2Samuellmao that'd do it I guess
1David Buchananyup
Leetle #7 3/6 3:40
[3 lines]
⚠️⚠️⚠️⚠️⚠️⚠️
⌛️⌛️⌛️⌛️⌛️⌛️
🟩🟩🟩🟩🟩🟩
(funnily enough it took me longer to get it right than the "smart" solution)
2
reece.pyLeetle #7 X/6 16:53
🟥🟩🟥🟩🟥🟩
🟥🟩🟩🟩🟥🟥
🟩🟩🟩🟩🟩🟥
🟩🟩🟩🟩🟩🟥
🟥🟩🟥🟩🟥🟩
🟥🟩🟥🟩🟥🟥
terrible. was trying to keep the logic to more-or-less one line lol. took two more tries after this and an interpreter to get the and clause right but i got there with this monstrosity
![Python code:
def solve(s):
st = []
try:
return all(t := [y for y in [(st.append({"(": ")", "[": "]", "{": "}"}[x]) if x in "{([" else st.pop() == x) for x in s] if y is not None]) and (bool(len(t)) or not(s))
except Exception:
return False](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:3aiguoirj6d7junactldeeos/bafkreienol53vpzxhfjnuzql6ybuqnyyvrus5hitqfe7hkggx27cikhcry "Python code:
def solve(s):
st = []
try:
return all(t := [y for y in [(st.append({\"(\": \")\", \"[\": \"]\", \"{\": \"}\"}[x]) if x in \"{([\" else st.pop() == x) for x in s] if y is not None]) and (bool(len(t)) or not(s))
except Exception:
return False")
SlackowLeetle #7 1/6 3:22
[11 lines]
🟩🟩🟩🟩🟩🟩
leetle.app
Leetle - Daily Python Coding Challenge
Like Wordle meets LeetCode!
leetle.app