Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Challenges

Post History

80%
+6 −0
Challenges Source with the whole alphabet in order of appearance

Vyxal, 27 bytes QabcdefghijKlmnopqrstUvwxyz Try it Online! Works by exiting straight away. The joys of a language where every letter is a built-in function. Explained QabcdefghijKlmnopqrstUv...

posted 2mo ago by lyxal‭

Answer
#1: Initial revision by user avatar lyxal‭ · 2024-10-18T13:20:19Z (about 2 months ago)
# [Vyxal](https://github.com/Vyxal/Vyxal/tree/version-2), 27 bytes 

```
QabcdefghijKlmnopqrstUvwxyz
```

[Try it Online!](https://vyxal.pythonanywhere.com/?v=2&c=1#WyIiLCIiLCJRYWJjZGVmZ2hpaktsbW5vcHFyc3RVdnd4eXoiLCIiLCIzIl0=)


Works by exiting straight away. The joys of a language where every letter is a built-in function.

## Explained

```
QabcdefghijKlmnopqrstUvwxyz
Q                            # Terminate the program
 a                           # Are any of the items in the (non-existent) input truthy?
  b                          # Convert that to binary
   c                         # Is that in the input?
    d                        # Double the result of that
     e                       # input ** that
      f                      # Flatten into a list of digits
       g                     # Get the smallest digit
        h                    # Push digit[0]
         i                   # and get the inputh digit of that
          j                  # Join the input on the result. This will give a string.
           K                 # All non-empty substrings of the stringthat occur more than once in the string
            l                # Get the pairwise overlaps of that list
             m               # And mirror it
              n              # Push the string "abcdefghijklmnopqrstuvwxyz"
               o             # And remove that from the mirrored list
                p            # Prepend that to the input
                 q           # Surround in backticks, escaping backslashes and existing backticks
                  r          # Does the input contain a regex match of that?
                   s         # Sort that
                    t        # Push that[-1]
                     U       # Uniquify the result
                      vw     # Wrap each item
                        x    # Call this program all over again
                         yz  # Incidentally, this is never executed, but then again, neither is the entire program after the first Q. :p        
```