refactor 5

fishercoder1534 · fishercoder1534 · commit cf8e1093d77e · 2020-04-25T06:31:58.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_5.java b/src/main/java/com/fishercoder/solutions/_5.java
@@ -1,19 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 5. Longest Palindromic Substring
- *
- * Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
-
- Example:
- Input: "babad"
- Output: "bab"
- Note: "aba" is also a valid answer.
-
- Example:
- Input: "cbbd"
- Output: "bb"
- */
 public class _5 {
 
     public static class Solution1 {
