allcoding1
27.7K subscribers
2.2K photos
2 videos
77 files
853 links
Download Telegram
MACHINE LEARNING WITH COMPLETE PYTHON (BASIC TO ADVANCED)

This course is designed for anyone who is interested in AWS cloud based machine learning and data science

Download Link :- https://mega.nz/folder/1Ip3xSgT#QBATxJcbIqYFtg6muJKArw
👍4
Capgemini is Hiring Contact Support Group

Location - Noida

Experience - Freshers

Salary - 3.25 lpa

Apply link - https://app.joinsuperset.com/join/#/signup/student/jobprofiles/91b17d89-df0e-4608-a02f-1021314224c5


📢Not:- Application Deadline : 10 March 2024 11:59 PM
👍1
🎯WIPRO Recruitment For Freshers

Qualification:- Any Graduate

Experience:- freshers Training + Job

Salary : 30,000

Apply Now:- www.allcoding1.com

Telegram:- @allcoding1
👍4
Black-Hat Hacking All Courses
▪️ Android Hacking Course
▪️ PC Hacking Course
▪️ Advance Carding Course
▪️ Account Cracking Course
▪️ Networking and Scanning
▪️ ATM Hacking Course
▪️ Advance Spamming Course
link - https://mega.nz/folder/E1c0kRyL#d4L37n8wZM3QQW7VpCT2ZQ
👍3
🎯 Accenture hiring

Qualification:- Any Graduate


Apply Now:- www.allcoding1.com

Telegram:- @allcoding1
👍2
🎯Awiros is hiring
Role : SDE ( Full Stack )

Apply:- www.allcoding1.com

Telegram:- @allcoding1
Tutorials + Books + Courses + Trainings + Workshops + Educational Resources

🔹Data science
🔹Python
🔹Artificial Intelligence
🔹AWS Certified
🔹Cloud
🔹BIG DATA
🔹Data Analytics
🔹BI
🔹Google Cloud Platform
🔹IT Training
🔹MBA
🔹Machine Learning
🔹Deep Learning
🔹Ethical Hacking
🔹SPSS
🔹Statistics
🔹Data Base
🔹Learning language resources ( English , French🇨🇵 , )


100 rupees

buy:- @meterials_available
👍6
🎯Awiros is hiring
Role : SDE ( Full Stack )

Apply:- www.allcoding1.com

Telegram:- @allcoding1
🎯 Micron Technology is hiring

Role : Associate Software Engineer
Batch : 2024, 2023, 2022 passouts
CTC : 6 - 10 LPA

Apply now:- www.allcoding1.com

Telegram:- @allcoding1
👍1
IBM exam

Telegram:- @allcoding1
Hacker Coin
IBM

Telegram:- @allcoding1
#include <bits/stdc++.h>
using namespace std;

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

vector<int> gcdArrays(vector<int>& arr) {
    int n = arr.size();
    int max_gcd = 0;
    int max_length = 0;

    for (int i = 0; i < n - 1; ++i) {
        int current_gcd = arr[i];
        for (int j = i + 1; j < n; ++j) {
            current_gcd = gcd(current_gcd, arr[j]);
            if (current_gcd > max_gcd) {
                max_gcd = current_gcd;
                max_length = j - i + 1;
            } else if (current_gcd == max_gcd && (j - i + 1) > max_length) {
                max_length = j - i + 1;
            }
        }
    }

    return {max_gcd, max_length};
}

DE Shaw

Telegram:- @allcoding1
👍6👎3
def max_benefit(n,A, K):
    n = len(A)
    dp = [0] * (n + 1)
    prefix_sum = [0] * (n + 1)
   
    for i in range(1, n + 1):
        prefix_sum[i] = prefix_sum[i - 1] + A[i - 1]
   
    for i in range(1, n + 1):
        min_val = float('inf')
        max_val = float('-inf')
       
        for j in range(1, K + 1):
            if i - j >= 0:
                min_val = min(min_val, prefix_sum[i] - prefix_sum[i - j])
                max_val = max(max_val, prefix_sum[i] - prefix_sum[i - j])
                dp[i] = max(dp[i], dp[i - j] + max(max_val, -min_val))
   
    return dp[n] % MOD

Alternate Segment
Infosys

Telegram:- @allcoding1
👍4
Cinema code
infosys

Telegram:- @allcoding1
Beautiful set of nodes
Infosys

Telegram:- @allcoding1