Ad
monkey_on_a_keyboard_1

amogus

among us
amongus
amoügsu
amogus

def is_sussy(s):
    try:
        i=0
        target="sus"
        while i<len(s)-len(target)+1:
            if s[i:i+len(target)].lower()==target:
                return "sus"
            i+=1
        return "not sus"
    except:
        return "ඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞ"
monkey_on_a_keyboard_1vs.monkey_on_a_keyboard_1

closused

ඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞ

Code
Diff
  • def sus():
    acc=[];s="sus";ss="sussy";sss="amogus";i=0
    def among():
        nonlocal acc;nonlocal s;nonlocal i;nonlocal ss;nonlocal sss;acc.append(s if i%5 else ss if i%3 else sss);i+=1
        return " ".join(acc)
    return among
    • def sus():
    • acc=[];s="sus";ss="sussy";i=0
    • acc=[];s="sus";ss="sussy";sss="amogus";i=0
    • def among():
    • nonlocal acc;nonlocal s;nonlocal i;nonlocal ss;acc.append(s if i%3 else ss);i+=1
    • nonlocal acc;nonlocal s;nonlocal i;nonlocal ss;nonlocal sss;acc.append(s if i%5 else ss if i%3 else sss);i+=1
    • return " ".join(acc)
    • return among
monkey_on_a_keyboard_1

closused

closuredsus
closused
closurussed
clossussed
closussuss
sus

⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣤⣤⣤⣤⣤⣶⣦⣤⣄⡀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⣿⡿⠛⠉⠙⠛⠛⠛⠛⠻⢿⣿⣷⣤⡀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⣿⠋⠀⠀⠀⠀⠀⠀⠀⢀⣀⣀⠈⢻⣿⣿⡄⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⡏⠀⠀⠀⣠⣶⣾⣿⣿⣿⠿⠿⠿⢿⣿⣿⣿⣄⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⠁⠀⠀⢰⣿⣿⣯⠁⠀⠀⠀⠀⠀⠀⠀⠈⠙⢿⣷⡄⠀
⠀⠀⣀⣤⣴⣶⣶⣿⡟⠀⠀⠀⢸⣿⣿⣿⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣷⠀
⠀⢰⣿⡟⠋⠉⣹⣿⡇⠀⠀⠀⠘⣿⣿⣿⣿⣷⣦⣤⣤⣤⣶⣶⣶⣶⣿⣿⣿⠀
⠀⢸⣿⡇⠀⠀⣿⣿⡇⠀⠀⠀⠀⠹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠃⠀
⠀⣸⣿⡇⠀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠉⠻⠿⣿⣿⣿⣿⡿⠿⠿⠛⢻⣿⡇⠀⠀
⠀⣿⣿⠁⠀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣧⠀⠀
⠀⣿⣿⠀⠀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⠀⠀
⠀⣿⣿⠀⠀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⠀⠀
⠀⢿⣿⡆⠀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⡇⠀⠀
⠀⠸⣿⣧⡀⠀⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⠃⠀⠀
⠀⠀⠛⢿⣿⣿⣿⣿⣇⠀⠀⠀⠀⠀⣰⣿⣿⣷⣶⣶⣶⣶⠶⠀⢠⣿⣿⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⠀⠀⠀⠀⠀⣿⣿⡇⠀⣽⣿⡏⠁⠀⠀⢸⣿⡇⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⠀⠀⠀⠀⠀⣿⣿⡇⠀⢹⣿⡆⠀⠀⠀⣸⣿⠇⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢿⣿⣦⣄⣀⣠⣴⣿⣿⠁⠀⠈⠻⣿⣿⣿⣿⡿⠏⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠈⠛⠻⠿⠿⠿⠿⠋⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀

def sus():
    acc=[];s="sus";ss="sussy";i=0
    def among():
        nonlocal acc;nonlocal s;nonlocal i;nonlocal ss;acc.append(s if i%3 else ss);i+=1
        return " ".join(acc)
    return among
monkey_on_a_keyboard_1vs.0x0x0x0x

Pyramid of X's

Code
Diff
  • pyramid_of_x = lambda _: 'Not enough building blocks!' if _<True+True else '\n'.join(['*' * _ for _ in range(True, _ + True)])
    • def pyramid_of_x(n):
    • if n < 2:
    • return 'Not enough building blocks!'
    • rows = ['*' * i for i in range(1, n + 1)]
    • return '\n'.join(rows)
    • pyramid_of_x = lambda _: 'Not enough building blocks!' if _<True+True else '\n'.join(['*' * _ for _ in range(True, _ + True)])
