testcase: (input \n output)
[1, 2, 2, 1, 1, 2, 3, 2, 3, 3, 2, 1, 1]
[1, 0, -1, 0, 1, 1, -1, 1, 0, -1, -1, 0]

lambda x:map(lambda a,b:a-b,x[1:],x[:-1])

Python: f=lambda a,*b:b and(b[0]-a,)+f(*b)

Python:  f=lambda a,*b:b and(b[0]-a,)+f(*b)
Haskell: f(a:b)|null b=[]|1<2=[head b-a]++f(b)

Pyth:    -Vt
Python:  f=lambda a,*b:b and(b[0]-a,)+f(*b)
Haskell: f(a:b)|null b=[]|1<2=[head b-a]++f(b)

lambda n:sum(a==b for a,b in zip(`n`,`n`[1:]))

sqVtzz

f(x:y)|null y=0|head y==x=1+f(y)|1<2=f(y)
g(n)=f(show n)

void main(){
    int length = 10;
    const char *names[length + 1];
    char test = 'a';
    char *a = &test;
    for (int i = 0; i < length; i++){
        names[i] = a;
    }
    printf("%s", names[4]);
}

for(var _loop = 0; _loop < 4; _loop++)
	for(var _loop = 0; _loop < 5; _loop++)
	console.log("Hello"), " World"

for(var _loop = 0; _loop < 5; _loop++)
	console.log("Hello");
for(var _loop = 0; _loop < 4; _loop++)
	console.log(" World")