๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.59K subscribers
5.59K photos
3 videos
95 files
10.1K 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
Criteria - Freshers / B.E., B.Tech, MCA/2023 & 2024 passout

โ€ข Full Stack Developer (0-3 years Experienced .NET/SQL & Angular/React)

โ€ข Data Analyst / Data Engineer (0-3 years Experienced)

โ€ข Software Developer Freshers

๐ŸขAddress: Office No 501, 5th Floor, CityAvenue - By Kolte Patil Mumbai-Bangalore By Pass, near Hotel Sayaji, Wakad, Pune, Maharashtra 411057
import java.util.*;
public class LibraryExplorer {
    public static boolean[] sieveOfEratosthenes(int N) {
        boolean[] isPrime = new boolean[N + 1];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false; 
        for (int i = 2; i * i <= N; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= N; j += i) {
                    isPrime[j] = false;
                }
            }
        }
        return isPrime;
    }

    public static int maxBooksCollected(int N, int K, int[] A) {
        boolean[] primes = sieveOfEratosthenes(N);
        int totalBooks = 0;
        for (int i = 1; i <= N; i++) {
            if (primes[i]) { 
                totalBooks += Math.min(A[i - 1], K); 
            }
        }
       
        return totalBooks;
    }


Library exploration โœ…
https://jobs.standardchartered.com/job/Bangalore-2025-Intern-Tech-PSG-Tech-GBS-India/803430002/?feedId=363857&utm_source=lilimitedlistings

SCB Hiring Intern - Tech PSG

Internships available
We have the following internships available in Bangalore and Chennai:

โ€ข    UI Developer
โ€ข    Java Developer
โ€ข    SQL Developer
โ€ข    Automation tester
โ€ข    Performance Engineer
โ€ข    Data Science
โ€ข    Machine Learning
โ€ข    Cloud

Responsibilities
โ€ข    Analyse complex business problems and help arrive at technically innovative solutions.
โ€ข    Design user interactions on web pages
โ€ข    Develop back-end website applications.
โ€ข    Develop front-end website architecture.
โ€ข    Automation of test suite using Selenium 
โ€ข    Identify performance gaps in applications and tuning code to achieve desired performance goals.
โ€ข    Collaborate with globally distributed agile teams.

Preferred Skills
โ€ข    Proven problem-solving ability.
โ€ข    Strong foundational knowledge of Algorithms, Data Structures, OOP concepts and frameworks.
โ€ข    Curious learner, willing to learn and adapt to new technologies and frameworks.
โ€ข    Empowered mindset with ability to ask questions and seek clarifications.
โ€ข    Excellent communication skills that enable seamless interactions with colleagues globally
โ€ข    Strong analytical skills and impeccable attention to detail
โ€ข    Excellent verbal and written communication skills
โ€ข    Highly enthusiastic individual and considered a go-getter.
โ€ข    Strong networking and inter-personal skills

Eligibility
We welcome students from Engineering degrees and encourage students from diverse backgrounds to apply.   

Weโ€™re looking for team players with excellent academic achievements and extracurricular activities, who are agile, flexible problem solvers with strong technical abilities and open to learning the latest tech stack.
A strong foundational knowledge of Algorithms, Data Structures, OOP concepts and frameworks is preferred.

You need to be a final year student, able to intern from January 2025 to June 2025 and start full-time employment in July 2025.
๐Ÿ‘2
#include <iostream>
#define MOD 1000000007
using namespace std;
int ff(int a) {
    int s = 0;
    while (a > 0) {
        s += a % 10;
        a /= 10;
    }
    return sum;
}
int solve(int N, int X) {
    int c = 0;
    int num = 0;
        while (c < N) {
        num++; 
        if (ff(num) == X) {
            c++; 
        }
    }
        return num % MOD;
}

Brainstorming Series โœ…
#include <bits/stdc++.h> 
using namespace std;

bool dfs(char current, char start, string &path, map<char, set<char>> &adj, set<char> &used, int target) {
    if (path.size() == target) {
        if (adj[current].count(start)) {
            path.push_back(start);
            return true;
        }
        return false;
    }

    for (char next : adj[current]) {
        if (!used.count(next)) {
            used.insert(next);
            path.push_back(next);
            if (dfs(next, start, path, adj, used, target)) return true;
            path.pop_back();
            used.erase(next);
        }
    }
    return false;
}

string gemWord(int input1, string input2) {
    set<char> unique_chars(input2.begin(), input2.end());
    if (unique_chars.size() < input1) return "No";

    map<char, set<char>> adj;
    int n = input2.size();
    for (int i = 0; i < n - 1; ++i) {
        adj[input2[i]].insert(input2[i + 1]);
        adj[input2[i + 1]].insert(input2[i]);
    }

    string result;
    bool found = false;
    for (char ch : unique_chars) {
        string path = "";
        set<char> used = {ch};
        path.push_back(ch);
        if (dfs(ch, ch, path, adj, used, input1)) {
            if (!found || path < result) {
                result = path.substr(0, path.size() - 1);
                found = true;
            }
        }
    }

    return found ? result : "No";
}


gem word 9/10โœ…
import math

def destroyMonster(n, a):
    dp = [[0] * n for _ in range(n)]
   
    for length in range(2, n + 1, 2):
        for i in range(n - length + 1):
            j = i + length - 1
            if length == 2:
                dp[i][j] = math.gcd(a[i], a[j])
            else:
                dp[i][j] = float('inf')
                for k in range(i + 1, j, 2):
                    cost = math.gcd(a[i], a[k]) + dp[i+1][k-1] + dp[k+1][j]
                    dp[i][j] = min(dp[i][j], cost)
   
    return dp[0][n-1]


Destroy all monsters โœ