tgindex

online assessment| ALL at one Point |

описание

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

← к каналу@oahelp
8 151
подписчиков
Охват к подписчикам
254,8%
ERR
Реакции к просмотрам
0,03%
131 на 19 постов
Пересылки к просмотрам
0,22%
881
Постов в день
0,0
всего 20

Где отзываются чаще

доля реакций к просмотрам
  • 17 сент. 2023 г.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<n; i++){ if((a[i]-mi)<=mid){ count++; } else{ if(count<m) f = false; else{ count = 1; mi = a[i]; } } } if(count<m) f = false; if(f==false){ s = mid+1; } else{ ans = mid; e = mid-1; } } return ans; array division Deshaw 9/150,13%
  • 17 сент. 2023 г.ll solve(vector<int> &arr){ int n=arr.size(); vector<ll> pf(n),sf(n); pf[0]=arr[0]; sf[n-1]=arr[n-1]; for(int i=1;i<n;i++) pf[i]=arr[i]+pf[i-1]; for(int i=n-2;i>=0;i--) sf[i]=arr[i]+sf[i+1]; ll sm=0,mn=0; ll mx=-1e18; for(int i=0;i<n;i++){ sm+=arr[i]; if(sm>0) sm=0; mn=min(mn,sm); mx=max(mx,pf[i]-2*mn-(i<n-1?sf[i+1]:0)); } return mx; } subarrays Deshaw0,09%
  • 17 сент. 2023 г.long getMaxDist(std::vector<long> 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 queries0,06%
  • 17 сент. 2023 г.Do you guys want us to post internship and placement opportunities too in this grp?0,06%
  • 17 сент. 2023 г.15/15 Deshaw range selection0,06%
  • 17 сент. 2023 г.Product Internship at Directi Link https://jobs.lever.co/directi/cf481540-aa1b-46b0-bb73-96d0b8100a2d Try to take referral (good cp profile have high chance in this)0,05%
  • 17 сент. 2023 г.без подписи0,05%
  • 18 сент. 2023 г.Company Name : Beepkart Role : Software Engineer Internship Batch : 2023,2024,2022 passouts Duration : 6-9 months Link : https://docs.google.com/forms/d/e/1FAIpQLScbkovP5Ef_sALJDgD4X81nvQ68ty8af729OyZq0NaxeLS-gg/viewform0,05%
  • 17 сент. 2023 г.int l=0,r=1e14; while(l<r){ int mid=(l+r+1)>>1; int ans=1; int pr=0; for(int i=0;i<n;i++){ if(pr>starts[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/150,05%
  • 17 сент. 2023 г.tomorrow which oa now comment in this thread?0,04%
  • 17 сент. 2023 г.без подписи0,02%
  • 17 сент. 2023 г.без подписи0,00%