class Solution {

public:

    bool checkSubarraySum(vector<int>& nums, int k) {

        unordered_map<int,int> allsum;

        allsum.insert(make_pair(,-));

        int sum=;

        for(int i=;i<nums.size();++i)

        {

            sum+=nums[i];

            if(k)sum%=k;

            auto j=allsum.find(sum);

            if(j!=allsum.end())

            {

                if(i-j->second>)return true;

            }

            allsum.insert(make_pair(sum,i));

        }

        return false;

    }

};