๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.61K photos
3 videos
95 files
10.6K 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
string solution(vector<string> commands) {
    unordered_map<string, unordered_set<string>> bucket_files;
    string current_bucket;
    for (const string& command : commands) {
        istringstream iss(command);
        string action, name;
        iss >> action >> name;
       
        if (action == "goto") {
            current_bucket = name;
        } else if (action == "create") {
            bucket_files[current_bucket].insert(name);
        }
    }
    string max_bucket;
    size_t max_files = 0;
   
    for (const auto& entry : bucket_files) {
        if (entry.second.size() > max_files) {
            max_files = entry.second.size();
            max_bucket = entry.first;
        }
    }
    return max_bucket;
}
โค1
def solution(queries, diff):
    numbers = {}
    output = []
    for query in queries:
        if "+" in query:
            number = int(query.split("+")[1])
            numbers[number] = numbers.get(number, 0) + 1
        else:
            number = int(query)
            del numbers[number]
        count = 0
        for number in numbers:
            count += numbers.get(number - diff, 0) * numbers.get(number + diff, 0)
        output.append(count)
    return output
TCS BSc Ignite and Smart Hiring 2024:

Graduation Year: 2023 / 2024

Eligibility: BCA, B.Sc (IT, Computer Science, Mathematics, Data Science, Statistics, Physics, Chemistry, Electronics, Cyber Security, Biochemistry), B.Voc in CS/IT

CTC for Ignite - 2.8 LPA
CTC for Smart - 1.9 LPA

Register Now: https://www.tcs.com/careers/india/tcs-smart-hiring-2024

Last Date to Regsiter: 24th June
๐ŸšจJob Opening Updates๐Ÿšจ

Company โ€“ Oracuz Infotech Pvt Ltd
Role โ€“ Data Science Intern
Exp. โ€“ Fresher
Apply Here โ€“ https://www.simplyhired.co.in/job/U44tuZ0b1xFLAqMw2dNuNWGetG7pNdEKVbIf7HbUqEq0hcb0X9ww6Q

Company โ€“ Conscript HR Advisors Private Limited
Role โ€“ Business Analytics Intern
Exp. โ€“ Fresher
Apply Here โ€“ https://internshala.com/internship/details/work-from-home-part-time-business-analytics-internship-at-conscript-hr-advisors-private-limited1717387959?utm_source=cp_link&referral=web_share

Company โ€“ EMERGEiQ
Role โ€“ Data Scientist
Exp. โ€“ Fresher
Apply Here โ€“ https://www.linkedin.com/jobs/view/3938463825
public static int minimumWinningMargin(int input1, int input2, int input3, int[] input4) {
        int requiredTotalMargin = input1 * input3;
        int currentTotalMargin = 0;
        for (int i = 0; i < input4.length; i++) {
            currentTotalMargin += input4[i];
        }
        int neededMargin = requiredTotalMargin - currentTotalMargin;
        if (neededMargin <= input2) {
            return Math.max(0, neededMargin);
        } else {
            return -1;
        }
    }

Qualifying Chances โœ…
Cognizant
select ca.first_name, od.status from customer_order co
join customer_address ca on ca.customer_id = co.customer_id
join order_delivery od on od.order_id = co.order_id
where first_name like 'C%';

Cognizant โœ…
int solve(int n, vector<int>& A, int M) {
    sort(A.begin(), A.end());
    int candies = 0;
    for (int i = 0; i < n; i++) {
        if (A[i] % 5 == 0 || A[i] <= M) {
            candies++;
            M -= A[i] % 5 == 0 ? 0 : A[i];
        }
        if (M == 0) {
            break;
        }
    }
    return candies;
}


Halloween candiesโœ…
int solve(vector<int>& A, int n) {
    int maxi = 0, cur = 0;
    for (int i = 1; i < n; i++) {
        if (A[i] < A[i - 1]) {
            cur++;
            if (cur >= 3) {
                maxi = max(maxi, cur);
            }
        } else {
            cur = 0;
        }
    }
    return maxi + 1;
}

Arctic temperature tracker โœ…
public class Main {

    public static int countSetBits(int number) {
        return Integer.bitCount(number);
    }
    public static int countElementsWithSetBits(int[] arr, int N, int X) {
        int count = 0;
        for (int num : arr) {
            if (countSetBits(num) == X) {
                count++;
            }
        }
        return count;
    }.  

SET BITSโœ…
๐Ÿ‘1
Genpect is hiring B.com/BBA/ MBA freshers or any accounting background for OTC/Order to Cash -Cash Applications skillset.

Job requirements:
. Good accounting knowledge
. Should understand OTC cycle
. Flexible to work in any shifts
. 5 days Work from Office.
. Office location- Gurgaon 22B

Interested candidates can share their resumes at the earliest at parul. chaturvedi1@genpact.com