LeetCode in Kotlin
2260. Minimum Consecutive Cards to Pick Up
Medium
You are given an integer array cards where cards[i] represents the value of the ith card. A pair of cards are matching if the cards have the same value.
Return the minimum number of consecutive cards you have to pick up to have a pair of matching cards among the picked cards. If it is impossible to have matching cards, return -1.
Example 1:
Input: cards = [3,4,2,3,4,7]
Output: 4
Explanation: We can pick up the cards [3,4,2,3] which contain a matching pair of cards with value 3.
Note that picking up the cards [4,2,3,4] is also optimal.
Example 2:
Input: cards = [1,0,5,3]
Output: -1
Explanation: There is no way to pick up a set of consecutive cards that contain a pair of matching cards.
Constraints:
1 <= cards.length <= 1050 <= cards[i] <= 106
Solution
class Solution {
fun minimumCardPickup(cards: IntArray): Int {
var mindiff = Int.MAX_VALUE
val map: MutableMap<Int, Int> = HashMap()
val n = cards.size
for (i in 0 until n) {
if (map.containsKey(cards[i])) {
val j = map[cards[i]]!!
mindiff = Math.min(mindiff, i - j + 1)
}
map[cards[i]] = i
}
return if (mindiff == Int.MAX_VALUE) {
-1
} else mindiff
}
}