Company Name: Mercari, Inc.

Program: Build at Mercari 2024, Software Engineer (Training) Get Trained for 2 weeks and then invitation for interviews for an internship

Role: Build Intern (1 Month) Summer Intern (2 months)

Batch eligible: 2027, 2026, 2025, 2024, 2023, 2022 and 2021 passouts

Location: Remote Expected

Stipend: INR 50K per month or more Application

deadline: January 15, 2024

https://apply.workable.com/mercari/j/2D079007DB/

🚨JOB OPENING UPDATE🚨

Company – SAZ India
Role – Junior Data Analyst
Exp. – 0-1 yrs
Apply Here – https://www.linkedin.com/jobs/view/3806267870

Company – SAZ India
Role – Data Analyst Fresher
Exp. – 0-1 yr
Apply Here – https://www.linkedin.com/jobs/view/3806276028

Company – WCG
Role – AI Engineer
Exp. – Fresher
Apply Here – https://www.linkedin.com/jobs/view/3806244882

Company – Leading IT Co.
Role – Data Scientist
Exp. – 0-5 yrs
Apply Here – https://www.naukri.com/job-listings-data-scientist-leading-it-co-visakhapatnam-hindco-recruitment-consultants-vijayawada-andhra-pradesh-visakhapatnam-andhra-pradesh-guntur-andhra-pradesh-0-to-5-years-130124003990?src=sortby&sid=17053009075136849_1&xp=3&px=1&nignbevent_src=jobsearchDeskGNB

Company – CLOUDSUFI
Role – Data Engineer
Exp. – Fresher, Experienced
Apply Here – https://www.simplyhired.co.in/job/kaGgRoEupF1ERJvfnpFdjbL5e999vrLOoyHOk53MI7aft8DOMA_oxw

Company – Patenti Technology Solutions
Role – Machine Learning Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/machine-learning-internship-in-bangalore-at-patenti-technology-solutions1704976556?utm_source=cp_link&referral=web_share

Company – Village Company
Role – Generative AI Intern (Remote)
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/generative-ai-work-from-home-job-internship-at-village-company1705164201?utm_source=cp_link&referral=web_share

Company – Genius AI Solutions
Role – Data Science Intern (Remote)
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/data-science-work-from-home-job-internship-at-genius-ai-solutions1705000259?utm_source=cp_link&referral=web_share

Company – Avaari
Role – Machine Learning Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/machine-learning-work-from-home-job-internship-at-avaari1705138982?utm_source=cp_link&referral=web_share

Company – Aviac Technologies
Role – Data Analytics Intern
Exp. – Fresher
Apply Here – https://internshala.com/internship/detail/data-analytics-work-from-home-job-internship-at-aviac-technologies1704963415?utm_source=cp_link&referral=web_share

Company Name : Sleek
Role : Product Analytics Intern - 6 Months

Batch. : 2024/2025 passouts

Link : https://docs.google.com/forms/d/e/1FAIpQLScHOA4u0spuL5isWf2on1WJQnUmAHO3dT1Av3CryJHm9a2RVg/viewform

#include <iostream>
#include <unordered_map>
#include <vector>

using namespace std;

int findMaxFrequency(int x,int y,int z,vector<int> a){
    unordered_map<int, int> mp;
    for (int i = 0; i < a.size(); ++i) {
            //cin >> a[i];
            long p = a[i] + x, q = a[i] - y, r = a[i] * z;
            mp[a[i]]++;
            mp[p]++;
            mp[q]++;
            if(z!=1) mp[r]++;
        }
        //for (const auto& pair : mp)
        //cout<<pair.first<<" "<<pair.second<<endl;
        int res = 0;
        for (auto& it : mp) {
            res = max(it.second, res);
        }
        return res;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int tes = 1;
    string ans;
   
    for (int fuck = 1; fuck <= tes; ++fuck) {
        int n;
        int x, y, z;
        cin >> n >> x >> y >> z;

        //unordered_map<long, int> mp;
        vector<int> a(n);

        for (int i = 0; i < n; ++i) {
            cin >> a[i];
        }

       
        cout<<findMaxFrequency(x,y,z,a);
    }

    cout << ans;

    return 0;
}

def max_moves_to_banana(s):
    target_word = "BANANA"
    max_moves_a = s.count('A') // target_word.count('A')
    max_moves_n = s.count('N') // target_word.count('N')
    return min(max_moves_a, max_moves_n)

Hashdin ✅

def first_day(visits, target):
    total_visits = 0
    for i, daily_visits in enumerate(visits):
        total_visits += daily_visits
        if total_visits >= target:
            return i
    return -1

Autodesk ✅

