leetcode-potd

2338. Count the Number of Ideal Arrays

leetcode-potd

You are given two integers n and maxValue, which are used to describe an ideal array. A 0-indexed integer array arr of length n is considered ideal if the following conditions hold: Every arr[i] is

2145. Count the Hidden Sequences

leetcode-potd

You are given a 0-indexed array of n integers differences, which describes the differences between each pair of consecutive integers of a hidden sequence of length (n + 1). More formally, call

368. Largest Divisible Subset

leetcode-potd

Given a set of distinct positive integers nums, return the largest subset answer such that every pair (answer[i], answer[j]) of elements in this subset satisfies: answer[i] %

Scroll to Top