現在ITエンジニアとして働いていますが、コーディング・アルゴリズム力をもっと鍛えたいと思い、LeetCodeで学んだ内容をメモ的にアウトプットしています。 今回解いてみた問題は「31.Next Permutation」です。 問題 順列とは整数配列の要素を並べ替えて作ら ...

So, you want to get better at those tricky LeetCode Python problems, huh? It’s a common goal, especially if you’re aiming for tech jobs. Many people try to just grind through tons of problems, but ...

Getting started with LeetCode can feel like a lot, especially if you’re just beginning your coding journey. So many problems, so many concepts – it’s easy to get lost. But don’t sweat it. This guide ...

# one of the first string's permutations is the substring of the second string. # The input strings only contain lower case letters. # The length of both given strings is in range [1, 10,000].

# Given a string S, we can transform every letter individually to be lowercase # or uppercase to create another string. Return a list of all possible strings we could create.