Skip to content

Practice Number of Subarrays With LCM Equal to K

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2470
LeetCode Problem

Number of Subarrays With LCM Equal to K

ArrayMathNumber Theory

Problem Statement

Given an integer array nums and an integer k, return the number of subarrays of nums where the least common multiple of the subarray's elements is k. A subarray is a contiguous non-empty sequence of elements within an array. The least common multiple of an array is the smallest positive integer that is divisible by all the array elements.

Source: Number of Subarrays With LCM Equal to K on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [3,6,2,7,1], k = 6
Output
4

# Example 2

Input
nums = [3], k = 2
Output
0

Constraints

1 <= nums.length <= 1000
1 <= nums[i], k <= 1000

Related LeetCode Problems

Practice more problems similar to Number of Subarrays With LCM Equal to K.

1 Two Sum Easy2 Add Two Numbers Medium4 Median of Two Sorted Arrays Hard7 Reverse Integer Medium9 Palindrome Number Easy
← Previous Convert the TemperatureNext → Minimum Number of Operations to Sort a Binary Tree by Level

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free