#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 : adj[node]) {
        if (neighbor == parent || visited[neighbor]) continue;
        dfs(neighbor, node, adj, hasFruit, visited, time);
        if (hasFruit[neighbor]) {
            time += 2;
        }
    }
}
int minTime(int n, vector<vector<int>>& edges, vector<bool>& hasFruit) {
    vector<vector<int>> adj(n);
    for (const auto& edge : edges) {
        adj[edge[0]].push_back(edge[1]);
        adj[edge[1]].push_back(edge[0]);
    }

    int time = 0;
    vector<bool> visited(n, false);
    dfs(0, -1, adj, hasFruit, visited, time);
    return time;
}

Magical Forest ✅

def min_window(s: str, t: str) -> str:
    from collections import Counter

   
    target_count = Counter(t)
    required_count = len(target_count)
    formed = 0
    window_counts = {}
   
   
    min_window_length = float('inf')
    min_window_start = 0
    left, right = 0, 0

  
    while right < len(s):
       
        char = s[right]
        window_counts[char] = window_counts.get(char, 0) + 1
       
     
        if char in target_count and window_counts[char] == target_count[char]:
            formed += 1
       
       
        while left <= right and formed == required_count:
          
            if right - left + 1 < min_window_length:
                min_window_length = right - left + 1
                min_window_start = left
           
         
            char = s[left]
            window_counts[char] -= 1
            if char in target_count and window_counts[char] < target_count[char]:
                formed -= 1
           
           
            left += 1
       
       
        right += 1
   
   
    return s[min_window_start:min_window_start + min_window_length] if min_window_length != float('inf') else "N/A"

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 ✅

Company Name : Tata Steel
Batch : 2026 passouts females
Branches : CS, IT , ECE and core branches aswell.

Scholarship worth 2,00,000 INR + Internship and PPO at Tata Steel.

Link : https://bit.ly/TataSteelWOM

Ripen Labs is hiring Frontend Devs (Full Time and Part Time)

https://www.linkedin.com/posts/ritvik-varghese-7b636617a_hi-ripen-labs-is-hiring-part-timefull-time-activity-7204053220371951616-CbND

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

Company Name: Qualcomm

🛄 Job Title: Associate Engineer
✍🏻 YOE: 0-2 years

➡️ Apply: https://careers.qualcomm.com/careers/job/446699291289

Please do share in your college grps and in case you are applying please react on this post:) 😇❤️

Jio Haptik is HIRING! 🚀

Position: Area Sales Associate
Graduation Years: 2023-2026
Stipend: ₹25,000/month + Placement Offer
Locations: Hyderabad / Secunderabad, Telangana, Surat, Pune, Kolkata

🔗 Apply Here: https://www.foundit.in/zuno/app/job/sales-development-representative-intern-2/description?utm_source=campus-ambassador&utm_medium=jiohaptik&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✅

EY Technology Consulting_Data Engineer Opening
Fresher – 7 LPA+
Experienced – Upto 25 LPA (Depend Upon Experience)

https://forms.office.com/pages/responsepage.aspx?id=mT-XW99360uyfaoMcLhILDvBfbGC2FlCvzlTcpEMzwlUNFhNWElaNjlGODJVVTQ5R1Q1SzFDVlJVTC4u

Securonix is hiring Associate Software Engineer

For 2023, 2022 grads

Location - Bangalore (Hybrid)

https://securonix.bamboohr.com/careers/1447?source=aWQ9NA%3D%3D