Here is problem solution - https://programs.programmingoneonone.com/2021/03/hackerrank-mark-and-toys-solution.html

Python3 Solution

def maximumToys(prices, k):
        # Sort the prices in ascending order
        prices.sort()

        # Initialize a variable to keep track of the total cost of the toys
        total_cost = 0
        # Initialize a variable to keep track of the number of toys
        num_toys = 0
        # Iterate through the prices list
        for price in prices:
                # Check if the current price plus the total cost is less than or equal to k
                if total_cost + price <= k:
                        # If yes, add the current price to the total cost
                        total_cost += price
                        # Increment the number of toys
                        num_toys += 1
                else:
                        # If not, break out of the loop
                        break
        return num_toys

php

function maximumToys($prices, $k) {
    // Write your code here
    $length = count($prices);
    sort($prices);
    $sum = 0;
    for ($i = 0; $i < $length; $i++) {
        $sum += $prices[$i];
        if ($sum > $k) {
           return $i;
        }
    }

    return $i;
}