Challenge
Challenge
Problem
Solutions
Submissions
Challenge Points: 10
Level: EasyYou are given an integer array nums and an integer k.
Your task is to find the smallest positive multiple of k that is not present in the array nums.
A multiple of k is any positive integer that can be written as m * k, where m is a positive integer.
Input: nums = [3, 6, 9, 12] k = 3
Output: 15
Input: nums = [5, 10, 20, 25] k = 5
Output: 15
Accepted:
Submission:
Report an issue
Code
You need toto run or submitYou need toto run or submit
Test Case
Test Result