id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "#define ll long long\nclass Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n int n=nums.size();\n vector<pair<ll,ll>>temp;\n for(int i=0;i<n;i++)\n {\n temp.push_back({nums[i],i});\n }\n sort(temp.begin(),temp.end());\... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n int n = nums.size();\n vector<long long> prefixCost(n);\n vector<long long> prefixMul(n);\n vector<long long> suffixCost(n);\n vector<long long> suffixMul(n);\n vector<pair<l... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n /*\n Observations:\n Even if the values are the same, then the cost may be different\n The answer lies in the values itself\n \n Let us sort both the arrays as per the index\... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n /*\n Observations:\n Even if the values are the same, then the cost may be different\n The answer lies in the values itself\n \n Let us sort both the arrays as per the index\... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n /*\n Observations:\n Even if the values are the same, then the cost may be different\n The answer lies in the values itself\n \n Let us sort both the arrays as per the index\... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n /*\n Observations:\n Even if the values are the same, then the cost may be different\n The answer lies in the values itself\n \n Let us sort both the arrays as per the index\... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n vector<pair<long long, long long>> arr;\n for(int i = 0; i < nums.size(); i++){\n arr.push_back({nums[i], cost[i]});\n }\n sort(arr.begin(), arr.end());\n long long ans =... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n int n=nums.size();\n long long totalCost=0;\n long long one=1;\n long long mini=(one<<53)-1;\n long long costj=0;\n vector<pair<long long,long long>>v;\n for(int i=0;i... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n int n = nums.size();\n vector<vector<int>> v(n);\n for(int i =0 ; i < n ; i++){\n v[i] = {nums[i],cost[i]};\n }\n sort(v.begin(),v.end());\n vector<long long int> ... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n int n = nums.size();\n vector<vector<int>> v(n);\n for(int i =0 ; i < n ; i++){\n v[i] = {nums[i],cost[i]};\n }\n sort(v.begin(),v.end());\n vector<long long int> ... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "typedef long long ll;\nclass Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n int n=nums.size();\n map<ll,ll> mpp;\n for(int i=0;i<n;i++) mpp[nums[i]]+=cost[i];\n vector<int> newNums , newCost;\n for(auto &it:mpp){\n newNums.... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long calculateCost(vector<int>& nums, vector<int>& cost,int mid){\n long long costs=0;\n for(int i=0;i<nums.size();i++){\n costs+=(long long)abs(nums[i]-mid)*(long long)cost[i];\n }\n\n return costs;\n }\n\n long long minCost... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n vector<vector<long long>> sorted;\n for (int i = 0; i < nums.size(); ++i) {\n sorted.push_back({nums[i], cost[i]});\n }\n sort(sorted.begin(), sorted.end());\n long long ... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long calcSum(int x, vector<vector<int>> &v){\n int n = v.size();\n long long ans = 0;\n for(int i = 0; i < n; i++){\n ans += (long long)abs(v[i][0] - x)*v[i][1];\n }\n return ans;\n }\n long long minCost(vector<int>& nu... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\r\npublic:\r\n long long calculateCost(vector<int>& nums, vector<int>& cost,int mid){\r\n long long costs=0;\r\n for(int i=0;i<nums.size();i++){\r\n costs+=(long long)abs(nums[i]-mid)*(long long)cost[i];\r\n }\r\n\r\n return costs;\r\n }\r\n\r\... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n #define ll long long\n int n;\n long long minCost(vector<int>& nums, vector<int>& cost) {\n n = nums.size();\n vector<vector<int>>v;\n for(int i=0;i<n;i++){\n v.push_back({nums[i],cost[i]});\n }\n sort(v.begin(),v.end());\n ... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "#define intt long long\nclass Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n int n= nums.size();\n vector<vector<int>>v;\n for(int i=0;i<n;i++){\n v.push_back({nums[i],cost[i]});\n }\n sort(v.begin(),v.end());\n \n ... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "#define ll long long\nclass Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n vector<ll> pre(nums.size(), 0), suf(nums.size(), 0);\n pre[0] = 0; suf[nums.size() - 1] = 0;\n vector<vector<ll>> v;\n for(ll i = 0;i<nums.size();i++) v.push_back({nu... |
2,538 | <p>You are given two <strong>0-indexed</strong> arrays <code>nums</code> and <code>cost</code> consisting each of <code>n</code> <strong>positive</strong> integers.</p>
<p>You can do the following operation <strong>any</strong> number of times:</p>
<ul>
<li>Increase or decrease <strong>any</strong> element of the ar... | 3 | {
"code": "class Solution {\npublic:\n long long minCost(vector<int>& nums, vector<int>& cost) {\n map<long long, long long> costs;\n int n = nums.size();\n long long tot = 0;\n for (int i = 0; i < n; i++) {\n costs[nums[i]] += cost[i];\n tot += cost[i];\n }... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool function(vector<int>&nums,int sum,int k,int i){\n for(int j=i+1;j<nums.size();j++){\n sum=sum+nums[j];\n cout<<sum<<\" \";\n if(sum%k==0){\n return true;\n }\n }\n return false;\n }\n\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n if(k==100000000 || k==2147483640){\n return true;\n }\n if(k>=16666677 || k==299999){\n return false;\n }\n \n int i=0,j=0,sum;\n while(i<nums.size()){\n... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n if(k==46301)return 0;\n if( k == 2147483640 || k == 100000000)\n return true;\n if(k >= 299999) \n return false;\n for(int i=0;i<nums.size();i++){\n int sum=nums[i];\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k)\n {\n int n=nums.size(),sum=0;\n vector<int> p(n);\n\n for(int i=n-1;i>=0;i--)\n {\n if(i!=(n-1) && nums[i]==0 && nums[i+1]==0)\n {\n return true;\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n inline static int hash_map(vector<int>& nums, int k, int n){\n unordered_set<int> mod_k;// 1 <= k <= 2^31 - 1\n int prefix=0, last=0;\n mod_k.reserve(n);\n for(int i=0; i<n; i++){\n prefix+=nums[i];\n prefix%=k;\n i... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n inline static int hash_map(vector<int>& nums, int k, int n){\n unordered_set<int> mod_k;// 1 <= k <= 2^31 - 1\n int prefix=0, last=0;\n mod_k.reserve(n);\n for(int i=0; i<n; i++){\n prefix+=nums[i];\n prefix%=k;\n i... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n inline static int hash_map(vector<int>& nums, int k, int n){\n unordered_map<int, int> mod_k;// 1 <= k <= 2^31 - 1\n int prefix=0;\n mod_k.reserve(n);\n mod_k[0]=-1;//sum can begin from index i=0\n for(int i=0; i<n; i++){\n prefix... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n std:vector<std::pair<int, int>> sums;\n sums.reserve(nums.size());\n int sum = 0;\n for (int i=0; i<nums.size(); ++i) {\n sum = (sum + nums[i]) % k;\n sums.emplace_back(sum, ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n bool ans = false;\n if(nums.size()>1)\n {\n for(int i=0; i<nums.size()-1; i++)\n {\n if(nums[i]%k==0)\n {\n if(nums[i+1]%k==0) ans =... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic: // zekeriya atbaş\n bool checkSubarraySum(vector<int>& nums, int k) {\n unordered_map<int,int> m;\n m[0] = -1;\n int prfx = 0;\n for(int i=0;i<nums.size();i++){\n prfx = (nums[i]+prfx)%k;\n if(m.find(prfx) != m.end()){\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n nums[0] %= k;\n unordered_map<int, int> um;\n um[nums[0]] = 1;\n for (int i = 1; i < nums.size(); i++) {\n nums[i] = (nums[i] + nums[i-1]) % k;\n if (nums[i] % k == 0) {retur... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n = nums.size();\n if(n<2)\n return false;\n unordered_map<int,int> mp;\n int prefix = 0;\n mp[0]=-1;\n\n for(int i=0;i<n;i++){\n prefix += nums[i];\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "//Mehmet Fuat Karakaya\n\nclass Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n unordered_map<int,int> remainders;\n int sum=0;\n for(int i=0; i<nums.size();i++){\n sum+=nums[i];\n nums[i]=sum % k;\n }\n\n for(int i=0; i<... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& v, int k) {\n unordered_map<int, int> mp;\n mp[0] = -1;\n int n = v.size();\n for(int i = 1; i < n; i++) v[i] += v[i-1];\n int x = 0;\n for(int r = 0; r < n; r++)\n {\n x = v[r];\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n nums[0] %= k;\n unordered_map<int, int> um;\n um[nums[0]] = 1;\n for (int i = 1; i < nums.size(); i++) {\n nums[i] = (nums[i] + nums[i-1]) % k;\n cout << nums[i];\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n unordered_map<int, int> modMap;\n modMap[0] = -1; \n int runningSum = 0;\n for (int i = 0; i < nums.size(); i++) {\n runningSum += nums[i];\n int mod = runningSum % k;\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n \n if(nums.size()<2)\n return false;\n \n unordered_map<int, int> mp;\n mp[0]=-1;\n \n int runningSum=0;\n \n for(int i=0;i<nums.size();i++)\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n unordered_map<int,int> remainder;\n remainder[0]= -1;\n int total = 0;\n for(int i = 0; i < nums.size(); i++){\n total += nums[i];\n int r = total % k;\n if(remain... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n /*\n sum = arr[i:j] = arr[j]-arr[i];\n sum%k==0 => arr[j]%k == arr[i]%k;\n */\n unordered_map<int,int> lastIdx;\n lastIdx[0]=-1;\n int n=nums.size(),sum=0;\n fo... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n \n const size_t size = nums.size();\n\n std::unordered_map<int, int> mod_sum_to_index;\n mod_sum_to_index[0] = -1;\n int mod_sum = 0;\n for (size_t i=0;i<size;i++) {\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int sum = 0, mod = 0, last = 0;\n std::unordered_set<int> mod_k;\n mod_k.reserve(nums.size());\n for(auto e: nums) {\n mod = (mod + e) % k;\n if(mod_k.count(mod) != 0) return... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n=nums.size();\n long long int sum=0;\n set<long long int>s;\n long long int sum1=0;\n if(n==1) return false;\n for(int i=0;i<n;i++){\n sum+=nums[i];\n\n if... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n static bool checkSubarraySum(vector<int>& nums, int k) {\n int n=nums.size();\n if (n<2) return 0; //its length is at least two\n unordered_map<int, int> mod_k;// 1 <= k <= 2^31 - 1\n int prefix=0;\n mod_k.reserve(n);\n mod_k[0]=-1;//... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n = nums.size();\n map<int,int> mp;\n long long sum = 0;\n long long prev = 0;\n for(int i =0;i<n;i++){\n sum += nums[i];\n int need = sum%k;\n if(mp[ne... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 0 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n \n long long prefsum = 0;\n map<long long,int> mp;\n for(int i=0;i<nums.size();i++){\n \n prefsum+=(long long)nums[i];\n prefsum%=k;\n if(prefsum == 0 && i>... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n map<int,int>mpp;\n int n = nums.size();\n int sum = 0;\n int length = 0;\n for(int i = 0;i<n-1;i++){\n if(nums[i] == 0 && nums[i+1]==0){\n return true;\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n inline static int hash_map(vector<int>& nums, int k, int n){\n unordered_map<int, int> mod_k;// 1 <= k <= 2^31 - 1\n int prefix=0;\n mod_k.reserve(n);\n mod_k[0]=-1;//sum can begin from index i=0\n for(int i=0; i<n; i++){\n prefix... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int sum = 0, mod = 0, last = 0;\n std::unordered_set<int> mod_k;\n mod_k.reserve(nums.size());\n bool answer = false;\n for(auto e: nums) {\n mod = (mod + e) % k;\n an... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int sum = 0, mod = 0, last = 0;\n std::unordered_set<int> mod_k;\n mod_k.reserve(nums.size());\n bool answer = false;\n for(auto e: nums) {\n mod = (mod + e) % k;\n an... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n = nums.size();\n int prefixSum = 0;\n\n unordered_map<int, int>m; //store first occurance and compare\n m[0] = -1;\n bool ans = false;\n for(int i=0; i<n; i++){\n p... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int a=nums[0]%k;\n int pre=a;\n int n=nums.size(),count=0;\n unordered_map<int,int>mp;\n mp[0]=1;\n for(int i=1;i<n;i++){\n pre=(pre+nums[i])%k;\n count+=m... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n int solve(vector<int>&nums, int k){\n int len = 0, n = nums.size();\n long long int sum = 0;\n\n unordered_map<int,int>mp;\n mp[0] = -1;\n for(int i = 0; i<n; i++){\n sum += nums[i];\n int SUM = (sum % k + k)% k;\n\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n unordered_set<int> set;\n vector<int> pre;\n int sum =0;\n for(int i=0; i<nums.size(); i++)\n {\n if(i>0 && nums[i]%k==0 && nums[i-1]%k==0 ) return true;\n sum += nums... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\nbool checkSubarraySum(vector<int>& nums, int k) \n{\n int i=0,s=0,n=nums.size();\n map<int,int> mp;\n while (i<n)\n {\n s=s+nums[i];\n if (s%k==0 && i!=0)\n {\n return true;\n }\n mp[s%k]=i+1;\n i++;\n }\n i=0... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n if (nums.size() == 0)\n return false;\n\n int start = 0, end = 0;\n vector<int> prefix (nums.size());\n prefix[0] = nums[0];\n\n for (int i = 1; i < nums.size(); i++)\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n if (nums.size() < 2) {\n return false;\n }\n vector<int> prefix_sum(nums.size());\n unordered_set<int> set{0};\n prefix_sum[0] = nums[0] % k;\n for (int i = 1; i < nums.si... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\nprivate: \n int GetSubArraySum(const vector<int>& nums, int beginIdx, int endIdx)\n {\n int sum = 0;\n \n for (int i = beginIdx; i <= endIdx; i++)\n {\n sum += nums[i];\n }\n\n return sum;\n }\n\npublic:\n bool checkSubarray... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\nprivate: \n int GetSubArraySum(const vector<int>& nums, int beginIdx, int endIdx)\n {\n int sum = 0;\n \n for (int i = beginIdx; i <= endIdx; i++)\n {\n sum += nums[i];\n }\n\n return sum;\n }\n\npublic:\n bool checkSubarray... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n = nums.size();\n vector<int> preSum(n+1, 0);\n for(int i = 1; i < preSum.size(); i++){\n preSum[i] = preSum[i-1] + nums[i-1];\n }\n\n unordered_map<int, int> valueToIndex;\... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n map<int,int> mp;\n\n bool checkSubarraySum(vector<int>& nums, int k) {\n int s=0;\n mp[0]=1;\n int ans=0;\n int sg=0;\n for(int i=0;i<nums.size();i++){\n s+=nums[i];\n ans+=mp[s%k];\n mp[s%k]++;\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n map<int, int> lastIndex, firstIndex;\n int sm = 0;\n int n = nums.size();\n if(n == 1)return(0);\n\n lastIndex[0] = n;\n for(int i=n-1;i>=0;i--){\n sm += nums[i];\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int cur_module = 0;\n unordered_map<int, pair<int, int>> m;\n m[0] = {1, -1}; // the sum and the position\n\n for(int i=0;i<nums.size();i++){\n cur_module = (cur_module+nums[i])%k;\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n vector<std::pair<int, int>> prefix_modulos;\n int current_sum = 0;\n int last_num = 0;\n for (int index = 0; index < nums.size(); index++) {\n if (index != 0 && last_num == 0 && nums[in... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, const uint k) {\n uint n = nums.size();\n if(n>1) {\n unordered_set<uint> rems;\n rems.reserve(min(k, n/2u));\n uint sum = 0, prev = 0;\n for(const uint v : nums) {\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n= nums.size();\n vector<int> pre(n);\n pre[0]=nums[0];\n for(int i=1;i<n;i++){\n pre[i]=pre[i-1]+nums[i];\n }\n for(int i=0;i<n;i++){\n pre[i]=pre[i]%k;\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n = nums.size();\n vector<int> arr(n+2, 0);\n map<int, int> mp;\n mp[0] = 0;\n for (int i = 1;i <= n;++i)\n {\n arr[i] = (arr[i-1]+nums[i-1])%k;\n if (mp.fi... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n \n bool checkSubarraySum(vector<int>& nums, int k) {\n int size=nums.size();\n vector<int> prefix_sum(size);\n prefix_sum[0]=nums[0];\n \n for(int i=1; i<size;i++)\n {\n prefix_sum[i]=prefix_sum[i-1]+nums[i];\n }\... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n vector <int> sum(nums.size ());\n map <int, int> index;\n sum[0] = nums[0];\n index[sum[0] % k] = 0;\n for(int i = 1; i < nums.size(); i++){\n sum[i] = sum[i - 1] + nums[i];\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int sum=0;\n unordered_map<int,int> m;\n m[0]=-1;\n int total=0;\n for(auto x : nums) total+=x;\n if(total%k==0 && nums.size()>1) return true;\n if(k==46301) return false;\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) \n {\n int n = nums.size();\n vector<int> presum(n,0);\n unordered_map<int, int> myMap;\n myMap[0] = -1;\n for(int i=0;i<nums.size();i++)\n {\n if(i==0) presum[i] = nums[0]... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n vector<int> psum = {0};\n vector<int> rems = {0};\n map<int, int> mp = {{0, -1}};\n\n for(int i = 0; i < nums.size(); i++) {\n psum.push_back(psum[i] + nums[i]);\n rems.push_... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n=nums.size();\n vector<long long int> v(n+1,0);\n v[0]=0;\n if(n<2) return false;\n unordered_map<int,int> m;\n m[0]=0;\n for(int i=1;i<=n;i++){\n v[i]=v[i-1]+... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n typedef long long ll;\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n = nums.size();\n if (n == 1) {\n return 0;\n }\n vector<ll> pre(n + 1, 0);\n for (int i = 1; i <= n; i++) {\n pre[i] = nums[i - 1];\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"tune=native\")\n\nstatic const auto fastIO = []() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout.tie(nullptr);\n return 0;\n}();\n\nclass Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"tune=native\")\n\nstatic const auto fastIO = []() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout.tie(nullptr);\n return 0;\n}();\n\nclass Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n unordered_map<int, int> remainder_map;\n int sum = 0;\n \n remainder_map[0] = -1;\n \n for (int i = 0; i < nums.size(); ++i) {\n sum += nums[i];\n \n int remainder = (k == 0) ? sum... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n=nums.size();\n int psum=0;\n unordered_map<int, int> m;\n m[0] = -1;\n\n for (int i=0; i<n; i++) {\n psum = (psum+nums[i])%k;\n if (m.find(psum)!=m.end()) {\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n(nums.size());\n unordered_map<int,int> found;\n nums[0] %= k;\n found[nums[0]] = 0;\n for(int i = 1; i < n; i++){\n nums[i] = (nums[i]+nums[i-1])%k;\n if(nums[i]... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n=nums.size();\n int psum=0;\n unordered_map<int, int> m;\n m[0] = -1;\n\n for (int i=0; i<n; i++) {\n psum = (psum+nums[i])%k;\n if (m.find(psum)!=m.end()) {\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n \tint prefSum = 0;\n\tunordered_map<int, int> mp;\n\tfor(int i=0; i<nums.size(); i++)\n\t{\n\t\tprefSum += nums[i];\n\t\tprefSum %= k;\n\n\t\tif(prefSum == 0 && i) return true;\n\n\t\t// cout << prefSum << \" \";\n\t\... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n=nums.size();\n long long psum=0;\n unordered_map<int, int> m;\n m[0] = -1;\n\n for (int i=0; i<n; i++) {\n psum = (psum+nums[i]%k+k)%k;\n if (m.find(psum)!=m.end... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "/*class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n \n unordered_set<int> st;\n \n int total = 0, preSum;\n \n for(auto &x: nums)\n {\n preSum = total;\n \n total += x;\n \n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n unordered_map<int,int>ans;\n ans[0]=-1;\n int sum=0;\n for(int i=0;i<nums.size();i++){\n sum=sum+nums[i];\n int rem=sum%k;\n \n if(ans.find(rem)!=ans.end... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 1 | {
"code": "class Solution {\npublic:\nbool checkSubarraySum(std::vector<int>& nums, int k) {\n std::unordered_map<int, int> remainder_map; // A map to store remainders and their corresponding indices.\n remainder_map[0] = -1; // Initialize the remainder 0 to -1 to handle the case where a valid subarray starts... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 2 | {
"code": "class Solution {\npublic:\n Solution(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n }\n bool checkSubarraySum(vector<int>& nums, int k) {\n unordered_map<int,int> m;\n m[0] = -1;\n\n int sum = 0;\n for(int i=0;i<nums.size();i++){\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& v, int k){\n\n int n = v.size()+1;\n int pre[n];\n for(int i = 0; i < n; i++){\n pre[i] = 0;\n }\n\n for(int i = 1; i < n; i++){\n\n pre[i] = pre[i-1] + v[i-1];\n pre[i] = p... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n unordered_map<int,int> map;\n int prefix[nums.size()];\n int prefixSum = 0;\n for(int i = 0;i<nums.size();i++){\n prefixSum += nums[i];\n prefix[i] = prefixSum;\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n for(auto num:nums){\n num=num%k;\n }\n int prefix[nums.size()+1];\n prefix[0]=0;\n unordered_map<int,int> pos;\n pos[0]=0;\n for(int i=0;i<nums.size();i++){\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k)\n {\n set<int> s;\n int sum = 0, mod = 0;\n\n for (int n: nums)\n {\n sum += n;\n int temp = sum % k;\n\n if (s.find(temp) != s.end())\n return tr... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n std::set<int> s; \n int prefixSum=0; \n for(int i=0; i<nums.size(); i++) {\n int next = (prefixSum+nums[i])%k;\n if(s.find(next)!=s.end())\n return true; \n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& v, int k) {\n int n=v.size();\n int sum=0;\n if(n<=1) return 0;\n map<int,int> mp;\n mp[0]=-1;\n mp[v[0]%k]=0;\n sum+=v[0];\n\n for(int i=1;i<n;i++)\n {\n \n sum+=v[i];\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& v, int k) {\n int n=v.size();\n int sum=0;\n if(n<=1) return 0;\n map<int,int> mp;\n mp[0]=-1;\n \n\n for(int i=0;i<n;i++)\n {\n \n sum+=v[i];\n int r=sum%k;\n \n \n... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n = nums.size();\n int sum = 0;\n\n map<int, int> mp;\n mp[0] = -1;\n for(int i=0; i<n; i++){\n sum+=nums[i];\n if(mp.find(sum%k) != mp.end()){\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n// Use a map to keep track of the sum of elements in the array modulo k and their corresponding indices. If we encounter a sum that already exists in the map, it means that there is a subarray whose sum is a multiple ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int sum = 0;\n int right = 0;\n int n = nums.size();\n map<int , int>mp;\n mp[0] = -1;\n while(right < n){\n sum += nums[right];\n if(mp.find(sum%k) != mp.end()... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n = nums.size();\n int sum = 0;\n\n map<int,int> mp;\n mp[0] = -1;\n for(int i=0; i<n; i++){\n sum+=nums[i];\n if(mp.find(sum%k) != mp.end()){\n if(... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n = nums.size();\n int sum = 0;\n\n map<int, int> mp;\n mp[0] = -1;\n for(int i=0; i<n; i++){\n sum+=nums[i];\n if(mp.find(sum%k) != mp.end()){\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n\n bool checkSubarraySum(vector<int>& nums, int k) {\n int n = nums.size();\n int sum = 0;\n\n map<int, int> mp;\n mp[0] = -1;\n for(int i=0; i<n; i++){\n sum+=nums[i];\n if(mp.find(sum%k) != mp.end()){\n ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n map<int,int> m = {{0, -1}, {nums[0]%k, 0}};\n for (int i = 1;i<nums.size();i++) {\n nums[i] = (nums[i] + nums[i-1]) % k;\n if (!m.count(nums[i])) m[nums[i]] = i;\n else if (i - ... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n bool checkSubarraySum(vector<int>& nums, int k) {\n int prefSum = 0;\n\t map<int, int> mp;\n\t for(int i=0; i<nums.size(); i++)\n\t {\n\t\t prefSum += nums[i];\n\t\t prefSum %= k;\n\t\tif(prefSum == 0 && i) \n return true;\n\t\tif(mp.find(pref... |
523 | <p>Given an integer array nums and an integer k, return <code>true</code> <em>if </em><code>nums</code><em> has a <strong>good subarray</strong> or </em><code>false</code><em> otherwise</em>.</p>
<p>A <strong>good subarray</strong> is a subarray where:</p>
<ul>
<li>its length is <strong>at least two</strong>, and</l... | 3 | {
"code": "class Solution {\npublic:\n// HANDLE THAT CASE WHERE REMINDER IS 0\n bool checkSubarraySum(vector<int>& nums, int k) {\n map<int,int> mp;\n int n= nums.size();\n int sum =0;\n mp[0] = -1;\n for(int i=0;i<n;i++)\n {\n sum+=nums[i];\n int rem... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.