Today at 21:00 CET. The 2026 Python Stack: What's Changing. We'll cover (Julian Sequeira, Bob Belderbos and myself) - uv: why one tool now replaces five - ruff: formatting and linting in milliseconds - The verification loop before every commit - Repository pattern for clean architecture - Real code, not theory - Then Q&A. Bring your Python questions. Whether you're wondering about modern tooling or trying to figure out how to structure your next project, this session will give you clarity. Free. Live. Today.👇 https://lnkd.in/e8X3sVNC See you there. #Python #LiveSession #ModernPython #uv #ruff
Juan José Expósito González’s Post
More Relevant Posts
-
📺 Now Available OnDemand: Inside the New SEC573 with Mark Baggett See how the updated course uses Python, LLMs, and MCP to help defenders build smarter tools faster. Watch the replay and get inspired to start automating. 🔗 https://go.sans.org/OkqVCi #OnDemand #SEC573 #CyberDefense #SecurityAutomation #Python #LLM
To view or add a comment, sign in
-
-
BREAKING NEWS: I’m thrilled to announce that all attendees of SEC573 AI-Powered security automation: Building Tools with Python LLMs and MCP in Orlando on March 29th will now have access to OnDemand at no extra cost! This means you’ll have extended access to labs and bonus “section 7” material, which includes hours of content that won’t fit into the live class. Additionally, you’ll receive all the solutions to the bonus material. Were you already considering taking the course OnDemand? Why not combine it with a trip to Orlando and double the fun? If you register now using the registration code “Presale10,” you’ll receive a 10% discount. Alternatively, if you’ve already taken 573 and want to enhance your skills to include AI agent development, you can register and select “pay by check” to get a 50% discount. - OnDemand - Live lecture - Orlando Don’t forget to also get your GPYC certification! Still not convinced? Register to watch the lecture below for an overview is the content.
📺 Now Available OnDemand: Inside the New SEC573 with Mark Baggett See how the updated course uses Python, LLMs, and MCP to help defenders build smarter tools faster. Watch the replay and get inspired to start automating. 🔗 https://go.sans.org/OkqVCi #OnDemand #SEC573 #CyberDefense #SecurityAutomation #Python #LLM
To view or add a comment, sign in
-
-
Mark Baggett is an excellent instructor, and I highly recommend checking out his SEC573 course if you're looking to improve your security automation skills!
📺 Now Available OnDemand: Inside the New SEC573 with Mark Baggett See how the updated course uses Python, LLMs, and MCP to help defenders build smarter tools faster. Watch the replay and get inspired to start automating. 🔗 https://go.sans.org/OkqVCi #OnDemand #SEC573 #CyberDefense #SecurityAutomation #Python #LLM
To view or add a comment, sign in
-
-
If your code is starting to look like spaghetti, it’s time to master Modules and Packages. This infographic is a perfect "cheat sheet" for: ✅ Modules vs. Packages – How to structure your files. ✅ Imports – The right way to bring in code. ✅ Virtual Environments – Keeping your projects clean and isolated. Pro-tip: Never skip the virtual environment. Your future self will thank you when you avoid version conflicts! 💡 What’s one Python tip you wish you knew when you started? 👇 #Python #Coding #SoftwareEngineering #TechTips
To view or add a comment, sign in
-
-
🚀 #100DaysOfLeetCode – Day 47 📌 Problem: Find the Peaks (LeetCode 2951) A peak element in the array is an element that is strictly greater than its immediate neighbors. ⚡ Important Points First and last elements cannot be peaks. We check each element from index 1 to n-2. If the current element is greater than both neighbors, it is a peak. 🧠 Approach: 1️⃣ Traverse the array from 1 to n-2 2️⃣ Compare each element with its left and right neighbor 3️⃣ If both conditions satisfy, store its index 4️⃣ Return the list of peak indices ⏱ Time Complexity: O(n) 💾 Space Complexity: O(1) (excluding output list) ✅ Successfully solved and accepted on LeetCode. #LeetCode #DSA #ProblemSolving #CodingJourney #100DaysOfCode #Python #Algorithms
To view or add a comment, sign in
-
-
Just want to share here, while i working on my Odin renderer I got curious about building my own doc generator by using a simple python script. I think for peoples who easily forgot like me and lazy to do documentation manually, this seems useful for them. It auto picks up your procs, structs, enums and unions. Drop a comment above any declaration and it shows up as a description. Search, filters, themes an some features included. It made specifically for Odin lang. Repo: https://lnkd.in/gxydfTrm Example: https://lnkd.in/gqtTXtV4 #Odin #OpenSource #Documentation #python #json
To view or add a comment, sign in
-
If you're not automating your daily workflows in 2026, you're missing out on massive time savings. 🛑⏳ Python has always been the king of automation, but the libraries leading the charge this year are taking things to a whole new level. From simple task automation to complex orchestration, there’s a modern tool for exactly what you need. 🛠️✨ Curious about which Python libraries you should be adding to your tech stack right now? I found a great guide that ranks and reviews the best options available today. 🔗 The link is in the first comment! Let me know what tasks you are automating this year. #WorkflowAutomation #PythonCoding #TechTrends #ProductivityHacks #SoftwareEngineering #Python
To view or add a comment, sign in
-
-
💻 Day 44 of #100DaysOfLeetCode 🔍 Problem: Find Common Characters 🔢 LeetCode: 1002 📌 Problem Understanding: We are given a list of words. The goal is to find all characters that appear in every word in the list. ✔ If a character appears multiple times in all words, it should appear the same number of times in the result. ✔ The order of the output does not matter. 🧠 Approach: 1️⃣ Iterate through all characters from 'a' to 'z'. 2️⃣ For each character, count how many times it appears in every word. 3️⃣ Track the minimum count across all words. 4️⃣ If the minimum count is greater than zero, add that character to the result list that many times. ⚙️ Key Idea: The smallest frequency of a character across all words determines how many times it will appear in the final result. 💡 What I Learned: This problem highlights how frequency counting and minimum occurrence tracking can be used to identify common elements across multiple strings efficiently. #Day44 #100DaysOfLeetCode #LeetCode #CodingJourney #Python #DSA #ProblemSolving 🚀
To view or add a comment, sign in
-
-
CanisterWorm campaign compromises 29+ npm packages across @emilgroup and @teale.io namespaces, deploying a Python backdoor that fetches second-stage payloads via ICP canisters. Uses npm tokens and postinstall hooks. #SupplyChain #NPMAttack ➡️ https://ift.tt/9HlP5GN
To view or add a comment, sign in
-
-
𝗪𝗲𝗲𝗸 𝟯 of my 𝗗𝗮𝘁𝗮 𝗦𝗰𝗶𝗲𝗻𝗰𝗲 & 𝗠L program with ParoCyber wrapped up with two solid labs on Python operators and string methods. We covered a lot of ground on arithmetic, comparison, logical, assignment, bitwise, membership, and identity operators. Each one serves a specific purpose in how Python reads and evaluates data. 💡The operators '𝙞𝙨' vs '==' were a good reminder that two values can be equal without pointing to the same object in memory. The second lab focused on string methods like split(), join(), replace(), and more. 💡One thing that stuck: strings in Python are 𝗶𝗺𝗺𝘂𝘁𝗮𝗯𝗹𝗲. Any operation returns a new string, not a modified original. Small detail, but it matters. To see the full breakdown, it's all documented on my GitHub. Link below. 🔗 https://lnkd.in/dVnTd3jS #DataScience #Python #MachineLearning #ParoCyber #LearningInPublic #CareerGrowth #WomenInTech
To view or add a comment, sign in
More from this author
Explore content categories
- Career
- Productivity
- Finance
- Soft Skills & Emotional Intelligence
- Project Management
- Education
- Technology
- Leadership
- Ecommerce
- User Experience
- Recruitment & HR
- Customer Experience
- Real Estate
- Marketing
- Sales
- Retail & Merchandising
- Science
- Supply Chain Management
- Future Of Work
- Consulting
- Writing
- Economics
- Artificial Intelligence
- Employee Experience
- Workplace Trends
- Fundraising
- Networking
- Corporate Social Responsibility
- Negotiation
- Communication
- Engineering
- Hospitality & Tourism
- Business Strategy
- Change Management
- Organizational Culture
- Design
- Innovation
- Event Planning
- Training & Development