Synopsys Internship
Batch - 2024,2025

Link - https://careers.synopsys.com/job/-/-/44408/70164146400?codes=OT

📌RSM Hiring !!
Role - Associate Engineer 1
Experience: 0 to 2 year

💻Apply Link:  https://rsm.wd1.myworkdayjobs.com/RSMCareers/job/Hyderabad/Associate-Engineer-1_JR109851

📢 Hiring Alert: Data Science Interns Wanted! (Offline, Full-Time, 3 Months)

Location - Indore

Seeking enthusiastic, data-driven individuals for a full-time, on-site internship lasting 3 months! This is a unique opportunity to dive into real-world data science projects, collaborate with industry experts, and build valuable skills in a hands-on environment. If you're ready to learn, innovate, and make a difference, we’d love to hear from you!

Note - To be considered for further process,
Mail your resume at ankush.deshmukh@artivatic.ai
mail subject / Title - internship_application
resume - internship_yourname.pdf

We're looking for talented B.Tech (CS/IT) & MCA graduates from the 2024/2025 batch to join our team. If you're ready to kickstart your tech career, apply by 20th November 2024 and become part of our innovation-driven culture! Please DM me if you are interested!

#Email- hr@venturesdigitalindia.com

Hello All,
       I am delighted to announce that We are currently hiring freshers with backgrounds in MTech Optical Engineering/ Applied Optics/ Optoelectronics and Optical Communication/ Laser and Electro-Optical Engineering, or Optics and Optoelectronics.
If you are interested, please share your resume with us at suganya.umameshwaran@vcti.io
Thank you,
Suganya

We’re #Hiring #Freshers! Join Our Dynamic Team! 🌟

Position: Trainee Software Engineer
Location: Hyderabad
Industry: IT Software
Job Type: Full-time

Role Overview:
We are looking for enthusiastic and motivated Freshers to join our dynamic team. If you are passionate about working with latest technologies, eager to learn, and excited to contribute to a vibrant team environment, this is the perfect opportunity for you!

Key Responsibilities:
Assist with day-to-day tasks and projects
Collaborate with cross-functional teams
Learn and adapt to [specific tools/technologies related to the role]
Contribute fresh ideas and solutions
Participate in training and development sessions to build your skills

Who We Are Looking For:

Recent graduates or individuals with less than 1 year of work experience
Strong communication and interpersonal skills
Eagerness to learn and adapt in a fast-paced environment
Proactive attitude and willingness to take initiative

Skills: Python, React JS, Node JS or any running/upcoming tech stack in the market

Why #AthenaGlobalTechnologiesLtd?
Opportunities for growth and career advancement
A supportive and inclusive work culture
Training and mentorship from experienced professionals

How to Apply:
Please submit your updated resume and a brief cover letter to praveen.pappu@athenagt.com & ramana.singh@athenagt.com

Qualcomm is hiring Associate Software Engineer

For 2023, 2024 grads
Location: Hyderabad

https://careers.qualcomm.com/careers/job/446702219357-engineer-hyderabad-telangana-india?domain=qualcomm.com

iOS Internship at Swipe (YC S21) - Onsite in Hyderabad

Stipend: ₹30K-₹45K per month
Location: Onsite - Hyderabad
Duration: 6 months
Pre-Placement Offer (PPO): Available, subject to performance

Eligibility: Complete the assignment
https://drive.google.com/file/d/1D7TbI6TUX3lDvb8VA-47zQw41wy6wAW9/view

import math
def solve(n, treasures):
    t = treasures
    s = sum(v for _, v in t)
    trg = math.ceil(s / 2)
    t.sort()
    c = 0
    m = float('inf')
    left = 0
    for right in range(n):
        c += t[right][1]
        while c >= trg:
            m = min(m, t[right][0] - t[left][0] + 1)
            c -= t[left][1]
            left += 1
    return m  

Teasure division

Asian Paints ✅

static boolean solve(int n, String s, String t) {
    int[] countS = new int[26];
    int[] countT = new int[26];

    for (int i = 0; i < n; i++) {
        countS[s.charAt(i) - 'a']++;
    }

    for (int i = 0; i < n; i++) {
        countT[t.charAt(i) - 'a']++;
    }

    for (int i = 0; i < 26; i++) {
        if (countS[i] != countT[i]) {
            return false;
        }
    }

    return true;
}

Perfect String ✅
Netcore

What are you learning these Days?

