title: (LeetCode) Contains Duplicate III
body: <blockquote>
    <p>Given an array of integers, find out whether there are two distinct
    indices i and j in the array such that the difference between nums[i]
    and nums[j] is at most t and the difference between i and j is at most
    k.</p>
  </blockquote>
  
  <p>Hello!</p>
  
  <p>I am kinda stumped by this question, to be honest. The solutions provided in the (LeetCode) discussion forum for this question did not provide much explanation/thought process as to how to solve it. I'd rather fully understand the technique to solving the problem than having the full implementation code given to me. I feel that it would be the best way to learn.</p>
  
  <p>So, the clue here is to use a (Java) TreeSet to approach this problem. I am assuming that the floor and ceiling methods would be useful here.</p>
  
  <p>I'd appreciate it if there is anyone out there that can give me a bit of a clue/hint to approach this problem. Pseudocode is welcome as well! I don't need the full implementation code as I've said before. Just a starting point would be great! :)</p>
  
  <p>Thanks!</p>
  
  <p>EDIT: I'm also working on this in the meantime! So, if I do eventually get to an answer, I'll post it on here for future reference. :)</p>