Let's solve your problem step by step!

Let's create a fun Python program for your task! 😃

🧮 Function: is_positive_odd_or_negative_even Let’s build a Python function that checks if a number is either a positive odd or a negative even. 🎯 🚩 Function Definition def is_positive_odd_or_negative_even(n): # Check for positive odd OR negative even return (n > 0 and n % 2 == 1) or (n < 0 and n % 2 == 0) 📝 Step-by-Step Explanation Positive Odd Number: Condition: n > 0 and n % 2 == 1 Checks if the number is positive AND odd. Negative Even Number: Condition: n < 0 and n % 2 == 0 Checks if the number is negative AND even. Logical OR: The function returns True if any one of the above conditions is met. 🧪 Practice Questions Practice 1 print(is_positive_odd_or_negative_even(7)) # _______ 7 is positive and odd. Output: True Practice 2 print(is_positive_odd_or_negative_even(-4)) # _______ -4 is negative and even. Output: True Practice 3 print(is_positive_odd_or_negative_even(-3)) # _______ -3 is negative and odd. Output: False Practice 4 print(is_positive_odd_or_negative_even(8)) # _______ 8 is positive and even. Output: False Practice 5 print(is_positive_odd_or_negative_even(0)) # _______ 0 is neither positive nor negative (and it’s even). Output: False ✨ Key Points Odd number: Remainder when divided by 2 is 1 (n % 2 == 1). Even number: Remainder when divided by 2 is 0 (n % 2 == 0). Positive Odd or Negative Even: Only one of these is needed for True. Zero case: 0 is not positive or negative, so always returns False. Happy Coding! 🚀

📝 Filter Words by Custom Criteria Below is the requested function to filter a list of words based on one of four criteria: continuous, vowel_rich, consonant_rich, or sorted. Words are checked case-insensitively, and helper functions are included for each criteria. def filter_words(words, criteria): """ Filters a list of words based on the given criteria. Args: words (list of str): Input list of words. criteria (str): One of 'continuous', 'vowel_rich', 'consonant_rich', 'sorted'. Returns: list or None: Filtered list based on criteria, or None if invalid. Criteria: • 'continuous': words ending with 'ing' (case-insensitive) • 'vowel_rich': words with more than 5 vowels • 'consonant_rich': words with more than 5 consonants • 'sorted': words whose letters are in ascending order (case-insensitive) """ def is_continuous(word): return word.lower().endswith('ing') def count_vowels(word): return sum(1 for ch in word.lower() if ch in "aeiou") def count_consonants(word): return sum(1 for ch in word.lower() if ch.isalpha() and ch not in "aeiou") def is_sorted(word): letters = [ch.lower() for ch in word if ch.isalpha()] return letters == sorted(letters) if criteria == 'continuous': return [w for w in words if is_continuous(w)] elif criteria == 'vowel_rich': return [w for w in words if count_vowels(w) > 5] elif criteria == 'consonant_rich': return [w for w in words if count_consonants(w) > 5] elif criteria == 'sorted': return [w for w in words if is_sorted(w)] else: return None ✨ Step-by-Step Explanation Helper Functions: is_continuous: Checks if the word ends with “ing” (case-insensitive). count_vowels: Counts vowels (a, e, i, o, u). count_consonants: Counts consonants (alphabetic letters that are not vowels). is_sorted: Checks if the letters of the word are in ascending order. Criteria Check: The function checks the criteria argument and applies the relevant helper. If an unknown criteria is given, returns None. 🧪 Practice Questions Try calling the function on the following list:

🔎 Function: Find Last Word Starting with Uppercase Here’s how you can implement the last_word_starts_with_upper_case function to find the last word in a sentence that starts with an uppercase letter. If no such word exists, it returns None. 🛠️ Function Definition def last_word_starts_with_upper_case(sentence: str): """ Find the last word in a sentence that starts with an uppercase letter. Args: sentence (str): The input sentence. Returns: str or None: The last word starting with an uppercase letter, or None if no such word exists. """ result = None for word in sentence.split(): if word and word[0].isupper(): result = word return result ✨ Step-by-Step Explanation Step 1: Split the sentence into individual words using split(). Step 2: Loop through each word: If the word starts with an uppercase letter (word.isupper()), save it as the current result. Step 3: After checking all words, return the last word found that met the criteria, or None if none did. 🚦 Example Usage print(last_word_starts_with_upper_case("This is a Test sentence")) # Output: "Test" print(last_word_starts_with_upper_case("no uppercase words here")) # Output: None 📝 Practice Questions What will last_word_starts_with_upper_case("Alice and Bob went to Paris") return? Try last_word_starts_with_upper_case("all lowercase words"). What is the result of last_word_starts_with_upper_case("Python Is Easy To Learn")? ✅ Solutions "Paris" None "Learn" With this function, you can quickly scan sentences for the last word that begins with a capital letter. Perfect for text analysis and simple parsing tasks! 🐍💡

