DSA GRIND #3

 DSA GRIND #3

By Ashur Baroutta

    This week we solved two problems. The first problem reads as follows : "Given two strings , s and t, return true if "t" is an anagram of "s", and false otherwise". An anagram is a word formed by rearranging the letters of a different word, using the original words letters exactly once (typically). 

    To solve this I started with setting up an if condition to return false for the edge case in which the length of s did not match the length of t, as if the lengths don't match then the words are obviously not anagrams of each other. I then turned both the strings into character arrays and sorted them. After sorting, I made a for loop and checked each index for a character match, as if one failed to match I knew it was not an anagram. The code submission is shown below. I am pleased with the performance.



    The second problem I worked on was a bit more complicated for me though it is built in part on the previous problem. It reads "Given an array of strings "strs", group the anagrams together. You can return the answer in any order.

    So this one was a bit more challenging in that I had to go through the string array and then break down each word in the string array into character arrays and assign value to each character so that I had identifiers to store and track if another word matched. I did this by making the character array size 26 as there are 26 letters in the alphabet.

    The way to go about that was to utilize the combination of lists and hashmaps. We are going to go through each word, assign value to the characters and then store the words with the same character values into the the hashmap as a list, that way we return anagrams grouped with eachother in their own lists. The submission results are as follows. This was super hard and took the bulk of my time, for now im okay with how it ranked.


 

Comments

  1. EricaSeptember 30, 2022 at 5:18 AM

    Ashur, great progress again this week. I'm curious if you can extrapolate and give a real world scenario where solving (one of) these problems will help you down the road in your career. More specifically, can you see where the structure of a command may be applied to different scenarios? I'd love to see a blurb about this in one of your blogs!

    ReplyDelete
  2. Genaro RiveraSeptember 30, 2022 at 9:45 PM

    This is an interesting specific problem. I never thought of writing a code that involved solving for an anagram (which is a new word for me). I can see this being used for generating a random password or trying to solve a fun worksheet of scrambled words. I feel as though this is something that does not have many applications but is definitely something that you learn to prepare yourself for a build off of this concept in more complicated applicable problems. Maybe this can be used for matrices in the way numbers are arranged.

    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

IP#5 : LinkedList Removing Duplicates II

Image
 Removing Duplicates II by Ashur Baroutta         In our last submissions, we worked on removing duplicates, this week we look at the more complicated problem of the same type. Our problem statement is " Given the  head  of a sorted linked list,  delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list . Return  the linked list  sorted  as well ."      So not only do we have to remove duplicates, but we cannot return values that are not distinct, for example, if our list originally contained three 1's, we need to delete all the 1's in our list as even if we delete all but one of them, the number 1 itself is not a distinct value.      This took me about 3 days to think through and complete, the following is our code submission.  We start by first creating a new ListNode called newlist. We set its .next reference pointing to head (the ListNode passed ini...
Read more