Finding Smallest & Second Smallest Elements in a List with Python

🔤 DAY 2/30: I CAN NOW MANIPULATE TEXT LIKE A PRO Today I learned string methods in Python - functions that transform text. 📚 WHAT I LEARNED: • .strip() - remove extra spaces (clean user input) • .upper() / .lower() - change case instantly • String slicing - grab specific parts of text [start:end] • .replace() - swap words in seconds 🛠️ PROJECT: Username Validator A program that: 1. Takes any messy username input 2. Cleans it (removes spaces, fixes case) 3. Validates length (5-15 characters) 4. Tells you if it's available 💡 BIGGEST INSIGHT: String methods don't change the original - they create a NEW string. That's why you need to save them: `name = name.strip()` 🐛 BUG I FIXED: Forgot to save the cleaned string - kept getting original. Now I know: methods RETURN values, they don't modify in place. 📂 DAY 2 CODE: https://lnkd.in/gvg2Rh6N 28 days to go. Getting stronger every day. #Python #30DaysOfCode #CodingJourney #LearnToCode

Day 12/365: Checking If a List Is a Palindrome in Python 🔁 Today I solved a classic problem in Python: checking whether a list is a palindrome or not — using the two‑pointer technique with a for-else loop. 🔍 How this works step by step: I start with a list l that has elements arranged symmetrically. To check if it’s a palindrome, I compare elements from both ends: l[0] with l[-1], l[1] with l[-2], and so on. I only need to go till the middle of the list: range(len(l)//2) Inside the loop: If any pair doesn’t match, I print "list is not palindrome" and use break to exit the loop early. The interesting part is the for-else: The else block runs only if the loop finishes without hitting a break. That means all pairs matched, so I print "list is palindrome". 💡 What I learned: How to use the two‑pointer technique to compare elements from start and end efficiently. How Python’s for-else works — the else is tied to the loop, not the if. Why we only need to iterate till the middle of the list for palindrome checking. How the same logic can be reused for: checking if a string is a palindrome, validating symmetric data in lists and arrays. Day 12 done ✅ 353 more to go. If you have ideas like: checking palindromes while ignoring cases/spaces in strings, handling mixed data types in lists, or checking palindromes in other data structures, drop them in the comments — I’d love to try them next. #100DaysOfCode #365DaysOfCode #Python #LogicBuilding #TwoPointers #Lists #CodingJourney #LearnInPublic #AspiringDeveloper

🚀 Day 4 of #14DaysOfPython 🐍 Today’s focus: Strings (Core Concepts) — working with text in Python. 💡 Easy way to understand strings: 🔹 Why strings? 👉 Almost every real-world program deals with text (names, inputs, data processing) 💡 Core Concepts (Logic First): 🔹 String Indexing & Slicing 👉 Access characters using position s[0] → first character s[-1] → last character s[start:end] → substring 🔹 String Traversal 👉 Loop through characters for loop → simple iteration while loop → more control 🔹 Built-in Methods 👉 Modify strings easily lower(), upper() → case change strip() → remove spaces replace() → replace characters 🔹 ASCII Basics 👉 Convert between characters and numbers ord('A') → 65 chr(65) → 'A' 🧠 Problems I practiced: Palindrome check Reverse a string Count vowels & consonants Remove spaces from a string ✨ Key takeaway: Strings are not just text — they are data you can manipulate step-by-step using logic. Day 4 done ✅ Moving to Day 5 💪 #HackerRank #Python #ProblemSolving #CodingJourney #Developer #LearningInPublic #codegnan

Day 9 of #30DaysOfPython ✅ Today I stopped letting my code crash. Exception handling. Here's what my scripts looked like before today. You type the wrong thing, Python throws a wall of red text at you, the whole program dies, and you sit there feeling personally attacked. Today I learned how to catch those errors before they explode. Wrap the risky code in a try block, tell Python exactly what to do if something goes wrong in the except block, and your program keeps running like nothing happened. The moment that sold me: I wrote a simple division script. Without exception handling, typing 0 as the divisor crashed everything with a ZeroDivisionError. With a try/except block, it just printed "hey, you can't divide by zero" and moved on. Same error. Completely different experience. The thing that tripped me up: I was writing bare except blocks — catching every possible error without specifying which one. My mentor's voice in my head (okay, it was a Stack Overflow answer) told me that's bad practice. If you catch everything, you also catch errors you didn't know existed and hide real bugs from yourself. Always name the exception. except ValueError, except FileNotFoundError, except ZeroDivisionError. Be specific. The finally block was the other thing that clicked today. Code inside finally runs no matter what — whether the try succeeded or the except caught something. Perfect for cleanup tasks. Closing a connection. Printing a summary. Saying goodbye gracefully. What I covered today: try / except — the basic safety net Catching specific exceptions by name else block — runs only if no error occurred finally block — runs always, no matter what Raising your own errors with raise Today's mini project: a safe calculator. It handles division by zero, invalid inputs, and unknown operations — all without crashing once. Day 9 done. My code finally fails gracefully. 🎯 👇 What's the most unexpected error you've ever had to catch in Python? I want to know what's waiting for me further down this road! #Python #30DaysOfPython #ExceptionHandling #BuildInPublic #CleanCode

🚀 Day 3/30 of My LeetCode Journey (Python + SQL) Showing up daily and building consistency, one problem at a time! 💻🔥 🔹 **Python Problems of the Day** 👉 *1. Move Zeroes* Given an integer array, move all 0’s to the end while maintaining the relative order of non-zero elements. Do it in-place without making a copy. 💡 *Key Concept:* Two-pointer technique for efficient in-place rearrangement. 👉 *2. Remove Element* Given an array and a value, remove all occurrences of that value in-place and return the number of remaining elements. 💡 *Key Concept:* In-place filtering using pointer overwrite approach. 🔹 **SQL Problem of the Day** 👉 *Find Duplicate Emails* Given a `Person` table with an email column, write a query to report all duplicate emails. 💡 *Key Concept:* GROUP BY with HAVING COUNT > 1. Small steps daily = Big progress over time 📈 Staying consistent and enjoying the process! #LeetCode #30DaysChallenge #Python #SQL #CodingJourney #Consistency #ProblemSolving #LearnInPublic

If you’ve ever felt like type hints in Python are getting…out of hand, you’re not alone. In this talk, Carlton Gibson (Django Steering Council) breaks down a real tension: Python was designed to stay dynamic, and type hints were never meant to be mandatory. But today, many teams feel pressure to add them anyway. Consider #Django, for example: • It’s built on dynamic patterns (introspection, minimal boilerplate, etc.). • Static typing often can’t fully represent those patterns. • Adding types can increase complexity without real safety gains. • Sometimes you’re just repeating yourself to satisfy the type checker. So what’s the alternative? Don’t force typing where it doesn’t fit. Keep Python dynamic – and add types where they actually bring value. The key takeaway: Instead of rewriting frameworks like Django, build typed layers on top – keeping flexibility while adding structure where needed. Don’t think “types vs. no types.” Think about using the right tool in the right place. ▶️ Watch the full talk: https://lnkd.in/eptmtpHj #Python #Django #TypeHints #StaticTyping #WebDevelopment

Day 2 of my LeetCode journey 🚀 Today’s problem: Group Anagrams This challenge was all about grouping strings that share the same characters. I approached it using a dictionary + hashing strategy in Python. For each word, I sorted its characters and used that as a key (converted into a tuple), ensuring all anagrams map to the same bucket. Here’s the core logic I implemented: ▪️Traverse the list of strings ▪️Sort each string → convert to tuple → use as dictionary key ▪️Append original string to the corresponding group ▪️Finally, return all grouped values This approach keeps the implementation clean and scalable. Time Complexity: ▪️Sorting each string takes O(k log k) (where k = length of string) ▪️For n strings → O(n * k log k) overall Space Complexity: ▪️O(n * k) for storing grouped anagrams A solid step forward in understanding how hashing + transformations can simplify complex grouping problems. Staying consistent and leveling up daily 💪 #LeetCode #Day2 #Python #DSA #CodingJourney #ProblemSolving

Clean code isn't clever. It's clear. 5 Python patterns every developer should know: 1️⃣ Flatten nested list: flat = [x for sub in nested for x in sub] 2️⃣ Merge dicts (Python 3.9+): merged = dict_a | dict_b 3️⃣ Most frequent item: max(set(lst), key=lst.count) 4️⃣ Swap variables: a, b = b, a 5️⃣ Read + strip file lines: lines = [l.strip() for l in open("file.txt")] --------------- These aren't tricks. They're idiomatic Python. When your code communicates intent: ✅ Reviews go faster ✅ Bugs surface sooner ✅ Onboarding is smoother Write for the developer reading it at 2am before a deployment. That developer is usually you. #Python #CleanCode #Programming #CodingTips #SoftwareEngineering

Day 5/365: Checking Armstrong Numbers in Python 🔢🧠 Today I worked on a classic number theory problem: checking whether a number is an Armstrong number. A number is an Armstrong number if the sum of its own digits each raised to the power of the number of digits is equal to the original number. For example: 153 has 3 digits 1³ + 5³ + 3³ = 1 + 125 + 27 = 153 So 153 is an Armstrong number. What this function does: First, I store a copy of the original number so I can compare at the end. Then I find how many digits the number has using len(str(copy)). Inside the loop, I extract each digit, raise it to the power of the number of digits, and keep adding it to a running sum. Finally, I compare the sum with the original number: If they are equal, it’s an Armstrong number. Otherwise, it’s not. What I learned from this exercise: How to break a number down digit by digit using % 10 and // 10. How to combine math (powers) with loops and conditionals to implement a rule. The importance of keeping a copy of the original value when you are modifying it in a loop. Day 5 done ✅ 360 more to go. If you have any variations of this problem (like finding all Armstrong numbers in a range or handling user input with validation), share them—I’d love to try them out. #100DaysOfCode #365DaysOfCode #Python #LogicBuilding #ArmstrongNumber #NumberTheory #CodingJourney #LearnInPublic #AspiringDeveloper

🚀 Master Python Strings: Beyond the Basics! Ever feel like you're only using upper() and lower()? Python’s string library is massive, and knowing the right method can save you lines of code and hours of debugging. 🐍 The table below is a fantastic "at-a-glance" guide, but did you know about these powerful extras? 💡 Pro-Tips for your next script: The Joiner: .join() is the cleanest way to turn a list into a string. Forget manual loops! Global Matching: Use .casefold() instead of .lower() for internationalized text—it’s much more robust for non-English characters. The Cleaner: While the chart shows .strip(), don't forget .rsplit() if you only need to break down a string from the end. Input Validation: .isalnum() is your best friend for checking if a username or password contains only letters and numbers. Common Catch: Notice len() in the list? It’s actually a built-in function, not a method! You call it like len(text), not text.len(). Also, module is a general programming concept, not a string method. #Python #CodingTips #DataScience #WebDevelopment #PythonProgramming #CleanCode #SoftwareEngineering #LearningToCode