Sumit Sharma’s Post

✅ Day 90 of 100 Days LeetCode Challenge Problem: 🔹 #476 – Number Complement 🔗 https://lnkd.in/gzE6gM7d Learning Journey: 🔹 Today’s problem focused on finding the complement of a number by flipping its binary bits. 🔹 I first converted the integer to its binary representation using bin(num)[2:]. 🔹 Then, I created a helper function to flip each bit: • '0' → '1' • '1' → '0' 🔹 After generating the flipped binary string, I converted it back to an integer using int(..., 2). 🔹 Returned the final complemented value. Concepts Used: 🔹 Binary Representation 🔹 Bit Manipulation 🔹 String Traversal 🔹 Base Conversion Key Insight: 🔹 The complement operation is essentially a bitwise NOT, but only within the significant bits of the number (ignoring leading zeros). 🔹 Converting to binary simplifies the flipping logic for beginners. Complexity: 🔹 Time: O(log n) 🔹 Space: O(log n) #LeetCode #Algorithms #DataStructures #CodingInterview #100DaysOfCode #Python #ProblemSolving #LearningInPublic #TechCareers

𝗜𝘁 𝘀𝘁𝗮𝗿𝘁𝘀 𝘄𝗶𝘁𝗵 𝗮 𝗻𝗼𝗯𝗹𝗲 𝗶𝗻𝘁𝗲𝗻𝘁𝗶𝗼𝗻: "𝗜 𝗮𝗺 𝗴𝗼𝗶𝗻𝗴 𝘁𝗼 𝘀𝗮𝘃𝗲 𝘁𝗶𝗺𝗲." It ends with you debugging a Python script at 2 AM for a process that you could have finished by hand before lunch. Engineers love to solve problems with code. But sometimes, code is the most expensive solution. Here is the math on why "𝗔𝘂𝘁𝗼𝗺𝗮𝘁𝗶𝗻𝗴 𝗘𝘃𝗲𝗿𝘆𝘁𝗵𝗶𝗻𝗴" is actually hurting your productivity. 𝗥𝗲𝗴𝗶𝘀𝘁𝗲𝗿 𝗻𝗼𝘄 : https://lnkd.in/dkVrmCHc #DeveloperLife #Automation #Productivity #IndieHacker #Engineering #TheVentureBuild

✅ Day 92 of 100 Days LeetCode Challenge Problem: 🔹 #2011 – Final Value of Variable After Performing Operations 🔗 https://lnkd.in/gX-JQNUJ Learning Journey: 🔹 Today’s problem was about evaluating a sequence of increment and decrement operations. 🔹 I initialized a variable ans = 0 to track the value. 🔹 Used a hashmap to map each operation to its effect: • "++X" and "X++" → +1 • "--X" and "X--" → -1 🔹 Iterated through the operations and updated ans accordingly. 🔹 Returned the final computed value. Concepts Used: 🔹 HashMap / Dictionary 🔹 String Matching 🔹 Simple Simulation Key Insight: 🔹 Instead of using multiple condition checks, mapping operations to values simplifies logic and improves readability. Complexity: 🔹 Time: O(n) 🔹 Space: O(1) #LeetCode #Algorithms #DataStructures #CodingInterview #100DaysOfCode #Python #ProblemSolving #LearningInPublic #TechCareers

Building this trading bot taught me how powerful clean architecture, modular design, and API‑driven automation can be. My goal wasn’t to create a complex system — but a simple, reliable, and transparent bot that anyone can understand. This project helped me sharpen my Python fundamentals, improve my debugging discipline, and design a structure that scales. Excited to keep improving it with strategies, risk checks, and backtesting. - Drafted with the help from Copilot. #Python #TradingBot #AlgorithmicTrading #PythonProjects #Automation #APIDevelopment #CodingJourney #LearningInPublic GIT hub link for code: https://lnkd.in/d_cCwG-r

