# Solving Leetcode Interviews in Seconds with AI: Find if Digit Game Can Be Won


	# Introduction
	In this blog post, we will explore how to solve the LeetCode problem "3232" using AI. LeetCode is a popular platform for preparing for coding interviews, and with the help of AI tools like [Chatmagic](https://www.chatmagic.app), we can generate solutions quickly and efficiently - helping you pass the interviews and get the job offer without having to study for months.

	# Problem Statement
	> You are given an array of positive integers nums. Alice and Bob are playing a game. In the game, Alice can choose either all single-digit numbers or all double-digit numbers from nums, and the rest of the numbers are given to Bob. Alice wins if the sum of her numbers is strictly greater than the sum of Bob's numbers. Return true if Alice can win this game, otherwise, return false.   Example 1:  Input: nums = [1,2,3,4,10] Output: false Explanation: Alice cannot win by choosing either single-digit or double-digit numbers.  Example 2:  Input: nums = [1,2,3,4,5,14] Output: true Explanation: Alice can win by choosing single-digit numbers which have a sum equal to 15.  Example 3:  Input: nums = [5,5,5,25] Output: true Explanation: Alice can win by choosing double-digit numbers which have a sum equal to 25.    Constraints:  1 <= nums.length <= 100 1 <= nums[i] <= 99  

	# Explanation
	Here's the breakdown of the solution:

*   **Calculate sums for both single-digit and double-digit choices:** Iterate through the array and calculate the sum of single-digit numbers and the sum of double-digit numbers separately.
*   **Calculate Bob's sum for both choices:** Calculate the total sum of the array. Then, subtract Alice's single-digit sum to get Bob's sum if Alice chooses single-digit numbers. Similarly, subtract Alice's double-digit sum to get Bob's sum if Alice chooses double-digit numbers.
*   **Compare and return:** Check if Alice's sum is greater than Bob's sum for either the single-digit or double-digit choice. If it is, return `True`; otherwise, return `False`.

*   **Runtime Complexity:** O(n), where n is the length of the input array `nums`.
*   **Storage Complexity:** O(1)

	
	# Code
	```python
	def canAliceWin(nums):
    """
    Determines if Alice can win the game by choosing either single-digit or double-digit numbers.

    Args:
        nums: A list of positive integers.

    Returns:
        True if Alice can win, False otherwise.
    """

    single_digit_sum = 0
    double_digit_sum = 0
    total_sum = 0

    for num in nums:
        total_sum += num
        if num < 10:
            single_digit_sum += num
        else:
            double_digit_sum += num

    bob_sum_single = total_sum - single_digit_sum
    bob_sum_double = total_sum - double_digit_sum

    if single_digit_sum > bob_sum_single or double_digit_sum > bob_sum_double:
        return True
    else:
        return False
	```