Solving Play with Chips in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example 1:

Input: chips = [1,2,3]
Output: 1
Explanation: Second chip will be moved to positon 3 with cost 1. First chip will be moved to position 3 with cost 0. Total cost is 1.

Example 2:

Input: chips = [2,2,2,3,3]
Output: 2
Explanation: Both fourth and fifth chip will be moved to position two with cost 1. Total minimum cost will be 2.

Constraints:

  • 1 <= chips.length <= 100

  • 1 <= chips[i] <= 10^9

  • 1 <= chips.length <= 100

  • 1 <= chips[i] <= 10^9

See the full details of the problem Play with Chips at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go