DSA GRIND #7

REVERSING LINKED LIST(RECURSIVELY)

    The grind continues! This week we're staying on linked lists as I've been working with them a lot more given my coding class this semester. Reversing a linked list is asked commonly in coding interviews, it's more of a beginner question and I wanted to tackle it with recursion. 

    The problem statement is very simple "Given the head of a singly linked list, reverse the list".

At first, I initialized a bunch of variables to continuously swap as I traversed the link list, and while the spirit of that approach isn't wrong, I thought it more of a challenge to think through how to do this recursively. 

So I setup parameterized functions to compute the reversal recursively utilizing a second helper function. This was really fun! The code and solution is posted below. 




Comments

Post a Comment

Popular posts from this blog

IP #6 : Reversing an Integer

Image
 Reversing an Integer by Ashur Baroutta     The focus of this submission will be on reversing a given integer passed into our function. Our problem statement is as follows "Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-2^31, 2^31 -1], then return 0." Seems simple, though was actually a little odd. My initial reaction is to convert the integer to a string and then just reverse each character. Though in a way that feels like cheating as I don't think that solution is in the spirit of the assignment,  and it takes more resources to complete.      Pivoting my attention to a mathematical solution made the problem a lot more fun. Say our first example for x is 123. The way we attack it is to setup variables to track the reversed total and to track the remainder of a given iteration, we also create a loop iterating through while x does not equal 0.  The ...
Read more

DSA GRIND #9

Image
 INVERTING A BINARY TREE - AB  This weeks problem is similar to our earlier work on reversing a linked list data structure, but in this instance we're going to be inverting a binary tree. The following picture shows an example of what that means. Like our earlier work, I went about doing this recursively as well. So kept making calls back to the function within itself as we went about inverting the data structure node for node. The results/code is as follows.  The code was solid, though the memory management was pretty lacking, its resource intensive holding the same calls within the stack for execution. 
Read more