Leetcode 5

Python solution

Author: kyle8998

README.md

@@ -11,6 +11,7 @@ Personal Practice Set - Doing One a Day (sometimes) in a Variety of Languages!!
 | 2  | Medium     | [Add Two Numbers](leetcode/2-Medium-Add-Two-Numbers/problem.md)                              | [C](leetcode/2-Medium-Add-Two-Numbers/answer.c)                  |
 | 3  | Medium     | [Longest Substring Without Repeating Characters](leetcode/3-Medium-Longest-Substring-Without-Repeating-Characters/problem.md) | [Python](leetcode/3-Medium-Longest-Substring-Without-Repeating-Characters/answer.py) |
 | 4  | Hard       | [Median of Two Sorted Arrays](leetcode/4-Hard-Median-Of-Two-Sorted-Arrays/problem.md)        | [Python](leetcode/4-Hard-Median-Of-Two-Sorted-Arrays/answer.py)  |
+| 5  | Medium     | [Longest Palindromic Substring](leetcode/5-Medium-Longest-Palindromic-Substring/problem.md)  | [Python](leetcode/5-Medium-Longest-Palindromic-Substring/answer.py) |
 | 6  | Medium     | [Zig Zag Conversion](leetcode/6-Medium-Zig-Zag-Conversion/problem.md)                        | [Java](leetcode/6-Medium-Zig-Zag-Conversion/answer.java)         |
 | 7  | Easy       | [Reverse Integer](leetcode/7-Easy-Reverse-Integer/problem.md)                                | [Python](leetcode/7-Easy-Reverse-Integer/answer.py)              |
 | 9  | Easy       | [Palindrome Number](leetcode/9-Easy-Palindrome-Number/problem.md)                            | [C](leetcode/9-Easy-Palindrome-Number/answer.c), [Java](leetcode/9-Easy-Palindrome-Number/answer.java), [Python](leetcode/9-Easy-Palindrome-Number/answer.py), [Swift](leetcode/9-Easy-Palindrome-Number/answer.swift) |

leetcode/5-Medium-Longest-Palindromic-Substring/answer.py

@@ -0,0 +1,25 @@
+#!/usr/bin/python
+
+class Solution:
+    def longestPalindrome(self, s):
+        """
+        :type s: str
+        :rtype: str
+        """
+        
+        result = ""
+        for i in range(len(s)):
+            # Takes in account odd and even cases
+            result = max(result, self.find_palindrome(s, i, i), self.find_palindrome(s, i, i+1), key=len)        
+            
+        return result
+            
+    # Helper method to find the longest palindrome starting from the center
+    def find_palindrome(self, s, left, right):
+        while left >= 0 and right < len(s) and s[left] == s[right]:
+            left -= 1
+            right += 1
+        return s[left+1:right]
+
+#-------------------------------------------------------------------------------
+#Testing

leetcode/5-Medium-Longest-Palindromic-Substring/problem.md

@@ -0,0 +1,22 @@
+# Problem 3: Longest Substring Without Repeating Characters
+
+
+#### Difficulty: Medium
+
+#### Problem
+
+Given a string, find the length of the longest substring without repeating
+characters.
+
+#### Example
+
+<pre>
+
+Given "abcabcbb", the answer is "abc", which the length is 3.
+
+Given "bbbbb", the answer is "b", with the length of 1.
+
+Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer
+must be a substring, "pwke" is a subsequence and not a substring.
+
+/pre>