mlopss.hashnode.devHow to Start a Machine Learning Project ?One of the most common questions beginners ask when entering machine learning is surprisingly simple: “How do I start a new ML project?” Not which algorithm to use, not which library is best, just where do I begin? The process isn’t magical. It’s sys...Feb 6·5 min read
prash-algorithms.hashnode.devLeetcode 31. Next permutation | GeeksforGeeks | Data Structure and AlgorithmsMe: “Okay, GfG / LeetCode - next permutation. I need the next lexicographically larger arrangement of this array (in-place). How do I do it?”Brain: “Easy. There's a greedy trick - find a pivot, swap with the smallest bigger element on its right, then...Sep 10, 2025·3 min read
prash-algorithms.hashnode.devLeetcode Weekly Contest 465 | My Experience of attempting 2/4.Competitive programming contests are always a mix of adrenaline, logic, and reality checks. In Weekly Contest 465, I managed to attempt 2 out of 4 problems. One was a smooth ride, while the other gave me a tough reality check - despite multiple attem...Aug 31, 2025·4 min read
prash-algorithms.hashnode.devSearching in a Sorted 2D Matrix | Leetcode 2D Matrix"Given a sorted 2D matrix (each row and column is sorted), and a target number, determine if the number exists in the matrix." At first glance, it looked simple. But as always, the devil is in the details. Here’s how my thought process evolved. Step ...Aug 30, 2025·3 min read
prash-algorithms.hashnode.devCounting Numbers Divisible by Given Primes | Geeks for GeeksWhen I first stumbled upon the problem “Count how many numbers from 1 to M are divisible by any number from a given set of primes”, it looked deceptively simple. The statement in my head was straightforward: Input: a set of primes arr, and a number ...Aug 30, 2025·4 min read