string solve(vector<string>& l) {
    unordered_map<string, set<string>> b;
    string c = "";
    for (string s : l) {
        stringstream ss(s);
        string d, n;
        ss >> d >> n;
        if (d == "switch") {
            c = n;
        } else if (d == "push") {
            b[c].insert(n);
        }
    }
    string m = "";
    int f = 0;
    for (auto i : b) {
        if (i.second.size() > f) {
            f = i.second.size();
            m = i.first;
        }
    }
    return m;
}

Autodesk ✅

vector<string> solve(int n) {
    vector<string> f;

    if (n <= 0) {
        return f;
    }
    f.push_back(string(n, '*'));

    for (int i = 1; i <= n - 2; ++i) {
        string l = "*" + string(n - 2, ' ') + "*";
        f.push_back(l);
    }

    f.push_back(string(n, '*'));
    return f;
}

def solution(rates, strategy, k):
    n = len(rates)
    max_profit = float('-inf')

    for i in range(n - k + 1):
        current_strategy = strategy.copy()
        for j in range(k // 2):
            current_strategy[i + j] = 0
            current_strategy[i + k // 2 + j] = 1

        profit = calculate_profit(rates, current_strategy)
        max_profit = max(max_profit, profit)

    return max_profit

def calculate_profit(rates, strategy):
    bought_price = 0
    total_profit = 0

    for i in range(len(strategy)):
        if strategy[i] == -1:
            bought_price += rates[i]
        elif strategy[i] == 1:
            total_profit += rates[i] - bought_price
            bought_price = 0

    return total_profit

Autodesk ✅

int solve(int initial, vector<int> deltas) {
    int health = initial;
    for (int d : deltas) {
        health += d;
        if (health < 0) {
            health = 0;
        } else if (health > 100) {
            health = 100;
        }
    }
    return health;
}

Autodesk ✅

vector<string> solve(vector<vector<string>> p, vector<string> a, int w) {
    vector<string> r;
    r.push_back(string(w + 2, '*'));
    for(int i = 0; i < p.size(); i++) {
        string l = "";
        for(string wd : p[i]) {
            if(l.size() + wd.size() + (l.empty() ? 0 : 1) > w) {
                if(a[i] == "LEFT") {
                    l += string(w - l.size(), ' ');
                } else if(a[i] == "RIGHT") {
                    l = string(w - l.size(), ' ') + l;
                }
                r.push_back("*" + l + "*");
                l = "";
            }
            if(!l.empty()) {
                l += " ";
            }
            l += wd;
        }
        if(!l.empty()) {
            if(a[i] == "LEFT") {
                l += string(w - l.size(), ' ');
            } else if(a[i] == "RIGHT") {
                l = string(w - l.size(), ' ') + l;
            }
            r.push_back("*" + l + "*");
        }
    }
    r.push_back(string(w + 2, '*'));
    return r;
}

Autodesk ✅

struct Node{
    Node* links[10];
    bool end=false;
    bool containskey(char ch){
        return links[ch-'0']!=NULL;
    }
    void put(char ch,Node* node){
        links[ch-'0']=node;
    }
    Node* get(char ch){
        return links[ch-'0'];
    }
    void end1(){
        end=true;
    }
    bool isend(){
        return end;
    }
};
class Trie{
    private:
    Node* root;
    public:
    Trie() {
       root=new Node();
    }
   
    void insert(string word) {
        int l=word.size();
        Node* node=root;
        for(int i=0;i<l;i++)
        {
            if(!node->containskey(word[i]))
            {
                node->put(word[i],new Node());
            }
            node=node->get(word[i]);
        }
        node->end1();
    }
   
    int search(string word) {
        int l=word.size();
        Node* node=root;
        int ans=0;
        for(int i=0;i<l;i++)
        {
            if(!node->containskey(word[i]))
            {
                return ans;
            }
            else{
                ans++;
            }
            node=node->get(word[i]);
        }
        return ans;
    }
};

ll solve(vector<ll>a,vector<ll>b){
    Trie* t=new Trie;
   for(auto x:a){
       string s=to_string(x);
    t->insert(s);
      
   }
   int ans=0;
   for(auto x:b){
       string s=to_string(x);
       ans=max(ans,t->search(s));
   }
   return ans;
}
Autodesk ✅

SDE (Backend) Walk-In Drive-20th Jan,24
https://docs.google.com/forms/d/e/1FAIpQLSezrGonwVTDwu7_wlPTVxIB6V7kKNxYXQ4ZrxajUuHZRg0r0A/viewform

int solve(int N, int k, vector<int>& d) {
    vector<bool> dislike(10, false);
    for (int i = 0; i < k; ++i) {
        dislike[d[i]] = true;
    }

    while (true) {
        int temp = N;
        bool found = false;
        while (temp > 0) {
            if (dislike[temp % 10]) {
                found = true;
                break;
            }
            temp /= 10;
        }
        if (!found) {
            return N;
        }
        ++N;
    }
}

Minimum Amount ✅