Harbor Signal Expansion Test

Published atDate not available

Array Easy 0 views

Like0

Think of a small harbor challenge where order and timing really matter. In Harbor Signal Expansion Test, you are trying to work toward the right number by following one clear idea.

Here, you are mostly deciding whether a rule stays true while you look through the input. Sometimes that means checking if things are connected, balanced, or allowed. Sometimes it means noticing the first place where the rule breaks. The answer depends on being careful from beginning to end.

For example, if the input is n = 5, links = [[0,1],[1,2],[2,3],[3,4]], start = 3, maintenance = [], the answer is 5. All towers are online, so the signal covers every lighthouse. Another example is n = 6, links = [[0,1],[1,2],[2,3],[3,4],[4,5]], start = 0, maintenance = [3], which gives 4. Towers 0, 1, 2, and 5 remain online; cable through tower 3 prevents reaching tower 4.

This is a friendly practice problem, but it still rewards careful reading. The key is noticing the exact moment when the rule stays true or breaks.

Example Input & Output

Example 1

Input

n = 5, links = [[0,1],[1,2],[2,3],[3,4]], start = 3, maintenance = []

Output

Explanation

All towers are online, so the signal covers every lighthouse.

Example 2

Input

n = 6, links = [[0,1],[1,2],[2,3],[3,4],[4,5]], start = 0, maintenance = [3]

Output

Explanation

Towers 0, 1, 2, and 5 remain online; cable through tower 3 prevents reaching tower 4.

Example 3

Input

n = 4, links = [[0,1],[1,2]], start = 2, maintenance = [0,1]

Output

Explanation

Maintenance disables the only connecting cables, so the broadcast stays at the starting lighthouse.

Algorithm Flow

Recommendation Algorithm Flow for Harbor Signal Expansion Test

Best Answers
These are the verified best solutions for this Challenge. You can use them as a reference to improve your solution.

java

import java.util.*;
class Solution {
    public boolean has_segment_sum(int[] signals, int k) {
        Set<Integer> seen = new HashSet<>();
        seen.add(0);
        int current = 0;
        for (int x : signals) {
            current += x;
            if (seen.contains(current - k)) return true;
            seen.add(current);
        }
        return false;
    }
}

javascript

function has_segment_sum(signals, k) {
    const seen = new Set([0]);
    let current = 0;
    for (let x of signals) {
        current += x;
        if (seen.has(current - k)) return true;
        seen.add(current);
    }
    return false;
}

php

function has_segment_sum($signals, $k) {
    $seen = [0 => true];
    $current = 0;
    foreach ($signals as $x) {
        $current += $x;
        if (isset($seen[$current - $k])) return true;
        $seen[$current] = true;
    }
    return false;
}

python

def has_segment_sum(signals, k):
    seen = {0}
    current = 0
    for x in signals:
        current += x
        if current - k in seen:
            return True
        seen.add(current)
    return False

rust

use std::collections::HashSet;
pub fn has_segment_sum(signals: Vec<i32>, k: i32) -> bool {
    let mut seen = HashSet::new();
    seen.insert(0);
    let mut current = 0;
    for x in signals {
        current += x;
        if seen.contains(&(current - k)) { return true; }
        seen.insert(current);
    }
    false
}

typescript

function has_segment_sum(signals: number[], k: number): boolean {
    const seen = new Set([0]);
    let current = 0;
    for (let x of signals) {
        current += x;
        if (seen.has(current - k)) return true;
        seen.add(current);
    }
    return false;
}

Related Array Challenges

Comments (0)

Join the Discussion

Share your thoughts, ask questions, or help others with this Challenge.

Harbor Signal Expansion Test

Example Input & Output

Algorithm Flow

Best AnswersThese are the verified best solutions for this Challenge. You can use them as a reference to improve your solution.

Solutions Coming Soon

Related Array Challenges

Interstate Rescue Network Audit

Disaster Relief Route Tracker

Metro Transfer Capacity Map

Riverside Power Grid Check

Campus Shuttle Loop Coverage

Harbor Ferry Route Planner

Comments (0)

Join the Discussion

Best Answers
These are the verified best solutions for this Challenge. You can use them as a reference to improve your solution.