From 72ef28dd403971344c592fee1b5ede28b8a6d901 Mon Sep 17 00:00:00 2001 From: Deven <63876261+devenperez@users.noreply.github.com> Date: Wed, 26 Nov 2025 15:19:26 -0500 Subject: [PATCH] Create README - LeetHub --- 0005-longest-palindromic-substring/README.md | 25 ++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 0005-longest-palindromic-substring/README.md diff --git a/0005-longest-palindromic-substring/README.md b/0005-longest-palindromic-substring/README.md new file mode 100644 index 0000000..2dd7c6a --- /dev/null +++ b/0005-longest-palindromic-substring/README.md @@ -0,0 +1,25 @@ +
Given a string s, return the longest palindromic substring in s.
+
Example 1:
+ ++Input: s = "babad" +Output: "bab" +Explanation: "aba" is also a valid answer. ++ +
Example 2:
+ ++Input: s = "cbbd" +Output: "bb" ++ +
+
Constraints:
+ +1 <= s.length <= 1000s consist of only digits and English letters.