id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<int> freq1(2001, 0), freq2(2001, 0); \n vector<vector<int>> v(2); \n\n for (int i = 0; i < nums1.size(); i++) { // O(n)\n freq1[nums1[i] + 10... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> s1;\n set<int> s2;\n vector<int> ans1;\n vector<int> ans2;\n vector<vector<int>> finalAns;\n\n for (int i = 0; i < nums1.size(); i++) {\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n \n sort(nums1.begin(), nums1.end());\n sort(nums2.begin(), nums2.end());\n vector<vector<int>>ans;\n vector<int> arr1;\n vector<int> arr2;\n set<int... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n \n sort(nums1.begin(), nums1.end());\n sort(nums2.begin(), nums2.end());\n vector<vector<int>>ans;\n vector<int> arr1;\n vector<int> arr2;\n set<int... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n \n sort(nums1.begin(), nums1.end());\n sort(nums2.begin(), nums2.end());\n vector<vector<int>>ans;\n vector<int> arr1;\n vector<int> arr2;\n set<int... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n \n sort(nums1.begin(), nums1.end());\n sort(nums2.begin(), nums2.end());\n vector<vector<int>>ans;\n vector<int> arr1;\n vector<int> arr2;\n set<int... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution \n{\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) \n {\n unordered_set <int> temp1, temp2;\n for(int i = 0; i < nums1.size(); i++)\n {\n if(find(nums2.begin(), nums2.end(), nums1[i]) == nums2.end()) temp1.insert(nu... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution \n{\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) \n {\n unordered_set <int> temp1, temp2;\n for(int i = 0; i < nums1.size(); i++)\n {\n if(find(nums2.begin(), nums2.end(), nums1[i]) == nums2.end()) temp1.insert(nu... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<int> posnum(1001,0);\n vector<int> negnum(1001,0);\n vector<int> posnum2(1001,0);\n vector<int> negnum2(1001,0);\n\n for(int x : nums1){\n if(x>... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<int>arr1;\n vector<int>arr2;\n vector<vector<int>>ans;\n int l1=nums1.size();\n int l2=nums2.size();\n for(int i=0;i<l1;i++){\n bool flag... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n sort(nums1.begin(),nums1.end());\n sort(nums2.begin(),nums2.end());\n\n int n1 = nums1.size();\n int n2 = nums2.size();\n\n set<int> s1,s2;\n for(int i=0;i... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n\n sort(nums1.begin(), nums1.end());\n sort(nums2.begin(), nums2.end());\n\n vector<int>::iterator it = unique(nums1.begin(), nums1.end());\n nums1.resize(it - nums1.begi... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n\n sort(nums1.begin(), nums1.end());\n sort(nums2.begin(), nums2.end());\n\n vector<int>::iterator it = unique(nums1.begin(), nums1.end());\n nums1.resize(it - nums1.begi... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n std::unordered_map<int, int> dict;\n for (int x : nums1) {\n if (dict[x] == 2 || dict[x] == -1) {\n dict[x] = -1;\n continue;\n }\n... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution\n{\npublic:\n std::vector<std::vector<int>> findDifference(const std::vector<int>& nums1, const std::vector<int>& nums2)\n {\n std::vector<std::vector<int>> results(2, std::vector<int>());\n\n std::size_t size1 = nums1.size(),\n size2 = nums2.size(),\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_map<int , pair<bool,bool>> nums;\n vector<vector<int>> ans(2);\n for(int i=0 ; i<nums1.size() ; i++)\n nums[nums1[i]].first=true;\n for(int i=0 ; i... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n typedef array<bool, 2> bArr;\n\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>> diff = {{}, {}};\n\n unordered_map<int, bArr> map;\n\n int n1 = nums1.size();\n int n2 = nums2.size();\n i... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_map<int,int>mp1;\n vector<vector<int>>ans;\n for(int i:nums1)\n mp1[i]=0;\n for(int i:nums2)\n {\n if(mp1.find(i)!=mp1.end())\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_map<int,bool> m1(nums1.size());\n unordered_map<int,bool> m2(nums2.size());\n for(auto x:nums1)\n {\n m1[x]=true;\n }\n for(auto x:num... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>>ans;\n set<int>st1;\n set<int>st2;\n for(auto it:nums1){\n st1.insert(it);\n } \n for(auto it:nums2){\n st2.i... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>> ans(2);\n set<int> s1,s2;\n for(auto it: nums1)\n s1.insert(it);\n for(auto it: nums2)\n s2.insert(it);\n\n for(auto it:s1)\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> s1(nums1.begin(),nums1.end());\n set<int> s2(nums2.begin(),nums2.end());\n return vector<vector<int>>{checkUnique(s1, nums2), checkUnique(s2, nums1)};\n }\n vect... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>> ans(2);\n set<int> s1,s2;\n for(int num : nums1){\n s1.insert(num);\n }\n for(int num : nums2){\n s2.insert(num);\n }\n for(auto it: s1){\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>> res(2);\n set <int> a(nums1.begin(), nums1.end());\n set <int> b(nums2.begin(), nums2.end());\n for(auto itr : a)\n {\n auto it = b... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int>set1(nums1.begin() , nums1.end());\n set<int>set2(nums2.begin() , nums2.end());\n\n vector<vector<int>>ans;\n vector<int>temp1;\n for(auto i :set1){\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 0 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> set1;\n set<int> set2;\n vector<int> ans1, ans2;\n for (int i = 0; i < nums1.size(); i++) {\n set1.insert(nums1[i]);\n }\n for (int i =... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 1 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>> answer;\n set<int> set1(nums1.begin(), nums1.end());\n set<int> set2(nums2.begin(), nums2.end());\n vector<int> ans0;\n for (auto n : set1) {\... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 1 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) \n {\n unordered_map<int, int>mpp1,mpp2;\n for(auto it: nums1)\n mpp1[it]++;\n for(auto it : nums2)\n mpp2[it]++;\n vector<vector<int>>answer(2);\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 1 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> set1(nums1.begin(), nums1.end()), set2(nums2.begin(), nums2.end());\n vector<int> res1, res2;\n for(auto& num : set1){\n if(!set2.contains(num)) res1.push_b... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 1 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_set<int> a(nums1.begin(),nums1.end());\n unordered_set<int> b(nums2.begin(),nums2.end());\n vector<vector<int>> res(2);\n for(int num : a){\n if(b.f... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 1 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_map<int,int>mp1;\n for(auto it:nums1){\n mp1[it]++;\n }\n unordered_map<int,int>mp2;\n for(auto it:nums2){\n mp2[it]++;\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_set<int> s1; \n unordered_set<int> s2;\n\n for (auto e : nums1) {\n s1.insert(e);\n }\n\n for (auto e : nums2) {\n s2.insert(e);\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_set<int>s(nums1.begin(),nums1.end());\n unordered_set<int>s1(nums2.begin(),nums2.end());\n vector<int>v2;\n vector<int>v1;\n vector<vector<int>>v;\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector <int> m1;\n vector <int > m2;\n vector<vector <int > >ans ;\n\n int n1=nums1.size();\n int n2=nums2.size();\n unordered_set<int> f1(nums1.begin(), n... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_map<int, int> hash1;\n unordered_map<int, int> hash2;\n for (int i = 0; i < nums1.size(); ++i) {\n ++hash1[nums1[i]];\n }\n for (int i = 0; i... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>>ans;\n vector<int>temp1;\n vector<int>temp2;\n unordered_set<int>mp1;\n unordered_set<int>mp2;\n for(auto i:nums1)mp1.insert(i);\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_set<int> Set1(nums1.begin(),nums1.end()),Set2(nums2.begin(),nums2.end());\n vector<int> ans1, ans2;\n for (auto& x : Set1) {\n if (Set2.find(x) == Set2.end... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_map<int, int> map1;\n unordered_map<int, int> map2;\n\n for(int i = 0; i < nums1.size(); i++){\n map1[nums1[i]]++;\n }\n\n for(int i = 0; i <... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 2 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n \n unordered_set<int> set1(nums1.begin(), nums1.end());\n unordered_set<int> set2(nums2.begin(), nums2.end());\n\n vector<int> unique1, unique2;\n\n for (int num : se... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> s1(nums1.begin(), nums1.end());\n set<int> s2(nums2.begin(), nums2.end());\n\n vector<vector<int>> res;\n vector<int> res1;\n vector<int> res2;\n\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> s1(nums1.begin(), nums1.end());\n set<int> s2(nums2.begin(), nums2.end());\n\n vector<int> res1;\n vector<int> res2;\n std::set_difference(s1.begin(), s1... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> s1(nums1.begin(), nums1.end());\n set<int> s2(nums2.begin(), nums2.end());\n\n vector<int> res1;\n vector<int> res2;\n std::set_difference(s1.begin(), s1... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "\nclass Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n\n map<int, int> mp1;\n for (auto it : nums1)\n mp1[it]++;\n\n map<int, int> mp2;\n for (auto it : nums2)\n mp2[it]++;\n \n vect... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_set<int> hs1,hs2;\n for(int n:nums1){\n hs1.insert(n);\n }\n unordered_set<int> com;\n for(int n:nums2){\n hs2.insert(n); ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n std::vector<std::vector<int>> findDifference(std::vector<int>& nums1,std::vector<int>& nums2){\n std::multiset<int> set1{nums1.begin(), nums1.end()};\n std::multiset<int> set2{nums2.begin(), nums2.end()};\n\n std::vector<std::vector<int>> res;... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n std::vector<std::vector<int>> findDifference(std::vector<int>& nums1,std::vector<int>& nums2){\n std::multiset<int> set1{nums1.begin(), nums1.end()};\n std::multiset<int> set2{nums2.begin(), nums2.end()};\n\n std::vector<std::vector<int>> res;... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n \n unordered_map<int,int>mp;\n\n for(int i = 0;i<nums1.size();i++)\n {\n mp[nums1[i]]++;\n }\n vector<vector<int>>vec;\n vector<int>temp;... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>> result;\n unordered_set<int> set(nums2.begin(), nums2.end());\n vector<int> nums1Distinct;\n vector<int> nums2Distinct;\n for (int x : nums1) ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n std::unordered_set<int> s;\n\n vector<vector<int>> answer;\n\n\n for (auto item : nums1) {\n s.insert(item);\n }\n\n vector<int> uniques2;\n for... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_set<int> hashset;\n vector<int> ans1, ans2;\n\n for (auto item : nums1) {\n hashset.insert(item);\n }\n\n for (auto item : nums2) {\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n std::unordered_set<int> set1 {};\n std::unordered_set<int> set2 {};\n\n for (int i : nums1){\n set1.insert(i);\n }\n for (int i : nums2){\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_set<int>s(nums2.begin(),nums2.end());\n vector<vector<int>>ans;\n set<int>ds;\n for(auto it:nums1){\n if(s.find(it)==s.end())ds.insert(it);\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n int p1 = 0;\n int p2 = 0;\n\n size_t n1 = nums1.size();\n size_t n2 = nums2.size();\n\n\n vector<int> ans1;\n vector<int> ans2;\n vector<int> freq1_... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n int n = nums1.size();\n int m = nums2.size();\n unordered_set<int>a;\n unordered_set<int>b;\n unordered_map<int,bool>mp;\n for(int i=0; i<n; i++)\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_map<int,int> m;\n unordered_map<int,int> n;\n vector <int> v;\n vector <int> w;\n vector <vector<int>> e;\n for (int i=0;i<nums1.size();i++){\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n\n unordered_set<int> one;\n one.insert(nums1.begin(), nums1.end());\n unordered_set<int> two;\n two.insert(nums2.begin(), nums2.end());\n\n unordered_set<int> ans... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> num1(nums1.begin(),nums1.end());\n set<int> num2(nums2.begin(),nums2.end());\n vector<vector<int>> ans(2);\n\n set<int> temp1;\n for(int i=0;i<nums1.size();i++){\n... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> s1(nums1.begin(), nums1.end());\n set<int> s2(nums2.begin(), nums2.end());\n\n vector<vector<int>> res;\n set<int> res1;\n set<int> res2;\n\n std:... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> s1(nums1.begin(), nums1.end());\n set<int> s2(nums2.begin(), nums2.end());\n\n vector<vector<int>> res;\n set<int> res1;\n set<int> res2;\n\n std:... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> s1(nums1.begin(), nums1.end());\n set<int> s2(nums2.begin(), nums2.end());\n\n vector<vector<int>> res;\n set<int> res1;\n set<int> res2;\n\n std:... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> s1; \n set<int> s2;\n for(auto it: nums1){\n s1.insert(it);\n } \n for(auto it: nums2){\n s2.insert(it);\n } \n vecto... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n set<int> m1(nums1.begin(), nums1.end()), m2(nums2.begin(), nums2.end());\n set<int> diff, diff2;\n vector<vector<int>> ans;\n \n set_difference(m1.begin(), m1.end... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_set<int>set1(nums1.begin(),nums1.end());\n unordered_set<int>set2(nums2.begin(),nums2.end());\n unordered_set<int>\n onlyinnum1;\n unordered_set<int>o... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n int n1= nums1.size(),n2= nums2.size();\n vector<vector<int>> ans;\n unordered_map<int,int> mp1,mp2;\n for(int i=0;i<n1;i++) mp1[nums1[i]]++;\n for(int i=0;i<n2;i+... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n bool in_map(unordered_map<int,int>& map, int val)\n {\n if (map.find(val) == map.end())\n return false;\n return true;\n }\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) \n {\n unordered_map<int,int> t... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n\n std::unordered_set<int> s1;\n std::unordered_set<int> s2;\n\n for(auto i : nums1) {\n s1.insert(i);\n }\n \n for(auto i : nums2) {\n ... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_set<int> n1;\n unordered_set<int> not1;\n unordered_set<int> n2;\n unordered_set<int> not2;\n vector<vector<int>> res;\n for (int& n : nums1) n1.... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_map<int,int>map1,map2;\n for(auto i:nums1){\n map1[i]++;\n }\n for(auto i:nums2){\n map2[i]++;\n }\n\n\n vector<vector<int>... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>> ans;\n vector<int> v1,v2;\n unordered_set<int> s1,s2;\n unordered_set<int> elems1;\n unordered_set<int> elems2;\n for(auto elem: nums1)... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_map <int, int> m1;\nunordered_map<int, int> m2;\nfor (int i : nums1) {\n m1[i] = 1;\n}\nfor (int i : nums2) {\n m2[i] = 1;\n}\nvector<vector<int>> result;\nvector<int> r1;\nv... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n unordered_map<int, bool> mp1, mp2;\n\n for(auto it: nums1) mp1[it] = true;\n for(auto it: nums2) mp2[it] = true;\n\n vector<vector<int>> ans(2);\n set<int> s1, s2... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>>v(2);\n map<int,int>cnt1,cnt2;\n for(auto u:nums1) cnt1[u]++;\n for(auto u:nums2) cnt2[u]++;\n for(auto u:nums1){\n if(cnt2[u]==0&&c... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>> ans(2);\n map<int, int> a, b;\n for(int i = 0; i < nums2.size(); i++){\n b[nums2[i]]++;\n }\n for(int i = 0; i < nums1.size(); i++)... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& a, vector<int>& b) {\n int n=a.size(), m=b.size();\n map<int,int> mp1,mp2;\n vector<vector<int>> v(2);\n for(int i=0;i<n;i++){\n mp1.insert({a[i],i});\n }\n for(int i=0;i<m;i+... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<int>> ans;\n vector<int> list1, list2;\n unordered_map<int, int> mp1, mp2;\n for(int num : nums1){\n mp1[num]++;\n }\n\n for(int n... |
1,392 | <p>Given two <strong>0-indexed</strong> integer arrays <code>nums1</code> and <code>nums2</code>, return <em>a list</em> <code>answer</code> <em>of size</em> <code>2</code> <em>where:</em></p>
<ul>
<li><code>answer[0]</code> <em>is a list of all <strong>distinct</strong> integers in</em> <code>nums1</code> <em>which ... | 3 | {
"code": "class Solution {\npublic:\n void removeDuplicate(vector<int> &v) {\n set<int> unique_elements(v.begin(), v.end());\n v.assign(unique_elements.begin(), unique_elements.end());\n }\n\n vector<vector<int>> findDifference(vector<int>& nums1, vector<int>& nums2) {\n vector<vector<i... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "class Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) {\n int bestVal[k+1]; fill(bestVal, bestVal + k + 1, 0);\n for (int i = 0; i < piles.size(); i++) {\n int newBestVal[k+1]; for (int j = 0; j <= k; j++) newBestVal[j] = bestVal[j];\n int... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "class Solution {\npublic:\nint maxValueOfCoins(vector<vector<int>>& piles, int K) {\n for (auto &pile:piles) for (int i=1;i<pile.size();i++) pile[i]+=pile[i-1];\n\n int dp[2][K+1];\n memset(dp,0,sizeof(dp));\n for (int i=piles.size()-1;i>=0;i--) {\n for (int k=0;k<=K;k++) {\n ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "class Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int K) {\n vector<int> prev(2001, 0), curr(2001);\n int n = piles.size();\n for(int i=0;i<n;i++) {\n int size = piles[i].size();\n for(int j=1;j<size;j++) {\n piles[i][j]... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "int dp[1001][2001];\n\nclass Solution {\npublic:\n int mxVal(int ind, int coinsLeft, vector<vector<int>>& piles){\n if(ind<0 || coinsLeft == 0)\n return 0;\n\n int& a = dp[ind][coinsLeft];\n if(a != -1) \n return a;\n\n a = 0;\n int s = 0;\n for(in... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "int dp[1001][2001];\nclass Solution {\npublic:\n int f(int i,int left,vector<vector<int>>&v)\n {\n if(i>=v.size())\n {\n if(left==0)return 0;\n return -1e9;\n }\n if(dp[i][left]!=-1)return dp[i][left];\n int ans=-1;\n ans=max(ans,f(i+1,l... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "class Solution {\npublic:\n\n int dp[1001][2001];\n int solve(int idx, int k, vector<vector<int> > &piles)\n {\n\n if(k<0) return -1e9;\n\n if(idx==piles.size())\n {\n return (k==0) ? 0 :-1e9;\n } \n\n if(dp[idx][k]!=-1) return dp[idx][k];\n\n i... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "class Solution {\npublic:\n\n // int solve(vector<vector<int>>& piles, int n ,int k){\n // if(k<=0) return 0;\n // int maxi=INT_MAX;\n // for(int i=0;i<n;i++){\n \n // }\n // }\n // int solve(vector<vector<int>>& piles,int n ,int k , int ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "class Solution {\npublic:\n int dp[1002][2002];\n int func(int i,int k,vector<vector<int>>& v){\n if(i==v.size()){\n return 0;\n } \n if(k==0) return 0;\n if(dp[i][k]!=-1) return dp[i][k];\n\n int ans,x=0,sz=v[i].size();\n ans=func(i+1,k,v);\n ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "class Solution {\npublic:\n int n;\n int dp[1003][2003];\n vector<vector<int> > piles;\n int solve (int pileIndex, int coinLeft) {\n if (pileIndex == n || coinLeft == 0) {\n return 0;\n }\n if (dp[pileIndex][coinLeft] != -1) {\n return dp[pileIndex][co... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "class Solution {\npublic:\n int dp[1001][2001];\n int solve(int pile, int k, vector<vector<int>>& piles, vector<vector<int>>& prefix){\n if(k == 0 || pile == 0) return 0;\n if(dp[pile][k]!= -1) return dp[pile][k];\n int ans = 0;\n for(int i = 0 ; i <= min((int)piles[pile-1... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "int curr[2001][2001];\nint maxVal[2001];\nclass Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) {\n //recursive: each step choose from one of the piles\n // and increment that pile's index by 1 for next iteration\n // need bth coin of ath pile to not be ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "int curr[2001][2001];\nint maxVal[2001];\nclass Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) {\n //recursive: each step choose from one of the piles\n // and increment that pile's index by 1 for next iteration\n // need bth coin of ath pile to not be ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "int curr[2001][2001];\nint maxVal[2001];\nclass Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) {\n //recursive: each step choose from one of the piles\n // and increment that pile's index by 1 for next iteration\n // need bth coin of ath pile to not be ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "int curr[2001][2001];\nint maxVal[2001];\nclass Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) {\n //recursive: each step choose from one of the piles\n // and increment that pile's index by 1 for next iteration\n // need bth coin of ath pile to not be ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 0 | {
"code": "#define ll long long int\n\nclass Solution {\npublic:\nll dp[1000][2001];\nll rec(ll ind,ll k,vector<vector<int>>& piles){\n if(k==0) return 0;\n if(ind==piles.size()) return -1e9;\n ll get=piles[ind].size();\n ll ans=-1e9;\n if(dp[ind][k]!=-1) return dp[ind][k];\n for(int i=0;i<min(k,get... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 1 | {
"code": "class Solution {\npublic:\n\n int dp[2020][2020], n;\n\n int rec(int i, int k, vector<vector<int>>& piles){\n //pruning\n if(k <= 0) return 0;\n\n //basecase\n if(i >= n) return 0;\n\n //cache check\n if(dp[i][k] != -1) return dp[i][k];\n\n //compute\n... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 1 | {
"code": "class Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) {\n int n=piles.size();\n vector<int>pv(k+1,0);\n for(int i=1;i<=n;i++){\n vector<int>cur(k+1,0);\n for(int j=0;j<=k;j++){\n int sm=0;\n for(int l=1... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 1 | {
"code": "class Solution {\npublic:\n vector<vector<int>> dp; \n \n int solve(int ind, int k, vector<vector<int>> &p) {\n if (ind==p.size())\n return 0; \n \n if (dp[ind][k] != -1)\n return dp[ind][k]; \n \n dp[ind][k] = solve(ind+1, k, p); \n ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 1 | {
"code": "class Solution {\npublic:\n int solve(int i, int k, vector<vector<int>>& piles, vector<vector<int>>& dp) {\n if (dp[i][k] > 0) return dp[i][k];\n if (i == piles.size() || k == 0) return 0;\n\n int res = solve(i + 1, k, piles, dp), cur = 0;\n for (int j = 0; j < piles[i].size(... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) {\n int n = piles.size();\n vector<vector<int>> pileSums;\n for(int i = 0; i < n; i++) {\n auto pile = piles[i];\n int l = pile.size();\n int sum = 0;\n vec... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int dp(vector<vector<int>>& prefixSum, int k, int index, vector<vector<int>>& memo) {\n // Base cases\n if(k <= 0 || index >= prefixSum.size()) return 0;\n if(memo[k][index] != -1) return memo[k][index];\n\n int res = dp(prefixSum, k, index + 1, me... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int dp[2000][3000];\n int solve(vector<vector<int>> &piles,int idx,int k){\n if(idx==piles.size()) return 0;\n if(k==0) return 0;\n if(dp[idx][k]!=-1) return dp[idx][k];\n int nottake=solve(piles,idx+1,k);\n int take=0;\n int sum=0... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int dp[1001][2001];\n int solve(int ind, vector<vector<int>>& piles, int k)\n {\n if (k==0)\n {\n return 0;\n }\n\n if (ind >= piles.size()) {\n return 0;\n }\n\n if (dp[ind][k] != -1) return dp[ind][k];\n\... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int n;\n int dp[1001][2001];\n int solve(vector<vector<int>>& piles, int k, int i) {\n if (i >= n)\n return 0;\n\n if (dp[i][k] != -1)\n return dp[i][k];\n\n int notTaken = solve(piles, k, i + 1);\n\n int taken = 0;\n ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.