Leetcode 3247. Number of Subsequences with Odd Sum

Count the number of non-empty subsequences of an integer array whose sum is odd (answer may be large — typically return modulo 1e9+7). The core challenge is tracking parity combinations efficiently — e.g., using parity-based DP or combinatorics to update counts of even/odd-sum subsequences as you iterate the array.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3247. Number of Subsequences with Odd Sum

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact