def isDistinctRange(s, ranges):
for i in range(len(ranges)):
l, r = ranges[i]
s2 = []
for j in range(l-1, r):
if s[j] != '_':
s2.append(s[j])
if len(set(s2)) != len(s2):
return False
return True

def goodString(N, Q, S, arr, ranges):
s = list(S)
if isDistinctRange(s, ranges):
return 0
for i in range(len(arr)):
s[arr[i] - 1] = '_'
if isDistinctRange(s, ranges):
return i + 1

Good String (Amazon)
Python 3✅

def norm(water_adj_list, visited, province):
if province in visited:
return water_adj_list[province]

visited.add(province)
for conn_province in water_adj_list[province]:
water_adj_list[province] = water_adj_list[province].union(norm(water_adj_list, visited, conn_province))

visited.union(water_adj_list)
return water_adj_list[province]

def norm_water_paths(water_adj_list):
computed = set()
for province in water_adj_list:
visited = set(computed)
norm(water_adj_list, visited, province)
computed.add(province)

for province in water_adj_list:
water_adj_list[province].discard(province)
return water_adj_list

def get_component(land_adj_list, visited, province):
global component
if province in visited:
return

visited.add(province)
component.add(province)
for conn_province in land_adj_list[province]:
get_component(land_adj_list, visited, conn_province)

def validate_component(water_adj_list):
global component
conn_by_water = set()
for province in component:
conn_by_water = conn_by_water.union(water_adj_list[province])

return len(component.intersection(conn_by_water)) == 0

def get_adj_list(N, edges):
adj_list = {}
for province in range(1, N+1):
adj_list[province] = set()

for edge in edges:
adj_list[edge[0]].add(edge[1])
adj_list[edge[1]].add(edge[0])

return adj_list

component = set()
def solve(A, B, N, land, water):
global component
land_adj_list = get_adj_list(N, land)
water_adj_list = get_adj_list(N, water)
water_adj_list = norm_water_paths(water_adj_list)
visited = set()
max_province = 0
for province in range(1, N+1):
component = set()
if not province in visited:
get_component(land_adj_list, visited, province)
if len(component) > max_province and validate_component(water_adj_list):
max_province = len(component)

return max_provincedef norm(water_adj_list, visited, province):
if province in visited:
return water_adj_list[province]

visited.add(province)
for conn_province in water_adj_list[province]:
water_adj_list[province] = water_adj_list[province].union(norm(water_adj_list, visited, conn_province))

visited.union(water_adj_list)
return water_adj_list[province]

def norm_water_paths(water_adj_list):
computed = set()
for province in water_adj_list:
visited = set(computed)
norm(water_adj_list, visited, province)
computed.add(province)

for province in water_adj_list:
water_adj_list[province].discard(province)
return water_adj_list

def get_component(land_adj_list, visited, province):
global component
if province in visited:
return

visited.add(province)
component.add(province)
for conn_province in land_adj_list[province]:
get_component(land_adj_list, visited, conn_province)

def validate_component(water_adj_list):
global component
conn_by_water = set()
for province in component:
conn_by_water = conn_by_water.union(water_adj_list[province])

return len(component.intersection(conn_by_water)) == 0

def get_adj_list(N, edges):
adj_list = {}
for province in range(1, N+1):
adj_list[province] = set()

for edge in edges:
adj_list[edge[0]].add(edge[1])
adj_list[edge[1]].add(edge[0])

return adj_list

component = set()
def solve(A, B, N, land, water):
global component
land_adj_list = get_adj_list(N, land)
water_adj_list = get_adj_list(N, water)
water_adj_list = norm_water_paths(water_adj_list)
visited = set()
max_province = 0
for province in range(1, N+1):
component = set()
if not province in visited:
get_component(land_adj_list, visited, province)
if len(component) > max_province and validate_component(water_adj_list):
max_province = len(component)

return max_province

Kingdom Connect (Amazon)
Python 3✅

#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 😊