id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int solve(vector<int>&v, int a,int b){\n int n=v.size();\n int i=0,f=0;\n int c=0;\n while(i<n){\n if((f==0 && v[i]==a) || (f==1 && v[i]==b)){\n c++;\n f=f^1;\n }\n i++;\n }\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int solve(vector<int>&v,int a,int b) {\n int n=v.size();\n int i=0,f=0;\n int c=0;\n while(i<n) {\n if((f==0 && v[i]==a) || (f==1 && v[i]==b)) {\n c++;\n f=f^1;\n }\n i++;\n }\n... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n// int solve(vector<int> nums , int idx ){\n// int cnt = \n// }\n int maximumLength(vector<int>& nums) {\n int o =0 ; \n int z =0 ;\n\n vector<int> rem;\n for(auto i : nums)rem.push_back(i%2);\n for(auto i : rem)o+=i;\n z= nums.siz... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n void printVec(const vector<vector<int>>& v) {\n for(const auto& iv: v)\n {\n for(const auto n: iv)\n {\n cout << n << \", \";\n }\n cout << endl;\n }\n }\n \n int maximumLength(vector<int... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> arr;\n int dp[200001][2], n;\n int rec(int i, int f){\n if(i == n)\n return 0;\n if(dp[i][f] != -1)\n return dp[i][f];\n int c1 = 0;\n for(int j = i + 1;j < n;j++){\n if((arr[i] + arr[j]) % 2 == f)... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n \n int odd=0;\n int even=0;\n\n vector<int>dp(nums.size(),0);\n\n for(int i=0;i<nums.size();i++)\n {\n if(nums[i]%2==1)\n {\n dp[i]=1;\n odd+... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n int n = nums.size();\n queue<int> q1, q2;\n int odd = 0, even = 0, oddEven = 0, evenOdd = 0;\n for(auto &it : nums) { \n if(it % 2 == 0)\n even++;\n if(it & 1)\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n vector<int>arr;\n int ans = 0;\n int dp[200001][2];\n int Solve(int idx,int rem){\n if(idx>=arr.size()){\n return 0;\n }\n if(dp[idx][rem]!=-1)\n return dp[idx][rem];\n\n int c1 = 0;\n for(int i = idx+1;i<arr.s... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n int n = nums.size(),i,j,l;\n int k=2;\n map<int,vector<int>> m;\n for(i=0;i<n;i++){\n nums[i]%=k;\n m[nums[i]].push_back(i);\n }\n int ans = 0;\n for(auto x: m) {l=... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> arr;\n int dp[100001][2], n;\n int rec(int i, int f){\n if(i == n)\n return 0;\n if(dp[i][f] != -1)\n return dp[i][f];\n int c1 = 0;\n for(int j = i + 1;j < n;j++){\n if((arr[i] + arr[j]) % 2 == f)... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int max(int a , int b) {\n if( a > b ) return a;\n return b;\n }\n int maximumLength(vector<int>& nums) {\n int n = nums.size();\n vector< int > arr( n , 0);\n for(int i=0 ; i<n ; i++){\n arr[i] = nums[i] % 2 ;\n }\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": " class Solution {\npublic:\n \n int sameParity(vector<int>& nums){\n int n = nums.size();\n \n\t\t// longest subsequence if previous and current term are even\n vector<int> even(n, 0);\n if(nums[0] %2 == 0) even[0] = 1;\n \n for(int i=1;i<n;i++){\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n \n int sameParity(vector<int>& nums){\n int n = nums.size();\n \n\t\t// longest subsequence if previous and current term are even\n vector<int> even(n, 0);\n if(nums[0] %2 == 0) even[0] = 1;\n \n for(int i=1;i<n;i++){\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n int n = nums.size();\n vector<int>dp1(n,0);//even odd\n vector<int>dp2(n,0);//only even\n vector<int>dp3(n,0);//only odd\n int is_even = 0;\n if(nums[0]%2==0)\n {\n dp2[0]=1;\... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int solve(vector<int> v, int a, int b){\n bool flag = true;\n int cnt = 0;\n int i = 0;\n int n = v.size();\n\n while(i < n){\n if((flag == true && v[i] == a) || (flag == false && v[i] == b)){\n cnt++;\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n \n int dp[200001][3];\n bool mod = 0;\n \n int dfs(int idx, int prev_mod, vector<int>& nums)\n {\n if(idx == nums.size())\n return 0;\n \n if(dp[idx][prev_mod]!=-1)\n return dp[idx][prev_mod];\n \n \n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n int n = nums.size();\n vector<pair<int, int>> even, odd;\n for (int i = 0; i < n; i++) {\n if (nums[i] % 2)\n odd.push_back({i, nums[i]});\n else\n even.push_back... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "#define ll long long\nclass Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n ll k=2;\n vector<ll> v[k];\n ll n=nums.size();\n for(ll i=0;i<n;i++)\n v[nums[i]%k].push_back(i);\n ll ans=0;\n for(ll i=0;i<k;i++)\n {\n ll m... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n int n = nums.size();\n int odd = 0;\n int even = 0;\n for( int i = 0 ; i < n ; i++ ){\n nums[i] = nums[i] % 2; \n if(nums[i])odd++;\n else{\n even++;\n } ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n int i,j,n=nums.size(),ans=1;\n vector<int> dpOdd,dpEven;\n bool oddVisited,evenVisited;\n for(i=0;i<n;i++) {\n dpOdd.push_back(1);\n dpEven.push_back(1);\n }\n for(i=1;i<n... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\nint solve(int i,int prev,int n,vector<int>&nums,vector<int>&dp)\n{\n if(i==n)\n {\n if(nums[n]%2!=prev)\n {\n return 1;\n }\n else\n {\n return 0;\n }\n }\n if(dp[i]!=-1)\n {\n return ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n vector<int> first_odd(nums.size(),-1);\n vector<int> first_even(nums.size(),-1);\n int even_ind = -1; int odd_ind = -1;\n vector<vector<int>> dp(2,vector<int>(nums.size(),1));\n if(nums[0] % 2)\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n vector<int> first_odd(nums.size(),-1);\n vector<int> first_even(nums.size(),-1);\n int even_ind = -1; int odd_ind = -1;\n vector<vector<int>> dp(2,vector<int>(nums.size(),1));\n if(nums[0] % 2)\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n vector<int> v1;\n vector<int> v2;\n vector<int> v3;\n vector<int> v4;\n\n // First odd, then even, and so on...\n for (int i = 0; i < nums.size(); i++) {\n if (nums[i] % 2 != 0 && (v... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n const int inf= INT_MAX;\n int dp[200001][2];\n \n int f(int ind, int even, vector<int> &nums){\n if(ind >= nums.size()){\n return 0;\n }\n \n // to check if state is already calculated\n if(dp[ind][even] != -1)\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n int n = nums.size();\n vector<int> odd, even, odd1, even1;\n for(int i=0;i<n;i++){\n if(odd.size()){\n if((odd.back()+nums[i])&1) \n odd.push_back(nums[i]);\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\nint solve(vector<int>v)\n{\n int c=0,c1=0;\n for(int i=0;i<v.size();i++)\n {\n if(v[i]==0)\n c++;\n else\n c1++;\n }\n return max(c,c1);\n}\nint solve1(vector<int>v,int v1,int v2)\n{\n bool f=false;\n int c=0;\n for(int i=0;i<v.... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int memo[200001][3];\n int solve(vector<int>& nums, int index, bool lastEven) {\n if (index == nums.size()) return 0;\n\n if (memo[index][lastEven] != -1) return memo[index][lastEven];\n\n int skip = solve(nums, index + 1, lastEven);\n int pick ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int memo[200001][3];\n int solve(vector<int>& nums, int index, bool lastEven) {\n if (index == nums.size()) return 0;\n\n if (memo[index][lastEven] != -1) return memo[index][lastEven];\n\n int skip = solve(nums, index + 1, lastEven);\n int pick ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\nint solve(vector<int>v,int val)\n{\n int c=0;\n for(int i=0;i<v.size();i++)\n {\n if(v[i]==val)\n c++;\n }\n return c;\n}\nint solve1(vector<int>v,int v1,int v2)\n{\n bool f=false;\n int c=0;\n for(int i=0;i<v.size();i++)\n {\n if(f... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\n int dp[200001][3][2];// dp array\n\n int solve(vector<int>& nums, int i, int p, int c){\n if(i>=nums.size()){\n return 0;\n }\n\n if(dp[i][p+1][c]!=-1){\n return dp[i][p+1][c];\n }\n\n if(p==-1 || (p+nums[i])%2==c){\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int dp[200003][3][2];\n int find(int id, vector<int>& nums, int prev, int odd) {\n if (id == nums.size()) {\n return 0;\n }\n if (dp[id][prev + 1][odd] != -1) {\n return dp[id][prev + 1][odd];\n }\n int maxi = 0;\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int dp[200003][3][2];\n int find(int id,vector<int>& nums,int prev,int odd){\n if(id==nums.size()){\n return 0;\n }\n if(dp[id][prev+1][odd]!=-1){\n return dp[id][prev+1][odd];\n }\n int maxi=0;\n if(odd){\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n\n vector<int> store(nums.size(),0);\n for(int i=0;i<nums.size();i++){\n if(nums[i] % 2 == 0){\n store[i] = 1;\n }\n }\n\n bool odd = true;\n bool even = false;\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int memo[200002][3];\n\n void reset(const int n) {\n for(int i = 0; i < n; ++i) {\n for(int j = 0; j < 3; ++j) {\n memo[i][j] = -1;\n }\n }\n }\n int dp(int pos, int rem, const vector<int>&ns, const int& tar) {\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int dp[200001][2][2];\n int see(vector<int> &nums,int i,int prev,int prev_per)\n {\n if(i==nums.size())\n {\n return 0;\n }\n else if(dp[i][prev][prev_per]!=-1)\n {\n return dp[i][prev][prev_per];\n }\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int n;\n int dp[200002][3][3];\n int solve(vector<int>& nums,int idx,int last,int rem)\n {\n if(idx == n) return 0;\n if(dp[idx][last][rem] != -1) return dp[idx][last][rem];\n int res = 0;\n if(last == 2)\n {\n res = max(... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n array<array<array<int, 3>, 2>, 200005> dp;\n\n int compute(int index, int current, vector<int> &nums, bool alternating) {\n if (index == nums.size()) return 0;\n int ans;\n if (current == 0) {\n ans = max(1 + compute(index + 1, nums[index], ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> arr;\n int dp[(int)2e5+1][3][3];\n int solve(int ind , int prev1, int prev2){\n if(ind == arr.size()) return 0;\n if(dp[ind][prev1+1][prev2+1]!=-1) return dp[ind][prev1+1][prev2+1];\n int nottake = solve(ind+1,prev1,prev2);\n int ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\nint cnteo(priority_queue<pair<int,char>,vector<pair<int,char>>,greater<pair<int,char>>>pq){\n int fl=0,eo=0;\n while(!pq.empty()){\n char type = pq.top().second;\n int ind = pq.top().first;\n pq.pop();\n if(type=='e' && fl==0)... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> nums;\n int dp[4][200001][4];\n int helper(int prev,int i,int status){\n if(i>=nums.size())return 0;\n if(dp[prev + 1][i][status + 1]!=-1)return dp[prev + 1][i][status + 1];\n int take = INT_MIN;\n int nottake = INT_MIN;\n if(status=... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int dp[200001][4][4];\n int helper(int ind, vector<int>& nums, int n, int val, int prev){\n if(ind == n)\n return 0;\n if(dp[ind][val][prev] != -1)\n return dp[ind][val][prev];\n int maxi = 0;\n if(prev == 3 || ((val + (num... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int getMaxLength(deque<int> arr,deque<int> brr){\n int count=0,prev;\n deque<int> tempo = arr , tempe = brr;\n vector<int> rese;\n rese.push_back(tempe[0]);count++;prev=tempe[0];\n while(tempo.size() > 0 || tempe.size()){\n if(cou... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k=2) {\n for(auto &it : nums){\n it %=k;\n }\n int n = nums.size();\n vector<vector<int>>mp(1e3 + 1);\n\n for(int i = 0; i<n; i++){\n mp[nums[i]].push_back(i);\n }\n\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<vector<int>>> dp;\n int solve(vector<int>& nums, int ind, int numType, int reqMod){\n if(ind < 0) return 0;\n\n if(dp[reqMod][numType][ind] != -1) return dp[reqMod][numType][ind];\n\n int not_take = solve(nums, ind-1, numType, reqMod);\n\... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n int n=nums.size();\n int odd=n;\n int even=n;\n int ans=0;\n vector<vector<int>>dp(n,vector<int>(2,1));\n for(int i=n-1;i>=0;i--)\n {\n if(nums[i]%2)\n {\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "\n\n\n\n\n\nclass Solution {\n\npublic:\n\n int maximumLength(vector<int>& nums) {\n\n int n = nums.size(), i_odd = n, i_even = n, ans = 0;\n\n vector<vector<int>> dp(n, vector<int>(2, 1));\n\n for (int i = n - 1; i >= 0; i--)\n\n {\n\n if (nums[i] % 2)\n\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n int n=nums.size();\n int odd=n;\n int even=n;\n int ans=0;\n vector<vector<int>>dp(n,vector<int>(2,1));\n for(int i=n-1;i>=0;i--)\n {\n if(nums[i]%2)\n {\n ... |
3,490 | You are given an integer array <code>nums</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]) % 2 == (sub[1] + sub[2]) % 2 == ... == (sub[x - 2] + ... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums) {\n vector<vector<int>>dp = vector<vector<int>>(nums.size(), vector<int>(4, 0));\n dp[0][0] = dp[0][2] = !(nums[0]&1);\n dp[0][1] = dp[0][3] = (nums[0]&1);\n int n = nums.size();\n for(int i=1; i<nums.siz... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "int dp[1002] = {};\nint prev_[1002] = {};\nclass Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n = nums.size();\n int ans = 1;\n memset(dp, 0, sizeof(dp));\n for(int rem = 0; rem < k; rem++){\n memset(dp, 0, sizeof(int) * (n + 1));\n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "#pragma GCC optimize(\"O3,unroll-loops\")\nstatic const bool Booster = []() {\n std::ios_base::sync_with_stdio(false);\n std::cout.tie(nullptr);\n std::cin.tie(nullptr);\n return true;\n}();\n\nclass Solution\n{\npublic:\n\tint k;\n int dp[1005];\n\tint f(vector<int> &arr, int r)\n\t{\n\t\ti... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\npublic:\n int dp[1001][2];\n int solve(vector<int>&nums,vector<vector<int>>&v,int i,int j,int cn,int k){\n if(i==nums.size()){return 0;}\n int ans=0;\n if(dp[i][cn]==-1){\n int cc;\n if((nums[i]%k)<=j){cc=j-(nums[i]%k);}\n else {cc=(k-(nums[... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int dp[nums.size()][k];\n for (int i=1; i<nums.size(); i++){\n \tfor (int j=0; j<k; j++) dp[i][j]=0;\n\t }\n for (int i=1; i<nums.size(); i++){\n \tfor (int j=0; j<i; j++)\n dp[i][(nums[i]+... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\npublic:\n unordered_map<int,vector<int>>mp;\n int dp[1001][1001];\n int rec(int i, int x, vector<int>& nums, int k){\n if(dp[i][x]!=-1)return dp[i][x];\n int ans=2;\n auto it = lower_bound(mp[nums[i]].begin(),mp[nums[i]].end(),x);\n if(it!=mp[nums[i]].... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int i,j,n=nums.size();\n int dp[n][k];\n memset(dp,0,sizeof(dp));\n for(i=0;i<n;i++){\n nums[i]=nums[i]%k;\n }\n dp[0][nums[0]]=1;\n int res=1;\n unordered_map<i... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\npublic:\n int k;\n int dp[1001][1001][3];\n int solve(vector<int>&nums,int ind , int f1 , vector<int>mp[],int target){\n if(ind==nums.size()) return 0;\n\n if(dp[ind][target][f1]!=-1) return dp[ind][target][f1];\n \n \n int ans = 0;\n \n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\npublic:\n \n int maximumLength(vector<int>& nums, int k) {\n vector<vector<int>>pos(1002);\n int n=nums.size();\n for(int i=0;i<n;i++)nums[i]=nums[i]%k;\n for(int i=0;i<n;i++)pos[nums[i]].push_back(i);\n int maxi=0;\n for(int v1=0;v1<k;v1++)... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "int dp[1001][1001];\n\nclass Solution {\n \n int n, K;\n vector<int> arr;\n \npublic:\n /*\n int maximumLength(vector<int>& nums, int k) {\n memset(dp, 0, sizeof(dp));\n \n arr = nums, K = k;\n for (auto &i : arr) i %= K;\n n = arr.size();\n \n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\n int n, K;\n vector<int> arr;\npublic:\n int maximumLength(vector<int>& nums, int k) {\n vector<vector<int>> pos(1001);\n \n arr = nums, K = k;\n for (auto &i : arr) i %= K;\n n = arr.size();\n \n for (int j = 0; j < n; j ++) \n pos[arr[j]].push_back(j... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n for(int &num : nums)\n num %= k;\n int N = nums.size();\n vector<vector<int>> dp(N, vector<int>(k, 1));\n for(int j = 0; j < k; j++)\n dp[0][j] = 1;\n\n int ans = 1;\n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n = nums.size();\n // unordered_map<int, int> dp[n];\n vector<vector<int>> dp(n , vector<int> ( k , 0 ));\n\n int maxLen = 0;\n for (int endInd = 0; endInd < n; endInd++) {\n for... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n=nums.size();\n vector<vector<int>> mem(n,vector<int>(k,1));\n int ans=0;\n for(int i=1;i<n;++i)\n {\n for(int j=0;j<i;++j)\n {\n int r=(nums[j]+nums[i... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\npublic:\n \n int solve(vector<int>& nums, int k, int i,int rem,vector<vector<int>> &dp){\n if(dp[i][rem]!=-1) return dp[i][rem];\n int ans=0;\n for(int j=i+1;j<nums.size();j++){\n if((nums[i]+nums[j])%k==rem){\n ans=1+solve(nums,k,j,rem... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 0 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n = nums.size();\n if(!n)\n return 0;\n vector<vector<int>>dp(n, vector<int>(k, 1));\n int ret = 1;\n for(int i = 0;i<n;i++){\n for(int j = i-1;j>=0;j--){\n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 1 | {
"code": "class Solution {\npublic:\n \n int solve(vector<int>& nums, int k, int i,int rem,vector<vector<int>> &dp){\n if(dp[i][rem]!=-1) return dp[i][rem];\n int ans=0;\n for(int j=i+1;j<nums.size();j++){\n if((nums[i]+nums[j])%k==rem){\n ans=1+solve(nums,k,j,rem... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 1 | {
"code": "class Solution {\npublic:\n int solve(vector<int>& nums, int i, int k, int rem, vector<vector<int>>& dp){\n if(i>=nums.size()) return 0;\n\n if(dp[i][rem]!=-1) return dp[i][rem];\n\n int ans=0;\n for(int j=i+1;j<nums.size();j++){\n if((nums[j]+nums[i])%k==rem){... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 1 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n=nums.size();\n vector<vector<int>>dp(n+1,vector<int>(k+1,1));\n int ans=INT_MIN;\n for(int i=0;i<n;i++){\n for(int j=0;j<i;j++){\n int rem=(nums[i]+nums[j])%k;\n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 1 | {
"code": "class Solution {\npublic:\n int solve(vector<int>& nums, int i, int k, int rem, vector<vector<int>>& dp){\n if(i>=nums.size()) return 0;\n\n if(dp[i][rem]!=-1) return dp[i][rem];\n\n int ans=0;\n for(int j=i+1;j<nums.size();j++){\n if((nums[j]+nums[i])%k==rem){... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 1 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n vector<int>a = nums;\n int n = a.size();\n vector<vector<int>>dp(n+1,vector<int>(k,1));\n for(int i=0;i<k;i++)dp[1][i] = 1;\n for(int i=1;i<=n;i++){\n for(int j=1;j<i;j++){\n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 1 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n for(auto &i:nums) i%=k;\n int n=nums.size();\n vector<vector<int>> dp(n, vector<int>(k, 0));\n vector<int> last(k,-1);\n\n int ans=1;\n for(int i=0;i<n;i++){\n for(int j=0;j<k... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 1 | {
"code": "// class Solution {\n// public:\n// int maximumLength(vector<int>& nums, int k) {\n// int n = nums.size();\n// vector<vector<int>>dp(n, vector<int>(k, 0)); \n// int ans = 0;\n// for (int i = 0; i < n; ++i) {\n// for (int j = 0; j < i; ++j) {\n// ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 1 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& a, int k) {\n int n=a.size(), ans=2;\n if(n==2)\n return 2;\n \n for(int i=0;i<n;++i)\n a[i]=a[i]%k;\n \n vector<vector<int>> dp(n+2,vector<int>(k+2,0));\n \n for(int ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 1 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& a, int k) {\n int n=a.size(), ans=2;\n if(n==2)\n return 2;\n \n vector<vector<int>> dp(n+2,vector<int>(k+2,0));\n \n for(int i=n-2;i>=0;--i) {\n for(int j=i+1;j<n;++j) {\n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 1 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n // 0 == 2 == 4 == 6\n // 1 == 3 == 5 == 7\n vector<int>last(k, 0),cnt(k,0);\n int ans = 1;\n vector<vector<int>>dp(nums.size() + 1, vector<int>(k, 0));\n for(int i = 1;i <= nums.size();i... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 2 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n = nums.size();\n if(!n)\n return 0;\n int ret = 1;\n \n for(int r = 0;r<k;r++){\n vector<int>dp(k, 0);\n for(auto&i:nums){\n i %= k;\n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 2 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n \n int n = (int)nums.size() ; \n int ans =1; \n for(int val = 0 ; val < k ; val++) \n {\n vector<int> dp(k,0) ; \n for(int j = n-1 ; j >= 0 ; j--) \n {\n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 2 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n = nums.size();\n if(!n)\n return 0;\n \n int ret = 1;\n for(int j = 0;j<k;j++){\n vector<int>dp(k, 0);\n for(const auto&i:nums){\n auto r =... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 2 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n = nums.size();\n int ans = 0;\n for(int i=0;i<k;i++){\n vector<int>mods(k,0);\n for(int j=0;j<n;j++){\n int cur = nums[j]%k;\n int rem = (k+(i - cur)... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 2 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n = nums.size();\n if(!n)\n return 0;\n int ret = 1;\n \n for(int r = 0;r<k;r++){\n vector<int>dp(k, 0);\n for(const auto&i:nums){\n auto x =... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 2 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n \n int n = nums.size();\n int maxi = INT_MIN;\n for(int val=0; val<k; ++val){\n vector<int>dp(k,0);\n for(int i=0; i < nums.size(); ++i){\n int t = nums[i]%k;\n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 2 | {
"code": "class Solution {\npublic:\n int dp[1005];\n int maximumLength(vector<int>& nums, int k) {\n vector<int>v=nums;\n int n=v.size();\n for(int i=0;i<n;i++)v[i]%=k;\n int mx=0;\n \n for(int j=0;j<k;j++)\n {\n vector<int>mp(k);\n for(... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 2 | {
"code": "class Solution {\npublic:\n int dp[1005];\n int maximumLength(vector<int>& nums, int k) {\n vector<int>v=nums;\n int n=v.size();\n for(int i=0;i<n;i++)v[i]%=k;\n int mx=0;\n \n for(int j=0;j<k;j++)\n {\n vector<int>mp(k);\n for(... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 2 | {
"code": "\r\n#include <ext/pb_ds/assoc_container.hpp>\r\n#include <ext/pb_ds/tree_policy.hpp>\r\n\r\nusing namespace __gnu_pbds;\r\n\r\ntemplate<class Fun>\r\nclass y_combinator_result\r\n{\r\n Fun fun_;\r\npublic:\r\n template<class T> \r\n explicit y_combinator_result(T &&fun) : fun_(std::forward<T>(fun)... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n=nums.size();\n vector<vector<int>> dp(k+5, vector<int> (k+1, 0));\n int ans=2;\n for(int i=0; i<nums.size(); i++) nums[i]%=k;\n for(int x=0; x<k; x++){\n for(int i=0; i<nums.si... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n = nums.size();\n for(int i = 0; i < n; ++i) nums[i] %= k;\n vector<vector<int>> f(k+5, vector<int>(k+5, -1));\n for(auto &x : nums) {\n for(int j = 0; j < k; ++j) {\n i... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int n;\n map<int, vector<int>> mp;\n int help(int i, int x, vector<int>& nums, vector<vector<int>> &dp, int k) {\n // base case\n int ans = 2;\n if(dp[i][x] != -1)return dp[i][x];\n int temp = nums[i]%k;\n auto y_iter = lower_bound(mp[... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\nvector<vector<int>>dp;\nmap<int,vector<int>>mp;\nint k;\nint rec(int i,int x,vector<int>&nums){\n int ans=2;\n if(dp[i][x]!=-1)return dp[i][x];\n auto y_itr=lower_bound(mp[nums[i]%k].begin(),mp[nums[i]%k].end(),x);\n if(y_itr!=mp[nums[i]%k].begin()){\n y_itr--;... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "#include <bits/stdc++.h>\nusing namespace std;\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\nusing namespace __gnu_pbds;\n/*\n * CUSTOM hash function which avoids collisions and hence makes unordered maps / sets faster\n */\nstruct custom_hash\n{\n static uint64_t spli... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n // int k = 2;\n for(int &i : nums){\n i %= k;\n }\n int n = nums.size();\n vector<vector<int>> dp(n, vector<int> (k, 0));\n // for(int i = 0; i < k; i++){\n // dp[0... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n = nums.size();\n for(int &x : nums) x = x % k;\n vector<vector<int>> dp(n + 1, vector<int> (k, 1));\n dp[n] = vector<int>(k, 0);\n\n for(int i = n - 1; i >= 0; i--) {\n for(int... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n = nums.size();\n vector<vector<int> > lst(k, vector<int>(n, -1));\n\n for(int i = 0; i < n-1; i++){\n for(int j = 0; j < k; j++){\n if(nums[i]%k == j){\n ls... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n = nums.size();\n vector<vector<int> > lst(k, vector<int>(n, -1));\n\n for(int i = 0; i < n-1; i++){\n for(int j = 0; j < k; j++){\n if(nums[i]%k == j){\n ls... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n=nums.size();\n int res=0;\n unordered_map<int,vector<int>> mp;\n for(int i=0;i<n;i++){\n nums[i]%=k;\n mp[nums[i]].push_back(i);\n }\n for(int i=0;i<k;i++){\n... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\n\n int checkForAlternate(vector<int> arr1, vector<int> arr2){\n int n1 = arr1.size(), n2 = arr2.size();\n bool isFirst = false;\n int lastElem = -1;\n int itr1 = 0, itr2 = 0;\n int cntr = 0;\n if(arr1[0] < arr2[0]){\n isFirst = true;... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n for (auto& it : nums) it %= k;\n map<int, int> cnt;\n for (auto& it : nums) cnt[it]++;\n int maxv = 0;\n for (auto it : cnt) {\n maxv = max(maxv, it.second);\n }\n // 1 maxv\n\n int sum = 0;\n map<i... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int n= nums.size();\n int res=0;\n for(int mod=0; mod<k; mod++)\n {\n vector<int> dp(n,1);\n vector<int> mod_max(k,-1);\n mod_max[nums[0]%k]=1;\n for(int i=... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n int res = 0, n = nums.size();\n for(int i=0;i<k;i++)\n {\n vector<int> dp(n+1, 0);\n vector<int> freq(k, -1);\n int maxy = 0;\n for(int j=0;j<n;j++)\n {... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n const int n = ssize(nums);\n int ans = 0;\n for (int i = 0; i < k; ++i) {\n vector<int> longest(n, 1);\n vector<int> last(k, -1);\n for (int j = 0; j < n; ++j) {\n ... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n int maximumLength(vector<int>& nums, int k) {\n vector<vector<int>> dp(nums.size(), vector<int>(1000,1));\n int mx = 0;\n for(int i = nums.size()-1; i>=0; i--){\n for(int j = i+1; j<nums.size(); j++){\n int rem = (nums[i]+nums[j]... |
3,491 | You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.
<p>A <span data-keyword="subsequence-array">subsequence</span> <code>sub</code> of <code>nums</code> with length <code>x</code> is called <strong>valid</strong> if it satisfies:</p>
<ul>
<li><code>(sub[0] + sub[1]... | 3 | {
"code": "class Solution {\npublic:\n\n \n\n // h[i][j] --> \n int maximumLength(vector<int>& a, int k) {\n\n int n = a.size();\n\n vector<vector<int>> h(n , vector<int>(1e3,0));\n\n\n int ans = 0;\n\n for(int i = 0 ; i < n ; i++){\n for(int j = 0 ; j < i ; j++){\n\n ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.