Hello **Programmers/Coders,** Today we are going to share ** solutions of Programming problems of HackerRank, Algorithm Solutions of Problem Solving Section in Java**. At Each Problem with Successful submission with

**all Test Cases Passed,**you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for **Utopian Tree** **in Java-HackerRank Problem**. We are providing the **correct and tested solutions** of coding problems present on **HackerRank**. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

**Introduction To Algorithm**

The word **Algorithm** means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be executed upon in order to get the expected results.

**Advantages of Algorithms:**

- It is easy to understand.
- Algorithm is a step-wise representation of a solution to a given problem.
- In Algorithm the problem is broken down into smaller pieces or steps hence, it is easier for the programmer to convert it into an actual program.

** Link for the Problem** – Utopian Tree – Hacker Rank Solution

Utopian Tree – Hacker Rank Solution

**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 sapling 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 , the calculations are as follows:

Period Height 0 1 1 2 2 3 3 6 4 7 5 14

**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, , the number of test cases.

subsequent lines each contain an integer, , the number of cycles for that test case.

**Constraints**

**Sample Input**

3 0 1 4

**Sample Output**

1 2 7

**Explanation**

Utopian Tree – Hacker Rank Solution

import java.util.Scanner; /** * @author Techno-RJ * */ public class UtopianTree { // Complete the utopianTree function below. static int utopianTree(int n) { return (1 << ((n >> 1) + 1)) - 1 << n % 2; } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int T = sc.nextInt(); for (int i = 0; i < T; i++) { int cycle = sc.nextInt(); System.out.println(utopianTree(cycle)); } sc.close(); } }