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) {
// Write your code here
ArrayList arr=new ArrayList<Integer>();
int count=0;
for(int i=0;i<=n;i++)
{
if(i%2==0)
{
count+=1;
arr.add(i, count);
}
else
{
count=count*2;
arr.add(i, count);
}
}
int wawa=(int)arr.get(n);
return wawa;
}
}
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 →
class Result {
}