Smallest Index With Equal Value

Given a 0-indexed integer array nums, return the smallest index i of nums such that i mod 10 == nums[i], or -1 if such index does not exist.

x mod y denotes the remainder when x is divided by y.

LeetCode Problem - 2057

class Solution {
    public int smallestEqual(int[] nums) {
        // Initialize answer with a very large value (maximum integer value)
        int answer = Integer.MAX_VALUE;
        // Flag to check if any matching index is found
        boolean flag = true;

        // Iterate through the array to find the smallest index that satisfies the condition
        for(int i = 0; i < nums.length; i++) {
            int mod = i % 10; // Calculate i modulo 10 (i % 10) to compare with nums[i]

            // If the modulo result matches the current element in the array
            if(mod == nums[i]) {
                // If the current index is smaller than the previously found answer, update answer
                if(i < answer) {
                    answer = i;   // Update answer with the current index
                    flag = false; // Set flag to false as a matching index is found
                }
            }
        }

        // If no matching index is found, return -1
        if(flag) return -1;

        // Return the smallest index that satisfies the condition
        return answer;
    }
}