find-maximum-number-of-non-intersecting-substrings

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given a string <code>word</code>.

Return the maximum number of non-intersecting substrings of word that are at least four characters long and start and end with the same letter.

&nbsp;
Example 1:

<div class="example-block">
Input: word = &quot;abcdeafdef&quot;

Output: 2

Explanation:

The two substrings are <code>&quot;abcdea&quot;</code> and <code>&quot;fdef&quot;</code>.
</div>

Example 2:

<div class="example-block">
Input: word = &quot;bcdaaaab&quot;

Output: 1

Explanation:

The only substring is <code>&quot;aaaa&quot;</code>. Note that we cannot also choose <code>&quot;bcdaaaab&quot;</code> since it intersects with the other substring.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= word.length &lt;= 2 * 105</code></li>
	<li><code>word</code> consists only of lowercase English letters.</li>
</ul>

Biweekly Contest 157

biweekly-contest-157

maxSubstrings

Senior

Find Maximum Number of Non Intersecting Substrings

Hash Table

String

Dynamic Programming

Greedy

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs