mhhung/coding-practice
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

refactor: refactor project structure

Browse Source
This commit is contained in:
MH Hung
2025-09-01 09:13:32 +08:00
parent 524784a3c5
commit 9fec047d3f
42 changed files with 0 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
legacy/2438 ProductQueries/description.md Executable file
View File

@@ -0,0 +1,5 @@
Given a positive integer n, there exists a 0-indexed array called powers, composed of the minimum number of powers of 2 that sum to n. The array is sorted in non-decreasing order, and there is only one way to form the array.
You are also given a 0-indexed 2D integer array queries, where queries[i] = [lefti, righti]. Each queries[i] represents a query where you have to find the product of all powers[j] with lefti <= j <= righti.
Return an array answers, equal in length to queries, where answers[i] is the answer to the ith query. Since the answer to the ith query may be too large, each answers[i] should be returned modulo 109 + 7.