Free copy paste solution of all major coding contest and OAs....
We provide all codes for free with regular internships and job updates
Join for all in one place....from codes to regular job updates everything
Discussion grp - https://t.me/oadiscussion
Join @oahelp for exclusive contest and free content and discussions in 1
No reviews yet. Be the first to share your experience!
Latest Posts
online assessment| ALL at one Point |
May 25, 2026, 04:55 AM
[poll]
28,400
17
0
online assessment| ALL at one Point |
May 25, 2026, 04:55 AM
tomorrow which oa now comment in this thread?
30,600
12
0
online assessment| ALL at one Point |
May 25, 2026, 04:55 AM
📷 Photo
25,700
5
0
online assessment| ALL at one Point |
May 25, 2026, 04:55 AM
long getMaxDist(std::vector starts, long d) {
int n = starts.size();
sort(starts.begin(), starts.end()); // Sort the starting points in ascending order
long l = 0, r = 1e14;
while (l < r) {
long mid = (l + r + 1) / 2;
int ans = 1;
long pr = 0;
for (int i = 0; i < n; i++) {
if (pr > starts[i] + d) {
ans = 0;
} else {
pr = std::max(pr + mid, starts[i]);
}
}
if (ans) {
l = mid;
} else {
r = mid - 1;
}
}
return l;
}
c++ Deshaw range queries
18,700
12
0
online assessment| ALL at one Point |
May 25, 2026, 04:55 AM
Deshaw questions
17,600
0
0
online assessment| ALL at one Point |
May 25, 2026, 04:55 AM
📷 Photo
18,200
9
0
online assessment| ALL at one Point |
May 25, 2026, 04:55 AM
int l=0,r=1e14;
while(l>1;
int ans=1;
int pr=0;
for(int i=0;istarts[i]+d){
ans=0;
}else{
pr=max(pr+mid,starts[i]);
}
}
if(ans){
l=mid;
}else{
r=mid-1;
}
}
return l;
Range selection deshaw
2/15
int n = a.size();
sort(a.begin(),a.end());
int s = 0;
int e = a[n-1]-a[0];
int ans = 0;
while(s<=e){
int mid = s+(e-s)/2;
int mi = a[0];
int count = 1;
bool f = true;
for(int i=1; i
