def coin_change_breadth_first(N,C):
    D = {0: []}
    S = {0}
    while S and not N in S:
        _S = set()
        for n in S:
            for c in C:
                if n+c <= N and not n+c in S:
                    _S.add(n+c)
                    D[n+c] = D[n]+[c]
        S = _S
    if N in S:
        return D[N]
    return None   

def DPChange(m,C):
    bestNumCoins = [m+1 for i in range(m+1)]
    bestNumCoins[0] = 0
    for i in range(1,m+1):
        for c in C:
            if i-c >= 0 and bestNumCoins[i-c]+1 < bestNumCoins[i]:
                bestNumCoins[i] = bestNumCoins[i-c] + 1
    return bestNumCoins

# Find starting indeces of short in long
# e.g.: findSubsequence([2,3],[1,2,3,4,2,3]) -> [1,4]
def findSubsequence(short,long):
    states = [(0,0)]
    indices = []
    for i in range(len(long)):
        _states = []
        for j,k in states:
            if long[i] == short[k]:
                if k == len(short)-1:
                    indices.append(j)
                else:
                    _states.append((j,k+1))
        _states.append((i+1,0))
        states = _states
    return indices
 
def findSubsequenceNaive(short,long):
    indices = []
    for i in range(len(long)-len(short)+1):
        if all(long[i+j]==short[j] for j in range(len(short))):
            indices.append(i)
    return indices
 
def hasSubsequenceNaive(short,long):
    return any(all(long[i+j]==short[j] \
        for j in range(len(short))) \
            for i in range(len(long)-len(short)+1))
 
 
from random import randint
 
def buildTestData(n,k,r):
    long = [randint(1,r) for i in range(n)]
    short = [randint(1,r) for i in range(k)]
    return short,long
 
from timeit import timeit
 
short, long = buildTestData(10000,10,2)
 
for f in [findSubsequenceNaive,hasSubsequenceNaive,findSubsequence]:
    t=timeit(f"f(short,long)",globals=globals(),number=100)
    print(f"{f.__name__:20} took {t:.3f}s to calculate {f(short,long)}")
 
 
findSubsequenceNaive took 23.584s to calculate [1436, 1472, 3276, 4921, 5229, 6539, 7977, 8191, 8625, 8689, 8739]
hasSubsequenceNaive  took 5.194s to calculate True
findSubsequence      took 2.160s to calculate [1436, 1472, 3276, 4921, 5229, 6539, 7977, 8191, 8625, 8689, 8739]

//
// move_window.c - Move a console window to specific
// screen coordinates.
//
// Written by Ted Burke - last modified 17-4-2012
//
// To compile: gcc -o move_window.exe move_window.c
//
 
#define WINVER 0x0500
#include <windows.h>
 
int main (void)
{
    // Get console window handle
    HWND wh = GetConsoleWindow();
 
    // Move window to required position
    MoveWindow(wh, 100, 100, 640, 250, TRUE);
}
 

def is_sub_sequence(short,long):
    i,j = 0,0
    while i < len(short):
        if j >= len(long):
            return False
        if short[i] == long[j]:
            i += 1
        j += 1
    return True
 
def is_sub_sequence_iter(short,long):
    long_iter = iter(long)
    for i in short:
        b = False
        for j in long_iter:
            if i == j:
                b = True
                break
        if not b:
            return False
    return True
 

ws.append([zä2]+langlist) # Hängt zä2 vor die langlist
# ist etwas völlig anderes als das unsinnige
ws.append(zä2+langlist) # Versucht eine Liste zu einer Zahl zu addieren

ws.append([zä2]+langlist)