def is_prime(n):
    if n <= 1:
        return False
    if n <= 3:
        return True
    if n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i * i <= n:
        if n % i == 0 or n % (i + 2) == 0:
            return False
        i += 6
    return True

def is_googly(n):
    digit_sum = sum(int(digit) for digit in str(n))
   
    if is_prime(digit_sum):
        return "GOOGLY"
    else:
        return "NOT GOOGLY"

N = int(input())

print(is_googly(N))

Googly Number ✅

from itertools  import combinations
n=int(input())
a=list(map(int,input().split()))
res=0
if n>1:
  for i in combinations(a,2):
    if sum(i)%60==0:
        res+=1
  if res! =0:
      print(res%((10**9)+7))
if res==0 or n<2:
       print("NO HOURS")


Hours Count ✅

#include<stdio.h>
#include<stdlib.h>

#define MOD 1000000007

int compare(const void *a, const void *b) {
    return (*(int*)a - *(int*)b);
}

int main() {
    int N;
    scanf("%d", &N);

    if (N <= 1) {
        printf("NO HOURS\n");
        return 0;
    }

    int *A = (int*)malloc(N * sizeof(int));

    for (int i = 0; i < N; i++) {
        scanf("%d", &A[i]);
    }

    qsort(A, N, sizeof(int), compare);

    int count = 0;

    for (int i = 0; i < N - 1; i++) {
        for (int j = i + 1; j < N; j++) {
            if ((A[i] + A[j]) % 60 == 0) {
                count = (count + 1) % MOD;
            }
        }
    }

    if (count > 0) {
        printf("%d\n", count);
    } else {
        printf("NO HOURS\n");
    }

    free(A);

    return 0;
}

Hours Count ✅

Amazon is hiring SDE-1, 2023 grads

https://www.linkedin.com/posts/rima-roy_software-dev-engineer-ftc-activity-7188840327108083712-NBcU?utm_source=share&utm_medium=member_android

NetApp is hiring SDE for 2024, 2023, 2022 grads

https://careers.netapp.com/job/bengaluru/software-engineer/27600/64077230112