Master Matplotlib Figures, Lines & Arrows

Today, I focused on working with NumPy arrays. Building a solid foundation for data manipulation and analysis. Here’s what I practiced: 🔹 Created a 1D array with values from 1 to 15 🔹 Built a 2D array (3×4) filled with ones 🔹 Generated a 3×3 identity matrix 🔹 Explored key array properties like shape, type, and dimensions 🔹 Converted a regular Python list into a NumPy array This session helped me better understand how data is structured and handled in numerical computing. Getting comfortable with arrays is definitely a crucial step toward more advanced data analysis and machine learning tasks. Looking forward to building on this momentum 💡 #AI #MachineLearning #Python #NumPy #DataAnalysis #M4ACE

Day 72. Spent time going deeper into XGBoost today. Covered classification and worked through the math: gradients & hessian leaf weights similarity score & gain Some questions I tried to answer while learning: Why do we need Taylor expansion here? Why can’t we directly differentiate the objective? What makes decision trees non-smooth / non-differentiable? The key realization: since trees produce piecewise constant outputs, the loss surface isn’t smooth — which is why second-order approximation becomes necessary. Still revising, but things are starting to connect. Notes: https://lnkd.in/gCqHUeK9 #MachineLearning #XGBoost #LearningInPublic #Python #DataScience

Just completed the Gradient Descent lab in Andrew Ng's ML Specialization — and it genuinely clicked for me here. The concept: instead of guessing the best values for w and b in a linear model, gradient descent finds them automatically by repeatedly moving in the direction that reduces error. What I built from scratch in Python: ✅ compute_cost() — measures how wrong the model is ✅ compute_gradient() — calculates which direction to move ✅ gradient_descent() — runs 10,000 iterations to find optimal parameters What surprised me most: → Starting from w=0, b=0, the algorithm found w≈200, b≈100 for a house price dataset → The cost dropped rapidly at first, then slowed as it approached the minimum — exactly like rolling a ball to the bottom of a bowl → Setting the learning rate too high (α = 0.8) caused the model to completely diverge — cost shot up instead of down That last point was the most valuable. Seeing divergence visually made the theory real. Building these functions line by line beats reading about them any day. #MachineLearning #Python #AndrewNg #LearningInPublic #DataScience #GradientDescent

Day 2 of my Plant Disease AI Detector project 🌱🤖: Today I went deeper into FastAPI and started structuring real logic behind the endpoints. I learned how to: -Work with multiple routes instead of just a single endpoint -Use Python loops like enumerate() to handle data more efficiently -Think about how the backend will process and return results from an AI model It’s starting to feel less like just “running a server” and more like building an actual system. Step by step, turning this into a real AI-powered project. 🚀 #Python #FastAPI #AI #MachineLearning #BackendDevelopment

🚀 Update on my NumPy A to Z Repository! If you’ve been following my work, you know I’ve been building a structured repository to master NumPy from fundamentals to advanced concepts. 🔥 What’s coming next: 1- Phase 12 Sorting & Searching in NumPy: np.sort() np.argsort() np.searchsorted() 2- Phase 13 (Surprise 👀) Something special is coming. and I’m really excited about this one. ⏳ I’ll be launching these phases very soon. Stay tuned this is just the beginning. #Python #NumPy #MachineLearning #DataScience #AI

Headline: Logic meets Code. 🧩💻 I just wrapped up another challenge on HackerRank focusing on Probability & Statistics—specifically calculating outcomes across multiple independent events. The task: Determining the exact probability of drawing a specific color combination from two different bags. While the math can be done on paper, translating these permutations and combinations into clean, efficient code is where the real fun is. Steps like these are small but vital foundations for building more complex machine learning models later on. Excited to keep this momentum going! #DataScience #Python #HackerRank #Statistics #ContinuousLearning #AI link of #Solution :- https://lnkd.in/gC9j7RgS

🗓 7 April 2026 LeetCode Problem #128 – Longest Consecutive Sequence Solved the problem of finding the longest consecutive sequence in an unsorted array. Key insight: use a set for O(1) lookups and only start counting sequences from numbers that are the beginning of a sequence. Takeaways: - Using the right data structure reduces time complexity from O(n²) to O(n). - Avoid redundant work while scanning arrays. - Handle edge cases like empty or single-element arrays efficiently. This problem reinforces how a smart approach beats brute force every time! #LeetCode #Algorithms #Python #DataStructures #ProblemSolving #Coding #TechLearning

Built a GenAI application that converts YouTube videos into structured articles, downloadable PDFs, and responsive webpages. The system uses a multi-step pipeline: transcript extraction, content cleaning, article generation, and multi-format output creation. Tech stack: Python, Streamlit, LangChain, Groq (LLaMA 3.3), FPDF This project helped me understand how to design end-to-end GenAI workflows beyond simple summarization. 🔗 GitHub: https://lnkd.in/gygZUgGG #Innomaticsresearchlabs #GenerativeAI #Langchain #Python #Datascience

Solved Kth Smallest Element in a BST today Used an iterative inorder traversal (DFS with stack) to efficiently find the answer without extra space for storing nodes. Key idea: 👉 Inorder traversal of a BST gives nodes in sorted order 👉 So the k-th visited node is the answer Instead of recursion, I used a stack to simulate traversal: Go left as much as possible Process node Move right Clean, efficient, and interview-friendly ✅ Time: O(H + k) Space: O(H) (stack) Consistent practice is making these patterns feel natural 🚀 #LeetCode #DataStructures #Algorithms #Python #CodingInterview

🚀 Built my first RAG (Retrieval-Augmented Generation) Chatbot using Python! Instead of guessing, this chatbot reads, understands, and answers directly from custom data 📄➡️🤖 Powered by FAISS, HuggingFace embeddings, and Groq LLM, it delivers fast and context-aware responses. 💡 From static text → to intelligent conversations This is a small step into the world of AI-powered applications, but a big leap in how machines interact with knowledge. #AI #MachineLearning #LangChain #Python #RAG #GenAI #DataScience