Algorithm Group 3
Algorithm Group 3 contains five exercises focused on correlated collections, pair processing, configurable numeric ranges, frequency analysis, calculated limits, and normalization.
Several tasks in this group operate on multiple collections whose elements are related by their index positions.
Tasks
Task 1 — Pair Sum Matching
Create pairs from two integer slices using matching index positions and return the indexes whose pair sums match one of the requested target values.
Task 2 — Pair Sum Delta Matching
Extend pair-sum matching with a configurable delta that defines an allowed range around or relative to a target value.
Task 3 — Frequency Grouping
Generate a collection of random integer values and classify each distinct value according to how many times it occurs.
Task 4 — Indexed Multiplication Limits
Associate each decimal value with a collection of multipliers, calculate the resulting value, and compare it against an individual limit.
Task 5 — Pair Normalization Analysis
Create pairs by combining values from opposite ends of a slice and analyze the multiplication result of every pair against a normalization value.
Objectives
The exercises in this group provide practice with:
- correlated slices
- index-based pairing
- sum matching
- configurable ranges
- parsing control values
- frequency counting
- random data generation
- floating-point calculations
- related multi-dimensional collections
- typed calculation results
- normalization
- formatted analysis output
Index Relationships
Several exercises in this group depend on the same index representing related data across multiple collections.
For example:
p1[0] is paired with p2[0]
p1[1] is paired with p2[1]
p1[2] is paired with p2[2]
When collections are related in this way, their lengths and index relationships must be considered part of the input validation.
Implementation
The examples define the expected behavior for the provided data, but implementations should solve the general problem described by each task.
Where the original specification used weakly typed output or contained an inconsistent example, the individual task page provides a clarified specification while preserving the original algorithmic objective.