monkey_on_a_keyboard_1

susmite ⣿⣿⣿⣿⣿⣿⣿⣿⠟⠋⠁⠄⠄⠄⠄⠄⠄⠄⠄⠙⢿⣿⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⡟⠁⠄⠄⠄⠄⣠⣤⣴⣶⣶⣶⣶⣤⡀⠈⠙⢿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⡟⠄⠄⠄⠄⠄⣸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣆⠄⠈⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⠁⠄⠄⠄⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠄⠄⢺⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⡄⠄⠄⠄⠙⠻⠿⣿⣿⣿⣿⠿⠿⠛⠛⠻⣿⡄⠄⣾⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⡇⠄⠄ ⢹⣿⡗ ⡀⣾⢀⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⡇⠘⠄⠄⠄⢀⡀⠄⣿⣿⣷⣤⣤⣾⣿⣿⣿⣧⢸⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⡇⠄⣰⣿⡿⠟⠃⠄⣿⣿⣿⣿⣿⡛⠿⢿⣿⣷⣾⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⡄⠈⠁⠄⠄⠄⠄⠻⠿⢛⣿⣿⠿⠂⠄⢹⢹⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⡐⠐⠄ ⣰⠄⠞⣾⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⣿⣷⡄⠄⠄ ⢠⣿⣎⣾⣿⣿⣿⣿⣿⣿⣿ ⣿⣿⣿⣿⣿⣿⡿⠟⠛⠄⠄⠄ . ⣵⣿⡿⢹⡟⣿⣿⣿⣿⣿⣿⣿ ⣿⠿⠿⠋⠉⠄⠄⠄⠄⠄⠄⠄⣀⣠⣾⣿⣿⣿⡟⠁⠹⡇⣸⣿⣿⣿⣿⣿⣿ ⠁⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠙⠿⠿⠛⠋⠄⣸⣦⣠⣿⣿⣿⣿⣿⣿⣿

sussy kumite
⣿⣿⣿⣿⣿⣿⣿⣿⠟⠋⠁⠄⠄⠄⠄⠄⠄⠄⠄⠙⢿⣿⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⡟⠁⠄⠄⠄⠄⣠⣤⣴⣶⣶⣶⣶⣤⡀⠈⠙⢿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⡟⠄⠄⠄⠄⠄⣸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣆⠄⠈⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⠁⠄⠄⠄⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠄⠄⢺⣿⣿⣿⣿
⣿⣿⣿⣿⣿⡄⠄⠄⠄⠙⠻⠿⣿⣿⣿⣿⠿⠿⠛⠛⠻⣿⡄⠄⣾⣿⣿⣿⣿
⣿⣿⣿⣿⣿⡇⠄⠄ ⢹⣿⡗ ⡀⣾⢀⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⡇⠘⠄⠄⠄⢀⡀⠄⣿⣿⣷⣤⣤⣾⣿⣿⣿⣧⢸⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⡇⠄⣰⣿⡿⠟⠃⠄⣿⣿⣿⣿⣿⡛⠿⢿⣿⣷⣾⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⡄⠈⠁⠄⠄⠄⠄⠻⠿⢛⣿⣿⠿⠂⠄⢹⢹⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⡐⠐⠄ ⣰⠄⠞⣾⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⣷⡄⠄⠄ ⢠⣿⣎⣾⣿⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⡿⠟⠛⠄⠄⠄ . ⣵⣿⡿⢹⡟⣿⣿⣿⣿⣿⣿⣿
⣿⠿⠿⠋⠉⠄⠄⠄⠄⠄⠄⠄⣀⣠⣾⣿⣿⣿⡟⠁⠹⡇⣸⣿⣿⣿⣿⣿⣿
⠁⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠙⠿⠿⠛⠋⠄⣸⣦⣠⣿⣿⣿⣿⣿⣿⣿

sus=list
Sus=set
suS=tuple
SuS=sorted
def among(us):
    return tuple(sus(us)+SuS(Sus(us)))
