Activity for WheatWizardâ€
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #296463 |
Those only show possible outputs not required outputs. `[0,1]` generates the Fibonnaci numbers, which contains `[34,55]` as a subsequence. This is one of infinitely many possible outputs, I included to highlight that it is permissible to output something like this which is not a subsequence of t... (more) |
— | about 1 month ago |
| Edit | Post #296463 |
Post edited: |
— | about 2 months ago |
| Edit | Post #296463 |
Post edited: |
— | about 2 months ago |
| Edit | Post #296463 | Initial revision | — | about 2 months ago |
| Question | — |
Find the garden of Eden The Fibonacci sequence starts with `[1,1]` and then continues to the right with each number being the sum of the previous number. For example the first 10 terms are `[1,1,2,3,5,8,13,21,34,55]`. We can also extend the sequence to the left, trying to keep the rules consistent. In order for `1` to... (more) |
— | about 2 months ago |
| Edit | Post #296406 |
Post edited: Put the math in a spoiler. |
— | about 2 months ago |
| Comment | Post #296406 |
Fixed. It's a little harder to see the reductions when things are written as `NSEW`. Usually I would write them as `aAbB`. (more) |
— | about 2 months ago |
| Edit | Post #296406 |
Post edited: |
— | about 2 months ago |
| Edit | Post #296406 | Initial revision | — | about 2 months ago |
| Article | — |
Red rover red rover Your national space agency has just landed a rover on Mars, and now you are in charge of controlling it. The rover can move in any of the 4 cardinal directions `N`, `E`, `S`, and `W`. To instruct the rover to move you can do the following: You can send a sequence of moves to be added to the ... (more) |
— | about 2 months ago |
| Comment | Post #296007 |
I think this would be more interesting as an asymptotic rather than on a fixed size. However, asking for an asymptotic analysis of an algorithm is a higher bar to cross. (more) |
— | 5 months ago |
| Edit | Post #295956 |
Post edited: |
— | 5 months ago |
| Edit | Post #295961 | Initial revision | — | 5 months ago |
| Answer | — |
A: Single letter HTML Haskell + hgl, 9 bytes ```txt fe"abipq" ``` Attempt This Online! This is the obvious solution and it's pretty much unbeatable. I also tried this solution avoiding the hardcoded string: 27 bytes ```txt ('x'>)+fe[7,8,15])`: check the input is also less than `'x'`. Obviously th... (more) |
— | 5 months ago |
| Edit | Post #295956 |
Post edited: Fixed strange text placement. |
— | 5 months ago |
| Edit | Post #295956 | Initial revision | — | 5 months ago |
| Question | — |
Identifying returning paths. Let's imagine a point in three dimensional space. We will start it located at \$(0,0,0)\$. Then we will receive a series of instructions. `x`, `y`, and `z` indicate moving unit distance in the positive \$x\$, \$y\$, and \$z\$ directions respectively. The capital letters `X`, `Y`, and `Z` indicate... (more) |
— | 5 months ago |
| Edit | Post #295929 |
Post edited: |
— | 5 months ago |
| Edit | Post #295929 | Initial revision | — | 5 months ago |
| Question | — |
Output a Sturmian sequence A Sturmian sequence is an infinite binary sequence satisfying two properties: It is balanced. This can be stated a number of equivalent ways: There is no pair of equal length subwords whose digit sums differ by 2 or more. There is no string $w$ such that $0w0$ and $1w1$ are both subs... (more) |
— | 5 months ago |
| Edit | Post #295901 |
Post edited: |
— | 5 months ago |
| Comment | Post #295901 |
Good idea. I'll edit that into the challenge. (more) |
— | 5 months ago |
| Edit | Post #295901 | Initial revision | — | 5 months ago |
| Question | — |
Determine if a string is Sturmian A finite binary string is "Sturmian" if for every two contiguous substrings \$x\$ and \$y\$ of the same length, the number of \$0\$s in \$x\$ and \$y\$ differs by at most 1. Your program should take a finite binary string and output one of two distinct values. The first if the input is Sturmia... (more) |
— | 5 months ago |
| Comment | Post #295044 |
@#53890 Yes. Thanks. I corrected that in the SE version of the post but forgot to change it here when I did. (more) |
— | 10 months ago |
| Edit | Post #295044 |
Post edited: |
— | 10 months ago |
| Comment | Post #295044 |
@#53890 Ah thanks. I've gone ahead and given a description first and then in a parenthetical given "maximal" as our shorthand. Maybe this clarifies that. I'm not sure if OP is confused about the definitions of these terms or something else. (more) |
— | 10 months ago |
| Edit | Post #295044 |
Post edited: |
— | 10 months ago |
| Edit | Post #294684 |
Post edited: Add MathJax formatting, fix typo |
— | 10 months ago |
| Comment | Post #295044 |
It is unclear what you are asking for. If you are confused it is more helpful to state what your confusion is rather than the words you are confused by, because I am obviously not confused by those words. (more) |
— | 10 months ago |
| Edit | Post #295044 |
Post edited: |
— | 10 months ago |
| Edit | Post #295044 |
Post edited: |
— | 10 months ago |
| Edit | Post #295044 | Initial revision | — | 10 months ago |
| Question | — |
Fast sampling of special binary strings We are going to define a simple little language. A word in this language is a binary string where the longest run of consecutive \$0\$s, is shorter than every run of $1$s which is not contained within a larger run (a "maximal" run). So for example: \begin{align} 001110111110011 \end{align} wh... (more) |
— | 10 months ago |
| Suggested Edit | Post #294684 |
Suggested edit: Add MathJax formatting, fix typo (more) |
helpful | 10 months ago |
| Comment | Post #294072 |
I don't have a nice answer, but I would argue against option 2. I think we should try to avoid adding special rules to the meta. I don't think it's fun when someone comes up with a shorter answer based on the evocation of an obscure meta post from years back. And unless this is collated into anot... (more) |
— | over 1 year ago |
| Comment | Post #293933 |
I split the first bullet in two, and I rewrote the second with less notation. A function is "from the rational numbers" if it takes rational numbers as its inputs (domain). Sometimes you forget that something is actually jargon ([xkcd](https://xkcd.com/2501/)), so I reworded this. Order equivalen... (more) |
— | over 1 year ago |
| Edit | Post #293933 |
Post edited: Simplify a bit. |
— | over 1 year ago |
| Edit | Post #293933 |
Post edited: |
— | over 1 year ago |
| Edit | Post #293933 |
Post edited: |
— | over 1 year ago |
| Edit | Post #293933 | Initial revision | — | over 1 year ago |
| Question | — |
Show order equivalence between the rationals and the binary fractions Write a function $f$ which takes rational numbers and gives binary fractions (rational numbers whose denominator is a power of two) which is bijective and preserves order. That means: - Different inputs give different outputs. - For every binary fraction $x$ there is a rational number $y$, s... (more) |
— | over 1 year ago |
| Comment | Post #293741 |
Yeah I struggle to think of a scenario in which "code-golf-tips" is anything but the intersection of "code-golf" and "tips". (more) |
— | over 1 year ago |
| Comment | Post #293741 |
I assume the intended usage is to differentiate between tips targeting other types of challenges. On SE they have a couple of questions asking for [tips in restricted source](https://codegolf.stackexchange.com/questions/209734/tips-for-restricted-source-in-python). (more) |
— | over 1 year ago |
| Edit | Post #293295 |
Post edited: Another thought. |
— | over 1 year ago |
| Edit | Post #293295 |
Post edited: Another thought. |
— | over 1 year ago |
| Edit | Post #293295 |
Post edited: Golf. |
— | over 1 year ago |
| Edit | Post #293295 |
Post edited: Golf. |
— | over 1 year ago |
| Edit | Post #293295 |
Post edited: Found the name of the tail map function. |
— | over 1 year ago |
| Edit | Post #293295 | Initial revision | — | over 1 year ago |