Day 3 of Codewars
Todayโs challenge was about extracting the domain name from a URL.
At first, it actually caught me off guard ๐ญ. I kept mixing up split() and slice(), and for a moment I was asking myself: โWhy? Why? WHYYYYYYYYY?โ
After stepping back and looking at the logic againโฆ โOhhhhhhโฆ thatโs why ๐ .โ
Once I realized the mistake, the solution became pretty straightforward.
Even though it tricked me for a bit, I really enjoyed this challenge. These small problems are great for sharpening how you think about string manipulation and logic.
LET'S GOOOOO๐ฆพ
10 POINTS CLEAR AT THE TOP AND ANOTHER STEP FORWARD IN THE JOURNEY๐
#Codewars #JavaScript #StackMinds
Todayโs challenge was about extracting the domain name from a URL.
At first, it actually caught me off guard ๐ญ. I kept mixing up split() and slice(), and for a moment I was asking myself: โWhy? Why? WHYYYYYYYYY?โ
After stepping back and looking at the logic againโฆ โOhhhhhhโฆ thatโs why ๐ .โ
Once I realized the mistake, the solution became pretty straightforward.
Even though it tricked me for a bit, I really enjoyed this challenge. These small problems are great for sharpening how you think about string manipulation and logic.
LET'S GOOOOO๐ฆพ
10 POINTS CLEAR AT THE TOP AND ANOTHER STEP FORWARD IN THE JOURNEY๐
#Codewars #JavaScript #StackMinds
Day 4 of Codewars
Todayโs challenge was about detecting a Pangram. Which is a sentence that contains every letter of the alphabet at least once.
The idea was simple:
1. Convert the sentence to lowercase.
2. Loop through all letters from aโz.
3. Check if each letter exists in the sentence.
If even one letter is missing โ not a pangram.
If all letters are present โ it is a pangram.
This challenge was actually fun because it required thinking about iteration and string checking in a clean way.
Another step forward in sharpening my problem-solving skills ๐
#Codewars #JavaScript #StackMinds
Todayโs challenge was about detecting a Pangram. Which is a sentence that contains every letter of the alphabet at least once.
The idea was simple:
1. Convert the sentence to lowercase.
2. Loop through all letters from aโz.
3. Check if each letter exists in the sentence.
If even one letter is missing โ not a pangram.
If all letters are present โ it is a pangram.
This challenge was actually fun because it required thinking about iteration and string checking in a clean way.
Another step forward in sharpening my problem-solving skills ๐
#Codewars #JavaScript #StackMinds
๐2โค1