Find the Sum of the Power of All Subsequences at DE Shaw
Hard38.0% acceptance
This problem has 75.0% frequency at DE Shaw.
Problem Description
You are given an integer array `nums` of length `n` and a **positive** integer `k`. The **power** of an array of integers is defined as the number of subsequences with their sum **equal** to `k`. Return _the**sum** of **power** of all subsequences of_ `nums` _._ Since the answer may be very large...
Read full problem and hintsTopics
Also asked at 1 company
More DE Shaw Questions
Binary Tree CamerasHardFind Minimum Cost to Remove Array ElementsMediumMaximum Points After Collecting Coins From All NodesHardRelative Sort ArrayEasyMaximum Strength of K Disjoint SubarraysHard
View all DE Shaw questions