Sort by

recency

|

738 Discussions

|

  • + 0 comments

    Cool!!

  • + 1 comment

    best sewing machine for sewing and quilting For sewing enthusiasts and quilters, a versatile and reliable sewing machine is essential. The Brother XR9550 is highly recommended for its ease of use and variety of features, offering 165 built-in stitches and an automatic needle threader, making it suitable for both beginners and experienced quilters. Another popular option is the Janome 3160QDC, known for its durability and precision, with 60 built-in stitches and an extension table that provides ample space for quilting projects. Both models offer excellent stitch quality and the versatility needed for intricate quilting and general sewing, making them ideal choices for hobbyists and professionals alike.

  • + 0 comments

    The Coin Change Problem is a classic algorithmic challenge where the goal is to determine the minimum number of coins needed to make a specific amount of money using a given set of denominations. The problem can be approached using dynamic programming, where an array is maintained to store the minimum coins required for each amount from 0 up to the target. By iteratively building up solutions for smaller amounts, one can efficiently find the minimum coins needed for the desired total .

  • + 0 comments

    short c++ solution using interative dynamic programming

    long getWays(int n, vector<long> c) {
        vector<long> dp(n+1,0);
        dp[0]=1;
        int cs = c.size();
        
         for (int i = 0; i < cs; i++) {
             int coin = c[i];
             for (int j = coin; j <= n; j++) {
                 dp[j] += dp[j-coin];
             }
         }
         
        return dp[n];
    }
    
  • + 0 comments

    The Coin Change Problem is a classic algorithmic challenge that involves determining the minimum number of coins needed to make a specific amount of change from a given set of coin denominations. It can also refer to the problem of counting the different ways to make that amount using the available coins. The problem can be solved using various methods, including dynamic programming, recursion, and greedy algorithms, depending on the specific constraints and requirements. @fadimahar02/best-coyote-calls-24026ccdcb99%2F">https://www.google.com/url?q=https%3A%2F%2Fmedium.com/@fadimahar02/best-coyote-calls-24026ccdcb99%2F