Leetcode 392. Is Subsequence | Leetcode Daily Challenge | Is String s a subsequence of string t

Connect with me on LinkedIn : / alisha-parveen-80579850
Check out our other playlists:
Dynamic Programming:
• Dynamic Programming
Trees:
• Trees
Heaps and Maps:
• Heaps and Maps
Arrays and Maths:
• Arrays and Maths
Bit Manipulation:
• Bit Manipulation
Greedy Algorithms:
• Greedy Algorithms
Sorting and Searching:
• Sorting and Searching
Strings:
• Strings
Linked Lists:
• Linked Lists
Stack and Queues:
• Stacks and Queues
Two Pointers:
• Two pointers
Graphs, BFS, DFS:
• Graphs, DFS, BFS
Backtracking:
• Backtracking
Non- DSA playlists:
Probability:
• Probability
SQL-Basic Join functions:
• SQL - Basic JOIN Funct...
SQL-Basic Aggregate functions:
• SQL-Basic Aggregate Fu...

[@mohitchoudhary7234]

Essy efficient and clean cut clear solution thanks++

[@secretcoder7]

The Legend , The God , The Real OG what a content

[@joshstudioz8834]

Thank you so much sister...this was very helpful

[@adarshsingh-lb3ws]

Acha btate ho mam ap... Nyc video

[@anishbhattacharya1190]

Your solutions are very precise. Thanks

[@sarankumar165]

Can u pls discuss the Follow UP question?
Follow up: Suppose there are lots of incoming s, say s1, s2, ..., sk where k >= 109, and you want to check one by one to see if t has its subsequence. In this scenario, how would you change your code?

[@srirampolisetty3149]

Thank you, you are amazing!
Keep posting ✨

[@devbhattacharya153]

Thanks maam for making this solution simple

[@prataynandy4583]

Thank you

[@jogendarmahto3048]

Loved the explanation ✨

[@alishabeautyparlour6283]

Love you mam🌹

[@reshmaparveen6679]

Tq di nice explain

[@whatwhat3435]

keep going i love your videos

[@DevDev-y2b]

good explanation mam tqu

[@sumitshrivastava1887]

Which Software you use for drawing on screen? Please Reply

[@harshitraheja5210]

pls explain the space and time complexity for this

[@sreeharianilkumar1]

Thanks, Please upload GFG Problem of the day

[@k-CE-OmkarPathak]

is Time Complexity=O(1) ?
plss reply
thnx though, nice explanation

[@BoomcoreIsLive]

Nope

[@HimanshuSingh-wd3bn]

👌👌

[@AmanTheMystery]

Mam please upload also gfg day to day problem

[@Star_Bawa9]

Hi I got the question i Tried to solve it in java
Please help i m unable to get it accepted
class Solution {
public boolean isSubsequence(String s, String t) {
if(s=="")
return true;
if(s.length()>t.length())
return false;

int i=0;
int j=0;
while(i

[@gautamjangir8927]

Please solve this problem Exactly one swap(gfg problem of the day)
This brute-force approach is not working
#include
using namespace std;
string swap(string s, int i, int j)
{
swap(s[i], s[j]);
return s;
}
int main()
{
string s = "ab";
map mp;
char cstr[s.size() + 1];
strcpy(cstr, s.c_str()); // or, pass `&s[0]`
for (int i = 0; i < s.size() - 1; i++)
{
for (int j = i + 1; j < s.size(); j++)
{
string p = swap(s, i, j);
mp[p]++;
}
}
cout