INTEST - Editorial

editorial
, ,
1

Problem Link - Enormous Input Test Practice Problem in 500 difficulty rating

Problem Statement:

You are given N integers. Find the count of numbers divisible by K.

Approach:

  • Simple Division Check: For each number A_i, check if A_i mod K == 0 to determine if it’s divisible by K.
  • Count the Divisibles: Maintain a counter to count how many numbers are divisible by K.

Complexity:

  • Time Complexity: O(N), where N is the number of integers. Each integer is processed in constant time O(1).
  • Space Complexity: O(1) for counting and checking