• Home
• com.github.javadev
• leetcode-in-java
• 1.38
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0401_0500.s0467_unique_substrings_in_wraparound_string.readme.md Maven / Gradle / Ivy

467\. Unique Substrings in Wraparound String

Medium

We define the string `s` to be the infinite wraparound string of `"abcdefghijklmnopqrstuvwxyz"`, so `s` will look like this:

*   `"...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd...."`.

Given a string `p`, return _the number of **unique non-empty substrings** of_ `p` _are present in_ `s`.

**Example 1:**

**Input:** p = "a"

**Output:** 1 Explanation: Only the substring "a" of p is in s.

**Example 2:**

**Input:** p = "cac"

**Output:** 2

**Explanation:** There are two substrings ("a", "c") of p in s.

**Example 3:**

**Input:** p = "zab"

**Output:** 6

**Explanation:** There are six substrings ("z", "a", "b", "za", "ab", and "zab") of p in s.

**Constraints:**

*   1 <= p.length <= 105
*   `p` consists of lowercase English letters.