Bayesian Model Summary: Posterior Distributions and Regression Analysis

Day 45 at Luminar Technolab Worked on the Iris dataset using Pandas, explored patterns across different species. Performed analysis like: • Comparing petal & sepal measurements • Finding max, min, and averages per species • Filtering and sorting data for specific conditions Starting to approach datasets with a more analytical mindset. #Python #Pandas #EDA #DataAnalysis #LearningJourney

A clean HMM.py utility for market regime detection with Hidden Markov Models. This module: - Trains a Gaussian HMM on the most recent 900 trading days - Accepts a DataFrame + configurable feature columns - Validates inputs and handles missing data - Returns both the fitted model and labeled output with: - hidden_state - per-state probabilities (state_prob_k) Designed it to be practical for quant workflows: reproducible (random_state), configurable (n_states, covariance_type, n_iter), and ready to plug into signal pipelines. #Python #QuantFinance #AlgorithmicTrading #SoftwareEngineering

Day 32/100 – Diameter of Binary Tree Today’s problem looked simple on the surface, but it really tested my understanding of tree traversal and recursion. Key Insight: The diameter of a binary tree isn’t about paths from root—it’s about the longest path between any two nodes. The trick? At every node, calculate: Left subtree height Right subtree height Update diameter = left + right This turns a potentially complex problem into a smooth DFS + height calculation. What I learned: How to combine recursion with global state Thinking beyond root-based solutions Every node can be the "center" of the longest path Time Complexity: O(n) Space Complexity: O(h) Consistency > intensity. On to Day 33 #100DaysOfCode #DataStructures #Algorithms #LeetCode #Python #CodingJourney

Day 118 Backtracking patterns are repeating — and getting clearer. #Day118 🧩 39. Combination Sum How today went: • Used index i to control choices • Two options at each step: → stay at i (reuse same element) → move to i + 1 (try next element) • Track current total • If total == target → store result • If total > target → backtrack What clicked: It’s all about: → controlling index → tracking total → backtracking at the right time Same pattern, more confidence. #LeetCode #DSA #Python #Backtracking #Recursion #LearningInPublic #Consistency

📊 Day 6 | K-Nearest Neighbors (KNN) 🤝📍 Today, I learned about K-Nearest Neighbors (KNN), a simple and intuitive Machine Learning algorithm. KNN works on the idea of distance — it classifies a data point based on the majority class of its nearest neighbors. 📌 In simple terms: “Similar data points are close to each other.” Example: ✔ Recommending products ✔ Classifying customers To understand this, I implemented KNN using Python and observed how it predicts based on nearby data points 💻 KNN is simple but powerful for many classification problems. #MachineLearning #KNN #DataScience #LearningInPublic #Python

Subsets: Backtracking with Include/Exclude Decision Tree Generate all 2^n subsets via recursive binary choices — include current element or skip. Base case: processed all elements, save current subset. Backtracking pattern: modify state, recurse, undo modification. Backtracking Pattern: Modify shared state, explore branch, restore state before exploring alternate branch. This template applies to permutations, combinations, constraint satisfaction problems. Time: O(2^n) | Space: O(n) recursion depth #Backtracking #Subsets #DecisionTree #StateRestoration #Recursion #Python #AlgorithmDesign #SoftwareEngineering

Day 20 of My DSA Journey – Daily Temperatures Today’s problem: Daily Temperatures 🌡️ A great example of how switching from brute force to the right data structure changes everything. 🔍 Problem Given a list of temperatures, find how many days you need to wait for a warmer day. If no warmer day exists, return 0. 💡 What I Learned At first glance, a nested loop feels natural… but that leads to O(n²) time complexity ❌ The optimized solution uses a Monotonic Stack to reduce it to O(n) ✅ ⚡ Approach Use a stack to store indices of unresolved temperatures Traverse the array once When a warmer temperature appears → resolve previous days Store the difference in indices #Day20 #DSA #LeetCode #Python #CodingJourney #ProblemSolving #100DaysOfCode

Day 243 of #365DaysOfCode Solved Minimum Distance Between Three Equal Elements I using a hashmap-based indexing approach. Grouped indices of identical elements and evaluated triplets by scanning index lists to compute the minimum distance. This approach efficiently reduces redundant comparisons by leveraging value-based grouping. The solution runs in O(n) time with additional space for index storage. Continuing to refine problem solving through pattern recognition and efficient data organization. #365DaysOfCode #Day243 #DSA #LeetCode #Python #Algorithms #HashMap #ProblemSolving #Consistency

Day 254 of #365DaysOfCode Solved Check if There is a Valid Path in a Grid using a DFS-based traversal with directional constraints. Each cell type defines allowed movement directions, and transitions are validated by ensuring bidirectional connectivity between adjacent cells. The traversal explores only feasible paths while maintaining a visited structure to avoid cycles. The solution runs in O(n × m) time and emphasizes careful handling of constrained graph traversal. Continuing to strengthen understanding of grid-based graphs and state validation. #365DaysOfCode #Day254 #DSA #LeetCode #Python #Algorithms #DFS #Graphs #ProblemSolving #Consistency

🚗 Built an Automatic Number Plate Recognition (ANPR) System! Excited to share my recent project where I developed a real-time ANPR system using YOLOv8 and EasyOCR. 🔍 Key Features: • Real-time number plate detection • OCR-based text extraction • Custom dataset creation This project helped me strengthen my skills in Computer Vision and Machine Learning. 🔗 GitHub Repository: https://lnkd.in/g_5r5wcW #MachineLearning #ComputerVision #YOLO #Python #DataScience