#2057 - Smallest Index With Equal Value

Easy • View on LeetCode • View on GitHub

Problem Description

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.

Solution

/**
 * @param {number[]} nums
 * @return {number}
 */
var smallestEqual = function(nums) {
  for (let i = 0; i < nums.length; i++) {
    if (i % 10 === nums[i]) {
      return i;
    }
  }
  return -1;
};