The goal was simple: take a cluttered directory and transform it into a structured, searchable archive in seconds. Key Features: Sequential Numbering: Automatically renames files based on a custom prefix (e.g., Project_Alpha_001). Extension Filtering: Targets specific file types while leaving others untouched. Error Handling: Prevents accidental overwrites and handles edge cases with duplicate names. 🛠️ The Tech Stack Language: Python Library: os (for navigating the file system and executing renames) 💡 Why Automation Matters It’s not just about saving five minutes today; it’s about building systems that scale. Automating these "micro-tasks" frees up mental bandwidth for the complex problem-solving that actually moves the needle. Check out the snippet below to see how a few lines of code can reclaim your afternoon! #Python #Automation #Coding #Productivity #SoftwareDevelopment #WorkflowOptimization #PythonProgramming Kodbud

I built 4 AI agents from scratch. No LangChain. No AutoGen. Just the Anthropic SDK and Python. Agent 01: answered a Kubernetes question. Cost $0.002. Agent 02: searched the web in real time. Cost $0.18 — 90x more. Here's why that matters. Agent 03: connected to my live Kubernetes cluster and ran kubectl commands autonomously. Agent 04: created a full K8s stack from one text description. The difference between a chatbot and an agent is one while loop. Full breakdown in the article 👇

🚀 Just solved the “Valid Number” problem on LeetCode! This problem looks simple at first glance—but handling edge cases like decimals, signs, and exponents makes it a great test of attention to detail and logical thinking. ✅ Key takeaways: Careful handling of edge cases is crucial Validating input step-by-step can simplify complex parsing problems Writing clean, readable logic beats overcomplicated solutions 💡 Performance: ⚡ Runtime: 3 ms 🧠 Efficient space usage ✅ All test cases passed Problems like this remind me that consistency in practice is what builds strong problem-solving skills. On to the next one! 🔥 #LeetCode #Coding #Python #ProblemSolving #SoftwareEngineering #AIEngineerJourney link of #Solution :- https://lnkd.in/ga9b5pVb

A lot of systems today are built to be “responsive.” I care more about systems that are bounded. That is part of why I made atlas-kvd-demo: a tiny Python toy where state evolves through: K — what the system carries  V — what the world pushes onto it  Δ — what a local event changes The point is simple: instead of jumping from 0 to 100 every time something happens, a system can update in a way that is legible, constrained, and stable. https://lnkd.in/e8WFcFPv Tiny demo. Bigger direction. #Python #SystemsDesign #Simulation #AIEngineering #GitHub #BuildInPublic #Tech

Day 10/100 – DSA Challenge Today’s problem: Move Zeroes (LeetCode 283) What I Learned: The goal was to move all zeroes to the end of an array while maintaining the relative order of non-zero elements — and importantly, doing it in-place. Key Idea: Two-Pointer Technique I used a two-pointer approach: One pointer (fast) iterates through the array Another pointer (slow) tracks where the next non-zero element should go Whenever a non-zero element is found, it is swapped with the element at the slow pointer, ensuring all non-zero elements are shifted forward while zeroes naturally move to the end. Why this approach? Maintains order of elements Works in O(n) time complexity Uses O(1) extra space (in-place) Takeaway: This problem reinforced how powerful the two-pointer technique is for array manipulation problems, especially when constraints require in-place operations. Looking forward to tackling more problems and improving consistency! #Day10 #100DaysOfCode #DSA #Python #CodingJourney #LeetCode #ProblemSolving

🚀 Day 75 of #100DaysOfCode 🔥 LeetCode 179 – Largest Number 💡 Problem: Given a list of non-negative integers, arrange them such that they form the largest possible number. 🧠 Key Insight: Normal sorting won't work here ❌ We need a custom comparator based on string concatenation. 👉 Compare: - ""a + b"" vs ""b + a"" - Whichever gives a larger value should come first. ⚙️ Approach: 1. Convert numbers to strings 2. Sort using custom comparison logic 3. Join the result 4. Handle edge case (like "[0,0] → "0"") ⚡ Complexity: - Time: O(n log n) - Space: O(n) 🎯 Result: ✅ Accepted ⚡ Runtime: 0 ms (100%) 📌 Lesson Learned: Sometimes sorting logic depends on combination, not value. #LeetCode #Python #CodingJourney #DSA #100DaysOfCode #Sorting #ProblemSolving