diff --git a/project_euler/problem_001/sl1.py b/project_euler/problem_001/sl1.py
new file mode 100644
index 000000000000..eb3bfd2e3d74
--- /dev/null
+++ b/project_euler/problem_001/sl1.py
@@ -0,0 +1,5 @@
+def sol1(n: int = 1000) -> int:
+    return sum(e for e in range(3, n) if e % 3 == 0 or e % 5 == 0)
+
+if __name__ == "__main__":
+    print(f"{sol1() = }")
diff --git a/project_euler/problem_001/sl2.py b/project_euler/problem_001/sl2.py
new file mode 100644
index 000000000000..627558a2faec
--- /dev/null
+++ b/project_euler/problem_001/sl2.py
@@ -0,0 +1,17 @@
+def sol2(n: int = 1000) -> int:
+    total = 0
+    terms = (n - 1)//3
+    total += terms * (2*3 + (terms-1)*3)//2
+    terms = (n-1)//5
+    total += terms * (2*5 + (terms-1)*5)//2
+    terms = (n-1)//15
+    total -= terms * (2*15 + (terms-1)*15)//2
+    return total2
+
+    # remember total of A.P
+    # Sn = terms * (a1 * (terms -1) * d) // 2
+    # terms = (n - 1)//d
+    # a1 is the first multiple of d
+
+if __name__ == '__main__':
+    print(f"{sol2() = }")
diff --git a/project_euler/problem_001/sl4.py b/project_euler/problem_001/sl4.py
new file mode 100644
index 000000000000..3cfc459ab376
--- /dev/null
+++ b/project_euler/problem_001/sl4.py
@@ -0,0 +1,25 @@
+def solution(n: int=1000) -> int:
+    multi_3 = []
+    multi_5 = []
+    temp = 1
+    while True:
+        result = temp * 3
+        if result < n:
+            multi_3.append(result)
+            temp += 1
+        else:
+            temp = 1
+            break
+
+    while True:
+        result = temp * 5
+        if result < n:
+            multi_5.append(result)
+            temp += 1
+        else:
+            break
+    return sum(list(set(multi_3 + multi_5)))
+
+if __name__ == "__main__":
+    print(f"{solution() = }")
+
diff --git a/project_euler/problem_002/s1.py b/project_euler/problem_002/s1.py
new file mode 100644
index 000000000000..65135f1fec71
--- /dev/null
+++ b/project_euler/problem_002/s1.py
@@ -0,0 +1,13 @@
+def solution(n: int=4000000) -> int:
+    fibo_list = []
+    a = 1
+    b = 2
+    while b < n:
+        if b % 2 == 0:
+            fibo_list.append(b)
+        a, b = b, b + a
+    return sum(fibo_list)
+
+if __name__ == "__main__":
+    print(f"{solution() = }")
+
diff --git a/project_euler/problem_004/sl1.py b/project_euler/problem_004/sl1.py
new file mode 100644
index 000000000000..7a672c04b883
--- /dev/null
+++ b/project_euler/problem_004/sl1.py
@@ -0,0 +1,10 @@
+def palindromic(n: int) -> int:
+    max_num = 0
+    for i in range(100, 1000):
+        for j in range(100, 1000):
+            str_ij = str(i*j)
+            if str_ij == str_ij[::-1] and i*j < n:
+                max_num = max(max_num, i*j)
+    return max_num
+
+print(palindromic(30000))
diff --git a/project_euler/problem_004/sl2.py b/project_euler/problem_004/sl2.py
new file mode 100644
index 000000000000..fa329f5f1718
--- /dev/null
+++ b/project_euler/problem_004/sl2.py
@@ -0,0 +1,11 @@
+def solution(n: int) -> int:
+    for i in range(n, 10000, -1):
+        str_num = str(i)
+        if str_num == str_num[::-1]:
+            dividor = 999
+            while dividor != 99:
+                if i%dividor == 0 and len(str(i//dividor)) == 3:
+                    return i
+                dividor -= 1
+
+print(solution(1000000))
diff --git a/project_euler/problem_007/sl1.py b/project_euler/problem_007/sl1.py
new file mode 100644
index 000000000000..9ada192bc016
--- /dev/null
+++ b/project_euler/problem_007/sl1.py
@@ -0,0 +1,25 @@
+import math
+
+def prime_number(number):
+    if 1 < number < 4:
+        return True
+    if number <= 1 or number % 2 == 0 or number % 3 == 0:
+        return False
+    if number > 4:
+        for i in range(5, int(math.sqrt(number)+1), 6):
+            if number % i == 0 or number % (2+i) == 0:
+                return False
+        return True
+
+def solution(n: int = 6) -> int:
+    # 2, 3, 5, 7, 11, 13
+    number_th = 1
+    number = 2
+    while number_th != n:
+        number += 1
+        if prime_number(number):
+            number_th += 1
+    return number
+
+if __name__ == "__main__":
+    print(f"{solution() = }")
diff --git a/project_euler/problem_008/sl1.py b/project_euler/problem_008/sl1.py
new file mode 100644
index 000000000000..4b2604545ff8
--- /dev/null
+++ b/project_euler/problem_008/sl1.py
@@ -0,0 +1,40 @@
+def solution():
+    N = ("73167176531330624919225119674426574742355349194934"
+    "96983520312774506326239578318016984801869478851843"
+    "85861560789112949495459501737958331952853208805511"
+    "12540698747158523863050715693290963295227443043557"
+    "66896648950445244523161731856403098711121722383113"
+    "62229893423380308135336276614282806444486645238749"
+    "30358907296290491560440772390713810515859307960866"
+    "70172427121883998797908792274921901699720888093776"
+    "65727333001053367881220235421809751254540594752243"
+    "52584907711670556013604839586446706324415722155397"
+    "53697817977846174064955149290862569321978468622482"
+    "83972241375657056057490261407972968652414535100474"
+    "82166370484403199890008895243450658541227588666881"
+    "16427171479924442928230863465674813919123162824586"
+    "17866458359124566529476545682848912883142607690042"
+    "24219022671055626321111109370544217506941658960408"
+    "07198403850962455444362981230987879927244284909188"
+    "84580156166097919133875499200524063689912560717606"
+    "05886116467109405077541002256983155200055935729725"
+    "71636269561882670428252483600823257530420752963450")
+
+    max_num = 0
+    list_n = list(N)
+    shift_num = 13
+    end_num = 13
+    len_n = len(list_n)
+    while end_num <= len_n:
+        start_num = end_num - shift_num
+        slice_list = list_n[start_num:end_num]
+        multi = 1
+        for i in range(shift_num):
+            multi *= int(slice_list[i])
+        max_num = max(max_num, multi)
+        end_num += 1
+    return max_num
+
+    
+    
+print(solution())
diff --git a/project_euler/problem_008/sl2.py b/project_euler/problem_008/sl2.py
new file mode 100644
index 000000000000..0ef5d9c38527
--- /dev/null
+++ b/project_euler/problem_008/sl2.py
@@ -0,0 +1,44 @@
+import math
+
+def solution():
+    N = ("73167176531330624919225119674426574742355349194934"
+    "96983520312774506326239578318016984801869478851843"
+    "85861560789112949495459501737958331952853208805511"
+    "12540698747158523863050715693290963295227443043557"
+    "66896648950445244523161731856403098711121722383113"
+    "62229893423380308135336276614282806444486645238749"
+    "30358907296290491560440772390713810515859307960866"
+    "70172427121883998797908792274921901699720888093776"
+    "65727333001053367881220235421809751254540594752243"
+    "52584907711670556013604839586446706324415722155397"
+    "53697817977846174064955149290862569321978468622482"
+    "83972241375657056057490261407972968652414535100474"
+    "82166370484403199890008895243450658541227588666881"
+    "16427171479924442928230863465674813919123162824586"
+    "17866458359124566529476545682848912883142607690042"
+    "24219022671055626321111109370544217506941658960408"
+    "07198403850962455444362981230987879927244284909188"
+    "84580156166097919133875499200524063689912560717606"
+    "05886116467109405077541002256983155200055935729725"
+    "71636269561882670428252483600823257530420752963450")
+    
+    shift_num = 4
+    end_num = 4
+    max_num = 0
+    while end_num <= len(N):
+        start_num = end_num - shift_num
+        multi = 1
+        for number in list(N[start_num:end_num]):
+            multi *= int(number)
+            max_num = max(max_num, multi)
+        end_num += 1
+    return max_num
+
+solution()
+
+
+    
+
+    
+    
+print(solution())
diff --git a/project_euler/problem_020/sl1.py b/project_euler/problem_020/sl1.py
new file mode 100644
index 000000000000..b1ab4fd7b6f3
--- /dev/null
+++ b/project_euler/problem_020/sl1.py
@@ -0,0 +1,2 @@
+hello
+just test
diff --git a/project_euler/problem_022/sl1.py b/project_euler/problem_022/sl1.py
new file mode 100644
index 000000000000..b1ab4fd7b6f3
--- /dev/null
+++ b/project_euler/problem_022/sl1.py
@@ -0,0 +1,2 @@
+hello
+just test