You are given an array of positive integers nums.
An element qualifies if both of these are true:
3, and7 appears at least twice in its decimal representation.The 7s can be anywhere in the number. They do not have to be next to each other.
Return the number of elements in nums that qualify. If the same value appears more than once, each occurrence counts separately.
Input: nums = [771, 3707, 777, 57]
Output: 2
Explanation: 771 = 3 * 257 and has two 7s, so it counts.
3707 has two 7s, but it is not divisible by 3.
777 = 3 * 259 and has three 7s, so it counts.
57 = 3 * 19, but it has only one 7.
Input: nums = [7071, 707, 7770, 177, 27]
Output: 3
Explanation: 7071 = 3 * 2357 and has two 7s that are not next to each other, so it counts.
707 has two 7s, but it is not divisible by 3.
7770 = 3 * 2590 and has three 7s, so it counts.
177 = 3 * 59 and has two 7s, so it counts.
27 = 3 * 9, but it has only one 7.
nums.length ≤105nums[i] ≤109