amon="\
⣿⣿⣿⣿⣿⣿⣿⣿⠟⠋⠁⠄⠄⠄⠄⠄⠄⠄⠄⠙⢿⣿⣿⣿⣿⣿⣿⣿⣿\n\
⣿⣿⣿⣿⣿⣿⡟⠁⠄⠄⠄⠄⣠⣤⣴⣶⣶⣶⣶⣤⡀⠈⠙⢿⣿⣿⣿⣿⣿\n\
⣿⣿⣿⣿⣿⡟⠄⠄⠄⠄⠄⣸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣆⠄⠈⣿⣿⣿⣿⣿\n\
⣿⣿⣿⣿⣿⠁⠄⠄⠄⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠄⠄⢺⣿⣿⣿⣿\n\
⣿⣿⣿⣿⣿⡄⠄⠄⠄⠙⠻⠿⣿⣿⣿⣿⠿⠿⠛⠛⠻⣿⡄⠄⣾⣿⣿⣿⣿\n\
⣿⣿⣿⣿⣿⡇⠄⠄       ⢹⣿⡗    ⡀⣾⢀⣿⣿⣿⣿⣿⣿\n\
⣿⣿⣿⣿⣿⡇⠘⠄⠄⠄⢀⡀⠄⣿⣿⣷⣤⣤⣾⣿⣿⣿⣧⢸⣿⣿⣿⣿⣿\n\
⣿⣿⣿⣿⣿⡇⠄⣰⣿⡿⠟⠃⠄⣿⣿⣿⣿⣿⡛⠿⢿⣿⣷⣾⣿⣿⣿⣿⣿\n\
⣿⣿⣿⣿⣿⣿⡄⠈⠁⠄⠄⠄⠄⠻⠿⢛⣿⣿⠿⠂⠄⢹⢹⣿⣿⣿⣿⣿⣿\n\
⣿⣿⣿⣿⣿⣿⣿⡐⠐⠄           ⣰⠄⠞⣾⣿⣿⣿⣿⣿⣿\n\
⣿⣿⣿⣿⣿⣿⣿⣷⡄⠄⠄         ⢠⣿⣎⣾⣿⣿⣿⣿⣿⣿⣿\n\
⣿⣿⣿⣿⣿⣿⡿⠟⠛⠄⠄⠄    . ⣵⣿⡿⢹⡟⣿⣿⣿⣿⣿⣿⣿\n\
⣿⠿⠿⠋⠉⠄⠄⠄⠄⠄⠄⠄⣀⣠⣾⣿⣿⣿⡟⠁⠹⡇⣸⣿⣿⣿⣿⣿⣿\n\
⠁⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠙⠿⠿⠛⠋⠄⣸⣦⣠⣿⣿⣿⣿⣿⣿⣿\n"
monkey_on_a_keyboard_1

Suspeak . ’ . : . ● . *: . ‘ ‘ : * . * . * ’ . : ’ ______𐐘𐑀 ____________

speech, except it is sussy
given a string of single space separated "words",
return the string except sustified
susified?
sussed?
idk

. ’ . : . ● . *: . ‘
‘ : * . * . * ’ . : ’
______𐐘𐑀 ____________

🌑🌑🌑🌑🌑🌑🌑🌑🌑🌑🌑 🌑🌑🌑🌔🌕🌕🌕🌘🌑🌑🌑 🌑🌑🌓🌕🌕🌕🌕🌕🌗🌑🌑 🌑🌑🌔🌕🌘🌑🌒🌕🌗🌑🌑 🌑🌑🌕🌘🌑🌑🌑🌒🌖🌑🌑 🌑🌒🌕🌕🌘🌑🌒🌕🌕🌑🌑 🌑🌒🌕🌕🌕🌕🌕🌕🌕🌑🌑 🌑🌒🌕🌕🌕🌕🌕🌕🌕🌑🌑 🌑🌒🌕🌕🌕🌖🌕🌕🌕🌑🌑 🌑🌒🌕🌕🌗🌑🌓🌕🌕🌑🌑 🌒🌕🌕🌕🌗🌔🌕🌕🌕🌑🌑 🌑🌑🌑🌑🌑🌑🌑🌑🌑🌑🌑 

susify = lambda _: " ".join(map(lambda _:_+"sussy" if _[-1].lower() in "aeiou" else _+"ussy",_.split(" ")))
monkey_on_a_keyboard_1

elf

elf

def elf(s):
    "santa"
    pass
monkey_on_a_keyboard_1

half adder

experiment=""
def ad(a,b):
    return (a & b, a ^ b)
monkey_on_a_keyboard_1

pasta

delicious marina sauce

