Activity for Shaggy
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #279747 |
And another: https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&code=J1x1MDEwMWMg9SDF6A (more) |
— | almost 4 years ago |
| Comment | Post #279747 |
Here's another: https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&code=I1x1MDEwMA (more) |
— | almost 4 years ago |
| Comment | Post #279747 |
Seeing as you haven't used `5` & `4` yet: https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&code=NdI10jXSNdI10jXSNdI10jXSNdI10jXSNdI10jXSNdI10jXSNdI10jXSNdI10jXSNdI10jXSNdI10jXSNdI10jXSNdI10jXSNdI10jXSNdI10jXSNA (more) |
— | almost 4 years ago |
| Comment | Post #281380 |
[8 bytes](https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&code=o69ZxCDopVg&input=WzMsNyw1LDQsOSwyLDMsMiw2LDZdCi1R) (more) |
— | almost 4 years ago |
| Edit | Post #282202 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Truthify an array Japt `-m`, 8 7 bytes ð òÎmiV Try it ð òÎmiV :Implicit map of each sub-array at 0-based index V ð :Indices of truthy (i.e., non-zero) elements ò :Partition between elements where Î :The sign of their difference is truthy m ... (more) |
— | almost 4 years ago |
| Edit | Post #282201 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Create an Alphabet Diamond Japt `-R`, 11 bytes ;Bå+ mê ê û Test it ;Bå+ mê ê û ;B :Uppercase alphabet å+ :Cumulatively reduce by concatenation m :Map ê : Palindromise ê :Palindromise û :Centre pad e... (more) |
— | almost 4 years ago |
| Edit | Post #282200 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Evaluation order of an APL n-train Japt, 10 bytes o ÅÔò cÔiU Try it o ÅÔò cÔiU :Implicit input of integer U o :Range [0,U) Å :Slice off the first element Ô :Reverse ò :Partitions of length 2 c :Map then flatten Ô ... (more) |
— | almost 4 years ago |
| Edit | Post #279723 | Initial revision | — | over 4 years ago |
| Answer | — |
A: Longest Increasing Subsequence Japt `-h`, 12 bytes à kÈäÎdÄÃmÊñ Try it à kÈäÎdÄÃmÊñ :Implicit input of array à :Combinations k :Remove elements that return true È :When passed through the following function ä : Consecutive pairs ... (more) |
— | over 4 years ago |
| Comment | Post #279450 |
`Õc` with the `-P` flag would work, taking the strings as character arrays. (more) |
— | over 4 years ago |
| Comment | Post #279434 |
Can we take the strings as an array of characters? (more) |
— | over 4 years ago |
| Comment | Post #279287 |
Sometimes it's a hangover from a previous attempt at a solution, @Quintec, other times it's me trying to keep various tricks fresh in my mind and, occasionally, it's just to show off! (more) |
— | over 4 years ago |
| Edit | Post #279289 |
Post edited: |
— | over 4 years ago |
| Edit | Post #279324 |
Post edited: |
— | over 4 years ago |
| Edit | Post #279324 | Initial revision | — | over 4 years ago |
| Answer | — |
A: Tile pyramids on top of each other! Japt `-R`, 12 bytes õÈ"/\\"mpXÃû Try it õÈ"/\\"mpXÃû :Implicit input of integer õ :Range [1,input] È :Map each X "/\\" : Literal string m : Map pX : Repeat X times à :... (more) |
— | over 4 years ago |
| Comment | Post #279203 |
@Corsaka, In Japt you can palindromise with or, by default, without repeating the middle character/element. (more) |
— | over 4 years ago |
| Edit | Post #279284 |
Post edited: |
— | over 4 years ago |
| Edit | Post #279284 |
Post edited: |
— | over 4 years ago |
| Comment | Post #279203 |
[22 bytes](https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&flags=LVI&code=MjfyyG4yOCDHbVgyNy1YLVrDuMPU%2bw) but I'm sure it can be improved further. I wonder would just building the left-hand side and then palindromising work out shorter? (more) |
— | over 4 years ago |
| Edit | Post #279289 | Initial revision | — | over 4 years ago |
| Answer | — |
A: Length of a Sumac Sequence Japt `-N`, 9 bytes ¨T©ÒßVVnU Try it ¨T©ÒßVVnU :Implicit input of integers U & V ¨ :U is >= T : 0 © :Logical AND with Ò :Negate the bitwise NOT of ß :Recursive call with arguments V ... (more) |
— | over 4 years ago |
| Comment | Post #279284 |
Turns out I was slightly overthinking it, @Quintec; a simple map does the trick. (more) |
— | over 4 years ago |
| Edit | Post #279284 |
Post edited: |
— | over 4 years ago |
| Edit | Post #279287 | Initial revision | — | over 4 years ago |
| Answer | — |
A: Partial Sums of Harmonic Series Japt, 11 10 bytes >0©ÒßUÉ/°T Try it >0©ÒßUÉ/°T :Implicit input of integer U >0 :Greater than 0? © :Logical AND with Ò :Negate the bitwise NOT of (i.e., increment) ß :Recursive call with argument UÉ/ ... (more) |
— | over 4 years ago |
| Edit | Post #279284 | Initial revision | — | over 4 years ago |
| Answer | — |
A: Evaluate a single variable polynomial equation Japt `-x`, 6 5 bytes ËVpE Try it ËVpE :Implicit input of array U and float V Ë :Map each element D at 0-based index E : Multiply D by VpE : V raised to the power of E :Implicit output of sum of resulting array (more) |
— | over 4 years ago |