From bdbe42ae229490de07ee7f912c25fb028cea2914 Mon Sep 17 00:00:00 2001
From: "pre-commit-ci[bot]"
 <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Date: Thu, 3 Oct 2024 17:58:21 +0000
Subject: [PATCH] [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci
---
 dynamic_programming/longest_arithmetic_subsequence.py | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/dynamic_programming/longest_arithmetic_subsequence.py b/dynamic_programming/longest_arithmetic_subsequence.py
index 781af9ef6..c1c54bda1 100644
--- a/dynamic_programming/longest_arithmetic_subsequence.py
+++ b/dynamic_programming/longest_arithmetic_subsequence.py
@@ -1,11 +1,11 @@
 """
-Longest Arithmetic Subsequence Problem: Given an array nums of integers, return the length 
+Longest Arithmetic Subsequence Problem: Given an array nums of integers, return the length
 of the longest arithmetic subsequence in nums.
 
 Note that:
-- A subsequence is an array that can be derived from another array by deleting some or no 
+- A subsequence is an array that can be derived from another array by deleting some or no
   elements without changing the order of the remaining elements.
-- A sequence seq is arithmetic if seq[i + 1] - seq[i] are all the same value (for 0 <= i < 
+- A sequence seq is arithmetic if seq[i + 1] - seq[i] are all the same value (for 0 <= i <
   seq.length - 1).
 """