hi, i am going to ask a very XY question, but i'm asking it because i'm asking for help on an algorithm i made up, i don't want a "good" algorithm cause then i'm not learning anything, right
So i need to see if a string has doubled letters in it. So far I have {⍺(2-/⍵)}⌸ 'aabcca'
the objective being, if there's any ¯1s in there, the letter is doubled
I've been trying to make a fibonnacci function, you give it a list starting with 2 fibonnacci numbers (like ⍳10) and the starting position for it to continue the sequence
I dont think you understand the problem then... uh
> [The string passes if] It contains a pair of any two letters that appears at least twice in the string without overlapping, like xyxy (xy) or aabcdefgaa (aa), but not like aaa (aa, but it overlaps).