def print_n_pattern(n): """ Prints an "N" shaped pattern with n rows. The pattern has vertical bars (|) on the left and right sides of each row, with a backslash (\) moving diagonally from the top-left to the bottom-right. There are no spaces to the right of the pattern. Args: n (int): The number of rows for the pattern (n > 0). """ for i in range(n): # Start each row with a vertical bar row = "|" # Add leading spaces before the diagonal backslash # The number of leading spaces is equal to the current row index 'i' row += " " * i # Add the diagonal backslash row += "\\" # Add trailing spaces after the diagonal backslash # The total width of the inner part (between vertical bars) is (n - 1) characters. # So, the number of trailing spaces is (n - 1) - i row += " " * (n - 1 - i) # End each row with a vertical bar row += "|" # Print the constructed row print(row) if __name__ == "__main__": try: # Read the integer input from the user n = int(input()) # Validate the input: n must be greater than 0 if n <= 0: print("Input 'n' must be a positive integer (n > 0).") else: # Call the function to print the pattern print_n_pattern(n) except ValueError: # Handle cases where the input is not a valid integer print("Invalid input. Please enter a single integer.")

🔄 Swap and Reverse Lines Program in Python Below is a Python program that reads multiple lines of input, swaps every two consecutive lines, and then reverses every odd-numbered line in the resulting output sequence. This meets the problem’s requirements exactly. 🛠️ Complete Code def main(): n = int(input()) lines = [input() for _ in range(n)] # Swap every two consecutive lines for i in range(0, n - 1, 2): lines[i], lines[i + 1] = lines[i + 1], lines[i] # Reverse every odd-numbered line in the output (1-based index) for i in range(n): if (i + 1) % 2 == 1: # odd line number lines[i] = lines[i][::-1] # Print the transformed lines for line in lines: print(line) if __name__ == "__main__": main() 📝 Explanation Input Reading: Read the integer n for the number of lines, then read each line into a list. Swapping Consecutive Lines: Iterate through the list in steps of two, swapping the pair at indices i and i+1. Reversing Odd-Numbered Lines: After swapping, reverse every odd line (1st, 3rd, 5th, …) by checking (i+1) % 2 == 1. Output: Print each line after these transformations. 🌟 Example Run Input:

🏃‍♂️ Matrix Walk Function Let’s design a Python function that follows three special matrix paths — “L”, “Z”, and “O” shapes — and collects the matrix elements accordingly! 🚀 🧑‍💻 Function Definition def matrix_walk(matrix, path): n = len(matrix) result = [] if path == "L": # Down the first column for i in range(n): result.append(matrix[i][0]) # Across the bottom row, excluding first element for j in range(1, n): result.append(matrix[n-1][j]) return result elif path == "Z": # Top row for j in range(n): result.append(matrix[0][j]) # Diagonal except first and last row for i in range(1, n-1): result.append(matrix[i][n-i-1]) # Bottom row for j in range(n): result.append(matrix[n-1][j]) return result elif path == "O": # Top row for j in range(n): result.append(matrix[0][j]) # Right column (excluding top and bottom) for i in range(1, n-1): result.append(matrix[i][n-1]) # Bottom row (reverse, excluding last element) for j in range(n-1, -1, -1): result.append(matrix[n-1][j]) # Left column (reverse, excluding top and bottom) for i in range(n-2, 0, -1): result.append(matrix[i][0]) return result else: return [] 🔍 Step-by-Step Explanation 1. L-Shape (“L”) Walk down the first column (leftmost). Then walk right along the bottom row (skipping the already-added first element). 2. Z-Shape (“Z”) Walk across the top row (left to right). Walk diagonally from the top-right to bottom-left, excluding corners. Walk across the bottom row (left to right). 3. O-Shape (“O”) Walk around the outside (clockwise): Top row (left to right), Right column (top to bottom, skipping corners), Bottom row (right to left), Left column (bottom to top, skipping corners). 🧪 Practice Questions with Solutions Example Matrix matrix = [ [1, 2, 3], [4, 5, 6], [7, 8, 9] ] Practice 1: L-Shape print(matrix_walk(matrix, "L")) # Output: [1, 4, 7, 8, 9] Practice 2: Z-Shape print(matrix_walk(matrix, "Z")) # Output: [1, 2, 3, 5, 7, 8, 9] Practice 3: O-Shape print(matrix_walk(matrix, "O")) # Output: [1, 2, 3, 6, 9, 8, 7, 4] ✨ Key Points The function traverses only as per the specified path — “L”, “Z”, or “O”. For unknown paths, returns an empty list. Works for any square matrix of size 1 or more. Happy Matrix Walking! 🟦🟩🟨🟥