The Dynamic Path – Mastering Dynamic Programming, One Thought at a TimeThe Confusion Before Clarity Imagine you’re sitting in front of your screen, staring at a problem like “Find the maximum sum of non-adjacent elements in an array.” You’ve tried recursion, brute force, even prayed to the algorithm gods—but the output ...Nov 4, 2025 · 6 min readdata-structures-and-algorithms-notes.hashnode.dev
String AlgorithmsSorting Algorithms KMP (Knuth–Morris–Pratt) Algorithm Core idea Build a table of how far to "jump back" in the pattern when a mismatch happens, using the pattern's internal prefix-suffix structure. Then scan the text once, reusing previous partial ma...Nov 3, 2025 · 19 min readdata-structures-and-algorithms-notes.hashnode.dev
Searching and Sorting Algorithms🧠 Binary Search Core Idea Binary Search works on sorted arrays.It repeatedly divides the search interval in half — compare the target with the middle element: If equal → found If smaller → search left If larger → search right Time Complexity B...Nov 2, 2025 · 18 min readdata-structures-and-algorithms-notes.hashnode.dev
Understanding Root Mean Squared Logarithmic Error ( RMSLE )Explaination A. What is RMSLE? RMSLE is an evaluation metric used for regression problems. It measures the ratio-based difference between predicted and actual values rather than absolute differences. RMSLE is especially useful when: You care more ab...May 7, 2025 · 2 min readdata-science-notes.hashnode.dev
🧠 Zero to Hero : Text Vectorization📌 What is Text Vectorization? In NLP, machines can’t understand text directly — they understand numbers. Text vectorization is the process of converting textual data into numerical vectors so that we can feed them into machine learning or deep learn...Apr 13, 2025 · 8 min readdata-science-notes.hashnode.dev
