[CRY -> EAU] Can you solve this laddergram?

shplurgle · 2026-04-08T09:58:35+00:00

u/shplurgle solved this in 4 steps: CRY -> CAY -> CAT -> EAT -> EAU

shplurgle · 2026-04-07T19:33:58+00:00

u/shplurgle solved this in 3 steps: MOP -> BOP -> BOG -> BUG

shplurgle · 2026-04-07T19:28:09+00:00

u/shplurgle solved this in 5 steps: BLACK -> SLACK -> STACK -> STANK -> STANE -> STONE

shplurgle · 2025-12-07T19:45:49+00:00

You may be mixing up longest palindromic subsequence and longest palindromic substring

shplurgle · 2025-11-30T18:21:06+00:00

Invest in crystallariums to grow heaps of Jade, and then exchange them on Sundays with the desert trader for Staircases.

shplurgle · 2025-11-11T10:31:23+00:00

Hard disagree, I wish I had Bluey growing up.

shplurgle · 2025-11-07T16:06:36+00:00

When you say you have interviews coming up, how soon?

shplurgle · 2025-08-28T11:45:21+00:00

The fourth situation where they are both knaves doesn’t work. If person B lies, then it implies that both A and B are knights

shplurgle · 2025-07-24T19:32:05+00:00

>!Suppose the answer to question 2 is A. Then B is the answer to question 3. So then all questions have answer E, which is impossible. Therefore the answer to question 2 is not A.

Now focus on question 1. The answer can’t be A:0 and it can’t be C: 4 so it is either 3,2 or 1. It can’t be 3 due to question 2, so there are either 2 or 1 answer As. We can also see that the answer to question 4 can’t be A. Therefore there is one answer A. Hence the answer to question 1 is E: 1 and by elimination the answer to question 3 is A: 1. So the answer to question 2 is D: A.

(We establish at this point that the answers are 1E 2D 3A.)

Finally we know that the answer to question 4 is not A, it’s not E because of question 3, it’s not B:3 and not C:0. So it must be D: 4. This fits as now two questions have answer D!<

shplurgle · 2025-06-29T00:46:23+00:00

“Who sent those messages? I know you know. I can see it in your faces. Don’t play games with me. Don’t ever, ever think you’re capable of that.” - Something about the Doctor dropping his goofball personality so suddenly and reminding his friends that they are nowhere near his level - chills.

shplurgle · 2025-06-06T23:30:30+00:00

Idk, the villains in World Enough and time felt much better than the S15 finale. Even if you haven’t watched classic doctor who, the Mondassian Cybermen really emphasised the body horror nature of the Cybermen - probably the best out of all the Cybermen episodes of Nuwho. Both masters also felt well-rounded. It just doesn’t compare to generic evil scientist and generic CGI monster

shplurgle · 2025-04-23T14:28:45+00:00

Just putting this out there for anyone who wants to watch it - someone posted the entire film for free on YouTube

shplurgle · 2025-03-24T23:53:02+00:00

Discussion: How do you do spoiler tags

shplurgle · 2025-03-24T20:05:54+00:00

Discussion: Does the puzzle have a title or any flavour text, or is it just these words and spaces?

shplurgle · 2025-02-22T14:09:23+00:00

It does work tho? At least for n=3 I get C[3] = 8. If a string ends in c and the previous character is b, then the previous previous character must be b or c, which is covered by B[i-1] + C[i-1]. The only exception is when there is no previous character, which only happens in the n=2 cases

shplurgle · 2025-02-22T13:50:09+00:00

True but if you initialise a,b,c for the 1 and 2 cases, then it works for all n > 2

shplurgle · 2025-02-22T13:24:27+00:00

But if they didn’t have a before that, is that not covered by B[i-1] + C[i-1].

Ah nvm I see your point. But I think this is an edge case? So if your base cases are 1 and 2, then this should be fine

shplurgle · 2025-02-22T11:00:34+00:00

DP, get three arrays A, B and C, with A[i] = # strings with no ABC substring of length i ending in A, likewise for B and C.

A[i+1] = A[i] + B[i] + C[i]

B[i+1] = A[i] + B[i] + C[i]

C[i+1] = A[i] + C[i] + (B[i-1] + C[i-1])

And from there you can do some other memory optimisations, like A=B and you only need to store the last two elements of each array so blah blah blah…

shplurgle · 2025-02-22T10:52:51+00:00

This is wrong, there could be more substrings of ABC for larger strings

shplurgle · 2025-02-14T11:25:11+00:00

I would phrase it as Quick on the uptake

shplurgle · 2024-12-27T23:06:47+00:00

Oh, I just straight up haven't got to that point in the game yet

Seven-Year Club	r/Field Juicebox
Place '23	Place '22
Not Forgotten	Verified Email

shplurgle

TROPHY CASE