🚀 Day 66/150 – Count Words in a String in Python

Counting words in a string is a common beginner-level Python problem and is very useful in text processing.

Example:
"Python is easy to learn" → 5 words

Let’s explore different methods to count words in Python 👇

🔹 Method 1 – Using split() and len()

text = "Python is easy to learn" count = len(text.split()) print("Word Count:", count)

📌 split() separates the sentence into words and len() counts them.

🔹 Method 2 – Taking User Input

text = input("Enter a string: ") count = len(text.split()) print("Word Count:", count)

📌 Useful when taking dynamic input from users.

🔹 Method 3 – Using for Loop

text = "Python is easy to learn" count = 1 for ch in text: if ch == " ": count += 1 print("Word Count:", count)

✅ Output

Word Count: 5

📌 Counts spaces manually to estimate the number of words.

⚠️ This method works properly only when words are separated by a single space.

🔹 Method 4 – Using Function

def count_words(text):
    return len(text.split())

print(count_words("Python is easy to learn"))

✅ Output

5

📌 Best approach for reusable and cleaner code.

🔥Key Takeaways

1)split() is the easiest way to count words

2)len() gives the total number of words

3)Loop method helps understand the logic manually

4)Functions improve code reusability and readability

Read More

🚀 Day 58/150 – Find Unique Elements in a List in Python

 

🚀 Day 58/150 – Find Unique Elements in a List in Python

Unique elements are values that appear only once in the list.

Example:
[1, 2, 2, 3, 4, 4, 5] → Unique elements = [1, 3, 5]

Let’s explore different ways to find them 👇

🔹 Method 1 – Using Loop

numbers = [1, 2, 2, 3, 4, 4, 5] unique = [] for num in numbers: if numbers.count(num) == 1: unique.append(num) print("Unique Elements:", unique)

🔹 Method 2 – Using List Comprehension

numbers = [1, 2, 2, 3, 4, 4, 5] unique = [num for num in numbers if numbers.count(num) == 1] print("Unique Elements:", unique)

🔹 Method 3 – Using collections.Counter

from collections import Counter numbers = [1, 2, 2, 3, 4, 4, 5] freq = Counter(numbers) unique = [num for num in numbers if freq[num] == 1] print("Unique Elements:", unique)

🔹 Method 4 – Taking User Input

numbers = list(map(int, input("Enter numbers: ").split())) unique = [num for num in numbers if numbers.count(num) == 1] print("Unique Elements:", unique)

💡 Key Takeaways

• Unique elements appear exactly once
• count() is easy to understand but slower for large lists
• Counter is better for larger datasets
• Useful in data cleaning and duplicate detection

Read More

 

🚀 Day 55/150 – Insertion Sort in Python

Insertion Sort builds the sorted list one element at a time.

It takes each element and inserts it into its correct position among the already sorted elements.

 Works like sorting playing cards in your hand.

🔹 Method 1 – Basic Insertion Sort

numbers = [12, 11, 13, 5, 6] for i in range(1, len(numbers)): key = numbers[i] j = i - 1 while j >= 0 and numbers[j] > key: numbers[j + 1] = numbers[j] j -= 1 numbers[j + 1] = key print("Sorted List:", numbers)

🔹 Method 2 – Taking User Input

numbers = list(map(int, input("Enter numbers: ").split())) for i in range(1, len(numbers)): key = numbers[i] j = i - 1 while j >= 0 and numbers[j] > key: numbers[j + 1] = numbers[j] j -= 1 numbers[j + 1] = key print("Sorted List:", numbers)

🔹 Method 3 – Sorting in Descending Order

numbers = [12, 11, 13, 5, 6] for i in range(1, len(numbers)): key = numbers[i] j = i - 1 while j >= 0 and numbers[j] < key: numbers[j + 1] = numbers[j] j -= 1 numbers[j + 1] = key print("Descending Order:", numbers)

🔹 Method 4 – Using Function

def insertion_sort(arr): for i in range(1, len(arr)): key = arr[i] j = i - 1 while j >= 0 and arr[j] > key: arr[j + 1] = arr[j] j -= 1 arr[j + 1] = key return arr print(insertion_sort([12, 11, 13, 5, 6]))

💡 Key Takeaways

• Builds the sorted list one element at a time
• Efficient for small or nearly sorted lists
• Time Complexity: O(n²) in the worst case
• Stable sorting algorithm (keeps equal elements in order)

Read More