CPMagical CP Library

Problem solution · Python

Find Products of Elements of Big Array

Find Products of Elements of Big Array: a Python solution using direct simulation. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Direct simulation
Source
walkccc LeetCode Solutions
Length
41 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Direct simulation

For Find Products of Elements of Big Array, the implementation follows the problem’s operations directly while maintaining only the state needed for the next decision.

  1. Translate each rule into one explicit state update.
  2. Maintain the invariant after every processed item.
  3. Return the accumulated state once all relevant input has been handled.

Code notes

  • 41 lines of Python from the credited upstream file 3145.py.
  • The implementation visibly relies on sequence storage.
  • No explicit loop blocks detected.

Complexity

Count the number and nesting of passes over the input, then include the maintained containers in the memory estimate.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeFind Products of Elements of Big Array · PythonPython
Use this to learn the idea, then write your own version.
class Solution:  def findProductsOfElements(self, queries: list[list[int]]) -> list[int]:    def sumBitsTill(x: int) -> int:      """Returns sum(i.bit_count()), where 1 <= i <= x."""      sumBits = 0      powerOfTwo = 1      while powerOfTwo <= x:        sumBits += (x // (2 * powerOfTwo)) * powerOfTwo        sumBits += max(0, x % (2 * powerOfTwo) + 1 - powerOfTwo)        powerOfTwo *= 2      return sumBits     def sumPowersTill(x: int) -> int:      """Returns sum(all powers of i), where 1 <= i <= x."""      sumPowers = 0      powerOfTwo = 1      for power in range(x.bit_length()):        sumPowers += (x // (2 * powerOfTwo)) * powerOfTwo * power        sumPowers += max(0, x % (2 * powerOfTwo) + 1 - powerOfTwo) * power        powerOfTwo *= 2      return sumPowers     def sumPowersFirstKBigNums(k: int) -> int:      """Returns the sum of powers of the first k numbers in `big_nums`."""      # Find the first number in [1, k] that has sumBitsTill(num) >= k.      num = bisect.bisect_left(range(k), k, key=sumBitsTill)      sumPowers = sumPowersTill(num - 1)      remainingCount = k - sumBitsTill(num - 1)      for power in range(num.bit_length()):        if num >> power & 1:          sumPowers += power          remainingCount -= 1          if remainingCount == 0:            break      return sumPowers     return [pow(2,                sumPowersFirstKBigNums(b + 1) -                sumPowersFirstKBigNums(a), mod)            for a, b, mod in queries]

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