12:33 AM
Clearly the OP wasn't aware that there are other kinds of literals than string literals
Actually I used the same technique in Factor a while ago
I'm tempted to close it as dupe

CMQ: What hand do you use for writing

Right hand for pencil/mouse/phone, both hands for keyboard

12:52 AM
@Lyxal Usually my right hand, although I use my left when I want to be anonymous

3 hours later…
3:27 AM
@Lyxal Right hand

4:24 AM
0

Three, Three, No code-golf restricted-complexity Given a non-empty sequence of non-negative integers, output any permutation of it in which no two adjacent elements have a sum that is divisible by 3. If it is impossible, either crash the program, return an empty sequence, or output nothing. The ...

@Lyxal My hand

4 hours later…
8:49 AM
@Lyxal Somebody else's hand. I tried printers, but those are too evil.

1 hour later…
9:53 AM
-1

The small code sample 42&x==42 which checks if a certain bit or all bits in a bitmask is set in an int feels like something that should be golf-able, but I'm stuck. Any hints? For large numbers, deduplicating the number should be a win, right? Maybe there's something useful to be done for smaller...

4 hours later…
2:22 PM
3

Consider the sequence \$(a_n)\$ defined in the following way. \$a_0=0\$ For all \$n=1, 2, 3, \dots\$, define \$a_n\$ to be the smallest positive integer such that \$a_n-a_i\$ is not a square number, for any \$0\leq i<n\$ In other words, this is the lexicographically first sequence where no two ...

@NewMainPosts Sandboxed.

2:38 PM
cmc: (interested in how other languages can do this) get the diagonal below the actual diagonal (idk how to put it) so [[0,1,2,3,4],[5,6,7,8,9],[10,11,12,13,14],[15,16,17,18,19],[20,21,22,23,24]] -> [5,11,17,23]

Javascript: a=>a.map((d,i)=>d[i-1]).slice(1)

@rak1507 Scala 3: _.tail.zipWithIndex.map(_(_))
Scala 2: _.tail.zipWithIndex.map(t=>t._1(t._2)) or _.tail.zipWithIndex.map{case(x,i)=>x(i)}

doesn't 0 0⍉1↓⊢ work

Oh, yes.

2:48 PM
or 1 1⍉1↓⊢ in ⎕IO←1

3:19 PM
0

I'm aware that this phenomenon is nothing new, as OEIS Challenges have been around since the beginning of this site. And I also don't think OEIS challenges are necessarily bad. In fact, many of my favorite challenges on this site are just those. But in the past year, I've noticed a large uptick i...

1 hour later…
4:47 PM
@rak1507 Jelly, 3 bytes ŒDṪ

1 hour later…
5:49 PM
0

Let's rise higher! answer-chaining, number, restricted-source (I am posting this challenge in sandbox because this kind of exceptional challenges are often closed, and then downvoted to oblivion, so I want to get your feedback and with kind help you fix the specifications in this challenge, and m...

6:01 PM
0

How to Hash a 2d maze of size less than 10 to maintain state while dfs

6:24 PM

6:46 PM
@RedwolfPrograms why not a=>a.slice(1).map((d,i)=>d[i])?

@Neil Because I'm not as good at golfing as you :p

1 hour later…
8:13 PM
wow I hope that description was worth it

Really interesting challenge, ruined at the last possible moment:
> You may not, at any point in your program, handle integers larger than 18446744073709551615 (2^64), if your language has support for arbitrary-precision integers

8:25 PM
classic

It's always fun to click on a question with <4 or so answers, and start reading. Just the gradual shift from "This seems completely doable" to "Oh, that's why there's only one answer" :P

1 hour later…
9:35 PM
Can I just not read or does "Find the distance of the plane from point A to B" make no sense

@RedwolfPrograms Changing "of" to "on" makes it make sense

Ohh it's talking about plane as in geometry. Kind of confusing when it was a word problem involving a literal airplane :/

9:57 PM
@UnrelatedString I finally figured out what ÐḶ does in Jelly, and it helped me win my own challenge :P

nice
wait it's just that one lol

Yep :P
I found Dennis' old answer and went "Hang on, that'd be super helpful for my narcissistic numbers challenge"

10:50 PM
Man, I have 3 different possible "answers" to an old question, and have to add a note in my answer about them following the written spec, not the sample program provided. 2011 was a wild time for PPCG