#include <bits/stdc++.h>
using namespace std;
void rem(string str,pair<int,int>p,unordered_map<int,int>map,int &ans){
int prev=0;
unordered_map<char,int>c;
for(int i=p.first-1;i<p.second;i++)c[str.at(i)]++;
priority_queue<pair<int,char>,vector<pair<int,char>>,greater<pair<int,char>>>pq;
for(int i=p.first-1;i<p.second;i++)pq.push({map[i+1],str.at(i)});
while(!pq.empty()){
pair<int,char>top=pq.top();
pq.pop();
if(c[top.second]>1){
c[top.second]--;
ans+=(top.first-prev);
prev=top.first;
}
}

}
int main() {
int t;
cin>>t;
while(t--){
int n,q,ans=0;
cin>>n>>q;
string str;
cin>>str;
unordered_map<int,int>map;
for(int i=1;i<=n;i++){
int v;
cin>>v;
map[v]=i;
}
vector<pair<int,int>>p,m;
for(int i=0;i<q;i++){
int u,v;
cin>>u>>v;
p.push_back({u,v});
}
sort(p.begin(),p.end());
m.push_back(p.at(0));
for(int i=1;i<q;i++){
if(p.at(i).first>m.back().second)m.push_back(p.at(i));
else{
pair<int,int>pt=m.back();
m.pop_back();
m.push_back({pt.first,max(p.at(i).second,pt.second)});
}
}
for(int i=0;i<m.size();i++){
rem(str,m.at(i),map,ans);
}
cout<<ans<<endl;
}
}

Good String (Amazon)
C++(14)✅

❗️GLOBANT OffCampus Drive❗️

🎖 Batch - 2020 & 2021
💰 CTC - 4.8LPA
📝 Link - bit.ly/3OpsboY

MCQ KYT

1q)sass
Softwares as a service
A
2q)navigational
A
True
3q) drawback
D
Cost of computing
4q) cloud service are
B.
True.
5q)the paradgism
C
Progessive

SQL

1)in a sql primary
A
True
2)from player where
A
Whose 2nd letter
3)the agreegate function
A
True
4)name like v per t
Ends with t
B
5)order by age runs
A
Then on runs

Raw agent code python3

Replace s with given parameter name
Don't write 1st and last line

❗️ZOHO OffCampus Drive❗️

🎖 Batch - 2015 & 2022
📝 Link - bit.ly/3QRsP0k

Remove things that don't 𝐂𝐎𝐍𝐓𝐑𝐈𝐁𝐔𝐓𝐄 to your 𝐆𝐑𝐎𝐖𝐓𝐇😊❤️

# A motivational quote to start your day with 😊

Texas Instruments for 2022/2021/2020 passouts.

CTC : 32 Lakhs

Do send it to core ECE students! 😊

https://ti.wecreateproblems.com/

https://www.linkedin.com/posts/priyanshu-panwar_samsung-srib-job-activity-6947446398439014400-FfGC?utm_source=linkedin_share&utm_medium=android_app

If want they go and ask for referral

Publicis Sapient Hackathon

Batch eligible: 2023 and 2024 passouts

Round 1: Online Quiz Round 2: Online Coding Challenge Round 3: Jumpstart

Apply Link:

https://lnkd.in/dc6PDYwH

Note : Last day of Registration is Ist July, 2022

Only for those who had given TCS NQT in the past.

Hitachi Vantara
Role: Associate
Batch eligible: 2022 passouts only
CTC: 5LPA (including 5% variable pay)

Link: https://learning.tcsionhub.in/jobs/HITACHI-VANTARA-INDIA-PRIVATE-LIMITED/Associate-2434/

L&T Technology Services
Batch eligible: 2021 and 2022 passouts
(Only Aerospace and Mechanical passouts)

Apply Link: https://docs.google.com/forms/d/e/1FAIpQLSdSohdaRyZdm6iVIfLzjqaknRpSe09XJB192oKtp4MBb9k6QA/viewform

Share this opportunity among your friends who are from Aerospace and Mechanical branch.

#HelpEveryone