Learn Python Coding

❔ Interview Question What is the potential pitfall of using a mutable object (like a list or dictionary) as a default argument in a Python function? Answer: A common pitfall is that the default argument is evaluated only once, when the function is defined, not each time it is called. If that default object is mutable, any modifications made to it in one call will persist and be visible in subsequent calls. This can lead to unexpected and buggy behavior. Incorrect Example (The Pitfall):

def add_to_list(item, my_list=[]):
    my_list.append(item)
    return my_list

# First call seems to work fine
print(add_to_list(1))  # Output: [1]

# Second call has unexpected behavior
print(add_to_list(2))  # Output: [1, 2] -- The list from the first call was reused!

# Third call continues the trend
print(add_to_list(3))  # Output: [1, 2, 3]

The Correct, Idiomatic Solution: The standard practice is to use None as the default and create a new mutable object inside the function if one isn't provided.

def add_to_list_safe(item, my_list=None):
    if my_list is None:
        my_list = []  # Create a new list for each call
    my_list.append(item)
    return my_list

# Each call now works independently
print(add_to_list_safe(1))  # Output: [1]
print(add_to_list_safe(2))  # Output: [2]
print(add_to_list_safe(3))  # Output: [3]

tags: #Python #Interview #CodingInterview #PythonTips #Developer #SoftwareEngineering #TechInterview ━━━━━━━━━━━━━━━ By: @DataScience4 ✨

⚠ Message was hidden by channel owner

⚠ Message was hidden by channel owner

⚠ Message was hidden by channel owner

🏆 Mastering Python Clean Code: 150 Key Principles 📢 Elevate your Python skills! Dive into 150 Clean Code principles to write truly readable and maintainable code for any project. ⚡ Tap to unlock the complete answer and gain instant insight. ━━━━━━━━━━━━━━━ By: @DataScience4 ✨

✨ chain of thought (CoT) | AI Coding Glossary ✨ 📖 A prompting technique that asks models to show intermediate steps, often improving multi-step reasoning but not guaranteeing accurate explanations. 🏷️ #Python

✨ reasoning model | AI Coding Glossary ✨ 📖 A generative model tuned to solve multi-step problems. 🏷️ #Python

✨ Python 3.14 Released and Other Python News for November 2025 ✨ 📖 Python 3.14 is officially out, Python 3.15 begins, and Python 3.9 reaches end of life. Plus, Django 6.0 first beta released, new PEPs, and more Python news. 🏷️ #community #news

✨ Quiz: Python MarkItDown: Convert Documents Into LLM-Ready Markdown ✨ 📖 Practice MarkItDown basics. Convert PDFs, Word documents, Excel documents, and HTML documents to Markdown. Try the quiz. 🏷️ #intermediate #ai #tools

Learning Common Algorithms with Python • This lesson covers fundamental algorithms implemented in Python. Understanding these concepts is crucial for building efficient software. We will explore searching, sorting, and recursion. • Linear Search: This is the simplest search algorithm. It sequentially checks each element of the list until a match is found or the whole list has been searched. Its time complexity is O(n).

def linear_search(data, target):
    for i in range(len(data)):
        if data[i] == target:
            return i  # Return the index of the found element
    return -1 # Return -1 if the element is not found

# Example
my_list = [4, 2, 7, 1, 9, 5]
print(f"Linear Search: Element 7 found at index {linear_search(my_list, 7)}")

• Binary Search: A much more efficient search algorithm, but it requires the list to be sorted first. It works by repeatedly dividing the search interval in half. Its time complexity is O(log n).

def binary_search(sorted_data, target):
    low = 0
    high = len(sorted_data) - 1
    
    while low <= high:
        mid = (low + high) // 2
        if sorted_data[mid] < target:
            low = mid + 1
        elif sorted_data[mid] > target:
            high = mid - 1
        else:
            return mid # Element found
    return -1 # Element not found

# Example
my_sorted_list = [1, 2, 4, 5, 7, 9]
print(f"Binary Search: Element 7 found at index {binary_search(my_sorted_list, 7)}")

• Bubble Sort: A simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order. The process is repeated until the list is sorted. Its time complexity is O(n^2).

def bubble_sort(data):
    n = len(data)
    for i in range(n):
        # Last i elements are already in place
        for j in range(0, n-i-1):
            if data[j] > data[j+1]:
                # Swap the elements
                data[j], data[j+1] = data[j+1], data[j]
    return data

# Example
my_list_to_sort = [4, 2, 7, 1, 9, 5]
print(f"Bubble Sort: Sorted list is {bubble_sort(my_list_to_sort)}")

