Time and Space Complexity | Dataford Interview Questions

What are the time and space complexities of your solution?

Analyze the provided single-pass solution that counts even integers in an array. State the asymptotic time and auxiliary space complexities in terms of n, the array length, and briefly justify both bounds.

Function contract: count_even(nums) accepts an integer array and returns the number of even values.

Constraints

0 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
The input array is not counted as auxiliary space

Function Signature

def count_even(nums):

Your question is Time and Space Complexity. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

What are the time and space complexities of your solution?

Function contract: count_even(nums) accepts an integer array and returns the number of even values.

Constraints

0 <= len(nums) <= 10^5
-10^9 <= nums[i] <= 10^9
The input array is not counted as auxiliary space

Function Signature

def count_even(nums):

Your question is Time and Space Complexity. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.