Note: the title was misspelled intentionally.
Given a string s, swap the first vowel runs of every 2 words. For this challenge, y is considered a vowel.
For example, given an input of "great day sir":
1. Input: "gr[ea]t day sir"
2. Identify pairs of words: "[great day] [sir]" (No word for sir ...
Title: Simple encryption for people on a byte budget
Overview
Your goal is to implement RC4 encryption. RC4 encryption, invented by Ron Rivest (of RSA fame), was designed to be secure, yet simple enough to be implemented from memory by military soldiers on the battlefield. Today, there are seve...
Challenge
My challenge, is for you to generate a Menger Sponge based on the level/iteration given. You only need to draw one face, but 3d is also acceptable. You can draw it anyway you want including ASCII, like the examples.
Examples
Input: 0
Output:
*
Input: 1
Output:
***
* *
***
In...
Who doesn't love a good fractal? The Sierpinski Carpet is a classic example of a fractal.
To complete this task, you will be required to generate a carpet of type and print the resulting image to the stdout (see example below for formatting) , representing the level carpet. Steps can be found o...
V, 21 bytes (non-competing)
é*Àñ}yPgvr PGï3pyGHP
Try it online!
Hexdump:
00000000: e92a c0f1 167d 7950 6776 7220 5047 ef33 .*...}yPgvr PG.3
00000010: 7079 4748 50 pyGHP
V is newer than the challenge, so it must be marked as non-competing. But still, it's nice ...
I've never done code golf before, but it looks fun. I have some questions though. Should I learn some golfing languages, or just try some challenges out with the languages I know? (I know C# and Python) Are there any types of challenges I should try first, or should avoid until I'm better? Are th...
I've noticed recently a few challenges were closed as duplicates, but when I visited the page of the duplicate I realized that my answer would be non-competing. Therefore, instead of working tirelessly on an answer that never will be seen, I often opt to just not participate. I've often also seen...
I'm pretty sure this can be written as a couple of lines, but I'm unable to come up with a better solution than this:
package main
import (
"fmt"
"math/big"
)
func colonedSerial(i *big.Int) string {
hex := fmt.Sprintf("%x", i)
if len(hex)%2 == 1 {
hex = "0" + hex
}
...
Adam West passed away, and I'd like to honor his memory here on PPCG, though I doubt he knew of our existence. While there are many, many different things that this man is known for, none are more prominent than his role as the original batman. I'll always remember my step-father still watching t...
A while ago I asked you to write a way to compare python's infinitely nested lists. Haskell doesn't allow self-referential lists like Python, but it does allow infinitely long lists and these are pretty cool too.
Just like python Haskell uses a recursive method to determine if two lists are equa...
