def solve(priceList):
    floors = len(priceList)
    frequencies = len(priceList[0])
    dp = [[0] * frequencies for _ in range(floors)]
    for j in range(frequencies):
        dp[0][j] = priceList[0][j]
    for i in range(1, floors):
        for j in range(frequencies):
            min_cost = float('inf')
            for k in range(frequencies):
                if k != j:
                    min_cost = min(min_cost, dp[i-1][k])
            dp[i][j] = priceList[i][j] + min_cost
    return min(dp[-1])

SOTI TEST EXAM👍

Please join this discussion group post your quires and doubts 📣📣

#SoTi

https://t.me/+hzoLCnJr5Jk2NTg1

Join nd let's help each other's ❤️👍📣

SOTI test Accomplished 👍💯

ANY oA help:

@Mrtrueliving_ix ✔️✔️ @Mrtrueliving_ix

Flipkart (SdE)Sending test mail's...ping me who need help


💯 🛍 Test Clearance

#paid help

DM for @Mrtrueliving_ix👍💯