# LeetCode: Sum Of All Subset Xor Totals Solution

1/**2 * @param {number[]} nums3 * @return {number}4 */5var subsetXORSum = function (nums) {6 let res = 07 const N = nums.length89 const recursion = (currentIndex, sum) => {10 res += sum11 for (let i = currentIndex; i < N; i++) {12 sum ^= nums[i]13 recursion(i + 1, sum)14 sum ^= nums[i]15 }16 }1718 recursion(0, 0)1920 return res21}

## Comments

Loading comments...

## Tags

leetcode

backtracking

recursion

## Apply and earn a $2,500 bonus once you're hired on your first job!

Clients from the Fortune 500 to Silicon Valley startups

Choose your own rate, get paid on time

From hourly, part-time, to full-time positions

Flexible remote working environment

A lot of open JavaScript jobs!!

**Fact corner:** Referred talent are 5x more likely to pass the Toptal screening process than the average applicant.

**Still hesitate?** Read HoningJS author's guide on dealing with Toptal interview process.

## Next Post

LeetCode: Binary Tree Cameras

May 18, 2021