"Max Vowels in Substring of Length K"

✅Day 68 of #100DaysOfLeetCode 1.📌Problem: Given two binary strings a and b, return their sum as a binary string. 2.🟢 Difficulty: easy 3.📍Topic: Add Binary, string 4.🎯 Goal: Add two binary strings and output the result as a binary string. 5.🧠Key idea: Approach 1: Use two pointers moving from right to left on both strings, add corresponding digits and carry, append the sum modulo 2 to the result, and handle final carry if any. Reverse the result at the end to get the correct binary output. #100DaysOfCode #LeetCode #Programming #Coding #Java #SoftwareDevelopment #ProblemSolving #Developer #CodeNewbie #CodingPractice #DataStructures #Algorithms #WebDevelopment #Tech #Python #Computersciencebest

How you delete useless billion dollar companies and save planet earth by increasing energy efficiency? One open source project at a time. Next up is a specialized debugger and self-hosting compiler that reaches deep into the tentacles of legacy C and Python and SMACKS IT...into #rust. Likely the final tool of the year will be Leon The Professional (LTP) and it will simply convert a repo with ANY C or Python to Rust.... https://lnkd.in/efJiuCCC

#100DaysLearningChallenge with Saurabh Shukla Shukla Sir 🎯 Day 36: GUI Unit Converter with Python Tkinter Today, I built a Unit Converter Application using Python’s Tkinter library! ⚙️✨ This project helped me combine GUI design with logic — allowing users to easily convert values between different units (like length, weight, and temperature) through an interactive interface. 🧮💡 Tkinter made it super simple to create input fields, dropdowns, and buttons, and to handle user actions efficiently. A perfect hands-on exercise to strengthen both Python logic and GUI programming skills! 💻 📂 Source Code (GitHub): https://lnkd.in/gZwQ2Ybx 📹 Video Reference (MySirG): https://lnkd.in/gmu-HZrJ #100DaysLearningChallenge #Day36 #Python #Tkinter #GUI #UnitConverter #MySirG #SaurabhShuklaSir #LearnToCode #DeveloperJourney #PythonProgramming

💡 Day 64 of #LeetCode365 Problem: 338. Counting Bits Category: Bit Manipulation | Dynamic Programming Today’s problem was all about counting 1s in binary numbers — basically, checking how “on” each number is 💡😅 💻 Approach: 👉 Use a DP array ans to store counts of 1s for each number. 👉 For each number: If it’s even ➡️ same count as i/2 If it’s odd ➡️ one more than (i−1) ans = [0, 1, 1] for i in range(3, n + 1): if i % 2 == 0: ans.append(ans[i // 2]) else: ans.append(ans[i - 1] + 1) return ans[:n + 1] ⚙️ Complexity: ⏱ O(n) | 💾 O(n) 💡 Lesson: Bits are like people — some are off, some are on, but together, they make the system work 😎💻 #LeetCode #Python #DynamicProgramming #BitManipulation #CodingHumor #100DaysOfCode #FunnyCode

Your terminal doesn’t have to be gray and boring! With simple ANSI escape codes, you can make your terminal output colorful and readable: ✅ Green = success ❌ Red = failure ⚪ Gray = skipped 🔵 Cyan = progress Works in Python, Node.js, Go, Bash — just a few characters can make logs and CLI tools much clearer. Read the guide here: https://lnkd.in/eiaywrBn #TerminalTips #CLI #DevTools #Programming #Debugging #SoftwareDevelopment #ANSIColors

Day 17 – Reverse an Array In-Place 💡 Problem: Given an array, reverse it without using any extra array. Example: Input → [10, 20, 30, 40, 50] Output → [50, 40, 30, 20, 10] 🧠 Approach (Two-Pointer Technique): 1️⃣ Initialize two pointers: left = 0, right = n - 1 2️⃣ Swap arr[left] and arr[right] 3️⃣ Move both pointers → left++, right-- 4️⃣ Repeat until left >= right Time Complexity: O(n) Space Complexity: O(1) Your Turn: Can you extend this logic to reverse a portion of the array (say, indices 2 to 6)? Drop your version below 👇 #CodeWithTanseer #DSA #Java #Python #CodingChallenge #ProblemSolving #Arrays #LogicBuilding #TwoPointerTechnique #SoftwareEngineer #BackendDeveloper #InterviewPrep

I think programming languages fall into 3 big categories. 🐍 Flexible scripters: Loosely typed, perfect for scripting and quick prototypes. Python is my go to language here. 🏭Enterprise enablers: Compiled, (usually) object-oriented, Virtual Machine-based (VM) and Garbage Collected (GC) like Java & C#. I think this category deserves Go. ⚡ Bare-Metal performers: Compiled, no GC and control over memory. Ill take Rust over C/C++ for its safety and modern tooling. All different tools with the same goal: solving problems. What is your favorite category to work in? #Programming #Python #GoLang #RustLang #SoftwareDevelopment #HookPrograms

My colleague, Shyamnath Premnadh, Software Engineer at Qt Group, explains how Qt enables modern multi-language development via Python. The session covers using shiboken and PySide6 to write Python with Qt’s C++ framework, practical tips for simplifying C++ apps, and upcoming QtQuick/QML–Python integration improvements. Check out the presentation here: https://lnkd.in/e2QqqFhe

LeetCode 90-Day Challenge – Day 73 Problem: Interleaving String Difficulty: Medium Problem: We’re given three strings s1, s2, and s3. We need to determine if s3 can be formed by interleaving s1 and s2. An interleaving means taking characters from both strings in order but not necessarily alternating evenly as long as the original order of each string is preserved. Solution approach: This problem can be solved using Dynamic Programming. We create a 2D table dp[i][j] where each cell represents whether the first i characters of s1 and first j characters of s2 can form the first i + j characters of s3. We fill this table by checking if the current character from s1 or s2 matches the corresponding character in s3. If either condition holds true, we mark that state as valid. The answer will be the value at dp[len(s1)][len(s2)]. #LeetCode #90DaysOfCode #Python #DynamicProgramming #LeetCodeChallenge #CodingJourney #ProblemSolving

My colleague, Shyamnath Premnadh, Software Engineer at Qt Group, explains how Qt enables modern multi-language development via Python. The session covers using shiboken and PySide6 to write Python with Qt’s C++ framework, practical tips for simplifying C++ apps, and upcoming QtQuick/QML–Python integration improvements. Check out the presentation here: https://lnkd.in/e8vAQuhW