Pravin K
Reputation: 311
Count the number of subsequence of length k from an array of size n
Is there any direct formula to count the number of subsequences possible from an array of size n It is not needed to be contiguous and also not needed to be only distinct subsequences
Upvotes: 2
Views: 2750
Answers (1)
MBo
Reputation: 80187
Yes, there is formula for number of combinations
nCr(n, k) or C(n,k) = n! / ((n-k)! * k!)
Upvotes: 1
Related Questions
- Count total subsequences whose sum is divisible by k
- For each element, count how many given subarrays contain it
- How to get the number of the Subarray with at least K different numbers?
- Finding total number of subsequences in an array with consecutive difference = k
- Count All Sub sequences having Product less than K
- No. of distinct subsequences of length 3 in an array of length n
- Generating increasing subsequences out of n numbers of length k
- Counting sequences of k elements
- How can I find the number of non-decreasing subsequences in an array?
- Counting contigious subsequences in an array with given pair of indices