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.
- Prepare
- Algorithms
- Implementation
- Utopian Tree
- Discussions
Utopian Tree
Utopian Tree
Sort by
recency
|
2020 Discussions
|
Please Login in order to post a comment
My Python Solution:
C# Easy to Understand Solution
First of all, since the tree sapling starts at 1 height, then if "n" is 0 (no growth), then its height stays at 1.
Then since it's always starts at Spring, then Summer, then Spring again, etc. We can think of it like an index. You might notice that each Spring happens at odd index, while each Summer happens at even index. This means you can just check if the index is odd or even. If it's an odd index (Spring), multiply the height by 2. If it's an even index (Summer), increment the height by 1.
Cleanest and Fastest soluion you will ever find here!!
include
using namespace std;
int main(){ //odd -> (2 ^ (n / 2) + 2) - 2 //even -> (2 ^ (n / 2) + 1) - 1
}
Here is problem solution in PYthon, Java, C++, C and Javascript - https://programmingoneonone.com/hackerrank-utopian-tree-problem-solution.html
here is my solution in javascript:
}