addition of longest substring without repeating charqacters

Author: VeldaKiara

add_two_numbers.py

@@ -1,3 +1,15 @@
+'''You are given two non-empty linked lists representing two non-negative integers. 
+The digits are stored in reverse order, and each of their nodes contains a single digit. 
+Add the two numbers and return the sum as a linked list.
+You may assume the two numbers do not contain any leading zero, except the number 0 itself.
+
+Constraints:
+-The number of nodes in each linked list is in the range [1, 100].
+-The0 <= Node.val <= 9
+-It is guaranteed that the list represents a number that does not have leading zeros.
+'''
+
+
 class Solution:
     def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode:
         dope = ListNode(0)

longest-substring-without-repeating-characters.py

@@ -0,0 +1,24 @@
+'''question Given a string s, find the length of the longest substring 
+without repeating characters.
+Constraints:
+0 <= s.length <= 5 * 104
+s consists of English letters, digits, symbols and spaces.
+'''
+class Solution:
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        v =0    #map to store information v and k
+        k = 0
+        m ={}   
+        result = 0
+        while k < len(s):
+            if s[k] not in m or v>m[s[k]]:
+                result = max(result,(k-v+1))
+                m[s[k]] = k
+            else:
+                    v = m[s[k]]+1
+                    result = max(result,(k-v+1))
+                    k-=1
+            k+=1
+        return result
+    
+#used sliding window to solve this problem

twosum.py

@@ -1,3 +1,16 @@
+'''Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
+
+You may assume that each input would have exactly one solution, and you may not use the same element twice.
+
+You can return the answer in any order.
+Constraints:
+2 <= nums.length <= 105
+-109 <= nums[i] <= 109
+-109 <= target <= 109
+Only one valid answer exists.
+'''
+
+
 class Solution:
     def twoSum(self, nums: List[int], target: int) -> List[int]:
         dict = {}