HackerRank - Super Reduced Strings | Full solution with visuals and examples | Study Algorithms 

Wow! I like your explanations! It certainly helps a lot!

Good explanation, really simple solutions as well and supper easy to understand. Once you said Stack I pretty much came up with the same solution. :) thank you Nikhil !

this guy speaks with confidence

Eloquent solutions as usual.

The best solution I've seen. Thanks man : )

Great video sir. Looking for more.

Thank you sir...💗

Good explanation

public static String superReducedString(String s) { Map charCount = new HashMap(); for (char c : s.toCharArray()) { charCount.put(c, charCount.getOrDefault(c, 0) + 1); } Set set = new TreeSet(); for (char c : s.toCharArray()) { if (charCount.get(c) % 2 == 1) { set.add(c); } } return (!set.isEmpty()) ? set.toString() : "Empty String"; }

Thank you ❤

Can we use xor operations between characters of the string and get result for this?

def short(s): #s=aaabccddd a=list(s) b=set(s) for i in b: c=s.count(i) if c%2==1: for j in range(c-1): a.remove(i) else: for j in range(c): a.remove(i) d=''.join(a) if len(d)==0: return "empty string" else: return d s="aabbb" print(short(s)) I wrote this but 6 test cases failed

Hi Sir, it would be great if you have JS version of the code.

Sir Code for final thought

But this Approach will not work with this type of string ---> "abbxayzz" !