๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.62K subscribers
5.59K photos
3 videos
95 files
10.2K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
Photo
vector<int> lis[100001];
int vis[100001];

void initialize(int n)
{
    for (int i = 0; i <= n; i++)
    {
        lis[i].clear();
        vis[i] = 0;
    }
}
set<int> found;

void dfs(int node)
{
    found.insert(node);
    vis[node] = 1;
    for (int child : lis[node])
    {
        if (vis[child] == 0)
        {
            dfs(child);
        }
    }
}

vector<int> timeOfInfection(int n, int m, vector<int> initially_infected, vector<vector<int>> update)
{
    vector<int> status(n, 0);
    vector<int> ans(n, -1);
    for (int i = 0; i < m; i++)
    {
        status[initially_infected[i]] = 1;
        ans[initially_infected[i]]=0;
    }

    for (int i = 0; i < update.size(); i++)
    {
        int type = update[i][0];
        if (type == 0)
        {
            int a = update[i][1];
            int b = update[i][2];
            if (status[a] == 0 && status[b] == 0)
            {
                lis[a].push_back(b);
                lis[b].push_back(a);
            }
            else if (status[a] == 1 && status[b] == 1)
            {
                lis[a].push_back(b);
                lis[b].push_back(a);
            }
            else if (status[a] == 1)
            {
                found.clear();
                dfs(b);
                for (auto x : found)
                {
                    ans[x] = i + 1;
                    status[x] = 1;
                }
            }
            else
            {
                found.clear();
                dfs(a);
                for (auto x : found)
                {
                    ans[x] = i + 1;
                    status[x] = 1;
                }
            }
        }
    }
    for (int i = 0; i < update.size(); i++)
    {
        int type = update[i][0];
        if(type==1)
        {
            int a=update[i][1];
            if(i+1<ans[a])
            {
                ans[a]=-1;
            }

        }
    }
    return ans;
}

Virus infection โœ…
Latest Job Opening Update

Company โ€“ Prodigal SoftTech India Private Limited
Role โ€“ Data Analytics Intern
Exp. โ€“ Fresher
Apply Here โ€“ https://internshala.com/internship/detail/data-analytics-internship-in-bangalore-at-prodigal-softtech-india-private-limited1709017623?utm_source=cp_link&referral=web_share

Company โ€“ Specrom Analytics
Role โ€“ Data Science Intern
Exp. โ€“ Fresher
Apply Here โ€“ https://internshala.com/internship/detail/part-time-data-science-internship-in-multiple-locations-at-specrom-analytics1709008815?utm_source=cp_link&referral=web_share

Company โ€“ iDataLytics
Role โ€“ Data science intern
Exp. โ€“ 0-5 yrs
Apply Here โ€“ https://www.simplyhired.co.in/job/a9BuN4ejA13LLJJDd24FStNxJxZaexsDdniAo6i4o4JDT-9w4-lMvQ
โค1
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <climits>
using namespace std;

int countMinimumOperations(string password) {
    int v = 0, c = 0;
    vector<int> cost(26, 26), choices;

    for (char ch = 'a'; ch <= 'z'; ch++) {
        for (char vowel : "aeiou") {
            cost[ch - 'a'] = min(cost[ch - 'a'], abs(ch - vowel));
        }
    }

    for (char ch : password) {
        if (cost[ch - 'a'] == 0) {
            v++;
        } else {
            c++;
            choices.push_back(cost[ch - 'a']);
        }
    }

    if (v > c) {
        return (v - c) / 2;
    }

    sort(choices.begin(), choices.end());
    return accumulate(choices.begin(), choices.begin() + (c - v) / 2, 0);
}

IBMโœ…
โค1
Walk in Drive for freshers...! Novastrid is #hiringnow

Position: QA Trainee

Location: Madurai

Qualifications: - Any Degree / Professional Degree (From 2020 to 2023 passed out to students only)

- Basic knowledge of Manual and Automation testing in the IT Industry

- Should have strong English communication skills (Oral & Written)

- Certified candidates are preferable.

- Immediate Joiners required.

Levels of Interview: - Group Discussion - Written Test (Aptitude, English writing skill) -

Technical round - Final round with our CEO via Microsoft Teams Work Type: Direct Office Walk-in Date: 29.02.2024 (Thursday) Time: 10 AM Address: NovaStrid IT Ventures Pvt Ltd, 127A/1, Indigo Arcade Second Floor, SBI Bank Upstairs, K.Pudur, Madurai-625007.