words per minute
23
Zaphod_Beeblebrox
00:00
Speed
def fibonacci(n):
if n <= 0:
return []
elif n == 1:
return [0]
elif n == 2:
return [0, 1]
sequence = [0, 1]
for i in range(2, n):
sequence.append(sequence[-1] + sequence[-2])
return sequence
class Example:
def init(self, value: int):
self.value = value
def increment(self):
self.value += 1
def __str__(self):
return f"Value: {self.value}"
if name == "main":
print("Python typing practice!")
print("Operators: + - * / // % ** @")
print("Comparison: == != < > <= >=")
print("Logical: and or not")
print("Bitwise: & ^ ~ << >>")
print("Membership: in, not in")
print("Identity: is, is not")
print("Assignment: = += -= *= /= %= //= **= &= = ^= >>= <<= @=")
example = Example(10)
print(example)
example.increment()
print(example)
try:
result = 10 / 0
except ZeroDivisionError as e:
print(f"Error: {e}")
finally:
print("Execution complete.")
with open("sample.txt", "w") as f:
f.write("Hello, world!\n")
words = ["apple", "banana", "cherry"]
for word in words:
print(word.upper())
numbers = {x: x ** 2 for x in range(10)}
print(numbers)
lambdas = lambda x: x * 2
print(lambdas(5))
import math
print(math.sqrt(25))
from collections import deque
queue = deque([1, 2, 3])
queue.append(4)
queue.popleft()
print(queue)