sliding-window3 5. Longest Palindromic Substring [Strings, dynamic programming] Problems: Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: "babad" Output: "bab" Note: "aba" is also a valid answer. Example 2: Input: "cbbd" Output: "bb" -Summary- Approach: Expand around the center 1. Two cases exist. - Palindrome with odd lengths of string (example: 'aba', 'abcba') --> where 1 character in th.. 2020. 6. 11. LeetCode. Is Subsequence Problem: Given a string s and a string t, check if s is subsequence of t. A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, "ace" is a subsequence of "abcde" while "aec" is not). Follow up: If there are lots of incoming S, say S1, S2, ... ,.. 2020. 6. 10. LeetCode 3. Longest Substring Without Repeating Characters [Sliding Window, Two-Pointers] Problems: Given a string, find the length of the longest substring without repeating characters. Example 1: Input: "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: Input: "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1. Example 3: Input: "pwwkew" Output: 3 Explanation: The answer is "wke", with the length of 3. Note that the answer mu.. 2020. 6. 10. 이전 1 다음
