[ Сураба 🦀]

Welcome to a tutorial series covering how to do reinforcement learning with the Stable Baselines 3 (SB3) package. The objective of the SB3 library is to be for reinforcement learning like what sklearn is for general machine learning.

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

print(is_palindrome("madam"))  # True
print(is_palindrome("hello"))  # False

def factorial(n):
    if n == 0 or n == 1:
        return 1
    return n * factorial(n - 1)

print(factorial(5))  # 120

dict1 = {'a': 1, 'b': 2}
dict2 = {'c': 3, 'd': 4}

# Method 1 (Python 3.5+)
merged_dict = {**dict1, **dict2}

# Method 2 (Python 3.9+)
merged_dict = dict1 | dict2

print(merged_dict)

list1 = [1, 2, 3, 4]
list2 = [3, 4, 5, 6]

intersection = list(set(list1) & set(list2))
print(intersection)  # [3, 4]

even_numbers = [i for i in range(1, 101) if i % 2 == 0]
print(even_numbers)

def longest_word(sentence):
    words = sentence.split()
    return max(words, key=len)

print(longest_word("Python is a powerful language"))  # "powerful"

from collections import Counter

my_list = [1, 2, 2, 3, 3, 3, 4]
frequency = Counter(my_list)
print(frequency)  # Counter({3: 3, 2: 2, 1: 1, 4: 1})

def remove_duplicates(lst):
    return list(dict.fromkeys(lst))

my_list = [1, 2, 2, 3, 4, 4, 5]
print(remove_duplicates(my_list))  # [1, 2, 3, 4, 5]

class Node:
    def __init__(self, data):
        self.data = data
        self.next = None

def reverse_linked_list(head):
    prev = None
    current = head
    while current:
        next_node = current.next
        current.next = prev
        prev = current
        current = next_node
    return prev

# Create linked list: 1 -> 2 -> 3
head = Node(1)
head.next = Node(2)
head.next.next = Node(3)

# Reverse and print the list
reversed_head = reverse_linked_list(head)
while reversed_head:
    print(reversed_head.data, end=" -> ")
    reversed_head = reversed_head.next

def binary_search(arr, target):
    low, high = 0, len(arr) - 1
    while low <= high:
        mid = (low + high) // 2
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            low = mid + 1
        else:
            high = mid - 1
    return -1

print(binary_search([1, 2, 3, 4, 5, 6, 7], 4))  # 3