Solution "Longest Substring Without Repeating Characters" on Leet Code

import string
abc = string.ascii_lowercase
symb = string.punctuation
#Переменные со всеми буквами нижнего регистра
#И вторая - со всеми символами

def is_palindrome(text):
    return text == text[::-1]


something = input("Type some text ")

s1="".join(c for c in something if c.isalpha())
#Попы…

To remove the last word from string we need to follow these steps

1. convert the string to list by using split() function
2. remove the last item from the list
3. convert the list to string

Now let's take apart the code of some of our previous example programs.

The following appeared in the simple examples chapter.

def fact(n)
  if n == 0
    1
  else
    n * fact(n-1)
  end
end
print fact(ARGV[0].to_i), "\n"

Because this is the first explanation, we examine each line individually.