DSA GRIND #6

DSA GRIND by Ashur Baroutta

        This week's problem is a classic! I wanted to tackle another Binary Search problem. So our problem statement reads -

    "Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1."

    So after spending a bit of time trying to figure out how to do this i settled on using a twopointer combined with a while loop setup and setting a variable to target the middle of the array and comparing our index of mid to our target and incrementing/decrementing based off the result of the comparisons. I can see why its a classic. While it may not be as widespread now, I think this type of search is useful in returning specific data from a smaller dataset. It probably doesn't scale too well for super large datasets.


Comments

  1. Genaro RiveraOctober 28, 2022 at 9:42 PM

    I find this as an interesting way to extract data from other data and could be the foundation for greater applications!

    ReplyDelete

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