Count exact matches for a chosen integer in a seed list. Task: Count occurrences of target x in the list. Input format: n, then n integers, then target x. Output format: One integer: the frequency. Constraints: 1 <= n <= 100000; -10^9 <= a[i],x <= 10^9 Edge rules: Apply the stated zero, tie, boundary, and ordering conventions exactly.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 100000; -10^9 <= a[i],x <= 10^9
Tags:
