๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.57K subscribers
5.58K photos
3 videos
95 files
9.99K 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
๐Ÿš€ Future First is Hiring for Financial Market Intern! ๐Ÿš€

๐Ÿ“ Position: Financial Market Intern
๐ŸŽ“ Eligibility: Graduating in 2025 or already graduated
๐Ÿ“š Preferred Background: Commerce, Finance, Economics, Mathematics, Statistics, or Engineering
๐Ÿง‘โ€๐Ÿ’ป Experience: No prior work experience required

๐Ÿ”‘ Skill Set:

Strong mathematical and analytical skills

Quick thinking under pressure

Competitive and driven mindset


๐Ÿ‘‰ Apply here:
https://futuresfirst.com/financial-market-intern-4/

๐Ÿ”— Join our community for more job updates on Telegram!
https://t.me/addlist/wcoDjKedDTBhNzFl
Immediate Hiring for "B.Tech/BE
(CSE), MCA - passed out the year - 2023 & 2024 @ Chidhagni Group , Hyderabad, TG, India"

Role: Intern to FTE (Full Time Employee)
Work mode: WFO
Job openings for the below positions:
Java full-stack developer
ReactJs Frontend developer
Python full-Stack developer
Android developer

Requirements:
Min 70% in all Academics.
No Gaps in Academics.

If interested, Kindly Fill and submit the google form details in the below link:

https://lnkd.in/dVyyiYSy


Send your updated resume to the respective technology email id given below:
android-fresher-openings@chidhagni.com
python-fresher-openings@chidhagni.com
java-fresher-openings@chidhagni.com
reactjs-fresher-openings@chidhagni.com
public static long getTriangleArea(List<Integer> x, List<Integer> y)
{
    double tempArea = 0.5 * (x.get(0) * (y.get(1) - y.get(2)) +
    x.get(1) * (y.get(2) - y.get(0)) +x.get(2) * (y.get(0) - y.get(1)));
    return Math.abs((long) tempArea);
}

Amdocs โœ…
๐Ÿ”นGet Placement Ready in 3 Months! ๐Ÿ”น

Month 1: Aptitude

Focus on Quantitative Aptitude, Logical Reasoning, and Verbal Ability
Daily practice sessions and mock tests
Months 1 & 2: Course Fundamentals

Master OOPS, DBMS, OS, CN, Java, and C++
Structured study plans with key resources
Months 1, 2, & 3: Coding

Data Structures and Algorithms (DSA)
Consistent practice on platforms like Hackerrank, Codechef, and Leetcode
Projects, Skills, and Internships

Build Full-stack or ML projects
Gain internship experience and prep for interviews
Month 3: Mock Interviews

Practice mock interviews with Pramp and peers
๐Ÿ”— Join our community for more placement tips and job updates on Telegram!
https://t.me/addlist/XPgRhDouPTM3YWY1
๐Ÿ“Œ Precisely is hiring for Associate Software Engineer (Remote)
๐Ÿง‘โ€๐Ÿ’ป Experience: 0 - 2 years
๐Ÿ’ฐ Expected Salary: 9-16 LPA
๐Ÿ‘‰ Apply here: https://www.linkedin.com/jobs/view/4030998498/?alternateChannel=search

๐Ÿ“Œ Red Hat is hiring for Software Engineer (Remote)
๐Ÿง‘โ€๐Ÿ’ป Experience: 1+ years
๐Ÿ’ฐ Expected Salary: 10-20 LPA
๐Ÿ‘‰ Apply here: https://redhat.wd5.myworkdayjobs.com/jobs/job/Bangalore---Carina/Software-Engineer_R-039242-1?%2526iisn=LinkedIn%252BPosting&source=LinkedIn&%2526%253Fmode=job&%2526iis=Job%252BBoard

๐Ÿ“Œ Swiss Re is hiring for DevSecOps Engineer
๐Ÿง‘โ€๐Ÿ’ป Experience: 0 - 3 years
๐Ÿ’ฐ Expected Salary: 10-15 LPA
๐Ÿ‘‰ Apply here: https://careers.swissre.com/job/Hyderabad-DevSecOps-Engineer-TG/1113644801/

๐Ÿ“Œ Bain & Company is hiring for Associate, Data Engineer
๐Ÿง‘โ€๐Ÿ’ป Experience: 1 - 3 years
๐Ÿ’ฐ Expected Salary: 12-20 LPA
๐Ÿ‘‰ Apply here: https://careers.bain.com/jobs/FolderDetail?folderId=87326&source=Linked-In

๐Ÿ”— Join our community for more job updates on Telegram!
https://t.me/addlist/XPgRhDouPTM3YWY1

