https://dmytros.blog/tags/partition-labels/ Recent content in Partition Labels on Dmytro's Blog https://dmytros.blog/images/papermod-cover.png https://dmytros.blog/images/papermod-cover.png Hugo en Mon, 18 May 2026 07:51:15 +0300 https://dmytros.blog/posts/leetcode-150-partition-labels/ Mon, 18 May 2026 07:51:15 +0300 https://dmytros.blog/posts/leetcode-150-partition-labels/ <p>LeetCode - 150 - Partition Labels</p> <h3 id="the-problem">The problem</h3> <p>You are given a string <code>s</code>. We want to partition the string into as many parts as possible so that each letter appears in at most one part. For example, the string <code>&quot;ababcc&quot;</code> can be partitioned into <code>[&quot;abab&quot;, &quot;cc&quot;]</code>, but partitions such as <code>[&quot;aba&quot;, &quot;bcc&quot;]</code> or <code>[&quot;ab&quot;, &quot;ab&quot;, &quot;cc&quot;]</code> are invalid.</p> <p>Note that the partition is done so that after concatenating all the parts in order, the resultant string should be <code>s</code>.</p>