316. Remove Duplicate Letters | Day 015 | Stack | Hot Interview Question🔥

In this video, I'll talk about how to solve Leetcode 316. Remove Duplicate Letters
Checkout DSA-169 Series: • Aryan DSA-169 Series |...
100Days 100k Placements: • 100 Days 100K Placement
Let's Connect:
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / ez.pz.dsa
📱Telegram : t.me/aryan_mittal_group
🤖 Github: github.com/aryan-0077
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
0:00 - Problem Explanation
1:10 - Intuition
3:28 - Dry Run
9:39 - Code Explanation
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@niteshkhanna690]

Please post these type of question daily which are very important it would be great

[@jhanavikumari274]

best explanation for this question thank youuu

[@shalinijha7359]

where do we get that list of question from which you are using?

[@Rohitsingh-ep2lo]

Done

[@snehaloganathan939]

Hi aryan please share those question excel sheet

[@kishokkumars7602]

First like and First comment

[@ARYANMITTAL]

Kishok kumar ji dhanyawad 🤌🏻🫡

[@kishokkumars7602]

@@ARYANMITTAL 😁😁

[@dayashankarlakhotia4943]

public String removeDuplicateLetters(String s){ StringBuilder sb=new StringBuilder(); int[]cnt=new int[128]; boolean[]vis=new boolean[128]; for(char c:s.toCharArray()) ++cnt[c]; for(char c:s.toCharArray()){ --cnt[c]; if(vis[c]) continue; while(sb.length()>0&&last(sb)>c&&cnt[last(sb)]>0){ vis[last(sb)]=false; sb.setLength(sb.length()-1); } vis[c]=true; sb.append(c); } return sb.toString(); } private char(StringBuilder sb){ return sb.charAt(sb.length()-1); } } 🎉❤ beats 100%tc