All the best ๐Ÿ‘๐Ÿ‘
๐Ÿš€ Goldman Sachs is Hiring for Software Engineering - Associate! ๐Ÿš€

๐Ÿ“ Location: Bengaluru, India
๐ŸŽ“ Qualifications: Bachelorโ€™s / Masterโ€™s Degree
๐Ÿ’ฐ Salary: 8 - 21 LPA (Expected)
๐Ÿง‘โ€๐Ÿ’ป Experience: Freshers / Experienced

๐Ÿ“Œ Apply Now:
https://hdpc.fa.us2.oraclecloud.com/hcmUI/CandidateExperience/en/sites/LateralHiring/job/136278?

๐Ÿ”— Join our community for more job updates on Telegram!
https://t.me/addlist/XPgRhDouPTM3YWY1

All the best ๐Ÿ‘๐Ÿ‘
๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
Photo
import java.util.*;
public class Main {
    static int MOD = 1000000007;
    public static void countErrors(String s, int[] type1, int[] type2) {
        int n = s.length();
        int[] p = new int[n + 1];
        int[] p1 = new int[n + 1];
        for (int i = n - 1; i >= 0; i--) {
            if (s.charAt(i) == '0') {
                p[i] = p[i + 1] + 1;
                p1[i] = p1[i + 1];
            } else {
                p[i] = p[i + 1];
                p1[i] = p1[i + 1] + 1;
            }
        }
        for (int i = 0; i < n; i++) {
            if (s.charAt(i) == '0') {
                type1[0] += p1[i + 1];
            } else {
                type2[0] += p[i + 1];
            }
        }
    }
    public static int getMinErrors(String errorString, int x, int y) {
        StringBuilder s1 = new StringBuilder(errorString);
        StringBuilder s2 = new StringBuilder(errorString);
        for (int i = 0; i < errorString.length(); i++) {
            if (errorString.charAt(i) == '!') {
                s1.setCharAt(i, '0');
                s2.setCharAt(i, '1');
            }
        }
        int[] t = new int[1];
        int[] t2 = new int[1];
        countErrors(s1.toString(), t, t2);
        int tt = (int) (((long) t[0] * x % MOD + (long) t2[0] * y % MOD) % MOD);
        t[0] = 0;
        t2[0] = 0;
        countErrors(s2.toString(), t, t2);
        tt = Math.min(tt, (int) (((long) t[0] * x % MOD + (long) t2[0] * y % MOD) % MOD));

        return tt;
    }


Amazon โœ…
def sortPermutation(p, moves):
    n = len(p)
    visited = [False] * n
    count = 0
    for i in range(n):
      if not visited[i]:
        cycle_length = 0
        x = i
        while not visited[x]:
          visited[x] = True
          x = p[x] - 1
          cycle_length += 1
        if cycle_length > 1:
          count += (cycle_length - 1)
    res = [0] * len(moves)
    for idx, move in enumerate(moves):
      if move >= count and (move - count) % 2 == 0:
        res[idx] = 1
    rs = "".join(str(x) for x in res)
    return rs


Amazon โœ…
๐Ÿ‘2
#include <iostream>
#include <vector>
#include <climits>
using namespace std;
int minMagicPoints(int H, int N, vector<int>& D, vector<int>& M) {
    vector<int> dp(H + 1, INT_MAX);
    dp[0] = 0;
    for (int h = 1; h <= H; ++h) {
        for (int i = 0; i < N; ++i) {
            int dmg = D[i];
            int cost = M[i];
            if (h - dmg >= 0) {
                dp[h] = min(dp[h], dp[h - dmg] + cost);
            } else {
                dp[h] = min(dp[h], cost);
            }
        }
    }
    return dp[H];
}

Commvaultโœ…
๐Ÿ‘3
string getLargestString(string s, int k) {
    unordered_map<char, int> charMap;

    for (char ch : s) {
        charMap[ch]++;
    }

    vector<pair<char, int>> cc(charMap.begin(), charMap.end());
    sort(cc.begin(), cc.end(), greater<>());

    string result;
    int n = cc.size();

    for (int i = 0; i < n;) {
        int count = 0;

        while (i < n && cc[i].second > 0 && count < k) {
            result += cc[i].first;
            cc[i].second--;
            count++;
        }

        if (count == k) {
            int j = i + 1;
            while (j < n && c[j].second <= 0) {
                j++;
            }
            if (j < n) {
                result += cc[j].first;
                cc[j].second--;
            }
        }

        if (cc[i].second == 0) {
            i++;
        }
    }

    return result;
}


IBMโœ