We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
/*
* Complete the 'utopianTree' function below.
*
* The function is expected to return an INTEGER.
* The function accepts INTEGER n as parameter.
*/
public static int utopianTree(int n) {
int height =1;
for (int i = 1; i <= n; i++) {
if(i%2!=0){
height = height*2;
}
else{
height = height+1;
}
}
return height;
}
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Utopian Tree
You are viewing a single comment's thread. Return to all comments →
java:
class Result {
}