Improved PostgreSQL Documentation in VulnerableCode

🚨 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.)

Here's the thing most developers miss: Claude Code has full terminal access. That's the entire point. It can shell out to wc for accurate token counts (LLMs are terrible at counting). It can use grep, sed, awk for text processing. It can hit APIs, execute Python scripts, deploy to production. It can also rm -rf your entire system if you're not careful with permissions. So the setup isn't optional. It's the foundation. We talked about Claude Code setup and barely opened Claude Code itself yesterday. Because that's how software development works. You build the infrastructure first. #ClaudeCode #DeveloperProductivity #AITools #SoftwareDevelopment

LinkedIn Draft – Valid Parentheses | Day 14 #DailyLeetcode - Day 14 🖥 Some problems aren’t about complexity… they’re about maintaining the right order. LeetCode Day 14 was a perfect example of that. The problem 🎯 Given a string: "( )[ ]{ }" → valid ✅ "( ]" → invalid ❌ "({ [ ] })" → valid ✅ Check if the brackets are balanced. The approach ⚡ Used a stack (LIFO) Opening bracket → push 📥 Closing bracket → check & pop 📤 The intuition 💡 Every closing bracket should match the most recent opening bracket. Not the first. Not a random one. 👉 The latest one. Quick visual 🧩 ( → push { → push [ → push ] → pop [ } → pop { ) → pop ( Stack becomes empty → valid ✅ Why this stood out Simple idea, but powerful Shows how order matters more than count Perfect use-case of stack Complexity ⏱️ Time → O(n) Space → O(n) Reflection ✨ Some problems aren’t about doing more… they’re about doing things in the right sequence. #LeetCode #DailyCoding #Stack #ValidParenthesis #DSA #Java #ProblemSolving #CodingJourney #100DaysOfCode #TechLearning #Algorithms #DataStructures #CodingLife

🚀 LeetCode Challenge 18/50 💡 Approach: Space-Optimized Dynamic Programming Recursion without memoization gives O(2ⁿ) — exponential! A full DP array gives O(n) space. But here's the trick: at every house we only ever look back TWO steps. So why store the entire array? 🔍 Key Insight: → At each house: either ROB it (prev2 + current) or SKIP it (prev1) → Take the maximum of both choices → Slide two variables forward — that's all we need! → No array, no extra memory 📈 Complexity: ❌ Brute Force → O(2ⁿ) Time ❌ DP Array → O(n) Time, O(n) Space ✅ Space-Optimized DP → O(n) Time, O(1) Space The best code isn't just correct — it's efficient. Sometimes the smartest move is knowing what NOT to store! 🧠 #LeetCode #DSA #DynamicProgramming #Java #ADA #PBL2 #LeetCodeChallenge #Day18of50 #CodingJourney #ComputerEngineering #AlgorithmDesign #HouseRobber

🚀 Just made my first open source contribution! Today I contributed to falconry/falcon — a Python web API framework with 9.8K+ GitHub stars used in production by developers worldwide. What I did: Updated 24 obsolete HTTP RFC references across the codebase, replacing deprecated standards (RFC 7230, 7231, 7232, 7233, 7235) with their modern equivalents (RFC 9110, 9112) — ensuring the documentation stays accurate and up to date for developers relying on it. What I learned: ✅ How to fork, clone and navigate a real production codebase ✅ How Git branching and Pull Requests work in a real team ✅ How to read and understand HTTP RFC specifications ✅ How open source contribution workflows operate end to end The honest truth? I started today not knowing how any of this worked. By the end of the day, PR #2637 was live on a real open source project. If you've been putting off contributing to open source because it feels intimidating — start small 🙌 PR: https://lnkd.in/djCyhQei Ameen Alam, Asharib Ali #OpenSource #Python #GitHub #100DaysOfCode #WomenWhoCode #Programming #Developer #FirstContribution

🚀 One thing I learned while working on backend systems: Handling duplicate data is harder than it looks. While working on a warehouse sync system, I faced a critical issue: ➡️ Same inventory updates were getting processed multiple times ➡️ Result? Incorrect stock levels 💡 Solution I implemented: Introduced idempotency keys Used task queues (Celery + RabbitMQ) Ensured each operation runs only once 📌 Lesson: In distributed systems, “at least once delivery” is common — but “exactly once processing” is what you must design for. If you're building backend systems, never ignore idempotency. #Python #BackendDevelopment #SystemDesign #Celery #RabbitMQ

PRFlow supports 8 languages with full scope detection. For these languages, PRFlow identifies the exact function or class that changed, not just the lines: Python, JavaScript, TypeScript, Go, Java, Rust, C#, Ruby. For every other language, PRFlow provides 30 lines of surrounding context as a fallback. The AI model itself can review virtually any language. Documentation, configuration files, and auto-generated files like lock files and migrations are handled separately with minimal analysis. #PRReview #Codereview #Github

🚀 LeetCode Challenge 17/50 💡 Approach: Dynamic Programming (HashMap) Brute force tries every + and - combination — that's O(2ⁿ) exponential time! Instead, I used a HashMap-based DP that tracks all reachable sums and their counts at each step, cutting it down drastically! 🔍 Key Insight: → Start with {0 → 1} (one way to make sum 0) → For each number, expand every existing sum by +num and -num → Accumulate the count of ways for each new sum → After processing all numbers, return count at target sum 📈 Complexity: ❌ Brute Force → O(2ⁿ) Time ✅ DP (HashMap) → O(n × S) Time, O(S) Space   where S = number of unique reachable sums Every number is a fork in the road — + or -. DP helps us travel all roads at once without repeating the journey! 🛣️ #LeetCode #DSA #DynamicProgramming #Java #ADA #PBL2 #LeetCodeChallenge #Day17of50 #CodingJourney #ComputerEngineering #AlgorithmDesign #TargetSum

Laziness: the underrated superpower of every programmer. Built a small CLI tool that kills the most boring part of starting a new project. The problem: Every new project means the same manual steps — configuring ESLint, Prettier, Husky, commitlint, wiring scripts, setting up git hooks. Easy to misconfigure. Always time-consuming. The fix: One command, a few prompts, and your project is ready — → Asks a few interactive questions → Scaffolds your entire project structure → Sets up only the tools you actually want → Wires everything together automatically TypeScript supported now. Python on the way. Code: https://lnkd.in/dJvFfHVm The only thing I repeat is "I should automate this." #BuildInPublic #CLI #TypeScript #DevTools #OpenSource #DeveloperExperience

🚀 Day 14 of LeetCode Problem Solving Solved today’s problem — LeetCode #34: Find First and Last Position of Element in Sorted Array 💻🔥 ✅ Approach: Binary Search (Twice) ⚡ Time Complexity: O(log n) 📊 Space Complexity: O(1) The task was to find the starting and ending position of a target element in a sorted array. 👉 Instead of linear search, I used Binary Search twice: One to find the first occurrence One to find the last occurrence 💡 Key Idea: Modify binary search slightly to keep searching even after finding the target. 👉 Core Logic: If target found → store index Continue searching left (for first position) Continue searching right (for last position) 💡 Key Learning: Binary Search is not just for finding elements — it can be modified to solve many variations efficiently. Consistency is the key — getting better every day 🚀 #Day14 #LeetCode #DSA #Java #CodingJourney #ProblemSolving #100DaysOfCode