๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.63K subscribers
5.61K photos
3 videos
95 files
10.6K 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
from collections import defaultdict, deque
def getMinRepairCost(g_nodes, g_from, g_to, g_weight, k):
    def can_reach_with_cost(max_cost):
        graph = defaultdict(list)
        for i in range(len(g_from)):
            if g_weight[i] <= max_cost:
                graph[g_from[i]].append(g_to[i])
                graph[g_to[i]].append(g_from[i])
        queue = deque([(1, 0)])
        visited = {1: 0}
       
        while queue:
            current, roads_used = queue.popleft()
            if current == g_nodes:
                return True
            if roads_used < k:
                for neighbor in graph[current]:
                    if neighbor not in visited or visited[neighbor] > roads_used + 1:
                        visited[neighbor] = roads_used + 1
                        queue.append((neighbor, roads_used + 1))
       
        return False
   
    left, right = min(g_weight), max(g_weight)
    result = -1
   
    while left <= right:
        mid = (left + right) // 2
        if can_reach_with_cost(mid):
            result = mid
            right = mid - 1
        else:
            left = mid + 1
   
    return result

Repairing Rods
Gameskraft โœ…
Company โ€“ Digantara
Role โ€“ Junior Data Scientist
Exp. โ€“ Fresher

Responsibilities โ€“
โ€ข Develop and implement statistics-based algorithms to enhance the accuracy and quality of space data
โ€ข Build and deploy machine learning models to classify space-based events and categorize them accordingly
โ€ข Create regression models to predict the trajectories and behaviours of space objects, considering various dynamic factors
โ€ข Develop robust evaluation frameworks to assess the performance of classification and regression models, continuously iterating on algorithms for enhanced accuracy and efficiency
โ€ข Collaborate with interdisciplinary teams to integrate machine learning solutions into our Space-MAPโ„ข๏ธ platform, ensuring seamless compatibility with existing systems

Skills โ€“
โ€ข Proficiency in basic descriptive statistics, hypothesis testing, feature transformation, dimensionality reduction, supervised or unsupervised learning, model tuning, and validation.
โ€ข Hands-on experience in developing machine learning models for classification and regression in a professional setting.
โ€ข Knowledge of data structures and various machine learning techniques. Familiarity with deep learning networks and other numerical algorithms.
Preferred :-
โ€ข Hands-on experience with Python packages for data analysis.
โ€ข Proficiency in programming languages such as Python, with experience in relevant libraries and frameworks.
โ€ข Experience with parallel programming and version control.

Apply Here โ€“ https://www.linkedin.com/jobs/view/3930503997
Hiring for Trained Freshers | No of Openings: 20  | CTC: 3.00 LPA
Send resumes to hr@lyrostech.com
Location: Hyderabad - WFO
Role: Software Engineer
Role: Permanent
YOP: 2022 to 2024 only
Mandatory to have Excellent Communication Skills
Strictly not Work from Home
What we're looking for:

- Trained fresher with a solid understanding of Apigee, GCP, or DevOps concepts.
- Enthusiastic individuals with a thirst for knowledge and a drive to excel.
- Strong communication and teamwork skills.
#include <bits/stdc++.h>
using namespace std;

vector<int> solve(int N, int M, vector<int> time) {
    vector<int> ans(M, 0);
    vector<vector<int>> v(N);
   
    for(int i = 0; i < M; ++i) {
        v[i % N].push_back(i);
    }

    int departure = 0;

    for(int i = 0; i < N; ++i) {
        if(!v[i].empty()) {
            ans[v[i][0]] = time[v[i][0]] + 1;
            departure = ans[v[i][0]];
        }
        for(int j = 1; j < v[i].size(); ++j) {
            int idx = v[i][j];
            int val1 = time[idx];
            if(departure > val1) {
                ans[idx] = departure + 1;
                departure++;
            } else {
                departure = val1 + 1;
                ans[idx] = departure;
            }
        }
    }

    return ans;
}

Shopping and Billing โœ…
Hiring for US Banking domain for freshers 2023 , 24 yr passed out

Work location - Accenture , Chennai

wfo option . US shift

knowledge needed in accounts , finance , basic banking skills

Good comm skills needed

Share ur resume to HR

Adarsh.elango@accenture.com
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int T = scanner.nextInt();

        for (int t = 0; t < T; t++) {
            int S = scanner.nextInt();
            int N = scanner.nextInt();
            int M = scanner.nextInt();

            int result = minDaysToBuyFood(S, N, M);
            System.out.println(result);
        }

        scanner.close();
    }

    private static int minDaysToBuyFood(int S, int N, int M) {
        int low = 0;
        int high = S;

        while (low <= high) {
            int mid = (low + high) / 2;

            if (canSurvive(S, N, M, mid)) {
                high = mid - 1;
            } else {
                low = mid + 1;
            }
        }

        if (low > S) {
            return -1;
        }

        return low;
    }

    private static boolean canSurvive(int S, int N, int M, int days) {
        int food = (N - N/7) * days;
        int foodRequired = M * S;

        return food >= foodRequired;
    }
}. 

Island survival โœ