RISC-V Assembly Optimization: N-Body Simulation

🗓 7 April 2026 Solved LeetCode Problem #73 — Set Matrix Zeroes Approach 💡 Used a simple and clean strategy with sets: • Traverse the matrix and store rows & columns containing 0 • In the next pass, set those entire rows and columns to 0 Why this works: We avoid modifying the matrix while scanning, preventing incorrect propagation of zeroes. Time Complexity ⏱: O(n × m) Space Complexity 📦: O(n + m) Learnings 📚 • Importance of separating observation and modification phases • Clean use of sets for tracking state • Trade-off between space and simplicity Next goal 🚀 Optimizing this to O(1) space using the first row & column as markers #leetcode #dsa #python #codingjourney #100daysofcode

🚀 Day 60 of #DSAJourney — Pascal’s Triangle II Today’s problem: Pascal’s Triangle II 📌 Given an integer rowIndex, return the rowIndex-th row of Pascal’s Triangle. 💡 Key Insight: Instead of generating the whole triangle, we can build the row in-place using the relation: 👉 Each element = sum of two elements from previous row 👉 Update from right to left to avoid overwriting values 🧠 Approach: Start with [1] Iteratively build each row Update elements backward to maintain correctness ⚡ Complexity: Time: O(n²) Space: O(n) (optimized, no extra triangle) 📈 What I Learned: In-place updates can optimize space significantly Backward traversal is key in many DP problems Simple math patterns → powerful solutions #Day60 #LeetCode #DSA #CodingJourney #Python #Programming

We’ve added a new Pong example to our plain language examples repository. It’s a simple but fun way to show how a game can be specified in ***plain language and rendered into a working Python implementation with the curses library. The example includes paddle controls, ball physics, scoring, and a playable terminal UI. Link in the comments. Thanks to Gašper Z. for the idea for this example and for creating the initial version.

Validate BST: Boundary Tracking for Global Ordering Checking only immediate children misses violations. Solution: pass valid range bounds down recursion. Each node must satisfy not just local constraint (left < node < right) but global constraint — all ancestors' bounds. Boundaries narrow as we recurse. Boundary Propagation: Each recursive call narrows allowable range. Left subtree inherits lower bound but gets node value as upper bound. This ensures all descendants respect ancestors' ordering requirements. Time: O(n) | Space: O(h) #BST #BoundaryTracking #TreeValidation #RecursiveConstraints #Python #AlgorithmDesign #SoftwareEngineering

New journal article published in GChron: 'Technical note: Geodynamic Thermochronology (GDTchron) – A Python package to calculate low-temperature thermochronometric ages from geodynamic numerical models' by D. A. Vasey et al. https://lnkd.in/d9p-_AjK

Add Two Numbers: Linked List Digit Addition with Carry Propagation Process lists simultaneously like grade-school addition. Handle different lengths by treating missing nodes as 0. Carry propagates to next iteration via loop condition carry > 0. Dummy node simplifies head handling. Continue until all lists exhausted AND carry is zero. Carry Handling: Including carry in loop condition ensures final carry digit gets added. Division/modulo elegantly extract carry and digit value. Time: O(max(m, n)) | Space: O(max(m, n)) #LinkedList #DigitAddition #CarryPropagation #SimulationAlgorithm #Python #AlgorithmDesign #SoftwareEngineering

Simcoon 1.11 is out! The big new feature : A proper 'rotation' object based on quaternion that facilitate frame change and direct rotation. For the python part it is based on scipy.spatial.transform.Rotation, with specific batch functions to rotate stress, strain tensor but also stiffness, compliance tensors with ease. Check out the documentation here : https://lnkd.in/dM4KFc6N

Signal Processing is attracting many students from computer science, but the challenge is that they need to spend more time understanding the computing infrastructure on which their algorithms run. All the best to Dan Boschen

Add Two Numbers: Linked List Digit Addition with Carry Process lists simultaneously like grade-school addition. Handle different lengths by treating missing nodes as 0. Carry propagates via loop condition carry > 0. Dummy simplifies head handling. Continue until lists exhausted AND carry zero. Carry Propagation: Including carry in loop condition ensures final carry digit added. Division/modulo elegantly extract carry and digit. This pattern applies to any multi-digit arithmetic simulation. Time: O(max(m, n)) | Space: O(max(m, n)) #LinkedList #DigitAddition #CarryPropagation #SimulationAlgorithm #Python #AlgorithmDesign #SoftwareEngineering

🗓 7 April 2026 🚀 LeetCode #703 – Kth Largest Element in a Stream Solved this problem using a clean and efficient Min Heap approach 🔥 💡 Instead of storing all elements, I maintained only the top K largest elements, which makes the solution scalable for large data streams. 🧠 Approach: • Created a min heap • Added elements in the constructor • If size exceeds k → removed the smallest element • In add(): – Push new value into heap – Pop if size exceeds k – Return the top element (Kth ) ⚡ Time Complexity: O(n log k) 📦 Space Complexity: O(k) 💭 Key Insight: We don’t need to store all elements — just maintain the top k elements. The smallest among them is the answer 🎯 #LeetCode #DSA #Python #Coding #100DaysOfCode #Heap