HackerRank - Print in Reverse | Full solution with visuals and examples | Study Algorithms

[@simonpauls3583]

I don't understand why people like u doesn't receive the credits u guys deserve!!! Your videos are so explainatory. I always tend to first search the video of yours if there is a pause in any of my problem solving questions!!!!! Keep posting videos regarding DSA concepts, a kind request from my side.

[@nikoo28]

Thanks for the motivation. I am constantly trying to add more and more videos. Stay tuned :)

[@arsenruslanovich6642]

Thank you , your channel is awesome and I find it more informative than my university papers

[@nikoo28]

Thanks for your support :)

[@sammedpatil3907]

nice explanation bro...You deserve more views...

[@nikoo28]

Please share the video if you can :)

[@jasper5016]

Thanks for the yet another fantastic video. There is one small correction in your code. In Recursion, head.next condition wont work. It should be head != null private static void reversePrintUsingRecursion(Node head) { if(head == null) return; //Recursive call reversePrintUsingRecursion(head.next); System.out.println(head.value); }

[@AdedolapoAdeleye]

is the recursive different from using the stack, when it comes to efficiency?

[@appayyagariaswini2060]

sir plss there is a small mistake in recursion base case, it will work if(head==null){}

[@sreddy8141]

Thanks a lot, could you please give ur gmail id to connect on other major problems i would like to connect witj

[@nikoo28]

Check out the channel description for this information :)