Skip to content

2260. Minimum Consecutive Cards to Pick Up 👍

  • Time: $O(n)$
  • Space: $O(1)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
class Solution {
 public:
  int minimumCardPickup(vector<int>& cards) {
    int ans = INT_MAX;
    unordered_map<int, int> lastSeen;

    for (int i = 0; i < cards.size(); ++i) {
      if (const auto it = lastSeen.find(cards[i]); it != lastSeen.cend())
        ans = min(ans, i - it->second + 1);
      lastSeen[cards[i]] = i;
    }

    return ans == INT_MAX ? -1 : ans;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
class Solution {
  public int minimumCardPickup(int[] cards) {
    int ans = Integer.MAX_VALUE;
    Map<Integer, Integer> lastSeen = new HashMap<>();

    for (int i = 0; i < cards.length; ++i) {
      if (lastSeen.containsKey(cards[i]))
        ans = Math.min(ans, i - lastSeen.get(cards[i]) + 1);
      lastSeen.put(cards[i], i);
    }

    return ans == Integer.MAX_VALUE ? -1 : ans;
  }
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
class Solution:
  def minimumCardPickup(self, cards: List[int]) -> int:
    ans = math.inf
    lastSeen = {}

    for i, card in enumerate(cards):
      if card in lastSeen:
        ans = min(ans, i - lastSeen[card] + 1)
      lastSeen[card] = i

    return -1 if ans == math.inf else ans