Shemul v1.0.1 Released: Project-Aware CLI for Python

Wow... Can we bolt in other data sources into LabView using this? If we cant get off shelf drivers or integration compatibility - we can bolt into the python bridge?

Recently, I've been experimenting how LLMs can interact with external context through a CLI-based assistant. Using LLaMa 3 and Python, I built a simple terminal-based system focusing on how models can work with real-world data through a concept Model Context Protocol (MCP). This helped me understand how LLMs become more useful when connected with tools and external context, rather than just generating text.

Starting a new routine: Daily Python problem-solving. Day 1 was all about revisiting the fundamentals today. I worked through a few classic logic exercises: a FizzBuzz variant, some conditional logic for grade classification, and a few quick warmup drills. It’s always good to go back to the basics and build a little consistency. Excited to see how far I can push this habit over the next few weeks! You can check out my code for today over on GitHub here: https://lnkd.in/gvvC4yRk #Python #SoftwareEngineering #DeveloperJourney #Day1

SIWES Day 3: Small wins, big clarity Today we dove into Python’s input() function and built this simple Celsius to Fahrenheit converter. Nothing beats seeing your code respond to actual user input instead of hardcoded values. What actually caught me off guard was BODMAS/BEDMAS. I always thought multiplication came before division and addition before subtraction. Turns out they’re on the same level — you just go left to right. You can see it in the formula here. VSCode is finally running smoothly too, so the flow was even better. One step at a time. #SIWES #PythonProgramming #TechJourney #LearningInPublic

Killpy Launches Unified CLI for Python Environment Cleanup 📌 Killpy revolutionizes Python dev cleanup by unifying environment deletion across 11 package managers - from Conda to Pipenv - in one CLI. It smartly targets obsolete artifacts while sparing active setups, slashing disk bloat with zero-risk automation. Perfect for devs drowning in 10–40GB of stale virtual environments. 🔗 Read more: https://lnkd.in/d4n_iGqk #Killpy #Python #Cli #Virtualenvironment #Packagemanager

Day 38/100 – #100DaysOfCode 🚀 Solved LeetCode #2011 – Final Value of Variable After Performing Operations (Python). Today I practiced string handling and simple iteration to compute the final value after a series of operations. Approach: 1) Initialize a variable x = 0. 2) Traverse through each operation in the list. 3) If the operation contains "++", increment x by 1. 4) Otherwise, decrement x by 1. 5) Return the final value of x. Time Complexity: O(n) Space Complexity: O(1) Simple logic but great practice for handling strings and loops 💪 #LeetCode #Python #DSA #Strings #ProblemSolving #100DaysOfCode

Day 06/50 – LeetCode Solved Increasing Triplet Subsequence (#334) Learned how a simple greedy approach can replace brute force: Track two values (first, second) and detect a third larger number. Result: O(n) time | O(1) space Key takeaway: Smart tracking > checking all combinations Dhanraj Sahu #Day06 #LeetCode #DSA #Python #CodingJourney

🚀 Day 85 of #100DaysOfLeetCode 🔍 Problem Solved: Ransom Note (LeetCode 383) Today’s problem was all about efficiently checking whether one string can be constructed from another — a classic hashing / frequency counting concept. ⚡ What I Learned: - Importance of frequency maps (hash tables) - Writing optimized solutions over naive approaches - How built-in methods can simplify logic but may impact performance 📊 Performance: ✅ Runtime: 0 ms (Beats 100%) ✅ Memory: Efficient usage 🔥 Takeaway: Small optimizations and choosing the right data structure can make a huge difference, even in easy problem #Day85 #LeetCode #CodingJourney #Python #DataStructures #ProblemSolving #100DaysOfCode

Day 1 of my LeetCode journey 🚀 🧩 Problem: Minimum Distance to the Target Element (1848) 💡 Approach: Looped through the array and tracked the minimum absolute difference whenever the target appeared. 📚 What I learned today: • How to iterate through a list efficiently • Using abs() to compute absolute difference • Tracking minimum values during iteration • Initializing variables correctly using infinity • Better understanding of loops and conditional checks in Python 🛠 Language Concepts Used: • for-loop • if condition • abs() function • min() logic / running minimum ⏱ Time Complexity: O(n) 📦 Space Complexity: O(1) 🔗 GitHub: https://lnkd.in/gZ23dWkV #LeetCode #Python #DSA #100DaysOfCode #LearningInPublic

🚀 Day 4 of #LeetCode Challenge 🔍 Problem: Reverse Integer 💡 Approach: Reversed the integer digit by digit using modulo (%) and division (/). Extract last digit using % 10 Build reversed number using rev * 10 + digit Handle negative numbers using abs() Checked for 32-bit overflow condition 🧠 Key Concept: Digit manipulation + overflow handling without using extra space. 🔥 #Day4 #LeetCode #Python #DSA #CodingJourney #Consistency