Len vs Count in Python: Understanding Container Length and Value Frequency

🚀 Day 2 of #100DaysOfCode Today I built a Tip Calculator using Python 🐍 🔹 The program: Takes the total bill amount Lets users choose a tip percentage (10%, 12%, 15%) Splits the bill among multiple people Calculates how much each person should pay 💡 Example: Bill: $150 Tip: 12% People: 5 ➡️ Each person pays: $33.60 🧠 What I learned: Taking user input in Python Type conversion (int, float) Basic calculations Formatting output using f-strings This project helped me understand how small programs can solve real-world problems. Looking forward to building more! 🔥 #Python #100DaysOfCode #CodingJourney #BeginnerProjects #LearnToCode

Working with messy real-world datasets taught me one thing: The cleaning step takes longer than the actual analysis. So I spent the last few weeks building dfdoctor - an open-source Python library that audits your DataFrame, tells you what’s wrong, and helps you fix it systematically instead of manually. It helps you quickly understand what’s broken and what to fix first. The part I'm most proud of: 5 correlation methods (including Kendall τ and Phi-k) implemented from scratch in pure numpy - no scipy dependency anywhere. 164 tests. CI passing across Python 3.9–3.12. Try it: pip install dfdoctor https://lnkd.in/e-ChV6mE #Python #OpenSource #DataEngineering #Pandas #EDA #DataScience

🌟 New Blog Just Published! 🌟 📌 Boost Python Speed: Easy Hacks Every Beginner Can Use 🚀 📖 You’ve probably stared at a script that should finish in seconds but drags on for minutes, and wondered, “What did I do wrong?” I know that feeling-it trips everyone up the first time a loop seems to.... 🔗 Read more: https://lnkd.in/dgeDzs9N 🚀✨ #python-performance #speed-hacks #beginner-tips

Machine Learning Image Data using wand #machinelearning #datascience #imagedata #wand Wand is a ctypes-based simple ImageMagick binding for Python. Wand is a ctypes-based simple ImageMagick binding for Python, supporting 2.7, 3.3+, and PyPy. All functionalities of MagickWand API are implemented in Wand. https://lnkd.in/gr_sVmdd

Python Clarity Series – Episode 16 Topic: range() Confusion (Start, Stop, Step) 📌 range() looks simple… but many students misunderstand it. Basic form: range(start, stop, step) Example: for i in range(2, 10, 2): print(i) Output: 2 4 6 8 👉 start → where counting begins 👉 stop → where counting stops (NOT included) 👉 step → increment value ⚠️ Important rule: range() always excludes the stop value. 💡 Memory Trick: Range goes UP TO but not INCLUDING the stop value. Example: range(5) Output: 0 1 2 3 4 Students often expect 5 — but it never appears. Small detail. Big exam mistake. #PythonBasics #LoopConcepts #StudentLearning

🐍 Week 17 – Refining My Python Skills 🐍 This was a shorter week due to some personal commitments, but I focused on implementing the quicksort algorithm. Like last week with merge sort, I wanted to deeply understand how quicksort works. Here are the key concepts I worked on: - Implemented a separate partition function to split around a pivot. In my approach, I used three buckets (left, middle, right) to handle duplicates more cleanly and avoid unnecessary comparisons. - Created a quick_sort function to implement the main algorithm, recursively sorting the partitions until the base case was met. After practicing merge sort, quicksort felt more intuitive, and the concepts connected more easily. In Week 18, I plan to practice implementing the Luhn Algorithm. #Python #CodingJourney #LearningInPublic

🚀 Day 9 of #100DaysOfCode Today’s problem: Valid Anagram ✅ 🔍 What I learned: How to check if two strings are anagrams Importance of sorting vs frequency counting Strengthened my understanding of strings & hashing concepts 💡 Approach: I used a simple and clean method: Sort both strings Compare them If equal → Anagram ✔️ 📊 Result: ✅ All test cases passed (54/54) ⏱️ Runtime: 19 ms 🔥 Key takeaway: Sometimes a simple solution is enough, but there’s always room to optimize using hash maps for better performance. Consistency > Perfection 💯 Let’s keep going! #LeetCode #DSA #CodingJourney #Day9 #Python #ProblemSolving

DSA Tip: Queue If you process tasks in random order… you’ll run into problems. Use a Queue. It follows FIFO (First In, First Out) the first item added is the first to be removed. From print jobs to request handling, queues keep systems organized and fair. Insight: Order isn’t just important, it determines how systems behave. Quick Challenge: If you enqueue A, B, C… which comes out first? Drop your answer, I’ll review the best ones. FOLLOW FOR MORE DSA TIPS & INSIGHTS #DSA #Queue #Python #CodingTips #LearnToCode

🚀 Day 12 of Consistency | #75DaysLeetCodeChallenge 🧠 Today’s Problem : 3Sum (#15) 💡 Key Learning: This problem teaches how to efficiently find triplets using sorting + two-pointer technique, while carefully handling duplicates. ⚡ Approach: Sort the array → fix one element (i) → use two pointers (l, r) → If sum == 0 → store triplet & skip duplicates If sum < 0 → move l++ If sum > 0 → move r-- 🧠 Why this works: Reduces complexity from O(n³) → O(n²) Avoids duplicate triplets Efficient use of sorting + two pointers 🔥 Result : ✔️ Runtime: 574 ms (Beats 75.21%) 📈 Problems like this build strong intuition for tackling complex array & pattern-based questions. Consistency is compounding. Keep going. 💪 #Day12 #LeetCode #DSA #CodingJourney #100DaysOfCode #Python #TwoPointers #Consistency