gfg_potd

You will be given an array arr of integers of length N. You can construct an integer from two integers by treating the integers as strings, and then concatenating them. For example, 19 and 4 can be used to construct 194 and 419.

The task is to find whether it’s possible to construct an integer using all the digits of these numbers such that it would be divisible by 3.
If it is possible then print 1 and if not print 0.


class Solution:
    def isPossible(self, N, arr):
        # code here
        s=''
        for i in arr:
            s+=str(i)
        sum=0
        for j in s:
            sum+=int(j)
            
        if sum%3==0:
            return 1
        else:
            return 0