_3223.java

packagecom.fishercoder.solutions.fourththousand;

importjava.util.Deque;
importjava.util.HashMap;
importjava.util.LinkedList;
importjava.util.Map;

publicclass_3223 {
publicstaticclassSolution1 {
publicintminimumLength(Strings) {
Map<Character, Integer> map = newHashMap<>();
Deque<Character> stack = newLinkedList<>();
for (inti = 0; i < s.length(); i++) {
charc = s.charAt(i);
if (!map.containsKey(c) || map.get(c) < 2) {
map.put(c, map.getOrDefault(c, 0) + 1);
stack.addLast(c);
 } else {
Deque<Character> tmpStack = newLinkedList<>();
intremovedCount = 0;
while (!stack.isEmpty()) {
Characterlast = stack.pollLast();
if (last == c) {
map.put(c, map.get(c) - 1);
if (map.get(c) == 0) {
map.remove(c);
 }
removedCount++;
if (removedCount == 2) {
break;
 }
 } else {
tmpStack.addLast(last);
 }
 }
while (!tmpStack.isEmpty()) {
stack.addLast(tmpStack.pollLast());
 }
stack.addLast(c);
map.put(c, map.getOrDefault(c, 0) + 1);
 }
 }
StringBuildersb = newStringBuilder();
while (!stack.isEmpty()) {
sb.append(stack.pollFirst());
 }
returnsb.toString().length();
 }
 }
}