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
Day 5 of Codewars Challenge
I could've used filter and find method lolπ but at the end it just worked.
One of the Rule on coding: If it works, don't touch itπ
Anyways, Another step forward in the journey π
#Codewars #JavaScript #StackMinds
@stackminds
I could've used filter and find method lolπ but at the end it just worked.
One of the Rule on coding: If it works, don't touch itπ
Anyways, Another step forward in the journey π
#Codewars #JavaScript #StackMinds
@stackminds