0
A challenge I thought that would be very cool is to make an interpreter for a Turing-complete language of your choosing.
The rules are simple:
You may use any language to create this interpreter even if it is newer than this challenge.
You may use any Turing-complete language as long as it is ...
There have been a couple of previous attempts to ask this question, but neither conforms to modern standards on this site. Per discussion on Meta, I'm reposting it in a way that allows for fair competition under our modern rulesets.
Background
A palindrome is a string that "reads the same f...
Write a program that produces an output such that:
At least three distinct characters appear.
The number of occurrences of each character is a multiple of 3.
For example, A TEA AT TEE is a valid output since each of the 4 distinct characters, A, E, T and (space), occurs 3 times.
Of course, a...
Javascript, 64 bytes
f=s=>s==[...s].reverse().join``//``nioj.)(esrever.]s...[==s>=s=f
Call function f with string
f("abba") // returns true
f("abab") // returns false
Introduction
Given two sorted arrays of integers X and Y, we can define the spike distance as follows. Both X and Y can have duplicates.
The distance is defined as the minimum cost associated with the transformation of one sorted array X into a sorted array Y by deleting, adding, and moving int...
A quick test in creating GUIDs is like this:
function guid() {
function s4() {
return Math.floor((1 + Math.random()) * 0x10000)
.toString(16)
.substring(1);
}
return s4() + s4() + '-' + s4() + '-' + s4() + '-' + s4() + '-' + s4() + s4() + s4();
}
var i = 1000000
var start ...
0
So, I wrote a simple Javascript game (as yet unnamed) and naturally I wanted to write an API so I could write a bot to play it for me, and naturally I wanted to let the PPCG community have a go for themselves.
It's a 'snake' game with the simple goal of collecting as many blue squares as possibl...
int func(int);
#include <stdio.h>
int main()
{
int number;
printf("Enter Number\n");
scanf("%d",&number);
func(number);
return 0;
}
int func(int num)
{
int counter_var;
for(counter_var=2;counter_var<=num;counter_var++)
{
if(num%counter_var==0)
{
printf("%d\n",counter_v...
Given a pattern (string or array format) of Bits :
[0,1,1,1,0,1,1,0,0,0,1,1,1,1,1,1]
The tasks is to replace any number of consecutive 1-Bits with an ascending number sequence starting at 1.
Input
Pattern (can be received as an string or array) Example:
String: 1001011010110101001
Array: [...