• Recursion (Factorial): Recursion is a method where a function calls itself to solve a problem. A classic example is calculating the factorial of a number (n!). It must have a base case to stop the recursion.

def factorial(n):
    # Base case: if n is 1 or 0, factorial is 1
    if n == 0 or n == 1:
        return 1
    # Recursive step: n * factorial of (n-1)
    else:
        return n * factorial(n - 1)

# Example
num = 5
print(f"Recursion: Factorial of {num} is {factorial(num)}")

#Python #Algorithms #DataStructures #Coding #Programming #LearnToCode ━━━━━━━━━━━━━━━ By: @DataScience4 ✨

✨ few-shot learning | AI Coding Glossary ✨ 📖 A setting where a model adapts to a new task using only a small number of labeled examples. 🏷️ #Python

⚠ Message was hidden by channel owner

⚠ Message was hidden by channel owner

9. Use isinstance() for Type Checking (It's safer and more robust than type() because it correctly handles inheritance.) Cluttered Way (brittle, fails on subclasses):

class MyList(list): pass
my_list_instance = MyList()
if type(my_list_instance) == list:
    print("It's a list!") # This will not print

Clean Way (correctly handles subclasses):

class MyList(list): pass
my_list_instance = MyList()
if isinstance(my_list_instance, list):
    print("It's an instance of list or its subclass!") # This prints

10. Use the else Block in try/except (Clearly separates the code that runs on success from the try block being monitored.) Cluttered Way:

try:
    data = my_ risky_operation()
    # It's not clear if this next part can also raise an error
    process_data(data)
except ValueError:
    handle_error()

Clean Way:

try:
    data = my_risky_operation()
except ValueError:
    handle_error()
else:
    # This code only runs if the 'try' block succeeds with NO exception
    process_data(data)

#Python #CleanCode #Programming #BestPractices #CodeReadability ━━━━━━━━━━━━━━━ By: @DataScience4 ✨

💡 Top 10 More Python Clean Code Practices 1. Use Ternary Operators for Simple Conditionals (Replaces a multi-line if/else block for simple assignments.) Cluttered Way:

is_adult = False
age = 20
if age >= 18:
    is_adult = True

Clean Way:

age = 20
is_adult = True if age >= 18 else False

2. Use str.join() for Concatenating Strings in a List (More efficient and readable than using + in a loop.) Cluttered Way:

words = ["hello", "world", "this", "is", "python"]
sentence = ""
for word in words:
    sentence += word + " "

Clean Way:

words = ["hello", "world", "this", "is", "python"]
sentence = " ".join(words)

3. Use collections.defaultdict for Grouping or Counting (Avoids manual key checking when appending to lists or incrementing counters.) Cluttered Way:

data = [('fruit', 'apple'), ('veg', 'carrot'), ('fruit', 'banana')]
grouped = {}
for category, item in data:
    if category not in grouped:
        grouped[category] = []
    grouped[category].append(item)

Clean Way:

from collections import defaultdict

data = [('fruit', 'apple'), ('veg', 'carrot'), ('fruit', 'banana')]
grouped = defaultdict(list)
for category, item in data:
    grouped[category].append(item)

4. Use collections.namedtuple for Simple Data Objects (Provides readable attribute access instead of relying on numeric indices.) Cluttered Way:

point = (10, 20)
# Unclear what point[0] or point[1] represents
if point[0] > 5:
    print("X is greater than 5")

Clean Way:

from collections import namedtuple

Point = namedtuple('Point', ['x', 'y'])
point = Point(10, 20)
if point.x > 5:
    print("X is greater than 5")

5. Use Argument Unpacking (* and **) (Passes all items from a list or dictionary as arguments to a function.) Cluttered Way:

def print_coords(x, y, z):
    print(f"X: {x}, Y: {y}, Z: {z}")

coords = [1, 2, 3]
print_coords(coords[0], coords[1], coords[2])

Clean Way:

def print_coords(x, y, z):
    print(f"X: {x}, Y: {y}, Z: {z}")

coords_list = [1, 2, 3]
print_coords(*coords_list)

coords_dict = {'x': 4, 'y': 5, 'z': 6}
print_coords(**coords_dict)

6. Use any() and all() for Boolean Checks on Iterables (More declarative and concise than manual loops with a flag variable.) Cluttered Way:

numbers = [-1, -2, 5, -4]
has_positive = False
for num in numbers:
    if num > 0:
        has_positive = True
        break

Clean Way:

numbers = [-1, -2, 5, -4]
has_positive = any(num > 0 for num in numbers)

7. Prefer Generator Expressions for Large Datasets (They don't store the entire sequence in memory, making them highly efficient.) Cluttered Way (can cause high memory usage):

total = sum([i * i for i in range(1000000)])

Clean Way (memory efficient):

total = sum(i * i for i in range(1000000))

8. Use Destructuring for More Powerful Unpacking (A clean way to assign elements from a sequence to multiple variables.) Cluttered Way:

numbers = [1, 2, 3, 4, 5]
first = numbers[0]
last = numbers[-1]

Clean Way:

numbers = [1, 2, 3, 4, 5]
first, *middle, last = numbers
# first = 1, middle = [2, 3, 4], last = 5

def process_data(data):
    if data is None:
        return "Error: No data provided."
    if not isinstance(data, list) or not data:
        return "Error: Invalid data format."

    # ... logic is now at the top level ...
    print("Processing data...")
    return "Done"

#Python #CleanCode #Programming #BestPractices #CodingTips ━━━━━━━━━━━━━━━ By: @DataScience4 ✨

💡 Top 10 Python Clean Code Practices 1. Use List Comprehensions for Simple Loops (Replaces verbose for loops for creating lists.) Cluttered Way:

squares = []
for i in range(10):
    squares.append(i * i)

Clean Way:

squares = [i * i for i in range(10)]

2. Use enumerate for Index and Value (Avoids manual index tracking with range(len(...))).) Cluttered Way:

items = ['a', 'b', 'c']
for i in range(len(items)):
    print(i, items[i])

Clean Way:

items = ['a', 'b', 'c']
for i, item in enumerate(items):
    print(i, item)

3. Use Context Managers for Resources (Ensures resources like files are properly closed, even if errors occur.) Cluttered Way:

f = open('my_file.txt', 'w')
try:
    f.write('hello world')
finally:
    f.close()

Clean Way:

with open('my_file.txt', 'w') as f:
    f.write('hello world')

4. Use Dictionary .get() for Safe Key Access (Prevents KeyError and avoids verbose if key in dict checks.) Cluttered Way:

my_dict = {'name': 'Alice'}
if 'age' in my_dict:
    age = my_dict['age']
else:
    age = 0

Clean Way:

my_dict = {'name': 'Alice'}
age = my_dict.get('age', 0)

5. Use F-Strings for Formatting (More readable and often faster than other string formatting methods.) Cluttered Way:

name = "Bob"
age = 30
message = "Hello, " + name + "! You are " + str(age) + " years old."
# Or: message = "Hello, {}! You are {} years old.".format(name, age)

Clean Way:

name = "Bob"
age = 30
message = f"Hello, {name}! You are {age} years old."

6. Use Unpacking to Swap Variables (A concise, Pythonic way to swap values without a temporary variable.) Cluttered Way:

a = 5
b = 10
temp = a
a = b
b = temp

Clean Way:

a = 5
b = 10
a, b = b, a

7. Check for Empty Sequences Correctly (Leverages Python's "truthiness" for more readable code.) Cluttered Way:

my_list = []
if len(my_list) == 0:
    print("List is empty!")

Clean Way:

my_list = []
if not my_list:
    print("List is empty!")

8. Use Underscores for Unused Variables (Signals to other developers that a variable is intentionally ignored.) Cluttered Way:

# 'i' is created but never used
for i in range(5):
    print("Hello")

Clean Way:

for _ in range(5):
    print("Hello")

9. Chain Comparison Operators (Makes numerical range checks more intuitive and readable.) Cluttered Way:

x = 10
if x > 5 and x < 15:
    print("x is between 5 and 15")

Clean Way:

x = 10
if 5 < x < 15:
    print("x is between 5 and 15")

10. Return from a Function Early (Reduces nesting and improves readability by handling edge cases or invalid states first.) Cluttered Way:

def process_data(data):
    if data is not None:
        if isinstance(data, list) and len(data) > 0:
            # ... deep nested logic here ...
            print("Processing data...")
            return "Done"
        else:
            return "Error: Invalid data format."
    else:
        return "Error: No data provided."

Clean Way:

# Check if `n > 0` and `(n & (n - 1)) == 0`.

• Pow(x, n): Implement pow(x, n).

# Use exponentiation by squaring for an O(log n) solution.

• Majority Element:

# Boyer-Moore Voting Algorithm for an O(n) time, O(1) space solution.

• Excel Sheet Column Number:

# Base-26 conversion from string to integer.

• Valid Number:

# Use a state machine or a series of careful conditional checks.

• Integer to English Words:

# Handle numbers in chunks of three (hundreds, tens, ones) with helper functions.

• Sqrt(x): Compute and return the square root of x.

# Use binary search or Newton's method.

• Gray Code:

# Formula: `i ^ (i >> 1)`.

• Shuffle an Array:

# Implement the Fisher-Yates shuffle algorithm.

IX. Python Concepts • Explain the GIL (Global Interpreter Lock):

# Conceptual: A mutex that allows only one thread to execute Python bytecode at a time in CPython.

• Difference between __str__ and __repr__:

# __str__ is for end-users (readable), __repr__ is for developers (unambiguous).

• Implement a Context Manager (with statement):

class MyContext:
    def __enter__(self): # setup
        return self
    def __exit__(self, exc_type, exc_val, exc_tb): # teardown
        pass

• Implement itertools.groupby logic:

# Iterate through the sorted iterable, collecting items into a sublist until the key changes.

#Python #CodingInterview #DataStructures #Algorithms #SystemDesign ━━━━━━━━━━━━━━━ By: @DataScience4 ✨

# Greedy. Add profit `prices[i] - prices[i-1]` whenever it's positive.

• Coin Change 2: Number of combinations that make up an amount.

# Unbounded knapsack DP. `dp[i]` is the number of ways to make amount `i`.

• Minimum Path Sum: Find the min path sum from top-left to bottom-right in a grid.

# 2D DP. `dp[i][j] = grid[i][j] + min(dp[i-1][j], dp[i][j-1])`.

• House Robber II: Houses are in a circle.

# Run the standard House Robber algorithm twice: once excluding the first house, once excluding the last.

• Palindromic Substrings: Count how many substrings are palindromic.

# Expand from center for every possible center (2n-1 centers).

• Longest Palindromic Subsequence:

# 2D DP. `dp[i][j]` = length of LPS in `s[i:j+1]`.

• Target Sum: Find ways to assign + or - to numbers to reach a target.

# DP or backtracking with memoization.

• Letter Combinations of a Phone Number:

# Classic backtracking problem.

• Knight's Shortest Path on a Chessboard:

# Use Breadth-First Search (BFS).

• Generate All Subsequences of a String:

# Backtracking: at each character, either include it or don't.

• Interleaving String:

# 2D DP. `dp[i][j]` is true if `s1[:i]` and `s2[:j]` can form `s3[:i+j]`.

• Paint House:

# Simple 1D DP. Track the min cost to paint the current house each of the three colors.

VI. Sorting, Searching & Heaps • K Closest Points to Origin:

# Use a max-heap of size k or `heapq.nsmallest`.

• Find Kth Largest Element in a Stream:

# Maintain a min-heap of size k.

• Median of Two Sorted Arrays:

# Binary search on the smaller array to find the correct partition.

• Find Median from Data Stream:

# Use two heaps: a max-heap for the lower half and a min-heap for the upper half.

• Time Based Key-Value Store:

# Store values in a list sorted by timestamp for each key. Use binary search (`bisect_right`) for lookups.

• Reorganize String: Rearrange so no two adjacent characters are the same.

# Greedy approach with a max-heap or by counting character frequencies.

• Wiggle Sort II: Reorder so nums[0] < nums[1] > nums[2] < ....

# Find the median, then use a three-way partition and clever index mapping.

• Pancake Sorting:

# Find the max, flip it to the front, then flip it to its correct sorted position. Repeat.

• Custom Sort String:

# Use a hash map to count chars in the string, then build the result based on the custom order.

VII. Design Questions • Design a Logger Rate Limiter:

# Use a hash map to store the last printed timestamp for each message.

• Design Tic-Tac-Toe:

# Store counts for rows, columns, and diagonals to check for a win in O(1).

• Design an In-Memory File System:

# Use a Trie-like structure where each node is a directory/file.

• Design a Hit Counter:

# Use a queue or deque to store timestamps of hits within the last 5 minutes.

• Design TinyURL:

# Map a long URL to a unique hash or incrementing ID, then convert to a base-62 string.

• Design a Web Crawler:

# Use BFS to explore links and a set to keep track of visited URLs.

• Design Twitter's Data Structures:

# Hash maps for users, tweets. A list/deque for a user's own tweets. A more complex structure for the news feed.

• Design Search Autocomplete System:

# Use a Trie (Prefix Tree) where nodes store search frequency.

VIII. Bit Manipulation & Math • Power of Two: