CareerCup

I would hashset the array to remove duplicate items. Then find the min and max value. If (max-min) + 1 == hashset size then the array is contiguous, otherwise it is not.

public bool IsArrayContiguous(int[] arr)
        {
            if (arr == null || arr.Length == 0)
                return false;

            var dedupedItems = new HashSet<int>(arr);
            int? minValue = null;
            int? maxValue = null;

            if (dedupedItems.Count == int.MaxValue) // array includes all possible integers
                return true; 

            foreach (var val in dedupedItems)
            {
                if (minValue == null || minValue.Value > val)
                    minValue = val;

                if (maxValue == null || maxValue.Value < val)
                    maxValue = val;
            }

            return (maxValue - minValue + 1 == dedupedItems.Count);
        }

private static boolean evaluateConsecutive(int[] arr){
        Set set = new TreeSet();
        Arrays.stream(arr).boxed().forEach(x -> set.add(x));

        int a=-1,b=-1;
        Iterator<Integer> it = set.iterator();
        do {
            a = (it.hasNext()) ? it.next() : -1;
            b = (it.hasNext()) ? it.next() : -1;

            if (b > 0 && b != a+1){
                return false;
            }
        } while (it.hasNext());
        return true;
    }

def isContiguous(arr):
	if len(arr)==0:
		return False
	mini=min(arr)
	maxi=max(arr)
	for i in range(mini,maxi+1):
		if i not in arr:
			return False
	return True

def isContiguous(arr):
	seen=set()
	for i in range(len(arr)):
		seen.add(arr[i])
	count=1
	cur_el=arr[0]-1
	while cur_el in seen:
		count+=1
		cur_el-=1
	cur_el=arr[0]+1
	while cur_el in seen:
		count+=1
		cur_el+=1
	if count==len(seen):
		return True
	else:
		return False