Draft: Given a character, output whether it is in the Jelly code page or not

I smell some potential bias in which languages get the advantage here.

BRB adding jelly's codepage to yuno

→ 10 messages moved to The Nineteenth Byte

Thanks!

Draft - Tarpits: Reverse a simple, unidimensional list.

Draft - Tarpits: Modulus. Given n,m → n%m.

@hyper-neutrino I think 2 languages have an advantage here :P

true :P

Draft: Increment every element in the list before or after a zero. (If before & after a zero, you may choose whether to increment once or twice.)

Draft: Output a magic square with the input number in one of the cells.

Draft: Match parens greedily and output everything within matched parens. (6 (1 (3 5))(7 8) 11→1 3 5 7 8

@AviFS It's unclear how you're handling spaces

@Bubbler Good point, I've no idea why I put them in

REDO

Draft: Match parens greedily and output everything within matched parens. (6(1(35))(78)9→13578

Draft: Given an alphabetic string and a boolean list of the same length, uppercase or lowercase each letter accordingly. "Hello", 0 1 1 0 1 -> "hELlO"

Draft: First n terms of 1, 2, 1, 2, 3, 2, 3, 4, 3, 4, 5, 4, ... which has a pattern of [1, 2, 1], [2, 3, 2], ...

Draft: First n terms of 1, 2, 3, 2, 3, 4, 3, 4, 5, 4, 5, 6, ... which has a pattern of [1, 2, 3], [2, 3, 4], [3, 4, 5], ... :P

Draft: Rail fence cipher encoder for rail size 3 (take a string and output the encoded string)

Draft: Given a string, output which-th time each character is appearing in that string. "abracadabra" -> 1, 1, 1, 2, 1, 3, 1, 4, 2, 2, 5

^ any idea for better wording?

Draft (inspired by a builtin I just added to my Jelly fork): Given a list (even length) of integers, split into consecutive pairs, sort each pair by its sum, then flatten. e.g. [2,3,6,4,2,1] -> [[2,3],[6,4],[2,1]] -> [[2,1],[2,3],[6,4]] -> [2,1,2,3,6,4]

@Bubbler I'm sure this is a challenge on main, that might have a better wording

It's something like "count occurrences in each prefix"

Draft: Given N (0- or 1-indexed), output the Nth element of this sequence:

""
\"""\"
\"\\"""\\"\"
\"\\"\\\\"""\\\\"\\"\"
\"\\"\\\\"\\\\\\\\"""\\\\\\\\"\\\\"\\"\"

That's kinda weird escaping scheme :P

Brownie points to whoever finds the 7-byte Pip answer. ^_^

Draft: Given a rectangular 2D string of odd width and height, place the character X at the center.

@Bubbler That's actually more difficult than I expected

@AviFS Will there ever be consecutive zeros?

@DLosc Great question! I didn't intend for that to ever happen, so no. You'll only receive valid input where valid means no consecutive zeroes. But you're of course welcome to also submit a clever solution which takes care of that edge case.

If it does take care of that case, I'd say the two reasonable outcomes are that both zeroes are incremented, or neither are. I suppose that's sort of obvious, though.

@Bubbler I gave this a shot in Jelly, and it found a case where ḋ<link> acts differently to ×<link>S :P

Draft: Map a direction String to the respective on the numpad.

upleft     up       upright
left       center   right
downleft   down     downright

the directions will be separated by spaces

Draft closed.