LeetCode Remove All Adjacent Duplicates In String Solution Explained - Java

Preparing For Your Coding Interviews? Use These Resources
————————————————————

Other Social Media
----------------------------------------------

Show Support
------------------------------------------------------------------------------

#coding #programming #softwareengineering

[ravishraj]

short concise and easy to understand. Your way of teaching is perfect. Please keep it up

[strider_]

How do you handle when char is repeated odd no of times like if string is abbbac

[yusenpeng]

Originally, I used two pointers instead of stack and it turned out to be really inefficient compared to stack. I really appreciate your stack explanation! :)

[smithshelke]

O(1) space solution ...
Loop until arr(i) ==arr(i+1) then place 2 pointers a and b at I+2 and i-1 respectively, and check if elements are equal at those indices, if yes keep expanding the pointers a and b until the elements are not equal then delete.repeat everything till we reach the end of string

[dharmaputra]

Request tutorial graph like a MST, djikstra shortest path

[theyashbansal]

That clap at the beginning blew my ear off 😅

[_karan]

what was that noise in the starting of the video !!

[krishnavar]

the the way you programmed this question it is genius...

[biswaranjanbarik]

U r doing a very very great job thanx that I have found u in youtube.
I love your videos..
Love from India..❤💌

[unknownman]

7:25 how does string from 0, 2 returns c, a. Instead of 0, 2 it should be 0, 1?

[dalindu]

why using a char[] as stack instead of using STACK ADT?

[ketansharma]

I have never used stack with indices, can someone share me some problems, which use the same. Thanks.

[CodeSuccessChronicle]

Brother you didn’t write a 0 assignment in case there’s a duplicate how can stack change then ....

[guyfromgalaxy]

Can do with inplace string manipulation, without using extra memory (credit to you as I learnt this trick from your previous video, so thank you! :) )

[samvid]

It does not work with aaab result is ab should be b

[varunsadhu]

It doesn't work for TC aabbccccbapq

[KoushikChowdhury]

string removeDuplicates(string s) {
int i = 0, n = s.length();
for (int j = 0; j < n; ++j, ++i) {
s[i] = s[j];
if (i > 0 && s[i - 1] == s[i]) // count = 2
i -= 2;
}
return s.substr(0, i);
}
This has SC: O(1)

[infotainment]

your code doesnt work for "geeksforgeek"

[sophiezhang]

i like your videos, but this solution doesn't work

[paraskumar]

my code is showing TLE for 9000+ characters