๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.62K subscribers
5.59K photos
3 videos
95 files
10.2K 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
Walk in Drive for freshers...! Novastrid is #hiringnow

Position: QA Trainee

Location: Madurai

Qualifications: - Any Degree / Professional Degree (From 2020 to 2023 passed out to students only)

- Basic knowledge of Manual and Automation testing in the IT Industry

- Should have strong English communication skills (Oral & Written)

- Certified candidates are preferable.

- Immediate Joiners required.

Levels of Interview: - Group Discussion - Written Test (Aptitude, English writing skill) -

Technical round - Final round with our CEO via Microsoft Teams Work Type: Direct Office Walk-in Date: 29.02.2024 (Thursday) Time: 10 AM Address: NovaStrid IT Ventures Pvt Ltd, 127A/1, Indigo Arcade Second Floor, SBI Bank Upstairs, K.Pudur, Madurai-625007. 
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 โœ…
import java.util.*;

class Main {
  public static void main (String[] args) {
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt(),i,j;
    long low[]=new long[n]; long high[]=new long[n];
    long ans=1L,mod=(long)1e9+7;
    for(i=0;i<n;i++) low[i]=sc.nextLong();
    for(i=0;i<n;i++) high[i]=sc.nextLong();
    boolean prime[]=new boolean[(int)1e6+1];
    prime[1]=true;
    for(i=2;i<=(int)1e6;i++)
    {
        if(prime[i]) continue;
        for(j=2*i;j<=(int)1e6;j+=i) prime[j]=true;
    }
    for(i=0;i<n;i++){
        long val=0;
        for(long k=low[i];k<=high[i];k++) if(!prime[(int)k]) val=val+k;
        ans=(ans*val)%mod;
    }
    System.out.println(ans);
  }
}

Infosys โœ