note

【LeetCodeに挑戦】3. Longest Substring Without Repeating Characters

現在ITエンジニアとして働いていますが、コーディング・アルゴリズム力をもっと鍛えたいと思い、LeetCodeで学んだ内容をメモ的にアウトプットしています。 今回解いてみた問題は「3. Longest Substring Without Repeating Characters」です。
GitHub

[LeetCode] 159. Longest Substring with At Most Two Distinct Characters

Input: "eceba" Output: 3 Explanation: _t_ is "ece" which its length is 3. Example 2: Input: "ccaabbb" Output: 5 Explanation: _t_ is "aabbb" which its length is 5 ...
GitHub

longest-palindromic-substring.py

Given a string s, return the longest palindromic substring in s. # https://leetcode.com/problems/longest-palindromic-substring/discuss/1025355/Easy-to-understand ...