Solution

Method 1 – Brute Force Pair Search

Intuition

The problem asks for any pair of indices (i, j) such that the absolute difference of their indices is at least indexDifference and the absolute difference of their values is at least valueDifference. Since the constraints are small, we can check all possible pairs.

Approach

Iterate over all possible pairs (i, j) with two nested loops.
For each pair, check if both abs(i - j) >= indexDifference and abs(nums[i] - nums[j]) >= valueDifference.
If such a pair is found, return [i, j] immediately.
If no such pair exists, return [-1, -1].

Code

[{"language":"C++","code":"class Solution {\npublic:\n    vector<int> findIndices(vector<int>& nums, int indexDifference, int valueDifference) {\n        int n = nums.size();\n        for (int i = 0; i < n; ++i) {\n            for (int j = 0; j < n; ++j) {\n                if (abs(i - j) >= indexDifference && abs(nums[i] - nums[j]) >= valueDifference)\n                    return {i, j};\n

Related Tags