def l():
    return "Did you ever hear the tragedy of Darth Plagueis The Wise? I thought not. It’s not a story the Jedi would tell you. It’s a Sith legend. Darth Plagueis was a Dark Lord of the Sith, so powerful and so wise he could use the Force to influence the midichlorians to create life… He had such a knowledge of the dark side that he could even keep the ones he cared about from dying. The dark side of the Force is a pathway to many abilities some consider to be unnatural. He became so powerful… the only thing he was afraid of was losing his power, which eventually, of course, he did. Unfortunately, he taught his apprentice everything he knew, then his apprentice killed him in his sleep. Ironic. He could save others from death, but not himself."
monkey_on_a_keyboard_1vs.BaRZone

ArraysContainsCommonItem

less space but slow

Code
Diff
  • //Given 2 Arrays, Return True if arrays contain common item, else false.
//e.g a= ['a','b','g','c'] and b =['z','e','c'] returns true
//input : 2 arrays
//output: bool
using System.Collections.Generic;
using System.Linq;

public class Kata
{
  public static bool ContainsCommonItem(char[] a, char[] b)
  {
    if (a==null ||b==null){
      return false;
    }
    for (int i = 0; i < a.Length; i++)
    {
       for (int j=0; j<b.Length; j++){
         if (a[i]==b[j]){
           return true;
         }
       }
    }
    return false;
  }
   
}
    • //Given 2 Arrays, Return True if arrays contain common item, else false.
    • //e.g a= ['a','b','g','c'] and b =['z','e','c'] returns true
    • //input : 2 arrays
    • //output: bool
    • using System.Collections.Generic;
    • using System.Linq;
    • public class Kata
    • {
    • public static bool ContainsCommonItem(char[] a, char[] b)
    • {
    • return a != null ? b != null ? new List<char>(a).Intersect(new List<char>(b)).Count() > 0 : false: false;
    • if (a==null ||b==null){
    • return false;
    • }
    • for (int i = 0; i < a.Length; i++)
    • {
    • for (int j=0; j<b.Length; j++){
    • if (a[i]==b[j]){
    • return true;
    • }
    • }
    • }
    • return false;
    • }
    • }
monkey_on_a_keyboard_1vs.monkey_on_a_keyboard_1

where were u wen codewar die?

Code
Diff
  • def where(thing="codewar",home="home",food="doorito",phone="phone"):
    return f"where were u wen {thing} die?\ni was at {home} eatin {food} wen {phone} ring\n\"{thing} is kil\"\n\"no\""
    
    
    
    
    
    
    
    
    
    
    
    
    pass
    • i_was_at_home_makin_kumite = lambda when_phone_ring: None
    • def codewar_is_kil(no):
    • def where(thing="codewar",home="home",food="doorito",phone="phone"):
    • return f"where were u wen {thing} die?\ni was at {home} eatin {food} wen {phone} ring\n\"{thing} is kil\"\n\"no\""
    • pass
monkey_on_a_keyboard_1

where were u wen codewar die

i_was_at_home_makin_kumite = lambda when_phone_ring:                                None 
def codewar_is_kil(no):
    
    
    
    
    
    
    
    
    
    
    
    
    pass
monkey_on_a_keyboard_1vs.sreekarthi47

Permutations

Code
Diff
  • def rec(pre,post,st):
    if pre==[]:
        st.add(tuple(post))
        return
    else:
        i=0
        while i<len(pre):
            rec(pre[0:i]+pre[i+1:],[pre[i]]+post,st)
            i+=1
        return
    
def all_permutations(lst):
    s=set()
    rec(lst,[],s)
    return s
    • from itertools import permutations
    • all_permutations = lambda lst: list(permutations(lst))
    • def rec(pre,post,st):
    • if pre==[]:
    • st.add(tuple(post))
    • return
    • else:
    • i=0
    • while i<len(pre):
    • rec(pre[0:i]+pre[i+1:],[pre[i]]+post,st)
    • i+=1
    • return
    • def all_permutations(lst):
    • s=set()
    • rec(lst,[],s)
    • return s
monkey_on_a_keyboard_1

decimal to binary

def binary(n):
    acc=[]
    while n:
        if n%2:
            acc=["1"]+acc
        else:
            acc=["0"]+acc
        n=n//2
    return "".join(acc)
monkey_on_a_keyboard_1

value of binary string

def value(s):
    curr=2**(len(s)-1)
    i=0
    acc=0
    while i<len(s):
        if s[i]=="1":
            acc+=curr
        curr=curr//2
        i+=1
    return acc
Loading more items...