C✅

Accenture
Butterfly code ✅

Marsh McLennan Off Campus Hiring Fresher For Analyst     
Location  : Gurugram 
Qualification   : B.E/B.Tech/M.E/M.Tech/MCA      
Work Experience : Fresher - 1 year
CTC    : 4 - 5 LPA       

Apply Link   : https://careers.marshmclennan.com/global/en/job/R_266528/Analyst-Implementation-Services

def csAlgo(n):
n = 1
for i in range(1, n + 1):
for j in range(i):
print(num, end=' ')
num += 1
print()
n = int(input())
csAlgo(n)

Accenture ✅

Accenture ✅

🚨Job Opening Updates

Company – Maalexi Incorporation
Role – Data Engineer Internship
Exp. – Frseher
Apply Here – https://internshala.com/internship/details/work-from-home-data-engineer-internship-at-maalexi-incorporation1714538310?utm_source=cp_link&referral=web_share

Company – Ayurveda House Private Limited
Role – Data Analytics Internship
Exp. – Fresher
Apply Here – https://internshala.com/internship/details/data-analytics-internship-in-delhi-at-ayurveda-house-private-limited1714633556?utm_source=cp_link&referral=web_share

Company – Smaclify Technologies
Role – Artificial Intelligence (AI) Internship
Exp. – Fresher
Apply Here – https://internshala.com/internship/details/artificial-intelligence-ai-internship-in-pune-at-smaclify-technologies1714549451?utm_source=cp_link&referral=web_share

Company – Orbio Solutions Pvt Ltd
Role – Data Engineer
Exp. – 0-1 yrs
Apply Here – https://www.simplyhired.co.in/job/2nV3UsONlsXwX-rOzZy4-G1JTd41n5_iEklqnc0MJpY6e3iIOp8RQg

Company – Datastream Solutions
Role – Data Engineer
Exp. – 0-5 yrs
Apply Here – https://www.naukri.com/job-listings-data-engineer-datastream-solutions-nagpur-0-to-5-years-020524002356?src=jobsearchDesk&sid=17146367846348643_3&xp=8&px=1&nignbevent_src=jobsearchDeskGNB

Snaptrude is hiring SDE Intern

https://www.linkedin.com/posts/namrata-chatterjee-b18365203_hiring-sde-freshers-activity-7191686683971538946-Qa8B?utm_source=share&utm_medium=member_android

Vahan is hiring SDE Interns
For 2023/2024/2025 grads
🚀

https://www.linkedin.com/posts/ketansp_hiring-internship-sde-activity-7191303262950539265-hdj0?utm_source=share&utm_medium=member_desktop

#include <iostream>
#include <string>
#include <cstring>
using namespace std;

typedef long long ll;

ll dp[100001][3][3];

ll F(int i, int j, int p, string &s) {
    if (i < 0 || j < 0) return j < 0;
    if (dp[i][j][p] != -1) return dp[i][j][p];
    return dp[i][j][p] = F(i-1, j, p, s) + (s[i]-'0' != p ? F(i-1, j-1, s[i]-'0', s) : 0);
}

ll numberOfWays(string s) {
    memset(dp, -1, sizeof dp);
    return F(s.size()-1, 2, 2, s);
}

def numberOfWays(book) ✅
Amazon

long compute(vector<int> a, int mid, int k){
    long ans = 0;
    for(auto i: a){
        long temp;
        if(mid >= i){
            temp = min((long)(mid-i), (long)i+(long)k-(long)mid);
        }else{
            temp = min(long(i-mid), (long)k-(long)i+(long)mid);
        }
        ans += temp;
    }
    return ans;
}

long minOperations(int k, vector<int> locks){
    long st = 1, end = k-1;

    long ans = compute(locks, 0, k);
    ans = min(ans, compute(locks, k, k));

    while(st<=end){
        int mid = (st+end)/2;
        long left=0, right=0, mmid=0;
        mmid = compute(locks, mid, k);
        left = compute(locks, mid-1, k);
        right = compute(locks, mid+1, k);
        ans = min(ans, mmid);
        if(left < mmid){
            end = mid-1;
        }else if(right<mmid){
            st = mid+1;
        }else{
            break;
        }
    }

    return ans;
}

Ship locks ✅
ServiceNow

#include<bits/stdc++.h>
using namespace std;

vector<vector<int>> textQueries(vector<string> sentences, vector<string> queries){
    int n = sentences.size(), m = queries.size();
    map<string, multiset<int>> mp;
    for(int i=0; i<n;i++){
        string temp = sentences[i];
        string tt = "";
        for(int j=0; j<sentences[i].length(); j++){
            if(temp[j]==' '){
                mp[tt].insert(i);
                tt = "";
            }else{
                tt += temp[j];
            }
        }
        mp[tt].insert(i);
    }

    vector<vector<int>> ans;

    for(int i=0; i<m; i++){
        string tt = "";
        string temp = queries[i];
        multiset<int> st, st2;
        for(int j=0; j<temp.length(); j++){
            if(temp[j]==' '){
                st = mp[tt];
                tt = "";
                break;
            }else{
                tt += temp[j];
            }
        }
        if(tt!="") {st = mp[tt]; tt="";}

        for(int j=0; j<temp.length(); j++){
            if(temp[j]==' '){
                for(auto it: mp[tt]){
                    if(st.find(it)!=st.end()){
                        st2.insert(it);
                    }
                }
                st = st2;
                tt = "";
                st2.clear();
            }else{
                tt += temp[j];
            }
        }
        if(tt!=""){
            for(auto it: mp[tt]){
                if(st.find(it)!=st.end()){
                    st2.insert(it);
                }
            }
            st = st2;
            st2.clear();
        }

        if(st.size()==0) ans.push_back({-1});
        else{
            vector<int> temp;
            for(auto it: st){
                temp.push_back(it);
            }
            ans.push_back(temp);
        }

    }

    return ans;
}

int main()
{
    vector<string> sentences = {"how it was done", "are you how", "it goes to", "goes done are it"};
    vector<string> queries = {"done it", "it"};

    vector<vector<int>> ans = textQueries(sentences, queries);
    for(auto i: ans){
        for(auto j: i){
            cout << j << " ";
        }cout << endl;
    }

}

Simple Text Queries ✅
ServiceNow

Sorting Algorithm ✅
Accenture