great explanation

Can we solve this by using frequency array where we store the frequency of each character and then compare it ?

Keep Hustling Bro ❤

Well Explained🙌

👏👏👏

Voiceover 👌👌

❤❤

👌👌

Valuable ❤

Feedback : Try to Not Upload These Kind Of Songs

Explanation Level 👌👌

Content ❤

Content ❤❤

Keep Hustling Bro 💯✅

apko kaise bhul skte hai

Good

Bro Lets do it together.

Arrays explained well

Very nice explanation

✅✅

❤❤

❤❤

Bro Try to Make a shorter Shorter Video ❤

👏👏👏

Great explanation

Well Explanation ✅

Well explained 👌

Keep it up.

❤❤❤

❤❤❤

Keep it up

Very well explained

First Viewer ✅

Voiceover 👌✅

Voiceover 👌👌

❤❤❤

Keep it up

🙌🙌

👌❤️

Keep Doing It ✅

Well Explained ❤

🌟🌟🌟🌟

I solve this problem using Stack and Stringbuilder class Solution { public String removeStars(String s) { Stack<Character> st = new Stack<>(); StringBuilder sb = new StringBuilder(); for(int i=0;i<s.length();i++) { if(s.charAt(i)!='*') { st.push(s.charAt(i)); } else if(!st.isEmpty() && s.charAt(i)=='*'){ st.pop(); } } while(!st.isEmpty()) { sb.append(st.pop()); } return sb.reverse().toString(); } } in this way

Keep Going Brother ❤❤❤

nye explanation bhaiya

👌👌👌

class Solution { public boolean isSubsequence(String s, String t) { int ans=0; int x=0; //base case if(s.length()==0) { return true; } for(int i=0;i<t.length();i++) { if(s.charAt(x)==t.charAt(i)) { ans++; if(x!=s.length()-1){ x++; } else{ break; } } } if(ans>=s.length()) { return true; } return false; } } I solve in this way .

👍👍👍