๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.56K photos
3 videos
95 files
9.69K 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
Stecktra Technologies Pvt. Ltd. is currently #hiring the #freshers for the position of Microsoft SOC Analyst (L1 level). Know anyone who might be interested?

Qualification: B.Tech/BE (strictly) (2025 pass outs are not eligible for this opportunity )

Interested candidates are kindly requested to share their updated resumes at nisha.das@stecktra.com

Desired Certifications: CEH, AZ-900

This entry-level position is open to freshers who possess a strong understanding of Azure cloud services and passion for cybersecurity.

Looking forward to your applications!
Scalex is looking for a motivated Java Developer (Fresher). Proficiency in Java programming language and Spring Boot framework. Solid understanding of SQL and relational database concepts. Experience working with MongoDB or other NoSQL databases. rupalig@scalextechnologies.com
class UserMainCode(object):
    @classmethod
    def theLastChocolate(cls, input1, input2):
        dp = [[0] * (input1 + 1) for _ in range(input1 + 1)]
        dp[1][1] = 1
       
        for i in range(2, input1 + 1):
            for j in range(1, i + 1):
                dp[i][j] += dp[i - 1][j - 1] if j - 1 >= 1 else 0
                dp[i][j] += dp[i - 1][j] if j <= i - 1 else 0
       
        return dp[input1][input2]. 

//   Amazon ml  THE LAST Chocolate
int gcd(int a, int b) {
    while (b != 0) {
        int t = b;
        b = a % b;
        a = t;
    }
    return a;
}

int calculatesun(int input1, int input2[]) {
    // Read only region end
    int N = input1;
    int max_so_far = input2[0];
   
    for (int i = 0; i < N; ++i) {
        max_so_far = std::max(max_so_far, input2[i]);
        input2[i] = gcd(input2[i], max_so_far);
    }
   
    std::sort(input2, input2 + N);
   
    int sum = 0;
    for (int i = 0; i < N / 2; ++i) {
        sum += gcd(input2[i], input2[N - 1 - i]);
    }
   
    return sum;
}

Sum in Array โœ…
Amazon ML
Random forest Reg

0.0923

K Nearest Neighbours algorithm. By identifying the similarity in physical features of each herb, it can be classified as a given species.

0.0032, computer = "yes"

K-Means Clustering

import pandas as pd

file = pd.read_csv('salary.csv')

q = [0,.25,.50,.75,1]

label = ['0 to 25', '25 to 50', '50 to 75', '75 to 1']

file['Age_q'] = pd.qcut(file['Age'], q = q, labels = label)

Factor of 4

c1 = (data['Grade'] == 'A') & (data['Marks'] > 60)
c2 = (data['Grade'] == 'B') & (data['Marks'] > 70)
c3 = (data['Grade'] == 'C') & (data['Marks'] > 80)

c = pd.Series(np.select([c1,c2,c3], ['Yes','Yes','Yes'], default='No'), index=data.index)
data['Admission'] = data['Admission'].fillna(c)\

From options (0.371,0.971,0.241.0) => correct => 0 โœ“

Question=> (Indian,student, male) => answer 1.5 โœ“

Linear regression question =>high bais, low variance,underfitting of data

Amazon ML MCQ โœ…
def min_key_presses(input1):
    S=input1
    n = len(S)
    i = 0
    key_presses = 0
   
    while i < n:
        if S[i] == '0':
            zero_count = 0
            while i < n and S[i] == '0':
                zero_count += 1
                i += 1
            key_presses += zero_count // 2
            if zero_count % 2 == 1:
                key_presses += 1
        else:
            while i < n and S[i] != '0':
                key_presses += 1
                i += 1
               
    return key_presses

Amazon MLโœ