๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
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
๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
#include <iostream> #include <vector> #include <algorithm> using namespace std; void dfs(int node, int parent, const vector<vector<int>>& adj, const vector<bool>& hasFruit, vector<bool>& visited, int& time) {     visited[node] = true;     for (int neighborโ€ฆ
import java.util.*;

public class Solution{
   
    static class TreeNode {
        int id;
        boolean hasFruit;
        List<TreeNode> children;

        TreeNode(int id, boolean hasFruit) {
            this.id = id;
            this.hasFruit = hasFruit;
            this.children = new ArrayList<>();
        }
    }
   
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
       
        int n = scanner.nextInt();
        int m = scanner.nextInt();
        int columns = scanner.nextInt();  used.
       
        TreeNode[] nodes = new TreeNode[n];
        for (int i = 0; i < n; i++) {
            nodes[i] = new TreeNode(i, false);
        }
       
        for (int i = 0; i < m; i++) {
            int u = scanner.nextInt();
            int v = scanner.nextInt();
            nodes[u].children.add(nodes[v]);
            nodes[v].children.add(nodes[u]);
        }
       
        int treeCount = scanner.nextInt();
        boolean[] hasFruit = new boolean[treeCount];
        for (int i = 0; i < treeCount; i++) {
            hasFruit[i] = scanner.nextInt() == 1;
        }
       
        for (int i = 0; i < treeCount; i++) {
            nodes[i].hasFruit = hasFruit[i];
        }
       
        boolean[] visited = new boolean[n];
        Result result = new Result();
        dfs(nodes[0], visited, result);
       
        System.out.println(result.time);
    }
   
    static class Result {
        int time = 0;
    }
   
    private static boolean dfs(TreeNode node, boolean[] visited, Result result) {
        visited[node.id] = true;
        boolean foundFruit = node.hasFruit;
       
        for (TreeNode child : node.children) {
            if (!visited[child.id]) {
                if (dfs(child, visited, result)) {
                    result.time += 2;  back
                    foundFruit = true;
                }
            }
        }
       
        return foundFruit;
    }
}

Magical Forest โœ…
Exciting Internship Opportunity: Frontend SDE Intern

Role: Frontend SDE Intern
Company: Blendnet.ai
Stipend: โ‚น25,000 per month
Perks: Pre-Placement Offer (PPO)
Responsibilities: Develop user-facing features, engage in responsive design, collaborate with UX/UI designers, optimize application performance, and maintain documentation.

Apply Now ๐Ÿ”—: https://www.foundit.in/zuno/app/job/frontend-sde-intern/description?utm_source=campus-ambassador&utm_medium=di_summer_blendnet_1&utm_campaign=ZW4204

Exciting Internship Opportunity: Frontend SDE Intern

Role: Frontend SDE Intern
Company: Blendnet.ai
Stipend: โ‚น25,000 per month
Perks: Pre-Placement Offer (PPO)
Responsibilities: Develop user-facing features, engage in responsive design, collaborate with UX/UI designers, optimize application performance, and maintain documentation.

Apply Now ๐Ÿ”—: https://www.foundit.in/zuno/app/job/frontend-sde-intern/description?utm_source=campus-ambassador&utm_medium=di_summer_blendnet_1&utm_campaign=ZW4204
def minutes_until_overlap(current_time):
    hours, minutes = map(int, current_time.split(':'))
    total_minutes = hours * 60 + minutes
    minutes_until_overlap = (60 - total_minutes) % 60
    return minutes_until_overlap

IBMโœ