Mattia Spadoni

input: '' blank: '0' start state: A table: A: 0: {write: 1, R: B} 1: {write: 1, R: D} B: 0 : {write: 1, R: C} C: 0 : {write:...


2 different ways: The first one is developed on my own, after a discussion with @mangiafrangette I understand that my code is too long and too complicated. So I've tried...

It's quite late, I don't have the energy to put also all the test structure. 

linear_search(list(["Coraline", "American Gods", "The Graveyard Book", "Good Omens", "Neverwhere"]), "The Sandman") #now we define the Algorithm , we are looking for the book "The Sandman" in a list for position,...

I have to check it on Pycharm, increasing n is a quite problematic about the computational work. I've written 44 as input of "cosalunga" on pycharm and I'm still waiting...

set_hobbit = set({"Frodo", "Sam", "Pippin", "Merry"}) set_magician = set({"Saruman", "Gandalf"}) #quest Create a dictionary with 2 key: "hobbit" and "magician" that contain the proper values lotr = dict() lotr["hobbits"] =...

All true, I was stack in the temptative of doing this thing with another way, but I'm not able to solve a problems with variables. 

I cannot understand why Github don't write the indentation in this case. def test(input_list, expected): result = createstuck(input_list) if expected == result: return True else: return False from collections import...

#Theoden: so, it begins sauron._set({"Bilbo", "Frodo", "Pippin", "Sam", "Merry"}) Actions: my_set.remove("Bilbo"), ​my_set.add("Galadriel"), ​my_set.update(set({"Saruman", "Frodo", "Gandalf"})) #first step: sauron_set.remove("Bilbo") sauron._set({"Frodo", "Pippin", "Sam", "Merry"}) #second step ​sauron_set.add("Galadriel") sauron._set({"Frodo", "Pippin", "Sam", "Merry", "Galadriel"})...