Day - 100

Assalamu alaykum, everyone!

And finally, today is the last day of my 100-day challenge. Getting to this day has not been easy. I am writing today's post in a different mood. Maybe because this is my first challenge in this direction, it is not surprising that such emotions are passing! But it is difficult to describe. The past 100 days have been amazing. Many things have changed in my life. I can even say that some nights passed without sleep. In the intervening days, I thought a lot about how to finish this challenge. The questions of what would happen if I didn't finish on time were troubling, but I managed to do it. And I am very happy to share it with you. One thing I've realized these days is that time flies so fast. Spend your free time on something worthwhile rather than on useless things. I hope it will be beneficial not only for you today but also for your future. I am sure of it.

So we will end today's challenge with a solution to a problem. Are you ready?

1. Problem 2586. Count the Number of Vowel Strings in the Range

Time Complexity:

The time complexity of the code is O(n), where n is the number of words in the array. This is because the for loop iterates over the entire array, and each iteration takes a constant amount of time.

Space Complexity:

The space complexity of the code is O(1) since the only additional space that is used is the constant space required to store the vowels string and the count variable.

Code:

/*
?* @param {string[]} words
?* @param {number} left
?* @param {number} right
?* @return {number}
?*/

var vowelStrings = function (words, left, right) {
? let count = 0;
? const vowels = "aeiou";

? for (let i = left; i <= right; i++) {
? ? const str = words[i];
? ? const firstChar = str.at(0);
? ? const lastChar = str.at(-1);

? ? if (vowels.includes(firstChar) && vowels.includes(lastChar)) count++;
? }

? return count;
};        

#coding #challenges #leetcode #javascript #programming #problems #solutions #100daysofcodechallenge #finish #like #share