Guillaume Fontes’ Post

Allen Institute Bridging the Gap Between Big Data and Neuroscience The Allen Institute is hosting a beginner-friendly webinar on Feb. 11 to help researchers navigate the Allen Brain Cell Atlas using Jupyter notebooks. Accessing and analyzing massive transcriptomic datasets can be daunting, but this session simplifies the setup and installation process using Python. It’s a perfect opportunity for researchers to integrate these world-class resources into their own computational workflows. A great way to sharpen your bioinformatics skills while exploring the latest in brain cell diversity! #Neuroscience #Transcriptomics #DataScience #AllenInstitute #JupyterNotebook #Bioinformatics #OpenScience

Mesa 3.5.0 Adds Discrete-Event Scheduling to Agent-Based Modeling 📌 Mesa 3.5.0 revolutionizes agent-based modeling with the introduction of discrete-event scheduling, letting developers seamlessly blend step-based and event-driven simulations in one framework. This leap enables more realistic modeling of complex, multi-timescale systems like epidemics and supply chains, while also simplifying agent initialization from data and boosting performance with architectural upgrades. 🔗 Read more: https://lnkd.in/dcfv7E_S #Mesa #Agentbasedmodeling #Python #Simulationframework

feb-21-26 LeetCode 762 – Prime Number of Set Bits in Binary Representation Solved today’s problem focused on bit manipulation and prime checking! 🔹 Problem: Given two integers left and right, count how many numbers in that range have a prime number of set bits (1s) in their binary representation. 💡 Approach: Iterate through each number in the range. Count set bits using bitwise operations (& and right shift). Check whether the count of set bits is a prime number. Keep track of valid cases. 🧠 Concepts Used: Bit Manipulation Prime Number Checking Mathematical Optimization Simple problem on the surface, but a great way to strengthen understanding of binary representation and efficient computation. Consistency + Daily Practice = Growth 📈🔥 #LeetCode #BitManipulation #PrimeNumbers #Python #CodingPractice #ProblemSolving

Day 47/50 - Day DSA Challenge 🧠 Problem: Min Cost to Convert String Arrays 🔹 Transform one list of strings into another using insert, delete, and modify operations 🔹 Line-level operations with character-level edit distance as modification cost 🔹 Designed an optimal solution using sequence DP + edit distance 💡 Key Takeaways This problem mirrors how Git diff, file synchronization, and version control systems work Learned how to model complex real-world constraints using clean DP states Importance of space optimization when handling large inputs Github Link:https://lnkd.in/gwg_dAtC #Day47 #DSAChallenge #DynamicProgramming #EditDistance #ProblemSolving #SystemDesignBasics #LearningInPublic #Python #HackerRank #Consistency

One of the most important design choices in CPython is its use of reference counting as the primary memory management strategy. Every object in Python keeps track of how many references point to it. When that count drops to zero, the memory is immediately reclaimed. This has an interesting side effect: object destruction in Python is often deterministic. In many cases, you can predict exactly when an object will be cleaned up, which is not true in runtimes that rely purely on tracing garbage collectors. However, reference counting alone cannot handle cyclic references. That’s why CPython also includes a generational garbage collector to detect and clean up unreachable cycles. The combination of immediate cleanup (via reference counting) and periodic cycle detection is a deliberate trade-off between performance and safety. Understanding this internal behavior is especially useful when building high-throughput backend services or debugging unexpected memory growth. #Python #RuntimeInternals #MemoryManagement #SoftwareEngineering

Rerun 0.29.0 is out! We're continuing to improve Rerun for roboticists. The release includes: 🤖 URDF loader improvements 🌳 UrdfTree utility in Python 📸 Experimental screenshot API from Python 💾 Improved memory panel 🦀 Updated ROS 2 example & documentation Check out the full release notes (link in the comments 👇)

📅 Day 16/30 – Revision (Day 8 to Day 14) Today I dedicated time to revising everything I’ve learned so far to strengthen my fundamentals. Topics revised: • Built-in modules (OS, Random, Math, Datetime, Sys) • Turtle Graphics • Requests & APIs • Threading • NetworkX Revision helped me connect concepts and improve clarity 💪 Consistency is slowly turning into confidence 🚀 📚 Learning resource: HackerBytez – https://lnkd.in/gzKTANVt #Day16 #PythonChallenge #30DaysOfPython #RevisionDay #Python #LearningInPublic #CodingJourney

Matmath v4.0.0-rc1 is now available. This release focuses on performance and correctness. 👉 Added CPython support for faster calculations when compared to the previous python-only solution. 👉 Fixed a bug in Matrix initialization that could produce incorrect state in some cases. 👉 Fixed a bug in bool(Vector) evaluation. PyPI: https://lnkd.in/gSCmxe_z Repo: https://lnkd.in/gHntrufh #python #numericalcomputing #opensource #softwareengineering #math #devtools

🔥 Day 30 of #100DaysOfCode 📌 LeetCode 26 – Remove Duplicates from Sorted Array Today’s problem focused on in-place array manipulation and strengthening the two-pointer technique. 🧠 Problem Summary Given a sorted array, remove duplicates such that each unique element appears only once. Return the count of unique elements (k). Important: Do it in-place with O(1) extra space. 💡 Key Insight Because the array is already sorted, duplicates are always adjacent. So instead of checking all elements repeatedly: 👉 Compare current element with previous one. 👉 If different → place it at the next unique index. This is where the Two Pointer Approach shines: Pointer i → traverses array Pointer k → tracks position of next unique element 📊 Complexity ⏱ Time: O(n) 📦 Space: O(1) Consistency > Motivation 30 Days Done. Still going strong 💪 #Day30 #LeetCode #DSA #100DaysOfCode #Python #CodingJourney

🚀 Day-43 of #100DaysOfCode 🐍 Python Pattern Programming Challenge – Diamond Star Pattern Today I implemented a Diamond Star Pattern using nested loops and proper space alignment. 🔹 Pattern Description: The upper half prints an increasing pyramid The lower half prints a decreasing pyramid Proper spacing ensures a symmetric diamond shape 🔹 Concepts Practiced: ✔ Nested for loops ✔ Space and star alignment logic ✔ Pyramid pattern formation ✔ Symmetry handling 🔹 Approach: First loop creates the upper pyramid Second loop creates the lower inverted pyramid Spaces are carefully calculated to maintain structure 🔹 Key Learning: Pattern problems like this improve loop control, visualization skills, and logical thinking, which are essential for mastering core programming concepts. #Python #PatternProgramming #DiamondPattern #CorePython #100DaysOfCode #Day43 #LearnPython #CodingPractice #PythonDeveloper