O(n) easy to understand solution with JavaScript :)
IntuitionApproachComplexity
Time complexity:
O(n)
Space complexity:
O(1)Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->
$$O(n)$$

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->
$$O(1)$$

# Code
```javascript []
/**
 * @param {string} num
 * @return {boolean}
 */
var isBalanced = function(num) {
   let sumEvens = 0;
   let sumOdds = 0;

   let turn = 1;
   for(let char of num){
       if(turn%2==0) sumEvens+=parseInt(char);
       else sumOdds+=parseInt(char);
       turn++;
   }
   return sumEvens===sumOdds;
};
```
['JavaScript']