|1721|[Swapping Nodes in a Linked List](https://leetcode.com/problems/swapping-nodes-in-a-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1721.java)||Medium|LinkedList|

|1720|[Decode XORed Array](https://leetcode.com/problems/decode-xored-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1720.java)||Easy|Bit Manipulation|

|1718|[Construct the Lexicographically Largest Valid Sequence](https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1718.java)||Medium|Backtracking, Recursion|

|1717|[Maximum Score From Removing Substrings](https://leetcode.com/problems/maximum-score-from-removing-substrings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1717.java)||Medium|Greedy|

|1716|[Calculate Money in Leetcode Bank](https://leetcode.com/problems/calculate-money-in-leetcode-bank/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1716.java)||Easy|Math, Greedy|

|1711|[Count Good Meals](https://leetcode.com/problems/count-good-meals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1711.java)||Medium|Array, HashTable, Two Pointers|

|1710|[Maximum Units on a Truck](https://leetcode.com/problems/maximum-units-on-a-truck/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1710.java)||Easy|Greedy, Sort|

packagecom.fishercoder.solutions;

importjava.util.Stack;

publicclass_1717 {

publicstaticclassSolution1 {

publicintmaximumGain(Strings,intx,inty) {

Stack<Character>stack1 =newStack<>();

intbig =x >y ?x :y;

intsmall =big ==x ?y :x;

charfirst =x ==big ?'a' :'b';

charsecond =first =='a' ?'b' :'a';

intmaximumGain =0;

for (charc :s.toCharArray()) {

if (c ==second && !stack1.isEmpty() &&stack1.peek() ==first) {

stack1.pop();

maximumGain +=big;

}else {

stack1.push(c);

}

}

Stack<Character>stack2 =newStack<>();

while (!stack1.isEmpty()) {

charc =stack1.pop();

if (c ==second && !stack2.isEmpty() &&stack2.peek() ==first) {

stack2.pop();

maximumGain +=small;

}else {

stack2.push(c);

}

}

returnmaximumGain;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1717;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1717Test {

privatestatic_1717.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1717.Solution1();

}

publicvoidtest1() {

assertEquals(19,solution1.maximumGain("cdbcbbaaabab",4,5));

}

publicvoidtest2() {

assertEquals(20,solution1.maximumGain("aabbaaxybbaabb",5,4));

}

}