Determine the Minimum Sum of a k-avoiding Array at Infosys

Problem Description

You are given two integers, `n` and `k`. An array of **distinct** positive integers is called a **k-avoiding** array if there does not exist any pair of distinct elements that sum to `k`. Return _the**minimum** possible sum of a k-avoiding array of length _`n`.

Topics