Timeline for Maximum summed subsequences with non-adjacent items
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 25, 2024 at 23:13 | comment | added | Kevin Cruijssen | æ€ι€`ê¦ΣO}θ - 11 bytes porting Shaggy's Japt answer. | |
| Apr 17, 2019 at 17:00 | history | edited | Emigna | CC BY-SA 4.0 | deleted 89 characters in body |
| Apr 17, 2019 at 17:00 | comment | added | Emigna | @KevinCruijssen: Oh yeah! For some reason I had convinced myself I needed a repeat element at the end. Thanks! | |
| Apr 17, 2019 at 16:40 | comment | added | Kevin Cruijssen | You may not be happy, but it's still 4 bytes shorter than my initial solution. ;) And you can golf 1 more changing ¤ª to Ć. | |
| Apr 17, 2019 at 14:39 | history | answered | Emigna | CC BY-SA 4.0 |