very average-to-simple 6 kyu imo. you might just be stuck. (not saying this to be an ass -- just, if it helps, you might be overthinking it and there are simple solutions.)

reference solution sometimes returns No decreasing sequence for the longest increasing subsequence method, and sometimes returns No increasing sequence for the longest decreasing subsequence method.

this is unintelligible.

this one is an absolute beast. it has kicked me in the pants at least five times now, causing me to scrap refactoring and start fresh again and again. i wish i had to mark this comment as including spoiler content lol. but it's just a note of desperation.

yes. apparently the tests don't catch O(n^2) solutions despite the description.

100%. there are plenty of unoriginal, poorly constructed/described/tested katas on here. this is clearly not one of them. it's a disservice to the community and the authors not to differentiate the good stuff from the bad by voting rationally.

man, this isn't your daddy's 6 kyu kata lol. good one tho.

test fails with 'Issue with shared date of birth' message for inputs:

[('Urma', '2002-03-06'), ('Victor', '2002-03-06'), ('Xavier', '2004-03-01')] , '2022-12-31'

Urma and Victor have the same birthdate (and more weekend birthdays than Xavier). according to the kata description, the tests should accept either Urma or Victor, but they reject Victor.

These goals are not mutually exclusive. Exactly the opposite in most practical cases.

Lots of fun, this one. Much appreciated.

Welp, I feel like an idiot.

Your encoder is giving the correct index for 'ATTACK APPROVED', in case that helps.