Utopian Tree HackerRank Solution | Hackerrank Utopian Tree | [One Liner Solution]

[@JavaAidTutorials]

If you find this tutorial helpful, please do not forget to like , comment, share and It would be great if you can leave your feedback about the tutorial, as I have put a lot of hard work to make things easy for you. Thanks ..!! 🙏🙏🙏

[@mohanbhati9595]

make correction in Problem statement it's different.

[@JavaAidTutorials]

thanks we have updated the problem statement link :)

[@sovnaishwarya]

You are making it more complex

[@rishiraj2548]

15:00 excellent! thanks

[@codedecks]

Congratulations on 15k Subscribers 👍 Welcome back !!!

[@JavaAidTutorials]

Thank you..😀 I also noticed after watching your comment

[@memesmacha61]

After a long time bro...we want many more videos from you!

[@JavaAidTutorials]

Even we want to produce more content but situations are not in our favor that much.

[@tusharhatwar4581]

Thank You for coming Back 🙏🙏

[@shivanigoswami2773]

Hey hey hey thank you so much for come back again😍😍😍😍😍😍

[@JavaAidTutorials]

Thanks to JAVAAID family to give so much of love ❤️❤️

[@kvr9423]

Great Contribution..Kudos

[@anil2009]

Guruji you are great. Where are you all these days

[@JavaAidTutorials]

We are always with our JAVAAID FAMILY.❤️

[@anil2009]

I m trying hard to get into Zoho company guruji but I'm faling to find out good algorithm to slove the problem

[@JavaAidTutorials]

have some passions and work hard you will see the results.

[@sebajean-baptiste6240]

I know this is old. But I struggled to understand this solution. Elegant, but a bit complicated. I did it a different way that might be easier to understand. At least for me. public static void main(String[] args) { for (int period = 0; period < 9; period++ ) { int c = cycle(period); int result = period % 2 == 0 ? calculate(c) : calculate(c) - 1; System.out.println( period + " : " + result); } } public static int cycle(int period) { if( period % 2 == 0) return period / 2; return (period + 1) / 2; } public static int calculate(int cycle) { return Double.valueOf(Math.pow(2, cycle + 1)).intValue() - 1; }

[@aravinddesikamani]

Welcome back😁

[@JavaAidTutorials]

Thank you 😊

[@karimdinani9845]

if(n%2==0) height = pow(2,(n/2) +1) -1 ; else height = pow(2,((n+1)/2) +1) -2 ;

[@JohnWindberg]

There's probably a one liner, without bitwise math, but I'm having trouble figuring it out. Something like 2^(n-1) + n%2

[@JohnWindberg]

I find bitwise math to be unreadable.

[@RahulKumar-ud3ct]

Sir , can't we apply a simple for loop with if (i%2==0){ Count =count +1;} And else { count =count *2 ;}

[@JavaAidTutorials]

You can but bitwise operations are much faster than anything else. so for large input your program will be a little bit slow.

[@VinayKumar-tv5bc]

@@JavaAidTutorials please elaborate this code as send by @rahul kumar

[@shannu9572]

happy teachers day javaaid maya

[@JavaAidTutorials]

Thank you..😊 but who is maya🤔

[@maqsamqureshi1052]

Sir it is simple programming question or data structure question

[@rishiraj2548]

Wow! Many thanks

[@optimusprime692]

Super solution!

[@JavaAidTutorials]

Glad you think so!

[@mahmmadhusen6794]

Please upload more videos

[@JavaAidTutorials]

Sure, we will try our best.

[@indlasubramanyam9510]

Audio is not up to the mark

[@jaidheersirigineedi8110]

Thank you sir!!

[@JavaAidTutorials]

Most welcome!

[@navinchainani4721]

Sir plz explain also using if else

[@JavaAidTutorials]

That approach is not optimal, but still you want, we have some old code, will paste it here for reference. Or for short use this algo- If cycle is even multiple height by 2 Else increase the height by 1

[@navinchainani4721]

@@JavaAidTutorials thanks

[@fernandogaldino5309]

Using if/else, try this... It works for me... public static int utopianTree(int n) { // Write your code here int height = 0; for(int i = 0; i

[@salilkumarghosh9861]

Sir can I solve these problems using C after watching all videos?

[@JavaAidTutorials]

We always try to teach generic algorithm which is independent of any specific language. so you can use any language to implement the same

[@RahdixCloudNine]

WTF ??? subscribed!

[@saikande8085]

Can you explain again sir

[@JavaAidTutorials]

The good thing about video tutorial is , if you have any doubt you can replay it. We are ready to explain again, just watch this video one more time. I hope things will be more clear next time.:)

[@manojb1606]

Voice very un easy to hear

[@abhisekpanda3701]

public class utopianTree { public static void main(String[] args) { int n=utopian(5); //utopian(7); System.out.println(n); } static int utopian(int n) { int value=1; for(int i=0;i