maybe last commit

Prashant0664 · Prashant0664 · commit c784a4c67cb7 · 2024-01-08T17:11:32.000+05:30
diff --git a/2923 Find Champion.cpp  b/2923 Find Champion.cpp 
@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int findChampion(int n, vector<vector<int>>& edges) {
+        set<int>s;
+        for(int i=0;i<edges.size();i++)
+            s.insert(edges[i][1]);
+        if(s.size()!=n-1)return -1;
+        for(int i=0;i<edges.size();i++)
+            if(s.find(edges[i][0])==s.end())
+                return edges[i][0];
+        return 0;
+    }
+};
diff --git a/2924. Find Champion II.cpp b/2924. Find Champion II.cpp
@@ -0,0 +1,13 @@
+class Solution {
+public:
+    int findChampion(int n, vector<vector<int>>& edges) {
+        set<int>s;
+        for(int i=0;i<edges.size();i++)
+            s.insert(edges[i][1]);
+        if(s.size()!=n-1)return -1;
+        for(int i=0;i<edges.size();i++)
+            if(s.find(edges[i][0])==s.end())
+                return edges[i][0];
+        return -1;
+    }
+};
diff --git a/2928. Distribute Candies Among Children I.cpp b/2928. Distribute Candies Among Children I.cpp
@@ -0,0 +1,13 @@
+class Solution {
+public:
+    long long combo(int n){
+        return 1ll* n *(n-1)/2;
+    }
+    long long distributeCandies(int n, int limit) {
+        if (n>3*limit) return 0;
+        long long res = combo(n + 2);
+        if (n>limit)  res -= 3*combo(n-limit+1);
+        if (n-2>=2*limit) res += 3*combo(n-2*limit);
+        return res;
+    }
+};
diff --git a/2929. Distribute Candies Among Children II.cpp b/2929. Distribute Candies Among Children II.cpp
@@ -0,0 +1,13 @@
+class Solution {
+public:
+    long long combo(int n){
+        return 1ll* n *(n-1)/2;
+    }
+    long long distributeCandies(int n, int limit) {
+        if (n>3*limit) return 0;
+        long long res = combo(n + 2);
+        if (n>limit)  res -= 3*combo(n-limit+1);
+        if (n-2>=2*limit) res += 3*combo(n-2*limit);
+        return res;
+    }
+};
diff --git a/2934. Minimum Operations to Maximize Last Elements in Arrays.cpp b/2934. Minimum Operations to Maximize Last Elements in Arrays.cpp
@@ -0,0 +1,30 @@
+class Solution {
+public:
+    int sol(vector<int>nums1, vector<int>nums2){
+        int h1=nums1[nums1.size()-1];
+        int h2=nums2[nums1.size()-1];
+        int ans=0;
+        for(int i=0;i<nums1.size()-1;i++){
+            if(nums1[i]>h1){
+                if(nums2[i]>h1)return -1;
+                else{ swap(nums1[i],nums2[i]);ans++;}
+            }
+            if(nums2[i]>h2){
+                if(nums1[i]>h2)return -1;
+                else{ swap(nums2[i],nums1[i]);ans++;}
+            }
+            if(nums1[i]>h1 || nums2[i]>h2)return -1;
+        }
+
+        return ans;
+    }
+    int minOperations(vector<int>& nums1, vector<int>& nums2) {
+        int ans1=sol(nums1,nums2);
+        swap(nums1[nums1.size()-1],nums2[nums1.size()-1]);
+        int ans2=sol(nums1,nums2);
+        if(ans1==ans2)return ans1;
+        else if(ans1==-1)return ans2+1;
+        else if(ans2==-1)return ans1;
+        else return min(ans1,ans2+1);
+    }
+};
diff --git a/High-Access Employees.cpp b/High-Access Employees.cpp
diff --git a/Maximum Strong Pair XOR I.cpp b/Maximum Strong Pair XOR I.cpp
@@ -0,0 +1,91 @@
+struct Node {
+    Node* links[2];
+    int frequency; 
+    Node() : frequency(0) {
+        links[0] = links[1] = NULL;
+    }
+
+    bool containsKey(int bit) {
+        return (links[bit] != NULL);
+    }
+
+    Node* get(int bit) {
+        return links[bit];
+    }
+
+    void put(int bit, Node* node) {
+        links[bit] = node;
+    }
+};
+
+class Trie {
+private:
+    Node* root;
+
+public:
+    Trie() {
+        root = new Node();
+    }
+
+    void insert(int num) {
+        Node* node = root;
+        for (int i = 31; i >= 0; i--) {
+            int bit = (num >> i) & 1;
+            if (!node->containsKey(bit)) {
+                node->put(bit, new Node());
+            }
+            node = node->get(bit);
+            node->frequency++;
+        }
+    }
+
+    int getMax(int num) {
+        Node* node = root;
+        int res = 0;
+        for (int i = 31; i >= 0; i--) {
+            int bit = (num >> i) & 1;
+            if (node->containsKey(1 - bit) && node->get(1 - bit)->frequency > 0) {
+                res = res | (1 << i);
+                node = node->get(1 - bit);
+            } else {
+                if(node->containsKey(bit) && node->get(bit)->frequency > 0) node = node->get(bit);
+                else return 0;
+            }
+        }
+        return res;
+    }
+
+    void deleteKey(int num) {
+        Node* node = root;
+        for (int i = 31; i >= 0; i--) {
+            int bit = (num >> i) & 1;
+            if (node->containsKey(bit)) {
+                node = node->get(bit);
+                node->frequency--;
+            } else {
+                break;
+            }
+        }
+    }
+};
+
+class Solution {
+public:
+    int maximumStrongPairXor(vector<int>& nums) {
+        int n=nums.size();
+        sort(begin(nums),end(nums));
+        int maxi=0;
+        int j=0;
+        Trie t;
+        t.insert(nums[0]);
+        for(int i=1;i<n;i++) {
+            while(j<i && nums[i]-nums[j]>min(nums[i],nums[j])) {
+                t.deleteKey(nums[j]);
+                ++j;
+            }
+            maxi=max(maxi,t.getMax(nums[i]));
+            t.insert(nums[i]);
+        }
+        return maxi;
+    }
+};
diff --git a/Most Profit Assigning Work.cpp b/Most Profit Assigning Work.cpp
@@ -0,0 +1,27 @@
+class Solution {
+public:
+    int maxProfitAssignment(vector<int>& diff, vector<int>& pro, vector<int>& wor) {
+        vector<pair<int,int>>v;
+        for(int i=0;i<diff.size();i++)
+            v.push_back({diff[i],pro[i]});
+        sort(v.begin(),v.end());
+        for(int i=1;i<diff.size();i++)
+            v[i].second=max(v[i-1].second,v[i].second);
+        int ans=0;
+        for(int i=0;i<wor.size();i++){
+            int start=0,end=diff.size()-1,index=-1;
+            while(start<=end){
+                int mid=(start+end)>>1;
+                if(v[mid].first>wor[i])
+                    end=mid-1;
+                else{
+                    index=mid;
+                    start=mid+1;
+                }
+            }
+            if(index!=-1)
+                ans+=v[index].second;
+        }
+        return ans;
+    }
+};
diff --git a/tempCodeRunnerFile b/tempCodeRunnerFile
diff --git a/tempCodeRunnerFile.cpp b/tempCodeRunnerFile.cpp
@@ -1,4 +1,46 @@
-9
-8
-7
-6
+#include<bits/stdc++.h>
+using namespace std;
+int maxProfitAssignment(vector<int>& diff, vector<int>& pro, vector<int>& wor) {
+        vector<pair<int,int>>v;
+        for(int i=0;i<diff.size();i++){
+            v.push_back({diff[i],pro[i]});
+        }
+        int maxi=0;
+        for(int i=0;i<diff.size();i++){
+            v[i].second=max(maxi,v[i].second);
+            maxi=max(v[i].second,maxi);
+        }
+        int ans=0;
+        for(int i=0;i<wor.size();i++){
+            int start=0;
+            int end=diff.size()-1;
+            int index=-1;
+            while(start<=end){
+                int mid=(start+end)/2;
+                if(v[mid].first>wor[i]){
+                    end=mid-1;
+                }
+                else{
+                    index=mid;
+                    start=mid+1;
+                }
+                cout<<index<<endl;
+            }
+            if(index==-1){
+                continue;
+            }
+            ans+=v[index].second;
+        }
+        return ans;
+    }
+int main(){
+    // string s="012";
+    // int m=stoi(s);
+    // cout<<m;
+    // cout<<((10)>>2);
+    // vector<int>v={1,2,3};
+    // maxProfitAssignment(v,v,v);
+    // vector<int>arr={1,2,4,5};
+    // auto t=lower_bound(arr.begin(),arr.end(),3);
+    // cout<<*t<<endl;
+}
