leetcode: add 3412

Author: Pankajcoder1

Codeforces/After Placement/2057A-MEX Table.cpp

@@ -0,0 +1,24 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n,m;
+    cin>>n>>m;
+    cout<<max(n,m)+1<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

Codeforces/After Placement/2057B-Gorilla and the Exam.cpp

@@ -0,0 +1,50 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n,k,temp;
+    cin>>n>>k;
+    map<int, int> m;
+
+    for(int i=0;i<n;i++){
+        cin>>temp;
+        m[temp]++;
+    }
+    vector<int> v;
+    for(auto x:m){
+        v.push_back(x.second);
+    }
+    sort(v.begin(),v.end());
+    int ans=v.size();
+    // cout<<"ans "<<ans<<endl;
+
+    if(k==0){
+        cout<<ans<<endl;
+        return 0;
+    }
+
+    for(int i=0;i<v.size();i++){
+        k-=v[i];
+        if(k<0){
+            break;
+        }
+        ans--;
+    }
+    cout<<max(ans,1)<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}

LeetCode/3412.Find Mirror Score of a String.cpp

@@ -0,0 +1,24 @@
+class Solution {
+public:
+    char find_mirror(char ch) {
+        return 'a' + 'z' - ch ;
+    }
+    long long calculateScore(string s) {
+        map<char , set<int>> mp;
+        
+        long long score = 0 ;
+        for(int i=0 ; i < s.size() ; i++) {
+            char mir = find_mirror(s[i]);
+
+            if( mp.find(mir) != mp.end() && mp[mir].size() > 0 ) {
+                    auto it = mp[mir].rbegin() ;
+                    score += i - *it ;
+                    mp[mir].erase(*it) ;
+            }
+            else {
+                mp[s[i]].insert(i) ;
+            }
+        }
+        return score ;
+    }
+};