Today #Day146 of #365DaysOfCode, I am Solving Leet code 392. Is Subsequence.
<h1 id="heading-question">Question</h1>
Given two strings <code>s</code> and <code>t</code>, return <code>true</code> if <code>s</code> is a subsequence of <code>t</code>, or <code>false</code> otherwise.
A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., <code>"ace"</code> is a subsequence of <code>"abcde"</code> while <code>"aec"</code> is not).
Example 1:
<pre><code class="lang-javascript">Input: s = "abc", t = "ahbgdc"
Output: true
</code></pre>
Example 2:
<pre><code class="lang-javascript">Input: s = "axc", t = "ahbgdc"
Output: false
</code></pre>
Constraints:
<ul>
<li><code>0 &lt;= s.length &lt;= 100</code>
</li>
<li><code>0 &lt;= t.length &lt;= 10&lt;sup&gt;4&lt;/sup&gt;</code>
</li>
<li><code>s</code> and <code>t</code> consist only of lowercase English letters.
</li>
</ul>
<h1 id="heading-answer-leetcode">Answer Leetcode:</h1>
<pre><code class="lang-javascript">var isSubsequence = function(s, t) {

 if(!s.length || (s === t)) return true;
 if(s.length &gt; t.length) return false;

 let j = 0;

 for(let i = 0; i &lt; t.length; i++) {
 if(s[j] === t[i]) {
 j++;
 }
 }
 return j === s.length;
};
</code></pre>
<h1 id="heading-conclusion">Conclusion</h1>
I solved the Leet code 392. Is Subsequence.
<h1 id="heading-source-is-subsequencelinkhttpsleetcodecomproblemsis-subsequence">Source: Is Subsequence<a target="_blank" href="https://leetcode.com/problems/is-subsequence/">[Link]</a></h1>
<h1 id="heading-author-dheerajy">Author: Dheeraj.y</h1>
<h1 id="heading-connect-with-me">Connect with me:</h1>
<ul>
<li><a target="_blank" href="https://twitter.com/yssdheeraj">My Twitter</a>
</li>
<li><a target="_blank" href="https://www.linkedin.com/in/dheerajy1/">My LinkedIn</a>
</li>
<li><a target="_blank" href="https://github.com/dheerajy1">My GitHub</a>
</li>
<li><a target="_blank" href="https://dheerajy1.hashnode.dev/">My Hashnode</a>
</li>
</ul>

Today #Day146 of #365DaysOfCode, I am Solving Leet code 392. Is Subsequence.

# Question

Given two strings `s` and `t`, return `true` *if* `s` *is a* ***subsequence*** *of* `t`*, or* `false` *otherwise*.

A **subsequence** of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (i.e., `"ace"` is a subsequence of `"abcde"` while `"aec"` is not).

**Example 1:**

```javascript
Input: s = "abc", t = "ahbgdc"
Output: true
```

**Example 2:**

```javascript
Input: s = "axc", t = "ahbgdc"
Output: false
```

**Constraints:**

* `0 <= s.length <= 100`
 
* `0 <= t.length <= 104`
 
* `s` and `t` consist only of lowercase English letters.
 

# Answer Leetcode:

```javascript
var isSubsequence = function(s, t) {
 
 if(!s.length || (s === t)) return true;
 if(s.length > t.length) return false;
 
 let j = 0;
 
 for(let i = 0; i < t.length; i++) {
 if(s[j] === t[i]) {
 j++;
 }
 }
 return j === s.length;
};
```

# Conclusion

I solved the Leet code 392. Is Subsequence.

# Source: Is Subsequence[\[Link\]](https://leetcode.com/problems/is-subsequence/)

# Author: Dheeraj.y

# Connect with me:

* [My Twitter](https://twitter.com/yssdheeraj)
 
* [My LinkedIn](https://www.linkedin.com/in/dheerajy1/)
 
* [My GitHub](https://github.com/dheerajy1)
 
* [My Hashnode](https://dheerajy1.hashnode.dev/)

Solving Leet code 392. Is Subsequence Day146

Question

Answer Leetcode:

Solving Leet code 392. Is Subsequence Day146

Table of contents

Question

Answer Leetcode:

Conclusion

Source: Is Subsequence[Link]

Author: Dheeraj.y

Connect with me: