coin change problem total way in o(n)space

long long numberOfWays(int coins[],int numberOfCoins,int value)
{

    long long ways[value+1]={0};
    ways[0]=1;
    vector<int> coinsSet;

    for(int i=0;i<numberOfCoins;i++)
    {
        coinsSet.push_back(coins[i]);
    }
    for(auto coin:coinsSet)
    {
        for(int i=1;i<value+1;i++)
        {
            if(i>=coin)
            {
                ways[i]=ways[i]+ways[i-coin];
            }
        }
    }

    return ways[value];
}