Codeforces Beta Round #22 (Div. 2 Only) B. Bargaining Table
Codeforces Beta Round #24 B. F1 Champions
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.
B - dp
E - Last Rook
E - Apple Baskets on Circle
D - Stones
E - Subsequence Path
Codeforces Beta Round #29 (Div. 2, Codeforces format) B. Traffic Lights
Codeforces Beta Round #31 (Div. 2, Codeforces format) B. Sysadmin Bob