## Coding questions Solve the following array problems. ### Problem 1: Check for duplicates Given an integer array `nums`, return `true` if any value appears **at least twice** in the array, and `false` if every element is distinct. **Input:** `nums: int[]` **Output:** `bool` **Constraints (typical):** - `0 <= nums.length <= 1e5` - `-1e9 <= nums[i] <= 1e9` ### Problem 2: Longest subarray with at most two distinct values ("fruit baskets" variant) You are given an array `fruits` where `fruits[i]` is the type of fruit at position `i`. Starting from any position, you can pick one fruit from each consecutive tree moving right, but you can carry **at most two distinct fruit types** total. Return the **maximum number of fruits** you can pick (i.e., the length of the longest contiguous subarray that contains **no more than 2 distinct values**). **Input:** `fruits: int[]` (or `string[]` depending on representation) **Output:** `int` **Constraints (typical):** - `1 <= fruits.length <= 1e5` - Fruit types are hashable (e.g., integers in a reasonable range).