Terraced Shell Count

Array Easy 0 views

Like30

The Terraced Shell Parade in Luminara Cove is a twilight ritual where polished shells are arranged along carved ledges. It begins with a single shell. For each additional terrace, the stewards add four guiding shells, and then the entire arrangement from the previous level is echoed twice as it reflects across the lagoon. Your task in Terraced Shell Count is to compute the total number of shells visible once all terraces are prepared.

The "secret sauce" here is a Doubling Recurrence. If the number of tiers is zero, only the first shell is shown. For every higher tier, the total follows the formula: Total = 2 * (Previous Total) + 4. This reflects how the hillside seems to breathe as the glow mirrors across the water while new beacons are set. You must return an integer representing the final count of glowing shells once the procession is ready. It’s a hypnotic pattern that turns a simple ritual into a stunning display of light!

Examples

Example 1

Input

tiers = 3

Output

Explanation

Three additional terraces mean another guiding shell plus twin reflections of everything from tier two.

Example 2

Input

tiers = 0

Output

Explanation

Only the original shell is shown.

Example 3

Input

tiers = 1

Output

Explanation

The new terrace adds one guiding shell and mirrors the earlier display twice.

Algorithm Flow

Recommendation Algorithm Flow for Terraced Shell Count - Budibadu

Best Answers

java

import java.util.*;
class Solution {
    public int calculate_shell_count(Object shell) {
        if (shell instanceof Integer) return (int) shell;
        if (shell instanceof List) {
            int total = 0;
            for (Object item : (List) shell) total += calculate_shell_count(item);
            return total;
        }
        return 0;
    }
}

javascript

function calculate_shell_count(shell) {
    if (typeof shell === 'number') return shell;
    if (Array.isArray(shell)) return shell.reduce((sum, item) => sum + calculate_shell_count(item), 0);
    return 0;
}

php

function calculate_shell_count($shell) {
    if (is_numeric($shell)) return $shell;
    if (is_array($shell)) {
        $total = 0;
        foreach ($shell as $item) $total += calculate_shell_count($item);
        return $total;
    }
    return 0;
}

python

def calculate_shell_count(shell):
    total = 0
    if isinstance(shell, (int, float)): return shell
    if isinstance(shell, list):
        for item in shell: total += calculate_shell_count(item)
    return total

rust

use serde_json::Value;
pub fn calculate_shell_count(shell: &Value) -> i32 {
    match shell {
        Value::Number(n) => n.as_i64().unwrap_or(0) as i32,
        Value::Array(arr) => arr.iter().map(|v| calculate_shell_count(v)).sum(),
        _ => 0,
    }
}

typescript

function calculate_shell_count(shell: any): number {
    if (typeof shell === 'number') return shell;
    if (Array.isArray(shell)) return shell.reduce((sum: number, item: any) => sum + calculate_shell_count(item), 0);
    return 0;
}

Comments (0)

Join the Discussion

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

Terraced Shell Count

Examples

Algorithm Flow

Best Answers

Solutions Coming Soon

Related Array Problems

Longest Consecutive Sequence

Garden Relay Count

Lantern Stall Picks

Festival Stall Order

Studio Lighting Slots

Seaport Ferry Gate Control

Comments (0)

Join the Discussion