You are given an integer array ribbons where each element represents the length of a ribbon, and an integer k. You are allowed to cut any ribbon into any number of positive integer length segments, or leave it uncut.

Return the maximum possible positive integer length of ribbon segments such that you can obtain at least k ribbons of that identical length. If it is impossible to obtain at least k ribbons of the same positive integer length, return $0$.

Constraints:

• $1 \leq$ ribbons.length $\leq 10^5$

• $1 \leq$ ribbons[i] $\leq 10^5$

• $1 \leq$ k $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.