[Codeforces] Beta Round #22 (Div. 2 Only) B. Bargaining TableRead more
[Codeforces] Beta Round #24 B. F1 ChampionsRead more
[LeetCode] Contains Duplicate II

219. Contains Duplicate II

Given an integer array nums and an integer k, return true if there are two distinct indices i and j in the array such that nums[i] == nums[j] and abs(i - j) <= k.

Read more
[AtCoder] B - dpRead more
[AtCoder] E - Last RookRead more
[AtCoder] E - Apple Baskets on CircleRead more
[AtCoder] D - StonesRead more
[AtCoder] E - Subsequence PathRead more
[Codeforces] Beta Round #29 (Div. 2, Codeforces format) B. Traffic LightsRead more
[Codeforces] Beta Round #31 (Div. 2, Codeforces format) B. Sysadmin BobRead more