알고리즘 문제풀이/리트코드2 [리트코드/파이썬] 5. Longest Palindromic Substring [리트코드/파이썬] 5. Longest Palindromic Substring 5. Longest Palindromic Substring Medium Given a string s, return the longest palindromic substring in s 참고 palindromic 문자열: 왼쪽에서 오른쪽으로 읽으나 오른쪽에서 왼쪽으로 읽으나 같은 문자열을 말한다. Example 1: Input: s = "babad" Output: "bab" Explanation: "aba" is also a valid answer. Example 2: Input: s = "cbbd" Output: "bb" Constraints: 1 =0 and e=0 and e+1 e-s: s = i - (length-1)/.. 2023. 12. 11. [리트코드/파이썬] 49. Group Anagrams (문자열, 딕셔너리) [리트코드/파이썬] 49. Group Anagrams (문자열, 딕셔너리) 49. Group Anagrams Medium Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Example 1: Input: strs = ["eat","tea","tan","ate","nat","bat"] Output: [["bat".. 2023. 12. 11. 이전 1 다음
