Python Async Performance Tuning with Uvicorn

Running concurrent workloads efficiently is critical in modern backend systems. I benchmarked Sync vs Threading vs Asyncio in Python to understand performance trade-offs and practical use cases. #python #Asyncio #Thread #Sync

LeetCode #102 – Binary Tree Level Order Traversal | Python Implementation I implemented an iterative BFS approach using a queue to collect nodes level by level. Core Insight: The len(q) snapshot before the inner loop prevents mixing levels. New children added during iteration don't affect the current level's processing count, ensuring clean level separation. Time: O(n) | Space: O(w) where w = maximum tree width #LeetCode #DataStructures #Python #BinaryTree #BFS #LevelOrderTraversal #CodingInterview #SoftwareEngineering

🚀 Day 37/60 — LeetCode Discipline Problem Solved: Concatenation of Array Difficulty: Easy Today’s problem was simple yet elegant — creating a new array by concatenating the given array with itself. Instead of manually looping, I used Python’s direct list operation to duplicate the array efficiently. 💡 Focus Areas: • Understanding array manipulation • Leveraging built-in language features • Writing concise and clean code • Avoiding unnecessary complexity • Strengthening fundamentals ⚡ Performance Highlight: Achieved 0 ms runtime (100% performance) Sometimes, the most powerful solutions are the simplest ones. No heavy logic… no complex structures— just clarity of thought and clean execution. #LeetCode #60DaysOfCode #100DaysOfCode #DSA #Arrays #Python #CodingJourney #ProblemSolving #Developers #TechGrowth #Consistency

Day 24/100 – #100DaysOfCode 🚀 Solved LeetCode #747 – Largest Number At Least Twice of Others (Dominant Index) (Python). Today I practiced array traversal and comparison logic to find the dominant index in the array. Approach: 1) Find the largest element in the array and its index. 2) Traverse through the array. 3) For every other element, check if the largest is at least twice of it. 4) If any element violates this condition, return -1. 5) If all conditions are satisfied, return the index of the largest element. Time Complexity: O(n) Space Complexity: O(1) Learning how simple comparisons can solve array problems efficiently 💪 #LeetCode #Python #DSA #Arrays #ProblemSolving #100DaysOfCode

This is Part 3 final of the Python for C++ Developers series, continuing the discussion from Part 3. In this segment, we will focus on generating an AI Mini Pipeline using iterators and generators. This practical application will utilize all the knowledge gained from the previous parts of the series.

LeetCode #235 – Lowest Common Ancestor of a Binary Search Tree | Python Implementation I implemented an iterative approach leveraging the BST property to find the LCA without recursion. Core Insight: BST ordering guarantees the LCA is where paths to p and q diverge. The iterative solution avoids recursion overhead by directly following the BST property until the split condition is met. Time: O(log h) where h = tree height | Space: O(1) #LeetCode #DataStructures #Python #BinarySearchTree #LCA #CodingInterview #SoftwareEngineering

LeetCode #100 – Same Tree | Python Implementation I implemented a recursive DFS approach that simultaneously traverses both trees, comparing nodes at each step. Core Insight: Tree equality decomposes into three checks: both null (base case), structural equality, and value equality. Recursion naturally handles the "and both subtrees match" requirement. Time: O(n) | Space: O(h) where h = tree height (recursion stack) #LeetCode #DataStructures #Python #BinaryTree #Recursion #DFS #CodingInterview #SoftwareEngineering

I recently implemented the K-Medoids clustering algorithm from scratch in Python and visualized the clusters using graphs to understand how the algorithm groups data points. #MachineLearning #PythonProjects https://lnkd.in/gczybNGr

"It works on my machine." The most famous lie in software. Virtual environments fix this — permanently. Day 43/50 - Virtual Environments #Python #VirtualEnvironments #50DaysOfPython #Day43 #pip #LearnPython

One of the biggest upticks of AI Driven Development is the ease in which you can put together clean console applications. You can literally now spin up a menu driven console interface within a few minutes in Python using Textual (other languages are available...)