subsequence-after-one-replacement

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 two strings <code>s</code> and <code>t</code> consisting of lowercase English letters.

You may choose at most one index in <code>s</code> and replace the character at that index with any lowercase English letter.

Return <code>true</code> if it is possible to make <code>s</code> a subsequence of <code>t</code>; otherwise, return <code>false</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;cat&quot;, t = &quot;chat&quot;

Output: true

Explanation:

<ul>
	<li>Replace <code>s[1]</code> from <code>&#39;a&#39;</code> to <code>&#39;h&#39;</code>. The resulting string is <code>&quot;cht&quot;</code>.</li>
	<li><code>&quot;cht&quot;</code> is a subsequence of <code>&quot;chat&quot;</code> because we can match <code>&#39;c&#39;</code>, <code>&#39;h&#39;</code>, and <code>&#39;t&#39;</code> in order.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: s = &quot;plane&quot;, t = &quot;apple&quot;

Output: false

Explanation:

<ul>
	<li>The characters <code>&#39;p&#39;</code>, <code>&#39;l&#39;</code>, and <code>&#39;e&#39;</code> can be matched in <code>t</code>, but the remaining characters cannot be matched while preserving the required order.</li>
	<li>Even after replacing any one character in <code>s</code>, it is impossible to make <code>s</code> a subsequence of <code>t</code>.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length, t.length &lt;= 105</code></li>
	<li><code>s</code> and <code>t</code> consist only of lowercase English letters.</li>
</ul>

Weekly Contest 509

weekly-contest-509

canMakeSubsequence

Staff

Subsequence After One Replacement

Two Pointers

String

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are given two strings s and t consisting of lowercase English letters.

You may choose at most one index in s and replace the character at that index with any lowercase English letter.

Return true if it is possible to make s a subsequence of t; otherwise, return false.

 

Example 1:

Input: s = "cat", t = "chat"

Output: true

Explanation:

 * Replace s[1] from 'a' to 'h'. The resulting string is "cht".
 * "cht" is a subsequence of "chat" because we can match 'c', 'h', and 't' in order.

Example 2:

Input: s = "plane", t = "apple"

Output: false

Explanation:

 * The characters 'p', 'l', and 'e' can be matched in t, but the remaining characters cannot be matched while preserving the required order.
 * Even after replacing any one character in s, it is impossible to make s a subsequence of t.

 

Constraints:

 * 1 <= s.length, t.length <= 105
 * s and t consist only of lowercase English letters.