Societe Generale OA 2026 | Distinct Subarrays with K Odd Numbers & Project Dependency Cycle Detection

Problem 1 - Count of Distinct Subarrays with at Most K Odd Elements Problem Statement You are given an integer array nums and an integer K. Count the total number of distinct subarrays that contain at most K odd elements. Two subarrays are considered distinct if they differ at any position, even if they appear multiple times within the original array. Return the total count of unique valid subarrays. Constraints Constraint 1 ≤ N ≤ 10000 1 ≤ nums[i] ≤ ...