id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "class Solution {\npublic:\n Solution(vector<int>& w) : gen(std::chrono::system_clock::now().time_since_epoch().count()), dis(0,w.size()-1) {\n num_curr_calls = 0;\n max_num_calls = 0;\n last_selected_index = -1;\n index_count_vec = vector<int>(w.size(), 0);\n for (cons... |
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "// https://www.youtube.com/watch?v=fWS0TCcr-lE\n// Create Buckets according to the contribution of each index value.\nclass Solution {\npublic:\n vector<int> wt;\n vector<int> pf;\n Solution(vector<int>& w) {\n for(int& i : w)\n {\n wt.push_back(i);\n }\n\n p... |
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "class Solution {\npublic:\n Solution(vector<int>& w) : gen(std::chrono::system_clock::now().time_since_epoch().count()), dis(0,w.size()-1) {\n num_curr_calls = 0;\n max_num_calls = 0;\n last_selected_index = -1;\n index_count_vec = vector<int>(w.size(), 0);\n for (cons... |
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "\n\n\nstruct AliasTable {\n\n struct Bin {\n float p, q;\n int alias;\n };\n\n vector<Bin> bins;\n\n AliasTable(vector<int>& w) {\n float totalWeight = accumulate(w.begin(), w.end(), 0.0f);\n bins.resize(w.size());\n\n for (int i = 0; i < w.size(); ++i) {\n ... |
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "\n\n\nstruct AliasTable {\n\n struct Bin {\n float p, q;\n int alias;\n };\n\n vector<Bin> bins;\n\n AliasTable(vector<int>& w) {\n float totalWeight = accumulate(w.begin(), w.end(), 0.0f);\n bins.resize(w.size());\n\n for (int i = 0; i < w.size(); ++i) {\n ... |
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "\n\n\nstruct AliasTable {\n\n struct Bin {\n float p, q;\n int alias;\n };\n\n vector<Bin> bins;\n\n AliasTable(vector<int>& w) {\n float totalWeight = accumulate(w.begin(), w.end(), 0.0f);\n bins.resize(w.size());\n\n for (int i = 0; i < w.size(); ++i) {\n ... |
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "\n\n\nstruct AliasTable {\n\n struct Bin {\n float p, q;\n int alias;\n };\n\n vector<Bin> bins;\n\n AliasTable(vector<int>& w) {\n float totalWeight = accumulate(w.begin(), w.end(), 0.0f);\n bins.resize(w.size());\n\n for (int i = 0; i < w.size(); ++i) {\n ... |
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "\n\n\nstruct AliasTable {\n\n struct Bin {\n float p, q;\n int alias;\n };\n\n vector<Bin> bins;\n\n AliasTable(vector<int>& w) {\n float totalWeight = accumulate(w.begin(), w.end(), 0.0f);\n bins.resize(w.size());\n\n for (int i = 0; i < w.size(); ++i) {\n ... |
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "class Solution {\npublic:\n vector<int> expanded;\n Solution(vector<int>& w) {\n expanded.push_back(w[0]);\n for(int i = 1; i < w.size(); i++){\n expanded.push_back(expanded[i-1] + w[i]);\n }\n }\n \n int pickIndex() {\n std::random_device rd;\n ... |
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "class Solution {\npublic:\n vector<int> expanded;\n Solution(vector<int>& w) {\n expanded.push_back(w[0]);\n for(int i = 1; i < w.size(); i++){\n expanded.push_back(expanded[i-1] + w[i]);\n }\n }\n \n int pickIndex() {\n std::random_device rd;\n ... |
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "// #include <random>\nclass Solution {\n vector<pair<double, int>> cumprob;\n std::mt19937 rng; // Random number generator\n std::uniform_real_distribution<double> dist;\npublic:\n\n Solution(vector<int>& w) : dist(0.0, 1.0) {\n int sum=0;\n for(auto&e:w)\n sum+=e;\n ... |
912 | <p>You are given a <strong>0-indexed</strong> array of positive integers <code>w</code> where <code>w[i]</code> describes the <strong>weight</strong> of the <code>i<sup>th</sup></code> index.</p>
<p>You need to implement the function <code>pickIndex()</code>, which <strong>randomly</strong> picks an index in the range... | 3 | {
"code": "#include <vector>\n#include <utility>\n#include <random>\n#include <ctime>\n#include <algorithm> // For std::lower_bound\n\nclass Solution {\n std::vector<std::pair<double, int>> cumprob;\n std::mt19937 rng; // Random number generator\n std::uniform_real_distribution<double> dist; // Uniform distr... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n \n vector<vector<int>> result;\n vector<int> temp;\n dfs(nums, result, temp, 0);\n return result;\n }\n\nprivate:\n void dfs(vector<int>& nums, vector<vector<int>>& result, ve... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n // Function to find all the increasing subsequences in the given vector.\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n vector<vector<int>> subsequences;\n vector<int> currentSubsequence;\n backtrack(0, INT_MIN, nums, currentSubsequence,... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n vector<int> curr;\n vector<vector<int>> res;\n backtrack(0, curr, nums, res);\n return res;\n }\nprivate:\n void backtrack(int start, vector<int>& curr, vector<int>& nums, vector<vec... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> ans;\n void dfs(int idx, vector<int> &nums, vector<int> &cur) {\n int n = nums.size();\n if (idx >= n) {\n if (cur.size() >= 2) ans.push_back(cur);\n return;\n }\n if (cur.size() == 0 || cur.back() <= nu... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> ans;\n void dfs(int idx, vector<int> &nums, vector<int> &cur) {\n int n = nums.size();\n if (idx >= n) {\n if (cur.size() >= 2) ans.push_back(cur);\n return;\n }\n if (cur.size() == 0 || cur.back() <= nu... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> ans;\n void dfs(int idx, vector<int> &nums, vector<int> &cur) {\n int n = nums.size();\n if (idx >= n) {\n if (cur.size() >= 2) ans.push_back(cur);\n return;\n }\n if (cur.size() == 0 || cur.back() <= nu... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> result;\n vector<int> subset;\n void backtracking(vector<int>& nums, int numsindex){\n if(subset.size()>1) result.push_back(subset);\n for(int i=numsindex; i<nums.size(); i++){\n if(i>numsindex && find(nums.begin()+numsindex,... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> result;\n vector<int> subset;\n void backtracking(vector<int>& nums, int numsindex){\n if(subset.size()>1) result.push_back(subset);\n for(int i=numsindex; i<nums.size(); i++){\n if(i>numsindex && find(nums.begin()+numsindex,... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n dfs(0, INT_MIN, nums);\n return ans;\n }\n\nprivate:\n vector<vector<int>> ans;\n vector<int> temp;\n\n void dfs(int cur, int last, vector<int>& nums) {\n if (cur == nums.size()) {\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n void solve(vector<int> &nums, vector<int> &temp, vector<vector<int>> &ans, int idx) {\n if (temp.size() > 1) {\n ans.push_back(temp);\n }\n\n set<int> used; // Local set to avoid duplicates at this level\n\n for (int i = idx; i < nums.s... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\nprivate:\n void getSequences(int index,vector<int>& inter,vector<vector<int>>& ans,vector<int>& nums){\n if(inter.size()>=2 && index!=nums.size()){\n ans.push_back(inter);\n }\n if(index==nums.size()){\n if(inter.size()>=2){\n a... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n int n;\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n n = nums.size();\n if(n == 1) return {};\n vector<vector<int>> result;\n vector<int> path;\n backtrack(result, path, nums, 0);\n return result;\n\n }\n\n vo... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n set<vector<int>> result;\n vector<int> subsequence;\n recursiveSubsequences(nums, 0, subsequence, result);\n return vector<vector<int>>(result.begin(), result.end());\n }\n \nprivate... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n void fun(int i, vector<int> &nums, vector<int> &ans,set<vector<int>> &set){\n if(i==nums.size()){\n if(ans.size()>1) set.insert(ans);\n return;\n }\n if(ans.empty() || ans.back()<=nums[i]){\n ans.push_back(nums[i]);\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "using vi = vector<int>;\nusing vll = vector<long long>;\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pq = priority_queue<int>;\nusing mpq = priority_queue<int, vector<int>, greater<>>;\n#define ump unordered_map\n#define FOR(i, to) for (int i = 0; i < (to); ++i)\n#define rep(i, a, b) for (int... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 0 | {
"code": "class Solution {\npublic:\n int n;\n void find(vector<int>& nums,vector<vector<int>>& result, int idx, vector<int>& curr){\n if(curr.size()>1){\n result.push_back(curr);\n \n }\n unordered_set<int>st;\n for(int i=idx;i<n;i++){\n if((curr.em... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 1 | {
"code": "class Solution {\npublic:\n map<vector<int>,int>mp;\n void solve(vector<vector<int>>&res,vector<int>&nums,int x,vector<int>&temp){\n if(temp.size()>=2)\n { \n mp[temp]++;\n if(mp[temp]>1)\n return;\n res.push_back(temp);\n \n }\n if(x>... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 1 | {
"code": "class Solution {\npublic:\n map<vector<int>,int>mp;\n void solve(vector<vector<int>>&res,vector<int>&nums,int x,vector<int>&temp){\n if(temp.size()>=2)\n { \n mp[temp]++;\n if(mp[temp]>1)\n return;\n res.push_back(temp);\n \n }\n if(x>... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 1 | {
"code": "class Solution {\npublic:\n set<vector<int>>ans;\n vector<int>level;\n void go(int idx,int prev,vector<int>&nums)\n {\n if(idx==nums.size())\n {\n if(level.size()>1)\n \n ans.insert(level);\n return;\n \n }\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 1 | {
"code": "class Solution {\npublic:\n set<vector<int>>ans;\n vector<int>level;\n void go(int idx,int prev,vector<int>&nums)\n {\n if(idx==nums.size())\n {\n if(level.size()>1)\n \n ans.insert(level);\n return;\n \n }\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n set<vector<int>> ans;\n void recur(vector<int>& nums, int ind, int n, vector<int> v) {\n if(ind >= n) return;\n\n for(int i = ind; i < n; i++) {\n // if(i > 0 && nums[i] == nums[i-1]) continue;\n int p = v.size();\n if(p > 0 &... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n set<vector<int>> ans;\n void recur(vector<int>& nums, int ind, int n, vector<int> v) {\n if(ind >= n) return;\n\n for(int i = ind; i < n; i++) {\n // if(i > 0 && nums[i] == nums[i-1]) continue;\n int p = v.size();\n if(p > 0 &... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n set<vector<int>> st{{}};\n for(const auto &num:nums) {\n vector<vector<int>> tmp(st.size());\n copy(st.begin(), st.end(), tmp.begin());\n\n for(auto v:tmp) {\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n int size = nums.size();\n vector<vector<int>> table;\n vector<vector<int>> ans;\n for(int i=0; i<size; i+=1){\n int len = table.size();\n for(int j=len-1; j>=0; j-=1)... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n void solve(int ind,vector<int> nums,vector<int> &temp,set<vector<int>> &ans){\n if(temp.size()>=2){\n ans.insert(temp);\n }\n if(ind>=nums.size()) \n return;\n for(int i=ind;i<nums.size();i++){\n if(temp.empty... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\nprivate:\n vector <vector <int>> ans;\n int n;\npublic:\n void helper(vector <int> &nums,int last,int begin,vector <int> &help){\n if(begin >= n){\n if(help.size() > 1){ans.push_back(help);}\n return ;\n }\n helper(nums,last,... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n map<int,vector<vector<int>>>m;\n map<pair<int,int>,int>v;\n for(int i=1;i<nums.size();i++)\n {\n int j=i-1;\n while(j>=0)\n {\n if(nums[i]>=... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> ans;\n set<vector<int>> st;\n void backtrack(vector<int>& nums, int i, vector<int> temp) {\n if (temp.size() >= 2) {\n if (st.find(temp) == st.end()) {\n ans.push_back(temp);\n st.insert(temp);\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>>ans;\n map<vector<int>,int>mp;\n vector<int>cat;\n void BackTrack(int i , int n, vector<int>v)\n {\n if(cat.size()>=2)\n {\n mp[cat]++; \n if(mp[cat]<=1) ans.push_back(cat);\n }\n for(int k = i;... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\n vector<vector<int>>ans;set<vector<int>>st;\n\npublic: \n\n vector<vector<int>> findSubsequences(vector<int>& nums) { \nsolve(nums,0,{});\nfor(auto i:st){ans.push_back(i);}\n return ans; \n }\n void solve(vector<int>&nums,int i,vector<int>temp){\n for(int j=i;j... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\n vector<vector<int>>ans;set<vector<int>>st;\n\npublic: \n\n vector<vector<int>> findSubsequences(vector<int>& nums) { \nsolve(nums,0,{});\nfor(auto i:st){ans.push_back(i);}\n return ans; \n }\n void solve(vector<int>&nums,int i,vector<int>temp){\n for(int j=i;j... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\nvector<vector<int>>vec;\nset<vector<int>>st;\n vector<vector<int>> findSubsequences(vector<int>& nums){\n vector<int>curr;\n for(int i=0;i<nums.size()-1;i++){\n curr.push_back(nums[i]);\n nondecrease(i+1,curr,nums);\n curr.pop_bac... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n void solve(vector<int>&nums,int index,set<vector<int>>&result,vector<int>&output){\n if(index>=nums.size()){\n if(output.size()>1){\n result.insert(output);\n }\n return;\n }\n solve(nums,index+1,result,outp... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "typedef vector<vector<int>> vvi;\ntypedef vector<int> vi;\n\nclass Solution {\nprivate:\n void subSeqGenerator(int i, vi& temp, vi& nums, set<vi>& answer) {\n if(i==nums.size()){\n if(temp.size() >= 2) answer.insert(temp);\n return;\n }\n // Don't Take This\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n set<vector<int>> ans;\n vector<int> nums;\n\n void solve(int i, vector<int> &temp){\n\n if(i==nums.size()){\n if(temp.size()>=2){\n ans.insert(temp);\n }\n return;\n }\n\n solve(i+1, temp);\n\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\nprivate: \n void solve(int index, int mask, vector<int>& v, vector<int>& nums, vector<vector<int>>& ans, vector<int>& dp){\n if(index==nums.size()){\n if(!dp[mask] && v.size()>1){\n ans.push_back(v);\n dp[mask]=1;\n }\n\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "#include <iostream>\n#include <vector>\n#include <set>\n\nusing namespace std;\n\nclass Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n vector<vector<int>> dp[nums.size()]; // DP array to store subsequences ending at each element\n set<vector<int>> res; ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n \n int n=nums.size();\n vector<vector<vector<int>>> V(n,vector<vector<int>>());\n V[0].push_back({nums[0]});\n \n for(int i=1; i<n;i++){\n V[i].push_back({nums[i]}... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic: \n vector<vector<int>> findSubsequences(vector<int>& nums) {\n \n function<void(int, int, vector<int>&)> generate;\n\n set<vector<int>> res;\n\n generate = [&nums, &res, &generate](int idx, int prev, vector<int>& temp)->void {\n if(idx ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\n int n;\n set<vector<int>>ans;\n vector<int>part;\n void solve(int i,int j,vector<int>&nums){\n if(part.size()>=2) ans.insert(part);\n if(i==n){\n return;\n }\n if(j==-1||nums[j]<=nums[i]){\n part.push_back(nums[i]);\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n void f(int ind,vector<int>& nums,set<vector<int>>&st,vector<int>&vec)\n {\n int n=nums.size();\n if(ind>=n){\n if(vec.size()>1)\n {\n if(st.find(vec)==st.end())\n st.insert(vec);\n }\n return;\n }\n\n if(vec.empt... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 2 | {
"code": "class Solution {\npublic:\n/*We saw that ki kaafi Permutations bnaune aa, hence Problem of backtracking.\nBcz har ek element vaaste check krna thus we use for loop from idx until n.\nWe need not call solve again in the case of exclude bcz i++ automatically ho he\nreha hai loop de vich.\nSet da use krke dup... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n set<vector<int>> res;\n int sz = nums.size();\n vector<vector<vector<int>>> dp(sz);\n for(int i = 0; i < sz; i++) {\n dp[i].push_back({nums[i]});\n for(int j = i - 1;... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<int> t;\n vector<vector<int>> ans;\n set<vector<int>> m;\n \n void fun(vector<int>& v, int i)\n {\n int n = t.size();\n if(n > 1 && t[n - 1] < t[n - 2])\n return;\n \n if(n > 1)\n m.insert(t);\n \n... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<int> t;\n vector<vector<int>> ans;\n set<vector<int>> m;\n \n void fun(vector<int>& v, int i)\n {\n int n = t.size();\n if(n > 1 && t[n - 1] < t[n - 2])\n return;\n \n if(n > 1)\n m.insert(t);\n \n... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<int> t;\n vector<vector<int>> ans;\n set<vector<int>> m;\n \n void fun(vector<int>& v, int i)\n {\n int n = t.size();\n if(n > 1 && t[n - 1] < t[n - 2])\n return;\n \n if(n > 1)\n m.insert(t);\n \n... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n void rec(vector<int>& nums, int i, vector<vector<int>>& ans, vector<int>& curr, set<vector<int>>& mp) {\n if (i == nums.size()) {\n if (curr.size() > 1 && mp.find(curr) == mp.end()) {\n ans.push_back(curr);\n mp.insert(curr); /... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n void rec(vector<int>& nums, int i, vector<vector<int>>& ans, vector<int>& curr, set<vector<int>>& mp) {\n if (i == nums.size()) {\n if (curr.size() > 1 && mp.find(curr) == mp.end()) {\n ans.push_back(curr);\n mp.insert(curr); /... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n void rec(vector<int>& nums,int i, vector<int> v, set<vector<int>>& s){\n s.insert(v);\n\n for(int j=i;j<nums.size();j++){\n if(v.empty() || nums[j]>=v.back()){\n v.push_back(nums[j]);}\n rec(nums,j+1,v,s);\n if(!v.empt... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n set<vector<int>> map;\n vector<vector<int>> answer;\n vector<int> sub;\n void sum(vector<int>& arr,int index,int n){\n if(index>=n){\n return;\n }\n \n if(sub.size()==0 || arr[index]>=sub.back()){\n sub.push_back(arr... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n int n=nums.size();\n set<vector<int>> st;\n for(int i=0;i<nums.size();i++)\n {\n \n set<vector<int>> s=st;\n // st.clear();\n for(auto j:s)\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n set<vector<int>>fin;\n void fun(vector<int>&nums,int ind, int prev,vector<int>&ans){\n int n=nums.size();\n if(ans.size()>=2)fin.insert(ans);\n if(ind>=n)return;\n \n if(nums[ind]>=prev){\n ans.push_back(nums[ind]);\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n vector<vector<int>> res;\n stack<pair<int, vector<int>>> st;\n st.push({0, {}});\n\n while (!st.empty()) {\n auto [i, curr] = st.top();\n st.pop();\n\n if ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Node{\npublic:\n unordered_map<int, Node*> mp;\n bool vis;\n Node(){\n vis = false;\n }\n bool add(int num){ \n if(mp.find(num) == mp.end()){\n mp[num] = new Node();\n return true;\n }\n return false;\n }\n};\n\nclass Solution... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n vector<vector<int>> result;\n int n = nums.size(),range = 1<<n;\n for(int i=1;i<range;i++)\n {\n if((i&(i-1))!=0)\n {\n bool choice = true;\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n set<vector<int>>ans;\n void back(vector<int>&nums,vector<int>&cur,int prv,int idx){\n if(idx==nums.size()){\n vector<int>kk=cur;\n if(cur.size()>1)ans.insert(kk);\n return;\n }\n back(nums,cur,prv,idx+1);\n if(nu... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "#include <set>\n\nclass Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n set<vector<int>> res;\n for (uint32_t m = 1; m != 1 << nums.size(); ++m) {\n if (popcount(m) < 2) continue;\n vector<int> v;\n int prev = numeric_limit... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n void helper(vector<vector<int>> &ans, vector<int>&v1,vector<int>nums,int idx){\n if(idx==nums.size()){\n return;\n }\n for(int i=idx;i<nums.size();i++){\n v1.push_back(nums[i]);\n helper(ans,v1,nums,i+1);\n if(f... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n // void solve(vector<vector<int>>&ans,vector<int>&temp,int prev,int curr,vector<int>&nums,map<int,bool>&m){\n // if(curr>=nums.size()){\n // if(temp.size()>1){\n // ans.push_back(temp);\n // }\n // return;\n // }\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n set<vector<int>> result;\n for(int i=1; i<pow(2,nums.size()); i++){\n int k=i;\n vector<int> temp;\n int prev=-101;\n bool p=true;\n for(int j=0; j... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n set<vector<int>> uniqueSubsequences;\n int n = nums.size();\n for(int i=3;i<pow(2,n);i++) {\n // cout<<i<<\" \"<<log2(i)<<\"\\n\";\n if(ceil(log2(i))==log2(i)) continue;\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\n // - prashu\n\n // - bit manipulation approach\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n set<vector<int>> uniqueSubsequences;\n int n = nums.size();\n for(int i=3;i<pow(2,n);i++) {\n if(ceil(log2(i))==log2(i)) continue... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n int n=nums.size();\n vector<vector<int>> res;\n set<vector<int>> hs;\n \n for(int i=1;i<=(1<<n)-1;i++){\n vector<int> v;\n int f=0;\n for(int j=0;j<... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n int n=nums.size();\n int m=pow(2,n);\n set<vector<int>> st;\n vector<vector<int>> res;\n for(int i=0;i<m;i++){\n int j=i;\n int idx=0;\n vector<int>... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n unordered_map<string, bool> map;\n void helper (vector<int>& arr, int start, vector<vector<int>> &ans, vector<int> &curr) {\n if (start == arr.size() && curr.size() >= 2) {\n string s = \"\";\n for(int i=0; i<curr.size(); i++) {\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n set<vector<int>> ans;\n vector<int> sub;\n void solve(vector<int> nums, int i){\n if(sub.size()>1){\n ans.insert(sub);\n }\n if(i>=nums.size()) return;\n if(!sub.empty() && sub.back()<=nums[i]){\n sub.push_back(nums[i]);... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n set<vector<int>> ans;\n vector<int> sub;\n void solve(vector<int> nums, int i){\n if(sub.size()>1){\n ans.insert(sub);\n }\n if(i>=nums.size()) return;\n if(!sub.empty() && sub.back()<=nums[i]){\n sub.push_back(nums[i]);... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n vector<vector<int>> res;\n set<vector<int>> s;\n int n=nums.size();\n for(int i=0;i<(1<<n);i++){\n vector<int> temp;\n int prev=INT_MIN,flag=0;\n for(int j... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n set<vector<int>> ans;\n int n = nums.size();\n for (int i = 0; i < (1 << n); i++) {\n int lastindex = -1;\n vector<int> ss;\n bool k = true;\n for (int... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\n private:\n void solve (vector<int> &nums,vector<int> list,vector<vector<int>> &ans, int idx){\n if (idx>=nums.size()){\n if (list.size()>=2){\n ans.push_back(list);\n }\n return;\n }\n //choose\n if (list.e... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n vector<vector<int>> subs;\n map<vector<int>, bool> mp;\n int n = nums.size();\n for(int i = 0; i < (1 << n); i++){\n vector<int> sub;\n for (int j = 0; j < n; j++){\n... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n vector<vector<int>> answer;\n set<vector<int>> s;\n int x = pow(2,nums.size());\n for (int i=0;i<x;i++){\n int y=i;\n int j=0;\n if ((y&(y-1))==1 || i==0) ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n vector<vector<int>> answer;\n set<vector<int>> s;\n int x = pow(2,nums.size());\n for (int i=0;i<x;i++){\n int y=i;\n int j=0;\n vector<int> count;\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n vector<vector<int>> answer;\n set<vector<int>> s;\n int x = pow(2,nums.size());\n for (int i=0;i<x;i++){\n int y=i;\n int j=0;\n if ((i&(i-1))==0 || i==0) ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n\n vector<vector<int>> ans;\n \n void helpFunc(vector<int>& nums, int currIndex, vector<int> subans)\n {\n if(currIndex >= nums.size())\n {\n if(subans.size() >= 2)\n {\n ans.push_back(subans);\n }\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n void f(vector<int>& nums,vector<int> temp,int ind,int prev,set<vector<int>>& st)\n {\n if(ind>=nums.size()) return;\n if(ind==nums.size()-1)\n {\n if(temp.size()>=2)\n {\n st.insert(temp);\n }\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n void sub(set<vector<int>>&s,vector<int>&m,vector<int>nums,int n){\n if(n==nums.size()){\n if(m.size()>1)s.insert(m);\n return ;\n }\n if(m.size()==0 || nums[n]>=m[m.size()-1]){\n m.push_back(nums[n]);\n sub(s,m,... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> rs;\n void fn(vector<int>& v,int x,int pv,vector<int> k){\n //This will generate all the subsequences\n if(x==v.size()){\n if(k.size()!=1 && k.size()!=0 && find(rs.begin(),rs.end(),k)==rs.end())\n rs.push_back(k);\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\n private:\n void solve (vector<int> &nums,int n, vector<int> list,set<vector<int>> &ans, int idx){\n if (idx>=n){\n if (list.size()>=2){\n ans.insert(list);\n }\n return;\n }\n //choose\n if (list.empty() ||... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\n private:\n void solve (vector<int> &nums,int n, vector<int> list,set<vector<int>> &ans, int idx){\n if (idx>=n){\n if (list.size()>=2){\n ans.insert(list);\n }\n return;\n }\n //choose\n if (list.empty() ||... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findSubsequences(vector<int>& nums) {\n vector<int> res;\n vector<vector<int>> ans;\n set<vector<int>> s;\n int n=nums.size();\n fill(0, n, nums, res, ans,s);\n return ans;\n }\n\n void fill(int i, int n, vec... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n void backtrack(vector<int>& nums, int index, vector<int> ans, set<vector<int>>& result) {\n\n if (ans.size() >= 2) {\n result.insert(ans);\n }\n\n if (index == nums.size()) {\n return;\n }\n\n if (ans.empty() || nums[in... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n void backtrack(vector<int>& nums, int index, vector<int> ans, set<vector<int>>& result) {\n\n if (ans.size() >= 2) {\n result.insert(ans);\n }\n\n if (index == nums.size()) {\n return;\n }\n\n if (ans.empty() || nums[in... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n\n set<vector<int>> ans;\n\n void solve(vector<int> &nums,int index,vector<int> temp){\n if(index >= nums.size()){\n if(temp.size() >= 2)ans.insert(temp);\n return;\n }\n\n if(temp.size() == 0 || temp.back() <= nums[index]){\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "void generate(vector<int> &arr , set<vector<int>>& ans , int i = 0 , vector<int> temp = {}){\n if(i == arr.size()){\n if(temp.size() > 1)\n ans.insert(temp);\n return ;\n }\n\n if(temp.empty()){\n temp.push_back(arr[i]);\n generate(arr,ans,i+1,temp);\n ... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "void generate(vector<int> &arr , set<vector<int>>& ans , int i = 0 , vector<int> temp = {}){\n if(i == arr.size()){\n if(temp.size() > 1)\n ans.insert(temp);\n return ;\n }\n\n if(temp.empty() || temp.back() <= arr[i]){\n temp.push_back(arr[i]);\n generate(ar... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n int n;\n void func(int ind,vector<int>ds,set<vector<int>>&st,vector<int>&nums, int prev){\n \n if(ind==n){\n if(ds.size()>=2){\n st.insert(ds);\n \n }\n return;\n \... |
491 | <p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong>... | 3 | {
"code": "class Solution {\npublic:\n void solve(set<vector<int>> &ans,vector<int> v,vector<int>& nums,int i,int prev){\n if(i>=nums.size()){\n if(v.size() >= 2){\n ans.insert(v); //set for unique ans\n }\n return;\n } \n //inc\n if(prev ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.