Jannis Leidel’s Post

FastAPI Depends() — the pattern I learned 7 weeks too late Tutorials show you Depends() in week 1. Nobody shows you composition until your auth is already a mess. The 4-day refactor I could have skipped. Full breakdown (7 min read) → https://lnkd.in/g9F9EWKT #Python #Backend #FastAPI #SoftwareEngineering #WebDev

I once spent 2 hours debugging a config issue. The token was right. The host was right. Yet nothing worked. Turns out? I had 3 separate config objects running in the same app , each with its own state. That day, I truly understood the Singleton pattern. The idea is simple: one class, one instance, shared everywhere. No duplication. No inconsistency. One single source of truth. It's not magic , it's discipline baked into code. Swipe through the carousel to see how it works, a real-world analogy, and a clean Python implementation.  #DesignPatterns #CleanCode #SoftwareEngineering #Python #web

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 11 of My Python + DSA Journey Today’s problem was all about greedy approach👇 ✅ Jump Game (#55) 💡 Jump Game Check if you can reach the last index 🔍 Approach: Tracked maximum reachable index → if current index exceeds it, return False ⏱ O(n) time | O(1) space 🔥 What I learned today: • Greedy approach can simplify complex problems • Tracking max reach avoids unnecessary checks • Early exit conditions improve efficiency Turning logic into faster decisions ⚡ #Day11 #LeetCode #Python #DSA #CodingJourney #100DaysOfCode

Rook Attack Given two strings for the location of two rooks on a chess board, determine if they can attack each other. A standard chessboard is 8x8, with columns labeled A through H (left to right) and rows labeled 1 through 8 (bottom to top). Rooks can move as many squares as they want in a horizontal or vertical direction. So if they are on the same row or column, they can attack each other. freeCodeCamp #DailyCodingChallenge #python #javascript

🚀 Day 3/30 – Image Puzzle Game using Python 🐍🧩 Day 3 of my 30 Days Python Challenge, and today I built something fun + interactive 🎉 I created an Image Puzzle Game using Python and Tkinter, where users can upload any image, shuffle the tiles, and solve the puzzle by rearranging the pieces 🖼️💻 What I focused on today:✨ Building an interactive GUI using Tkinter✨ Image slicing and tile shuffling logic✨ Creating a smooth and engaging puzzle-solving experience✨ Improving logic building with game mechanics This challenge is helping me stay consistent, creative, and hands-on with real Python projects every day 🚀 👉 Would love your feedback! 👉 What image would you try first in this puzzle game? 👀 Day 4 coming tomorrow… stay tuned 👀 #Python #30DaysChallenge #PythonProjects #Tkinter #PuzzleGame #GUI #CodingJourney #BuildInPublic #GameDevelopment

Get hands-on experience with Python's Wave file library With Wave Print, you'll learn to read, write, and update audio files in seconds. Master the Wave API to create production-ready software for IT professionals. Read the full article 👉 https://lnkd.in/dehD9qqH #Python #ITFreshers #LearnPython #ProgrammingLanguage #SoftwareEngineering #TechLab Code. Learn. Build. — TechLab by Neeraj

Day 46/100 – #100DaysOfCode 🚀 Solved LeetCode #2733 – Neither Minimum nor Maximum (Python). Today I practiced sorting and simple array logic to find any element that is neither the minimum nor the maximum in the array. Approach: 1) Sort the array. 2) Check the length of the array. 3) If the size is less than or equal to 2, return -1 (no valid element exists). 4) Otherwise, return the second element as it will be neither min nor max. Time Complexity: O(n log n) Space Complexity: O(1) Understanding how sorting simplifies boundary-based problems 💪 #LeetCode #Python #DSA #Arrays #Sorting #ProblemSolving #100DaysOfCode

Need to investigate a spike in revenue? Plan your revenue and inventory data so you can compare them side by side. This article covers how to do it with R (and you can plan a similar technique with Python, too!). https://lnkd.in/gZjCqxC9

Top 4 Python patterns every beginner should practice 🐍✨ Pattern programs are one of the best ways to understand nested loops, rows, columns, conditions, spacing, and how logic builds shapes step by step. In this post, you’ll see how Python can print: Heart pattern ❤️ Hollow square pattern ⬛ Pyramid pattern 🔺 Right triangle pattern 📐 These may look simple, but they train your brain to think like a programmer. You learn how loops move line by line. You learn how conditions control the output. You learn how spacing changes the entire shape. You learn how small logic creates a full pattern.