Python Database Connectors & Cursors Explained with SQLite

🧠 Python Concept That Tracks Object Lifetime: __del__ (Destructor) Objects don’t just appear… they also disappear 👀 🤔 What Is __del__? It runs when an object is about to be destroyed (garbage collected). 🧪 Example class File: def __init__(self, name): self.name = name print("Opened", name) def __del__(self): print("Closed", self.name) f = File("data.txt") del f ✅ Output Opened data.txt Closed data.txt 🧒 Simple Explanation 📚 Imagine borrowing a book . When you return it, the librarian checks it back in. That final step = __del__. 💡 Why This Matters ✔ Resource cleanup ✔ Debugging lifetimes ✔ Memory-sensitive systems ✔ Advanced object design ⚠️ Important Reality ❗__del__ timing is not guaranteed. ❗Depends on garbage collection. ❗So avoid critical logic here. ⚡ Real Advice Prefer: with open(...) as f: over relying on __del__. 🐍 In Python, objects have lifecycles 🐍 __del__ is the final chapter — 🐍 but one you should use carefully. #Python #PythonTips #PythonTricks #AdvancedPython #CleanCode #LearnPython #Programming #DeveloperLife #DailyCoding #100DaysOfCode

I’m really happy to share something small but meaningful to me 😊 I just published my first Python package on PyPI — Notebook-Playlink 🎉 It allows you to render YouTube videos and any web link directly inside Jupyter Notebook or Google Colab. No switching tabs. No breaking workflow. Everything stays inside the notebook. What started as a tiny utility for my own use during notebooks and demos slowly turned into a proper package. Along the way, I learned a lot more than I expected — about packaging, structuring projects, writing cleaner code, handling dependencies, and thinking like a real software engineer instead of just writing scripts. Why I built this? Because during teaching, research demos, and data science workflows, I often needed to show videos or web content — and constantly switching between tabs was annoying. So I thought, why not make it seamless? Now you can simply: pip install notebook-playlink and then: from notebook_playlink import inline_playlink inline_playlink("your_link_here") That’s it. This project may look simple from the outside, but shipping something to PyPI, documenting it properly, and making it usable for others gave me a completely different level of confidence. If you work with Jupyter, Colab, teaching notebooks, or data science reports — you might find it helpful. GitHub: https://lnkd.in/gj5dU98V PyPI: https://lnkd.in/gnUkWFEZ If you check it out and like it, a ⭐ would honestly mean a lot. Small step. Big learning. More to come #Python #PyPI #OpenSource #JupyterNotebook #GoogleColab #SoftwareDevelopment #DataScience #Boktiar Ahmed Bappy #Inception BD

🚀 Day 11/30 | LeetCode 3190 – Minimum Operations to Make Array Elements Divisible by 3 Problem: Given an integer array nums, in one operation you can increment or decrement any element by 1. Return the minimum number of operations required to make all elements divisible by 3. 🧠 Approach For any number: If num % 3 == 0 → no operation needed If num % 3 == 1 → 1 operation needed If num % 3 == 2 → 1 operation needed Because: 1 step can either increase or decrease to nearest multiple of 3 So the problem becomes: 👉 Count how many numbers are not divisible by 3 ⏱️ Complexity Time Complexity: O(n) Space Complexity: O(1) 🧾 Python Code class Solution: def minimumOperations(self, nums): return sum(i % 3 != 0 for i in nums) ✅ Result Accepted ✅ Runtime: 0 ms (Beats 100%) Clean & concise solution 🎯 Key Learning Sometimes problems look complex but reduce to: 👉 Observing mathematical patterns 👉 Using modulo smartly Writing concise Python like this improves readability and efficiency. 🔖 Hashtags #LeetCode #30DaysOfLeetCode #Day11 #Python #Math #DSA #ProblemSolving #CodingJourney #SoftwareEngineering #TechCommunity

If your Python class is mostly storing data, you probably don’t need to write all that boilerplate. Take a simple example. Most of us used to write classes like this: - Define __init__ - Assign every field manually - Add __repr__ for debugging - Implement __eq__ for comparisons It works — but it’s repetitive. Now look at this: from dataclasses import dataclass @dataclass class Car: make: str model: str year: int That’s enough. Python automatically generates: • __init__ • __repr__ • __eq__ • Optional ordering methods • Optional hashing Same behavior. Far less code. Why this matters: • Cleaner classes • Fewer mistakes • Built-in comparison logic • Readable debug output • Type hints included And you can go further: • Make objects immutable using "frozen=True" • Enable sorting using "order=True" • Avoid shared mutable defaults with "field(default_factory=list)" • Add validation using "__post_init__" • Convert to dict with "asdict()" • Create updated copies using "replace()" Dataclasses are ideal when your class is primarily a "data container". They reduce noise and make intent obvious. If you're still manually writing constructors for simple data models, there’s a cleaner way. #Python #SoftwareEngineering #CleanCode #BackendDevelopment

