How should I practice Tally the Number of Friend Groups with K Sets of Matching Traits 🐰?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Trade Desk online assessment problems in FastPrep.

Is Tally the Number of Friend Groups with K Sets of Matching Traits 🐰 associated with Trade Desk?

FastPrep tags this as a Trade Desk online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · Array

Tally the Number of Friend Groups with K Sets of Matching Traits 🐰

Learn this problem

● MediumTDTrade DeskOA

Problem statement

You are given an integer array friendList and a positive integer minimumPairs. Count the contiguous subarrays that contain at least minimumPairs disjoint pairs of equal values.

More formally, a qualifying subarray contains 2 * minimumPairs elements at pairwise distinct indices that can be grouped into minimumPairs pairs, with the two values in every pair equal. One array element cannot be used in more than one pair.

Return the number of qualifying contiguous subarrays.

Function

tDeskFriendList(friendList: int[], minimumPairs: int) → int

Examples

Example 1

friendList = [0, 1, 0, 1, 0]minimumPairs = 2return = 3

The qualifying subarrays are indices [0..3], [1..4], and [0..4]. Each contains two disjoint equal-value pairs.

Example 2

friendList = [2, 2, 2, 2, 2, 2]minimumPairs = 3return = 1

Only the full array contains six elements, which form three disjoint pairs of equal values.

Constraints

Unknown for now