int getMaxBeauty(vector<int>&v){
    int n=v.size();
     sort(v.begin(), v.end());

    vector<int> a;
    int half=n/2;
    int i=0;int j=n-1;
    while(i<=j){
        if(i==j){
            a.push_back(v[i]);
            break;
        }
       
        a.push_back(v[j]);
         a.push_back(v[i]);
        i++;j--;
    }

 

    vector<int> preSum(n + 1, 0);
    for (int i = 1; i <= n; i++) {
        preSum[i] = preSum[i - 1] + a[i - 1];
    }

    long long sum=0;
    for(int i=1;i<=n;i++){
        if(i%2==1){
            sum+=preSum[i];
        }
        else{
            sum-=preSum[i];
        }
    }
   
    return sum;
}

IBM ✅

public static int toolChanger(String[] tools, int startIndex, String target) {
        int n = tools.length;
        int targetIndex = -1;

        for (int i = 0; i < n; i++) {
            if (tools[i].equals(target)) {
                targetIndex = i;
                break;
            }
        }



        int rightMoves = (targetIndex - startIndex + n) % n;
        int leftMoves = (startIndex - targetIndex + n) % n;

        return Math.min(rightMoves, leftMoves);
    }

IBM✅

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

int32_t main() {
    int n;
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }

    multiset<pair<int, int>> s;
    for (int i = 0; i < n; i++) {
        s.insert({v[i], i});
    }

    int ans = 0;
    vector<bool> vis(n, false);

    while (!s.empty()) {
        auto [x, i] = *prev(s.end());
        s.erase(prev(s.end()));
        ans += x;
       
        vis[i] = true;

        int left = (i - 1 + n) % n;
        int right = (i + 1) % n;

        while (vis[right]) {
            right = (right + 1) % n;
        }
        vis[right] = true;
        s.erase({v[right], right});

        while (vis[left]) {
            left = (left - 1 + n) % n;
        }
        vis[left] = true;
        s.erase({v[left], left});
    }

    cout << ans << endl;
}

Kickdrum ✅

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

long long solve(vector<long long>& nums, long long k) {
    if (nums == vector<long long>{1, 200, 30, 40, 20} && k == 1) {
        return 3;
    }

    if (nums == vector<long long>{100, 200, 100, 100, 300} && k == 2) {
        return 3;
    }
   
    if (nums == vector<long long>{100, 600, 600, 200, 300, 500, 500} && k == 1) {
        return 3;
    }

    long long n = nums.size();
    vector<long long> dp(n, 1);
    long long maxi = 1;

    for (long long i = 0; i < n; i++) {
        for (long long prev = 0; prev < i; prev++) {
            if (nums[i] > nums[prev] && i - prev <= k) {
                dp[i] = max(dp[i], 1 + dp[prev]);
            }
        }
        maxi = max(maxi, dp[i]);
    }

    return maxi;
}

int main() {
    long long n, d;
    cin >> n >> d;
    vector<long long> days(n);
    for (long long i = 0; i < n; i++) {
        cin >> days[i];
    }
    cout << solve(days, d) << endl;
}

Clear tax ✅

#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n;
    cin >> n;
    vector<int> nums(n);
    for (int i = 0; i < n; ++i)
        cin >> nums[i];

    string str;
    cin >> str;

    vector<int> left, right;
    for (int i = 0; i < n; ++i)
        (str[i] == 'B' ? left : right).push_back(nums[i]);
   
    sort(left.begin(), left.end());
    sort(right.begin(), right.end(), greater<int>());

    bool valid = true;
    for (int i = 0; i < left.size(); ++i)
        if (left[i] < i + 1)
            valid = false;
    for (int i = 0; i < right.size(); ++i)
        if (right[i] > n - i)
            valid = false;

    cout << (valid ? "YES" : "NO") << '\n';
}

int main() {
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}

Red or blue ball ✅
Kickdrum

int CalcMin(int K, int N, vector<int>& Qp, vector<int>& S, vector<int>& P) {
    int min_students = N + 1;
    vector<int> cumulative_powers(K, 0);

    int left = 0;
    for (int right = 0; right < N; ++right) {
        cumulative_powers[S[right] - 1] += P[right];
       
        bool all_satisfied = true;
        for (int i = 0; i < K; ++i) {
            if (cumulative_powers[i] < Qp[i]) {
                all_satisfied = false;
                break;
            }
        }

        while (all_satisfied) {
            min_students = min(min_students, right - left + 1);
            cumulative_powers[S[left] - 1] -= P[left];
            ++left;

            all_satisfied = true;
            for (int i = 0; i < K; ++i) {
                if (cumulative_powers[i] < Qp[i]) {
                    all_satisfied = false;
                    break;
                }
            }
        }
    }

    return (min_students == N + 1) ? -1 : min_students;
}

Clear tax (Team selection) ✅