@@ -0,0 +1,373 @@
+package com.anuragkapur.leetcode;%0A%0Aimport java.util.Arrays;%0A%0A/**%0A * @author anuragkapur%0A */%0Apublic class ContainsDuplicate %7B%0A%0A    public boolean containsDuplicate(int%5B%5D nums) %7B%0A%0A        Arrays.sort(nums);%0A        for(int i=0; i%3Cnums.length-1; i++) %7B%0A            if(nums%5Bi%5D == nums%5Bi+1%5D) %7B%0A                return true;%0A            %7D%0A        %7D%0A%0A        return false;%0A    %7D%0A%7D%0A

Add problem #217 solution