2551. Put Marbles in Bags

You have k bags. You are given a 0-indexed integer array weights where weights[i] is the weight of the ith marble. You are also given the integer k. Divide the marbles into the k bags according to the following rules: - No bag is empty. - If the ith marble and jth marble are in a bag, then all marbles with an index between the ith and jth indices should also be in that same bag. - If a bag con