Combinations with Repeat

Prob. and Stats

Difficulty: 2 | Problem written by peter.washington
Problem reported in interviews at


Given n items, return how many ways there are to choose k of the items, where order doesn't matter, but elements selected can be repeated

Sample Input:
<class 'int'>
n: 5
<class 'int'>
k: 3

Expected Output:
<class 'int'>

This is a premium problem, to view more details of this problem please sign up for MLPro Premium. MLPro premium offers access to actual machine learning and data science interview questions and coding challenges commonly asked at tech companies all over the world

MLPro Premium also allows you to access all our high quality MCQs which are not available on the free tier.

Not able to solve a problem? MLPro premium brings you access to solutions for all problems available on MLPro

Get access to Premium only exclusive educational content available to only Premium users.

Have an issue, the MLPro support team is available 24X7 to Premium users.

This is a premium feature.
To access this and other such features, click on upgrade below.

Log in to post a comment

Jump to comment-84
rafi • 7¬†months, 2¬†weeks ago


Here the formula is slightly different

return factorial((n+k-1)) / (factorial(k) * factorial((n - 1)))



Input Test Case

Please enter only one test case at a time
numpy has been already imported as np (import numpy as np)