Solve Factorial Zeros and Kadane Maximum | Dataford Interview Questions

Solve a math problem and an algorithmic problem.

The math component asks for the number of trailing zeros in n!. The algorithmic component asks for the maximum sum of a non-empty contiguous subarray. Implement solve_tasks(n, nums) and return both results as [trailing_zeros, maximum_subarray_sum].

Input and Output

n is a non-negative integer and nums is a non-empty list of integers. Return a two-element list containing the trailing-zero count and the maximum contiguous-subarray sum.

Constraints

0 <= n <= 10^9
1 <= len(nums) <= 10^4
-10^9 <= nums[i] <= 10^9
The maximum subarray must be non-empty

Function Signature

def solve_tasks(n, nums):

Your question is Solve Factorial Zeros and Kadane Maximum. 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