Swiggy is hiring for 6 months full time intern role (2023 and 2024 grads eligible)

Apply: https://docs.google.com/forms/d/e/1FAIpQLSf-S4Kqkz5TcmpE9vyDcVjODEoHaVNJ-EjqiPSWCebcrhG_Ew/viewform

Seagate is hiring 2023/2024 Grads


https://seagatecareers.com/job/Pune-Intern-Seagate-Research-Group/1007615300/

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int f = 0;
    int s = 1;
    int ans = 0;
    if (n == 0)
    {
        cout << 0;
    }
    if (n == 1)
    {
        cout << 1;
    }
    for (int i = 2; i <= n; i++)
    {
        ans = f + s;
        f = s;
        s = ans;
    }
    cout << ans;
}

#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n)
{
    for (int i = 2; i <= sqrt(n); i++)
        if (n % i == 0)
            return false;
    return true;
}
int main()
{
    int n, m;
    cin >> n >> m;
    int a = 0;
    int b = 0;
    while (n < m)
    {
        if (isPrime(n))
        {
            a = n;
            break;
        }
        n++;
    }
    while (n < m)
    {
        if (isPrime(m))
        {
            b = m;
            break;
        }
        m--;
    }
    cout << a + b;
    return 0;
}

public static void main(String[] args) {
        String[] arr =new String[]{"aa", "aab", "b", "bbd", "d"};
        String tar = "aabbd";
        int len = tar.length();
        int[] dp = new int[len+1];
        Arrays.fill(dp, 9999);
        dp[0] = 0;
        for(int i = 1; i <= len; i++) {
            int cal = 0;
            for(int j = 1; j <= i; j++) {
                String sub = tar.substring(j-1,i);
                boolean found = false;
                for(int k = 0; k < arr.length; k++) {
                    if(arr[k].startsWith(sub)){
                        found = true;break;
                    }
                }
                if(found)dp[i] = Math.min(dp[i], 1 + dp[j-1]);
                System.out.print(i + " " + dp[i] + "    ");
            }
            // dp[i] = cal;
        }
        System.out.println(dp[len]);
    }

equal string trilogy ✅

def solve(arr, target):
   
    ans = -1
    s = 0
   
    for i in range(len(arr)):
        s += arr[i]
        if s>=target:
            ans = i
            break
   
    return ans

Company Name: CloudSEK

Role: SDE - Backend Intern

Batch eligible: 2022 and 2023 grads

Apply: https://www.linkedin.com/jobs/view/3699008130

Company Name: LinkedIn

Role: SDE Intern

Batch eligible: 2025 grads only

Apply: https://www.linkedin.com/jobs/view/3694138424

Company Name: Router.gg

Role: SDE Intern - iOS

Batch eligible: 2024 grads only

Location: Delhi

Duration: 6-9 months.

Apply: https://www.linkedin.com/jobs/view/3702890647

P.S: Only go if your cllg allow you to do on-site internship.

Micron Hiring !!!

Role - Data Engineer

CTC - 20 lpa

Batch - 2023,22,21,20

https://careers.micron.com/careers/job/17504660

Tsaaro Hiring Solutions Engineers Interns
https://www.linkedin.com/jobs/view/3702484368

For 2023/2022 Grads

Company Name: [24]7.ai

Role: SDE 1

Batch eligible: 2022 and 2023 grads

Apply: https://www.linkedin.com/jobs/view/3702458462

Idealmet Technologies Hiring !!

Role: Data Analyst Trainee

Batch: 2022-2023 Batch

CTC: 4-5 LPA

Apply here- https://app.pyjamahr.com/careers?company=Idealmet%20Technologies&job_id=53843&company_uuid=50C816C4B4

Company Name: Procter & Gamble

Role: Software Engineer Intern

Batch eligible: 2024 grads only

Apply: https://bit.ly/3PbO8Lf

#include <iostream>
#include <vector>

class Stock {
private:
    int S;
    std::vector<int> days;

public:
    Stock(int s, int maxDay) {
        S = s;
        days.resize(maxDay + 1, 0);
    }

    void UpdateDividend(int prevD, int A, int D) {
        if (prevD != -1) {
            for (int i = prevD; i < days.size(); i++) {
                days[i] += A;  // undo previous dividend update
            }
        }
        for (int i = D; i < days.size(); i++) {
            days[i] -= A;
        }
    }

    int CalculateFuturePrice(int F) {
        return S + days[F];
    }
};

int main() {
    int S, N, Q;
    std::cin >> S >> N >> Q;

    Stock stock(S, 1000000); 
    std::vector<int> prevDays(N, -1);
    for (int i = 0; i < N; i++) {
        int A, D;
        std::cin >> A >> D;
        stock.UpdateDividend(-1, A, D);
        prevDays[i] = D;
    }

    for (int i = 0; i < Q; i++) {
        std::string operation;
        std::cin >> operation;

        if (operation == "PRICE") {
            int F;
            std::cin >> F;
            std::cout << stock.CalculateFuturePrice(F) << "\n";
        } else if (operation == "DIVIDEND_UPDATE") {
            int index, A, D;
            std::cin >> index >> A >> D;
            index--; 
            stock.UpdateDividend(prevDays[index], A, D);
            prevDays[index] = D;
        }
    }

    return 0;
}

optiver C++✅