| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|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|

|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|

packagecom.fishercoder.solutions;

publicclass_1720 {

publicstaticclassSolution1 {

publicint[]decode(int[]encoded,intfirst) {

int[]arr =newint[encoded.length +1];

arr[0] =first;

for (inti =0;i <encoded.length;i++) {

arr[i +1] =encoded[i] ^arr[i];

}

returnarr;

}

}

}