urgently hiring for two positions at Teamarcs Technologies Pvt. Ltd. in Noida (Sector 62).

We are thrilled to announce that we are recruiting! We have exciting internship opportunities available for the following:

- Business Analyst Intern
 
Qualifications:
- Bachelor's degree completed or equivalent qualification.

- Candidate must have good communication skills

- React Native Developer Intern

Qualifications:
- Bachelor of Technology completed.

Interested candidates can share their resume at hr@teamarcs.com

Location: 
Sector 62, Noida, Uttar Pradesh 201309 
(On-Site)

For QA intern at pune
10000 per month
BTech/BCA/MCA are eligible
Apply at
mailto:nancy@roxiler.com

Company: Jio hoster
Role: Business Development Associate
Expected CTC: 12 LPA
Batch Eligible: Any
Website: https://jiohoster.com/jobs/business-development-associate/

Zomato is hiring android developers

Do apply at
mailto:asheesh.a@zomato.com

Tutero is hiring Backend Engineer

For 2022, 2021 grads

Location - Remote (Australia)

Apply - https://www.linkedin.com/jobs/view/3961938743

NCS Off Campus Drive 2024 Details:

Job Role:  Freshers

Qualification:  B.E/B.Tech/B.Sc/BCA

Batch:  2023 & 2024

Experience:  Freshers

Job Location:  Pune

https://forms.office.com/pages/responsepage.aspx?id=9diQymOJbku8qZrEaLzHqNxQYEspi3tPmcHfMEubmiVUQ0tQTk1TMVNEM0Q4Tk1ET0NBRE1RTzlVMy4u&web=1&wdLOR=c0595B219-58D3-4DF7-AC2D-DC19256255CB

Company: Samagra Governance
Location: N/A
Role: Devops Intern
For Graduates: 2023, 2024, 2025, 2026

https://www.linkedin.com/posts/singhalkarun_hiringnow-activity-7214113392364593152-5bha

Company Name : Swiggy
Role : ASDE, SDE 1 and SDET

Batch : 2024,2023,2022,2021 passouts

Link : https://docs.google.com/forms/d/e/1FAIpQLSdPtswFrJv8T1aa2Fn1wkOI369w1ACHtL048WQuLYLk04LddA/viewform?pli=1

Snoodify is hiring Backend Interns

For 2024, 2025, 2026 Grads

Location - Delhi

Stipend - 18k/month

Potential FT comp - 9-12 LPA

https://www.linkedin.com/posts/dheekshithkumar_backend-developer-hiring-post-ugcPost-7211374996999262208-km92

#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
vector<int> getNumStrings(int k, vector<vector<int>>& queries) {
    int max_length = 0;
    for (const auto& query : queries) {
        max_length = max(max_length, query[1]);
    }
   
    vector<int> dp(max_length + 1, 0);
    dp[0] = 1;
   
    for (int i = 1; i <= max_length; ++i) {
        dp[i] = dp[i - 1];
        if (i >= k) {
            dp[i] = (dp[i] + dp[i - k]) % MOD;
        }
    }
   
    vector<int> prefix_sum(max_length + 1, 0);
    for (int i = 1; i <= max_length; ++i) {
        prefix_sum[i] = (prefix_sum[i - 1] + dp[i]) % MOD;
    }
   
    vector<int> results;
    for (const auto& query : queries) {
        int L = query[0];
        int R = query[1];
        int result = (prefix_sum[R] - prefix_sum[L - 1] + MOD) % MOD;
        results.push_back(result);
    }
   
    return results;
}

DE Shaw ✅

long getMaxScore(int n, vector<vector<int>> score) {
  
   vector<vector<long long>> maxs(n+1,vector<long long>(11,0LL)) , d(n+1,vector<long long>(11,0LL));
   for(int i=0;i<=9;i++) maxs[0][i]=score[i][0];
   vector<long long> v1(11,0) ,v2(11,0);
   for(int i=1;i<n;++i){
       vector<long long> v3(11,0LL);
       v2=v3;
       for(int j=0;j<=9;j++){
           long long cur=-1,val=-1e12;
           for(int k=0;k<=9;k++){
               if(maxs[i-1][k]+score[k][j]>val){
                   val=maxs[i-1][k]+score[k][j];
                   cur=k;
               }
               v2[k]=max(v2[k],v1[j]+score[j][k]);
           }
           d[i][j]=cur;
           maxs[i][j]=val;
       }
       v1=v2;
   }
   long long res=0;
   for(int i=0;i<=9;i++) res=max(res,v1[i]);
   return res;
  
}

DE Shaw ✅

vector<int> assignTasks(int n, vector<int>& s, vector<int>& e, int k, vector<int>& t) {
    vector<int> wt(k, -1);
    vector<pair<int, int>> srv;

    for (int i = 0; i < n; ++i) {
        srv.push_back({s[i], e[i]});
    }

    sort(srv.begin(), srv.end());

    auto findSrv = [&](int tt) -> int {
        int lo = 0, hi = n - 1;
        while (lo <= hi) {
            int mid = lo + (hi - lo) / 2;
            if (srv[mid].first <= tt && tt < srv[mid].second) {
                return 0;
            } else if (tt < srv[mid].first) {
                if (mid == 0 || tt >= srv[mid - 1].second) {
                    return srv[mid].first - tt;
                }
                hi = mid - 1;
            } else {
                lo = mid + 1;
            }
        }
        return -1;
    };

    for (int i = 0; i < k; ++i) {
        wt[i] = findSrv(t[i]);
    }

    return wt;
}


// getwaitingtime

DE Shaw ✅