Day 15 — File Handling: Working with Real Data So far, your programs lived in memory. Now they start interacting with the real world. File handling allows Python to read from and write to files — which means your programs can store data permanently. Today you learned: • How to open files using open() • The difference between read, write, and append modes • How to use with statements for safe file handling • Why closing files properly matters • How to read data line by line This is where Python becomes practical. File handling powers: • Logs and reports • Data storage • Configuration files • Real-world automation tools If your program can store and retrieve data, it becomes more than just a temporary script. Mini Challenge: Create a text file, write three lines into it, then read and print its contents using a with statement. Post your solution in the comments. I’m sharing Python fundamentals — one focused concept per day. Designed to move you from basic syntax to real-world capability. Next up: Object-Oriented Programming — thinking in objects and structure. Working with multiple files and testing outputs is much easier in PyCharm by JetBrains, especially with its built-in file explorer and debugging tools. Follow for the full Python series. Like • Save • Share with someone learning Python. #Python #LearnPython #PythonBeginners #FileHandling #Programming #CodingJourney #Developer #Tech #JetBrains #PyCharm

🧠 Python Concept That Explains super() Magic: Cooperative Multiple Inheritance 💫 super() isn’t “call parent”. 💫 It’s “call next in MRO”. 🤔 The Surprise class A: def hello(self): print("A") class B(A): def hello(self): print("B") super().hello() class C(A): def hello(self): print("C") super().hello() class D(B, C): pass D().hello() ✅ Output B C A Why did C run? 🤯 🧠 Because super() follows MRO D → B → C → A Each class calls the next one. 🧒 Simple Explanation Imagine passing a message in line 👧👦👨 Each person: 💻 says their part 💻 passes to next 💻 That chain = cooperative inheritance. 💡 Why This Matters ✔ Multiple inheritance ✔ Framework mixins ✔ super() correctness ✔ Avoid duplicate calls ⚠️ Important Rule 🐍 Every class must use super() or chain breaks ❌ 🐍 super() isn’t about parents. 🐍 It’s about cooperation 🐍 Python classes form a chain — not a tree. #Python #PythonTips #PythonTricks #AdvancedPython #CleanCode #LearnPython #Programming #DeveloperLife #DailyCoding #100DaysOfCode

🚀 Day 45 of #100DaysOfCode ✅ Solved: Binary Gap (LeetCode 868) Today’s problem was about finding the longest distance between two consecutive 1s in the binary representation of a number. 🔎 Problem Insight: Given a positive integer n, convert it into binary and calculate the maximum distance between adjacent 1s. 💡 Key Idea: Instead of converting the number into a string, we can directly use bit manipulation: Traverse each bit using n & 1 Track the position of the previous 1 Update the maximum distance whenever a new 1 is found ⚡ Optimized Python Solution (O(log n) time | O(1) space) Python Copy code class Solution: def binaryGap(self, n: int) -> int: last = -1 max_dist = 0 position = 0 while n > 0: if n & 1: if last != -1: max_dist = max(max_dist, position - last) last = position n >>= 1 position += 1 return max_dist 🧠 What I Learned: Bitwise operations can make solutions more efficient Always think beyond string conversion for binary problems Tracking positions smartly reduces extra space usage Consistency > Motivation 🔥 One problem at a time towards mastering Data Structures & Algorithms. #LeetCode #ProblemSolving #Python #BitManipulation #DSA

🚀 Do you use Pandas in your day-to-day programming? Pandas just hit a major milestone with release of pandas 3.0. If you work with data, here is a quick breakdown of what's new and what might break in your current code. 1. Arrow-backed data becomes the default 2. .append() is fully removed 3. Strict typing for string and mixed columns 4. Datetime & timezone rules are stricter 5. Copy‑on‑Write is now mandatory 6. Indexing is predictable and strict 7. No more implicit dtype coercion If you maintain a production pipeline/notebook now might be a time to modernize it. ✔ My 2 cents: Upgrade to Pandas 2.3 first to address any deprecation warnings before completely switching Pandas 3.x #Pandas #Python #Data

Built a tiny plotting tool in Python with vibe-coding to experience what it feels like. I wanted something lightweight for making figures without having to jump between coding and plotting software since trying to tweak plots in python can be quite tedious when writing it. This “mini-Illustrator” has lots of bugs for sure, but I think it sort of works - It will ingest csv/tsv files and plot things using seaborn/matplotlib underneath the hood, which can be adjusted and reshaped all in one interactive canvas. https://lnkd.in/gsJGe35H