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...
perfinsights.hashnode.dev1 min read