LeetCode 3232: Find if Digit Game Can Be Won Solution

Master LeetCode problem 3232 (Find if Digit Game Can Be Won), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

3232. Find if Digit Game Can Be Won

Easy

Array Math

Problem Explanation

Explanation:

To solve this problem, we need to determine if Alice can win the game by choosing either all single-digit numbers or all double-digit numbers from the given array nums. We can approach this problem by calculating the total sums of single-digit numbers and double-digit numbers separately. If the sum of the chosen numbers by Alice is greater than the sum of the remaining numbers given to Bob, then Alice can win the game.

Here is the algorithm:

Initialize two variables sumSingleDigit and sumDoubleDigit to store the sum of single-digit numbers and double-digit numbers respectively.
Iterate through the array nums and based on the number's value, add it to either sumSingleDigit or sumDoubleDigit.
Check if sumSingleDigit or sumDoubleDigit is greater than the sum of the remaining numbers. If yes, return true indicating that Alice can win; otherwise, return false.

Time complexity: O(n) where n is the number of elements in the array nums. Space complexity: O(1)

Solution Code

class Solution {
    public boolean canWin(int[] nums) {
        int sumSingleDigit = 0;
        int sumDoubleDigit = 0;
        
        for (int num : nums) {
            if (num < 10) {
                sumSingleDigit += num;
            } else {
                sumDoubleDigit += num;
            }
        }
        
        return sumSingleDigit > sumDoubleDigit;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 3232 (Find if Digit Game Can Be Won)?

This page provides optimized solutions for LeetCode problem 3232 (Find if Digit Game Can Be Won) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 3232 (Find if Digit Game Can Be Won)?

The time complexity for LeetCode 3232 (Find if Digit Game Can Be Won) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 3232 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 3232 in Java, C++, or Python.

Back to LeetCode Solutions