# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#219. Contains Duplicate II
#Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.
## @param {Integer[]} nums
## @param {Integer} k
## @return {Boolean}
#def contains_nearby_duplicate(nums, k)
#end



# Time Is Money