NimbusPost is hiring Freshers!!

We are looking for passionate people with strategic mindset and business acumen for Management Trainee Role.

ROLE: Management Trainee (Business Strategy & Analysis)
LOCATION: Gurgaon (Work from Office)
EDUCATIONAL QUALIFICATION: MBA or equivalent degree (Specialisation in Business Strategy, General Management , Marketing & Strategy are preferred)

Interested students can share their CVs at manvi.g@nimbuspost.com .

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

ll solve(ll N, ll K, vector<ll>& A, vector<ll>& B ) {
    vector<ll> dp(K + 1, 0);
    for (ll i = 0; i < N; ++i) {
        for (ll j = K; j >= A[i]; --j) {
            dp[j] = max(dp[j], B[i] + dp[j - A[i]]);
        }
    }
    return dp[K];
}

int main() {
    ll N, K;
    cin >> N >> K;
    vector<ll> A(N), B(N);
    for (ll i = 0; i < N; ++i) {
        cin >> A[i];
    }
    for (ll i = 0; i < N; ++i) {
        cin >> B[i];
    }
    cout << solve(N, K, A, B ) << endl;
    return 0;
}

#include <iostream>
#include <vector>
#include <climits>

using namespace std;

class Solution {
public:
    //total water is trapped into the bars
    int trap(vector<int>& h) {
        int l = 0, r = h.size() - 1, lmax = INT_MIN, rmax = INT_MIN, ans = 0;
        while (l < r) {
            lmax = max(lmax, h[l]);
            rmax = max(rmax, h[r]);
            ans += (lmax < rmax) ? lmax - h[l++] : rmax - h[r--];
        }
        return ans;
    }
};

int main() {
    Solution solution;
   
    int N;
   
    cin >> N;

    vector<int> heights(N);
    cout << N;
    for (int i = 0; i < N; ++i) {
        cin >> heights[i];
    }

    int trappedWater = solution.trap(heights);
    cout  << trappedWater << endl;

    return 0;
}

Trapping Rain water ✅

Company Name: Über

Role: SDE 1

Experience Required: 0+ years

Apply: https://www.uber.com/global/en/careers/list/128898/

Company Name: Qualcomm

Role: Software Engineering Intern

Batch eligible: 2024 and 2025 passouts

Apply: https://careers.qualcomm.com/careers/job/446693743471-interim-engineering-intern-sw-hyderabad-telangana-india?domain=qualcomm.com

#include <stdio.h>
#include <string.h>

void main() {
    char str1[20], str2[30];

    printf("Enter string: ");
    scanf("%s", str2);

    strcpy(str1, str2);

    printf("The copied string: %s\n", str1);
}

Pipixel is seeking an HR Recruiter to join our dynamic team.
kindly share your CV at naina@pipixel.io
#HR_Recruiter
#Experience : fresher - 0.6 month
#Location : Mohali (WFO)

int solution(const string &s) {
    const int n = s.length();
    int r = 0;
    for (int i = n - 1, j = 0; i >= 0 && j < n; ++j) {
        if (s[i] == s[j]) {
            --i;
            ++r;
        }
    }
    return n - r;
}

Amazon ✅

Entry level position ( #Fresher )

Company: Cognizant

Requirement: Must have Bachelor's degree, strong communication and interpersonal skills.

#Interested candidates can send their resume to varsha.jha5@cognizant.com

Note: Please include "Entry-level position Application" in the subject line.

Company Name: Groww
Role: SDE Intern (Frontend)
Batch eligible: 2024 and 2025 passouts

Apply: https://docs.google.com/forms/d/e/1FAIpQLSc-fRZNWgZbMyAZfCPMDYpDOX9vWwnYhM7X4lFJUUa1IQmYjg/viewform

P.S: Do share among all your frnds:)

CelebAI Technologies are hiring for Associate Software Engineer Position(Trainee+ FTE).

Walk in drive in the office for 2023, 2024 batch.
Please share your CV at careers@celeb-ai.com.

Eligibility: Only Delhi NCR students or who can come to Delhi and haven't attended drive from last 6 months should apply.
[Please increase the reach for visibility]

#include<stdio.h>
#include<stdlib.h>

#define MOD 1000000007

int compare(const void *a, const void *b) {
    return (*(int*)a - *(int*)b);
}

int main() {
    int N;
    scanf("%d", &N);

    if (N <= 1) {
        printf("NO HOURS\n");
        return 0;
    }

    int *A = (int*)malloc(N * sizeof(int));

    for (int i = 0; i < N; i++) {
        scanf("%d", &A[i]);
    }

    qsort(A, N, sizeof(int), compare);

    int count = 0;

    for (int i = 0; i < N - 1; i++) {
        for (int j = i + 1; j < N; j++) {
            if ((A[i] + A[j]) % 60 == 0) {
                count = (count + 1) % MOD;
            }
        }
    }

    if (count > 0) {
        printf("%d\n", count);
    } else {
        printf("NO HOURS\n");
    }

    free(A);

    return 0;
}

Hours Count ✅
NPCI