Easy 📶 solution with each step by step procedure with 🗿 O(n)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```typescript []\nfunction isBalanced(num: string): boolean {\n\n    //converting string to Array\n    const numArray : number[] = num.split("").map( no => Number(no) )\n    const size : number = numArray.length;\n    let evenSum : number = 0;\n    let oddSum : number = 0;\n    \n    for(let i=0; i<size; i++){\n        \n        if( i%2 === 1 ){\n            oddSum += numArray[i];\n        }else{\n            evenSum += numArray[i];\n        }\n    }\n\n    return oddSum === evenSum;\n    \n};\n```
['TypeScript', 'JavaScript']