What is this error coming?

Quote:

Why I am getting this error?

bool containsNearbyDuplicate(int* nums, int numsSize, int k){
    int i=0;
    int max=nums[0];
    for(i=0;i<numsSize;i++)
    {
        if(max<nums[i])
            max=nums[i];
    }
    int hash[max+1];   // What if max < 0 here ?

Your code do not behave the way you expect, or you don't understand why !

There is an almost universal solution: Run your code on debugger step by step, inspect variables.
The debugger is here to show you what your code is doing and your task is to compare with what it should do.
There is no magic in the debugger, it don't know what your code is supposed to do, it don't find bugs, it just help you to by showing you what is going on. When the code don't do what is expected, you are close to a bug.
To see what your code is doing: Just set a breakpoint and see your code performing, the debugger allow you to execute lines 1 by 1 and to inspect variables as it execute.

Debugger - Wikipedia, the free encyclopedia[^]

Mastering Debugging in Visual Studio 2010 - A Beginner's Guide[^]
Basic Debugging with Visual Studio 2010 - YouTube[^]

1.11 — Debugging your program (stepping and breakpoints) | Learn C++[^]

The debugger is here to only show you what your code is doing and your task is to compare with what it should do.

In the case of max<0
The code:

bool containsNearbyDuplicate(int* nums, int numsSize, int k){
    int i=0;
    int max=nums[0];
    int min=nums[0];
    for(i=0;i<numsSize;i++)
    {
        if(max<nums[i])
            max=nums[i];
        if(min>nums[i])
            min=nums[i];
    }
     
   
    if(max>=0)
    {
         int hash1[max+1];   
    for(i=0;i<max+1;i++)
    {
        hash1[i]=0;
    }
        
         for(i=0;i<numsSize;i++)
    {
        if(nums[i]>=0)
        {
            hash1[nums[i]]++;
        }
    }
        
        int s=0,i1,i2,j;
    while(s<max+1)
    {
       if(hash1[s]>1)
       {
           for(i=0;i<numsSize;i++)
           {
               if(nums[i]==s)    //
               {
                   i1=i;
                   j=i+1;
                   while(j<numsSize)
                   {
                       if(nums[j]==s)  //
                       {
                           i2=j;
                           if(i2-i1<=k)
                           {
                               return true;
                           }
                           else
                           {
                               j++;    //    
                           }
                       }
                       else
                       {
                           j++;   //
                       }
                   }
                   
               }
           }
           s++;    //
       }
        else
    {
        s++;
    }
    }
    }
    if(min<0)
    {
         int hash2[(-1*min)+1];   
    for(i=0;i<(-1*min)+1;i++)
    {
        hash2[i]=0;
    }
         for(i=0;i<numsSize;i++)
    {
        if(nums[i]<0)
        {
            hash2[-1*nums[i]]++;
        }

         }
        
         int s=0,i1,i2,j;
     while(s<(-1*min)+1)
    {
       if(hash2[s]>1)
       {
           for(i=0;i<numsSize;i++)
           {
               if(nums[i]==(-1*s))    //
               {
                   i1=i;
                   j=i+1;
                   while(j<numsSize)
                   {
                       if(nums[j]==(-1*s))  //
                       {
                           i2=j;
                           if(i2-i1<=k)
                           {
                               return true;
                           }
                           else
                           {
                               j++;    //    
                           }
                       }
                       else
                       {
                           j++;   //
                       }
                   }
                   
               }
           }
           s++;    //
       }
        else
    {
        s++;
    }
    }
    
         }
    
    
    return false;
}