Error
|
|
---|---|
@Ibrahim Nash | 6381 |
@blackshadows | 6329 |
@mb1973 | 5388 |
@Quandray | 5231 |
@akhayrutdinov | 5111 |
@saiujwal13083 | 4510 |
@sanjay05 | 3762 |
@marius_valentin_dragoi | 3522 |
@sushant_a | 3459 |
@verma_ji | 3357 |
@KshamaGupta | 3318 |
Complete Leaderboard | |
|
|
@1905439 | 553 |
@terabaap123 | 508 |
@smitadiwedi1991 | 279 |
@DevanandJayakumar | 250 |
@atishagusain | 244 |
@gupta_10 | 226 |
@nipun edara | 224 |
@shubhamkhullar7 | 224 |
@sharmachandan487 | 204 |
@balunagar | 204 |
@arshjit_singh7 | 190 |
Complete Leaderboard |
You will be given an array A of N non-negative integers. Your task is to find the rightmost non-zero digit in the product of array elements.
Example 1:
Input: N = 4, A = {3, 23, 30, 45} Output: 5 Explanation: Product of these numbers are 93150.Rightmost non-zero digit is 5.
Example 2:
Input: N = 5, A = {1, 2, 3, 4, 5} Output: 5 Explanation: Product of these numbers are 120. Rightmost non-zero digit is 5.
Your Task:
You don't need to read input or print anything. Your task is to complete the function rightmostNonZeroDigit() which takes an array A and returns the rightmost non-zero digit in the product of array elements, if there is no right most non zero digit, then return -1.
Expected Time Complexity: O(N)
Expected Auxiliary Space: O(N)
Constraints:
1 ≤ N ≤ 100
0 ≤ A[i] ≤ 1010
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Yes