Email your Resume at: ADMIN@SPCYBERWORD.COM

📌Volvo Cars Hiring

Role: Associate Software Engineer
Location: Bengaluru

💻Apply: https://jobs.volvocars.com/job/Bengaluru-Associate-Software-Engineer-KA-562122/1121362001/

The power of Ai Hype and LinkedIn

7 Rules of Life:

- Let it go
- Ignore them
- Give it time
- Don’t compare
- Stay calm
- It’s on you
- Always smile

Company Name : Atlassian
Batch : 2023/2022/2021 passouts
Role : Software Engineer

Link : https://www.atlassian.com/company/careers/details/15802

Apply: https://www.compindia.com/careers/

Lam Research hiring Engineering Intern
Batch eligible: 2025 grads 

Apply: https://careers.lamresearch.com/job/Bangalore-Engineering-Intern-1-IN-B/1218002000/

I am not sure if you guys are aware or not but there are many scammers in Telegram who may ask you to pay them 200 rs and will give 1250 after sometime, never ever reply to those fraud people. Never ever pay any money to anyone in telegram for the sake of getting it double or whatsoever.
Be smart, stay safe ❤️

#include <iostream>
#include <vector>
#include <unordered_map>
#include <set>
#include <algorithm>
using namespace std;
long long minimumCost(vector<int>& arr) {
    unordered_map<int, int> freq;
    for (int num : arr) {
        freq[num]++;
    }
    vector<pair<int, int>> elements;
    for (const auto& entry : freq) {
        elements.push_back(entry);
    }
    sort(elements.begin(), elements.end(), [](pair<int, int>& a, pair<int, int>& b) {
        return a.second > b.second; 
    });
    set<int> distinct;
    long long totalCost = 0;
    for (const auto& element : elements) {
        for (int i = 0; i < element.second; ++i) {
            distinct.insert(element.first);
            totalCost += distinct.size(); 
        }
    }
    return totalCost;
}

IBM ✅

SELECT product_name, cost AS product_cost, category AS product_category
FROM products AS p1
WHERE cost = (
    SELECT MAX(cost)
    FROM products AS p2
    WHERE p1.category = p2.category
)
ORDER BY product_cost DESC, product_name ASC;

Fractal✅

public static int countHashtagDivisors(String description1, String description2) {
        int len1 = description1.length();
        int len2 = description2.length();
        int gcdLength = gcd(len1, len2);
       
        int commonDivisors = 0;
        for (int i = 1; i <= gcdLength; i++) {
            if (gcdLength % i == 0) {
                String candidate = description1.substring(0, i);
                if (isValidDivisor(description1, candidate) && isValidDivisor(description2, candidate)) {
                    commonDivisors++;
                }
            }
        }
        return commonDivisors;
    }

    public static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }

    public static boolean isValidDivisor(String description, String candidate) {
        int len = description.length();
        int candLen = candidate.length();
        if (len % candLen != 0) return false;
       
        StringBuilder repeated = new StringBuilder();
        for (int i = 0; i < len / candLen; i++) {
            repeated.append(candidate);
        }
        return repeated.toString().equals(description);
    }

Hashtag divisor count ✅

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
#include <cctype>

using namespace std;
string sanitize(string s) {
    string result;
    for (char c : s) {
        if (isalnum(c)) {  
            result += tolower(c);  
        }
    }
    return result;
}

vector<string> generate_usernames(vector<string> names) {
    unordered_map<string, int> username_count;  
    vector<string> usernames;
    
    for (string full_name : names) {
        vector<string> words;
        string word;
        for (char c : full_name) {
            if (c == ' ') {
                if (!word.empty()) words.push_back(word);
                word = "";
            } else {
                word += c;
            }
        }
        if (!word.empty()) words.push_back(word);
                string given_name = sanitize(words[0]);
        string family_name = sanitize(words.back());
                string username = family_name.substr(0, min(7, (int)family_name.length()));
        int remaining_len = 8 - username.length();
        
        if (remaining_len > 0) {
            username += given_name.substr(0, min(remaining_len, (int)given_name.length()));
        }
                string final_username = username;
        int counter = 1;
        
        while (username_count.find(final_username) != username_count.end()) {
            if (final_username.length() < 8) {
                final_username = username + to_string(counter);
            } else {
                final_username = username.substr(0, 7) + to_string(counter);
            }
            counter++;
        }
                username_count[final_username]++;
        usernames.push_back(final_username);
    }
    
    return usernames;
}

Company Username ✅
Squarepoint

public static int solution(int[] objects, int radius) {
        int n = objects.length;
        int maxIlluminated = 0;
        int bestPosition = Integer.MAX_VALUE;
        int left = 0;

        for (int right = 0; right < n; right++) {
            while (objects[right] - objects[left] > 2 * radius) {
                left++;
            }

            int count = right - left + 1;

            int candidatePosition = objects[right] - radius;
            candidatePosition = Math.max(candidatePosition, objects[left]);

            if (count > maxIlluminated) {
                maxIlluminated = count;
                bestPosition = candidatePosition;
            } else if (count == maxIlluminated) {
                bestPosition = Math.min(bestPosition, candidatePosition);
            }
        }

        return bestPosition;
    }

Coinbase (FTE) ✅

Software Engineer || Capgemini Exceller 2024-25
Capgemini · PAN India

https://app.joinsuperset.com/join/#/signup/student/jobprofiles/f5ddcff9-5635-47a8-bdff-2e11cb8e4bdd