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

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

|1863|[Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1863.java)||Easy|Backtracking, Recursion|

|1862|[Sum of Floored Pairs](https://leetcode.com/problems/sum-of-floored-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1862.java)||Hard|Math|

|1861|[Rotating the Box](https://leetcode.com/problems/rotating-the-box/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1861.java)||Medium|Array, Two Pointers|

|1860|[Incremental Memory Leak](https://leetcode.com/problems/incremental-memory-leak/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1860.java)||Medium|Math|

packagecom.fishercoder.solutions;

importjava.util.ArrayList;

importjava.util.List;

publicclass_1863 {

publicstaticclassSolution1 {

publicintsubsetXORSum(int[]nums) {

intsum =0;

List<List<Integer>>subsets =subsets(nums);

for (List<Integer>subset :subsets) {

intxor =0;

for (inti :subset) {

xor ^=i;

}

sum +=xor;

}

returnsum;

}

publicList<List<Integer>>subsets(int[]nums) {

List<List<Integer>>result =newArrayList();

backtracking(result,newArrayList(),nums,0);

returnresult;

}

voidbacktracking(List<List<Integer>>result,List<Integer>list,int[]nums,intstart) {

result.add(newArrayList(list));

for (inti =start;i <nums.length;i++) {

list.add(nums[i]);

backtracking(result,list,nums,i +1);

list.remove(list.size() -1);

}

}

}

}