Company: Godrej_21dec
Difficulty: medium
Budget planning body { font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", "Roboto", "Oxygen", "Ubuntu", "Cantarell", "Fira Sans", "Droid Sans", "Helvetica Neue", sans-serif; line-height: 1.6; color: #333; max-width: 800px; margin: 20px auto; padding: 0 20px; } h1, h2, h3 { border-bottom: 1px solid #eaecef; padding-bottom: 0.3em; } code { font-family: "SFMono-Regular", Consolas, "Liberation Mono", Menlo, Courier, monospace; background-color: #f6f8fa; padding: 0.2em 0.4em; margin: 0; font-size: 85%; border-radius: 3px; } pre { background-color: #f6f8fa; padding: 16px; overflow: auto; border-radius: 3px; } ul, ol { padding-left: 20px; } li { margin-bottom: 8px; } Budget planning Problem Description Given an array arr of N distinct integers, you need to determine the minimum number of containers required to construct all elements of the array using a specific set of operations. You have a set of containers, say x 1 , x 2 , ..., x m , which can hold integer values. You need to perf