This is a template on how to fill out a PR properly.
Description
Language Used: Python
Approach Used: Using Loops, Nested Loops, Variables
Question(s) Solved: Q2,Q3,Q5
Issue(s) related: #13
Q2: Solves the problem of adding two number in linked list like linked list 1 contain number and linked list 2 contain number so adding this 2 linked list and make a new linked list.In this I have used the while loop to iterate over every number and it reduce the time complexity it's time complexity is O(n)
Q3: Solves the problem of getting the length of longest sub-string without repeating characters in the give String like the given string is "abcabcbb" so its output is 3 because "abc" is a unique in a string and also a sub-string of the given string .In this I have used the nested loop it's time complexity is O(n x m)
Q5: Solves the Problem of getting the palindrome of the string from a given string like the given string is "babad" in which the palindrome string is "aba" it is palindrome because reading from left and reading from right are same. In this I have used the Loop and Function and it's time complexity is O(n)
## Related Issue
#13
This is a template on how to fill out a PR properly.
Description
- Language Used: Python
- Approach Used: Using Loops, Nested Loops, Variables
- Question(s) Solved: Q2,Q3,Q5
- Issue(s) related: #13
Q2: Solves the problem of adding two number in linked list like linked list 1 contain number and linked list 2 contain number so adding this 2 linked list and make a new linked list.In this I have used the while loop to iterate over every number and it reduce the time complexity it's time complexity is O(n) Q3: Solves the problem of getting the length of longest sub-string without repeating characters in the give String like the given string is "abcabcbb" so its output is 3 because "abc" is a unique in a string and also a sub-string of the given string .In this I have used the nested loop it's time complexity is O(n x m) Q5: Solves the Problem of getting the palindrome of the string from a given string like the given string is "babad" in which the palindrome string is "aba" it is palindrome because reading from left and reading from right are same. In this I have used the Loop and Function and it's time complexity is O(n) ## Related Issue #13Acceptance Criteria
Type of Changes
Testing Steps / QA Criteria
Q2
Q3
Q5