# LeetCode Çözümlerİ – 392. Is Subsequence

LeetCode içerisinde bulunan “Is Subsequence” sorusunun açıklaması ve çözümü. Verilen stringlerden birinin, diğerinin subsequence’ı olup olmadığını bulmanız isteniyor. “Subsequence”‘ı soruda; uzun olan string’ten belirli sayıda (veya hiç) karakterler silinerek, kalan harflerin sırası değiştirilmeden elde edilebilen bir string ise true, değilse false döndürmeniz isteniyor.

🔥 LeetCode 392. Is Subsequence: https://leetcode.com/problems/is-subsequence/

➡️ Problem açıklaması:

Given a string s and a string t, check if s is subsequence of t.

A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) of the characters without disturbing the relative positions of the remaining characters. (ie, “ace” is a subsequence of “abcde” while “aec” is not).

If there are lots of incoming S, say S1, S2, … , Sk where k greaterEqualThan 1B, and you want to check one by one to see if T has its subsequence. In this scenario, how would you change your code?

Example 1:

Input: s = “abc”, t = “ahbgdc”

Output: true

Example 2:

Input: s = “axc”, t = “ahbgdc”

Output: false

Constraints:

0 lessEqualThan s.length lessEqualThan 100

0 lessEqualThan t.length lessEqualThan 10^4

Both strings consists only of lowercase characters.