First Open Source Contribution to Falcon Python Framework

Headline: Why stop at 15 digits? 🚀 I’ve always found it frustrating when standard calculators hit a limit and switch to scientific notation or simply give up. Whether it’s massive factorials or high-precision cryptography values, shouldn't our tools be able to handle "the big stuff"? To solve this, I built Calculator-infinite — a tool designed to process numbers of any length without losing precision. What makes this different? Unlike standard data types that have a fixed bit-size, this project uses logic to handle numbers as strings, meaning the only limit to your calculation is your computer's memory. I’m looking for your feedback! I want to push this further and would love for the dev community to break it. How does it handle your most complex strings? What features should I add next (Advanced functions? A GUI?)? Check out the logic here: https://lnkd.in/gwmT7hW5 If you enjoy tinkering with algorithms or just want to see how deep the rabbit hole goes with "Infinite" math, take a look at the repo. Stars, forks, and honest critiques are all welcome! #OpenSource #JavaScript #Coding #WebDevelopment #DataStructures #Programming #Mathematics #GitHub

Excited to share another open-source contribution 🚀 I recently submitted a pull request to VulnerableCode where I improved documentation by clarifying PostgreSQL requirements for running the full test suite. 🔹 Helped make setup clearer for new contributors 🔹 Identified real-world issue while working in Codespaces 🔹 Contributed to improving developer experience Working on real-world codebases is helping me improve debugging, backend understanding, and collaboration. PR link: https://lnkd.in/gwdTsPJ8 Looking forward to contributing more 💻 #OpenSource #GitHub #Python #SoftwareDevelopment #Backend

🚀 LeetCode Challenge 25/50 💡 Approach: Unbounded Knapsack DP (Bottom-Up) Greedy seems tempting — always pick the largest coin! But greedy FAILS here. Example: coins=[1,3,4], amount=6 → Greedy gives 4+1+1=3 coins, but DP finds 3+3=2 coins. Only DP guarantees the optimal answer! 🔍 Key Insight: → dp[i] = minimum coins needed to make amount i → Initialize all values to amount+1 (impossible sentinel) → dp[0] = 0 (base case: 0 coins for amount 0) → For each amount, try every coin and take the minimum → Coins can be reused unlimited times (unbounded!) 📈 Complexity: ❌ Brute Force → O(amount^n) Time ✅ Bottom-Up DP → O(amount × coins) Time, O(amount) Space When Greedy fails, Dynamic Programming never lets you down. Always question the obvious approach! 🧠 #LeetCode #DSA #DynamicProgramming #Java #ADA #PBL2 #LeetCodeChallenge #Day25of50 #CodingJourney #ComputerEngineering #AlgorithmDesign #CoinChange

LeetCode Day 13 : Problem 13 (Roman to Integer) Just solved another LeetCode problem. It was "Roman to Integer", sounds like a history lesson, right? But here's what I actually learned: The subtraction rule is the only tricky part. Roman numerals go largest to smallest left to right, except when a smaller symbol appears before a larger one. IV means 4, not 6. The moment you spot that pattern, the solution becomes simple: if the current symbol is less than the next one, subtract. Otherwise add. I had an accidental global variable. I declared one variable with let but forgot it on another. In strict mode that throws an error. A small habit, always declare every variable with let or const, no exceptions. The fix? A HashMap to map each symbol to its value, then one pass through the string. Check if current value is less than next value. If yes, subtract and skip ahead. If no, just add. O(n) time, O(1) space. Fourteen problems in. HashMaps keep showing up as the go-to tool whenever you need fast lookups. If you find yourself writing a long if-else chain for fixed values, a HashMap is almost always cleaner. The real lesson? Always declare your variables properly. One missing let can cause bugs that are hard to track down. #DSA #LeetCode #JavaScript #CodingJourney #Programming

I got tired of spending 45 minutes setting up my development environment every time I started a new project. Same steps. Same packages. Same configuration. Every. Single. Time. So I built a solution. One Command Setup. A collection of shell scripts that configures your entire development environment with a single command. What it sets up: -> Python, Node.js, Ruby environments -> PostgreSQL and SQLite -> Git with useful aliases and config -> Common dev tools and CLI utilities -> Bash/Zsh productivity shortcuts You clone the repo. You run one command. Your environment is ready. No more hunting for the right package version. No more reading a setup doc that's 3 updates out of date. No more "it works on my machine." I built it for myself first. Then I realized every student and developer starting a new project faces the same problem. It's free. Open source. On GitHub. Link in the comments. What stack would you want me to add support for? Follow Sachin Shah - I build tools for developers and document everything publicly. #OpenSource #DevTools #BuildInPublic #ShellScript #Django #NodeJS #ReactJS #100DaysOfCode #SoftwareEngineering

🚨 The repo is now at 117k stars and climbing. All others have been DMCA'd but it's still standing. Frequently being updated. Codex is saying good things about the architecture. Either we will have a massive security event that will be remembered for decades or Open Source Claude Code... but like actually open source. (if you let codex read it, make sure you are in a safe container. beware of prompt injection whenever letting an agent interact with anything.)

Last time I shared the idea. Now it’s live. ErrorLens is now open source on GitHub. It’s a simple developer tool: paste an error message and get a clear explanation, common causes, and example fixes without digging through multiple forums. Current version includes: • React + Tailwind UI • Support for JavaScript, Python, Java, TypeScript, Go, and Rust • “Wrong vs Correct” code examples for each error • Fully responsive layout Next steps: AI-based explanations , Deployment , Error history The repository is open for contributions especially around expanding the error library and improving detection. GitHub: https://lnkd.in/dkcFCj8G If there’s an error message you think should be included, feel free to suggest it or open an issue. #opensource #devtools #webdevelopment #reactjs

I was tired of having to open my bloated, local IDE to test my code during Codeforces contests, and repetitively typing lines of test cases into STDIN gets really annoying after some time. So, I built an online compiler that speeds up that process and automates the grunt work. It's build on top of a Containerization API that I made myself, and so it's immune to most attacks like fork bombs or disk-fillers, It also makes it easier to visualize the working of that API. The project supports Python, C++, Java and C, the 4 biggest languages on codeforces, feel free to use it on it's deployed URL: https://lnkd.in/g2DB2mPw github repo for the online compiler: https://lnkd.in/g2dkNy3H github repo for the api: https://lnkd.in/g9YPisst

LeetCode Day 5 : Problem 122 (Best Time to Buy and Sell Stock II) Just solved another LeetCode problem. It was "Best Time to Buy and Sell Stock II", a follow up to yesterday's stock problem, right? But here's what I actually learned: My first instinct was to track the minimum price just like the previous problem. It worked, but I was overcomplicating it. The simpler insight? Since you can buy and sell on the same day, you don't need to track the minimum price at all. Just grab every upward movement between consecutive days. If today is higher than yesterday, add the difference to your profit. That's it. Same problem structure, completely different angle. The lesson, don't carry assumptions from one problem into the next. Each problem deserves a fresh look. Eight problems in. The greedy approach keeps showing up, sometimes the optimal solution is just grabbing every small win as you go instead of looking for the perfect moment. The real lesson? Simpler code is almost always better code. If you need to track extra variables, ask yourself if you actually need them. #DSA #LeetCode #JavaScript #CodingJourney #Programming