From 506161a4cf3f878bcc7fb9a5b42af0e5d917af6a Mon Sep 17 00:00:00 2001
From: Tejaswi Tyagi <98461855+tejaswi0910@users.noreply.github.com>
Date: Thu, 3 Oct 2024 18:06:25 +0000
Subject: [PATCH] line length shortened

---
 .../longest_arithmetic_subsequence.py                | 12 ++++++------
 1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/dynamic_programming/longest_arithmetic_subsequence.py b/dynamic_programming/longest_arithmetic_subsequence.py
index c1c54bda1..dfa061f18 100644
--- a/dynamic_programming/longest_arithmetic_subsequence.py
+++ b/dynamic_programming/longest_arithmetic_subsequence.py
@@ -1,12 +1,12 @@
 """
-Longest Arithmetic Subsequence Problem: Given an array nums of integers, return the length
-of the longest arithmetic subsequence in nums.
+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
-  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 <
-  seq.length - 1).
+- 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 < seq.length - 1).
 """