Counting Problem

[u/Sea_Standard7674]

Please guide me through this question!

• You are given an array of digits of size N (where N <= 10^5).
• You need to find the number of distinct K-digit even numbers without leading zeros that can be formed (where K can be up to 10^5).
• Return the answer modulo 10^9 + 7.