Activity for Shaggy
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #293100 | Initial revision | — | 8 days ago |
| Answer | — |
A: Find all unique quintuplets in an array that sum to a given target Japt, 12 bytes Outputs an empty array if no solution is possible. Íà5 â fÈx ¶V Try it Íà5 â fÈx ¶V :Implicit input of array U & target integer V Í :Sort U à5 :Combinations of length 5 â :Deduplicate f ... (more) |
— | 8 days ago |
| Edit | Post #292944 | Initial revision | — | about 1 month ago |
| Answer | — |
A: Display a Progress Bar Japt, 18 bytes "[{/V50 ç| ú-50}] Try it (more) |
— | about 1 month ago |
| Comment | Post #292920 |
I would suggest instead allowing solutions to round `.5` to whatever the built-in they're using defaults to. The crux of the challenge here is constructing the progress bar; requiring the numbers be rounded in a way that may not be a language's native way of doing so adds, I think, an unnecessary pot... (more) |
— | about 2 months ago |
| Edit | Post #292866 |
Post edited: |
— | about 2 months ago |
| Edit | Post #292866 |
Post edited: |
— | about 2 months ago |
| Comment | Post #284201 |
You can save 2 bytes by ditching the `,y` from the function parameters. But, as you're using recursion, you'll need to include the `f=` in your byte count, negating that saving! (more) |
— | about 2 months ago |
| Comment | Post #285147 |
https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&code=O0JnNG1VbiCkzaT5VDggcVQgzso&input=WwpBOiAiMC4wLjAuMCIKQTogIjEyNy4yNTUuMjU1LjI1NSIKQjogIjEyOC4wLjAuMCIKQjogIjE5MS4yNTUuMjU1LjI1NSIKQzogIjE5Mi4wLjAuMCIKQzogIjIyMy4yNTUuMjU1LjI1NSIKRDogIjIyNC4wLjAuMCIKRDogIjIzOS4yNTUuMjU1LjI1NSIKRTogIjI0M... (more) |
— | about 2 months ago |
| Edit | Post #292866 | Initial revision | — | about 2 months ago |
| Answer | — |
A: Find the IP address class Japt, 15 bytes Port of m90's JS solution, until I manage to come up with something shorter. ;Bg7^Mm8|#ÿ^3îU Try it (more) |
— | about 2 months ago |
| Edit | Post #292841 |
Post edited: |
— | 2 months ago |
| Edit | Post #292841 |
Post edited: |
— | 2 months ago |
| Edit | Post #292841 |
Post edited: |
— | 2 months ago |
| Edit | Post #292841 |
Post edited: |
— | 2 months ago |
| Edit | Post #292841 |
Post edited: |
— | 2 months ago |
| Edit | Post #292841 | Initial revision | — | 2 months ago |
| Answer | — |
A: Source with the whole alphabet in order of appearance Japt, 26 bytes aBcDeFgHiJkLmNoPqRsTuVwXyZ Try it Trivial Solution, 26 bytes ABCDEFGHIJKLMNOPQRSTUVWXYZ Try it Explanations In the first solution each lowercase letter is a method that gets applied to its preceding uppercase letter, which is a predefined variable (except `... (more) |
— | 2 months ago |
| Edit | Post #292361 |
Post edited: |
— | 2 months ago |
| Comment | Post #291048 |
May we use lowercase instead of uppercase? (more) |
— | 2 months ago |
| Comment | Post #291891 |
Do we have consensus here as to whether solitions can be scored in bits? (more) |
— | 3 months ago |
| Edit | Post #292743 | Initial revision | — | 3 months ago |
| Answer | — |
A: Multiplicative perfection JavaScript, 36 bytes n=>n==(g=d=>--d?(n%d?1:d)g(d):1)(n) Try it online! (more) |
— | 3 months ago |
| Edit | Post #292742 | Initial revision | — | 3 months ago |
| Answer | — |
A: Multiplicative perfection Japt v1.4.5, 4 bytes ¶â¬× Try it ¶â¬× :Implicit input of integer ¶ :Is equal to ⬠:Proper divisors × :Reduced by multiplication (more) |
— | 3 months ago |
| Comment | Post #292696 |
Using the term "proper divisors" rather than "strict factors" would make this challenge clearer. (more) |
— | 3 months ago |
| Edit | Post #292361 |
Post edited: |
— | 4 months ago |
| Edit | Post #292362 |
Post edited: |
— | 4 months ago |
| Edit | Post #292362 | Initial revision | — | 4 months ago |
| Answer | — |
A: How many odd digits? JavaScript, 25 bytes Input as an array of digits a=>a.map(x=>t+=x%2,t=0)|t Try it online! 26 bytes With input as a string (or an array of digit strings). f=([d,...a])=>d?d%2+f(a):0 Try it online! (more) |
— | 4 months ago |
| Edit | Post #292361 | Initial revision | — | 4 months ago |
| Answer | — |
A: How many odd digits? Japt `-mx`, 2 1 byte u Try it u :Implicit map of input array u :Modulo 2 :Implicit output of sum of resulting array (more) |
— | 4 months ago |
| Comment | Post #292354 |
Any restrictions on the input format? Can we take an array of digits, for example? (more) |
— | 4 months ago |
| Comment | Post #291568 |
Your solution must output infinitely, without taking any input. Also, hardcoded input isn't permitted. (more) |
— | 4 months ago |
| Edit | Post #292279 | Initial revision | — | 4 months ago |
| Answer | — |
A: Fibonacci without consecutive digits Japt, 17 bytes 0-indexed gU²o!gM fÈì äa eÉ Try it 15 bytes 1-indexed @µXì äa eÉ}f!gM Try it (more) |
— | 4 months ago |
| Comment | Post #291018 |
Could you add some test cases and a worked example, please? (more) |
— | 4 months ago |
| Comment | Post #292000 |
I'd suggest loosening up the requirements for the colour inputs to allow for, for example, RGB and hex values. (more) |
— | 4 months ago |
| Edit | Post #292266 | Initial revision | — | 4 months ago |
| Answer | — |
A: Substring factor JavaScript, 42 bytes s=>(g=n=>--n&&s.includes(s%n?g:n)|g(n))(s) Try it online! (more) |
— | 4 months ago |
| Edit | Post #291900 |
Post edited: |
— | 4 months ago |
| Comment | Post #291889 |
This is sequence [A003215](https://oeis.org/A003215) (more) |
— | 4 months ago |
| Edit | Post #292259 | Initial revision | — | 4 months ago |
| Answer | — |
A: Substring factor Japt v1.4.5, 7 bytes â¬d!øUs Try it â¬d!øUs :Implicit input of integer U ⬠:Divisors, excluding itself d :Are any !ø : Contained in Us : The string representation of U Or, if we could simply output truthy or fal... (more) |
— | 4 months ago |
| Edit | Post #291900 | Initial revision | — | 6 months ago |
| Answer | — |
A: Hex detector Japt `-d`, 8 bytes °U3¥NÉ Try it 9 bytes NøT±1wU6 Try it (more) |
— | 6 months ago |
| Comment | Post #288502 |
I think this would benefit from reiterating the last bullet point from the "Output" section in the "Equivalence" section. On first read through, I wasn't 100% clear on whether we needed to handle rotations, etc. (more) |
— | over 1 year ago |
| Edit | Post #288561 | Initial revision | — | over 1 year ago |
| Answer | — |
A: Efficient censorship Japt `-h`, 7 bytes à ñÊkøV Try it à ñÊkøV :Implicit input of strings U=X & V=Y à :Powerset of U ñ :Sort by Ê : Length k :Remove elements that øV : Contain V :Implicit output of last eleme... (more) |
— | over 1 year ago |
| Edit | Post #287337 |
Post edited: |
— | over 1 year ago |