Emberstone Step Glow

Published atDate not available

Array Easy 0 views

Like0

This problem feels like a little puzzle you can solve one step at a time. In Emberstone Step Glow, you are trying to work toward the right number by following one clear idea.

Illuminate emberstone step markers recursively A good way to think about it is to first understand what goes in, then what rule you must follow, and finally what shape the answer should have.

For example, if the input is terraces = 2, the answer is 21. The second terrace adds one ember and mirrors the earlier route four times. Another example is terraces = 5, which gives 1365. Five terraces maintain the rule, revealing a glowing path of 1365 embers.

This is a friendly practice problem, but it still rewards careful reading. The key is understanding the rule clearly and then applying it carefully.

One helpful habit is to say the rule out loud in your own words before you start solving. If you can explain what counts, what changes, and what the final answer should look like, you are already much closer to the right solution.

Example Input & Output

Example 1

Input

terraces = 2

Output

Explanation

The second terrace adds one ember and mirrors the earlier route four times.

Example 2

Input

terraces = 5

Output

1365

Explanation

Five terraces maintain the rule, revealing a glowing path of 1365 embers.

Example 3

Input

terraces = 0

Output

Explanation

Only the first emberstone glows.

Algorithm Flow

Recommendation Algorithm Flow for Emberstone Step Glow

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

java

class Solution {
    public int emberstone_step_glow(int[] nums, int k, int s) {
        int total = 0;
        for (int i = 0; i <= k; i++) {
            int idx = i * s;
            if (idx < nums.length) {
                total += nums[idx];
            }
        }
        return total;
    }
}

javascript

function emberstone_step_glow(nums, k, s) {
    let total = 0;
    for (let i = 0; i <= k; i++) {
        let idx = i * s;
        if (idx < nums.length) {
            total += nums[idx];
        }
    }
    return total;
}

php

function emberstone_step_glow($nums, $k, $s) {
    $total = 0;
    for ($i = 0; $i <= $k; $i++) {
        $idx = $i * $s;
        if ($idx < count($nums)) {
            $total += $nums[$idx];
        }
    }
    return $total;
}

python

def emberstone_step_glow(nums: list, k: int, s: int) -> int:
    total = 0
    current = 0
    for _ in range(k + 1):
        if current < len(nums):
            total += nums[current]
        current += s
    return total

rust

pub fn emberstone_step_glow(nums: Vec<i32>, k: i32, s: i32) -> i32 {
    let mut total = 0;
    for i in 0..=k {
        let idx = (i * s) as usize;
        if idx < nums.len() {
            total += nums[idx];
        }
    }
    total
}

typescript

function emberstone_step_glow(nums: number[], k: number, s: number): number {
    let total = 0;
    for (let i = 0; i <= k; i++) {
        let idx = i * s;
        if (idx < nums.length) {
            total += nums[idx];
        }
    }
    return total;
}

Related Array Challenges

Comments (0)

Join the Discussion

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

Emberstone Step Glow

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

Aurora Feather Lights

Crystal Bell Resonance

Moonlit Orchid Bloom

Harbor Tide Chants

Starlight Lantern Chain

Fern Spiral Growth

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.