package
0.0.0-20240717210230-cb72c3092e0b
Repository: https://github.com/ashinzekene/algorithms.git
Documentation: pkg.go.dev

# README

Utopian Tree problem

https://www.hackerrank.com/challenges/utopian-tree/problem

The Utopian Tree goes through 2 cycles of growth every year. Each spring, it doubles in height. Each summer, its height increases by 1 meter.

A Utopian Tree sampling with a height of 1 meter is planted at the onset of spring. How tall will the tree be after growth cycles?

For example, if the number of growth cycles is n=5, the calculations are as follows:

PeriodHeight
01
12
23
36
47
514

Function Description:

Complete the utopianTree function in the editor below.

utopianTree has the following parameter(s):

int n: the number of growth cycles to simulate

Returns:

int: the height of the tree after the given number of cycles Input Format:

The first line contains an integer, t, the number of test cases. t subsequent lines each contain an integer, n, the number of cycles for that test case.

Sample Input

3
0
1
4

Sample Output

1
2
7