I solved Day 4's problem again and it beats 100% noicee
For comparison The first one took 22ms

I solved Day 5's question again in hopes of making it faster but it's still slower than i would like it to be but better than before it went from 28ms to 17ms

Day 6
The first one was my initial solution it worked but it was pretty slow (2ms, Beats 35%) I wasn’t satisfied so I gave it another try and now it runs in (0ms, Beats 100%)!

Fun fact - this is my first medium challenge but it doesn't seem medium tho

Try it out - Reverse Words in a String
#LeetCode #Challenge

Day 7
The first one was my first solution but it wasn't accepted not because it doesn't work because it's was too slow so i had to google a bit to find a new solution

Basically the questions is asking use to find the product of all numbers in a list except the current one

My first solution creates new list for each number excluding the current number and multiplies the rest so imagine if we are given a list that has 50,000 number it would take ages

So the efficient way of solving this is using a technique called prefix and suffix product
Prefix - Multiply all elements before the current index
Suffix - Multiply all elements after the current index

For example let's say we are given

x = [1, 2, 3]

Then

Prefix = [1, 1, 2]

Suffix = [6, 3, 1]

And we multiply them(element-wise) to get the answer

Prefix * Suffix = [6, 3, 2]

Tbh idk how they came up with this it's genius

Try it out - Product of Array Except Self
#LeetCode #Challenge