Mastering JavaScript & DSA Fundamentals through Code Challenges

📘 Today’s Learning: Big O Notation 🔍 Today I explored one of the most important concepts in programming — Big O Notation 🚀 Big O helps us understand how efficient our code is — how fast or slow it runs as the size of input grows. It’s all about analyzing time complexity and space complexity. 💡 What I learned & practiced: Understanding O(1), O(n), O(n²) and more Comparing how different data structures like Array and Set perform Experimenting with forEach, map, and loops to see how operations scale with input size Writing small test cases to visualize performance differences 🧠 Key Takeaway: Big O is not about exact speed — it’s about how your algorithm scales. Optimizing for efficiency is what separates good developers from great ones 💪 #BigONotation #TimeComplexity #CodingJourney #JavaScript #LearningEveryday

🚀 Mastering the KMP (Knuth–Morris–Pratt) Algorithm in JavaScript Today I explored one of the most efficient string matching algorithms — KMP Algorithm. It’s an optimized pattern searching method that avoids unnecessary comparisons, making it faster than the naive approach. 🧠 Key Concepts: Preprocesses the pattern using the LPS (Longest Prefix Suffix) array. Avoids re-checking characters that are already matched. Runs in O(n + m) time — perfect for large text searches. 📘 Use Case: Efficient searching in text editors, DNA sequence analysis, and search engines. 🔥 Learning takeaway: Understanding how preprocessing (LPS array) improves performance is a game-changer in algorithm design. #JavaScript #DSA #Algorithms #Coding #LearningJourney #KMPAlgorithm #Programming

Ever wondered how “Ctrl + F” finds text so fast? ⚡ That’s thanks to algorithms like Knuth–Morris–Pratt (KMP) — built to search patterns quickly and efficiently. It’s still used in real-time apps today — from chat filters and DNA searches to cybersecurity log scans. Old algorithm, modern impact. 💡

🚀 DSA Progress – Day 103 ✅ Problem #472: Concatenated Words 🧠 Difficulty: Hard | Topics: String, DFS, Dynamic Programming, Memoization 🔍 Approach: Implemented a DFS + Memoization strategy to identify all words that can be formed by concatenating two or more other words from the given list. Step 1 (Preparation): Store all words in a set for O(1) lookups. Step 2 (Recursive Checking): For each word, split it into all possible prefix–suffix pairs. If the prefix exists in the set, check if the suffix is either directly in the set or can be recursively formed using other words. Step 3 (Memoization): Use a dictionary (mp) to cache previously computed results to avoid redundant recursive calls. Step 4 (Result Collection): If a word can be formed by concatenation, add it to the result list. 🕒 Time Complexity: O(n × L²) n = number of words L = maximum word length Each word may be split at every position. 💾 Space Complexity: O(n + L) For the word set, recursion stack, and memoization dictionary. 📁 File: https://lnkd.in/gHA3vtD5 📚 Repo: https://lnkd.in/g8Cn-EwH 💡 Learned: This problem taught me how to efficiently combine recursion and memoization for overlapping subproblems. It felt like solving an advanced version of the Word Break problem but applied across an entire list of words. Breaking down the logic into small, reusable parts (isConcat + main loop) made the implementation clean and scalable. ✅ Day 103 complete — pieced together words like a linguistic puzzle master 🧩✨ Every big problem is just smaller words glued smartly together! 💬🔠 #LeetCode #DSA #Python #Recursion #DynamicProgramming #Strings #Memoization #WordProblems #100DaysOfCode #DailyCoding #InterviewPrep #GitHubJourney

💡 Brute Force vs. Mathematical Logic — Which One Wins? ⚔️ Tried a small coding challenge today: 👉 Find two numbers in an array whose sum equals a target (classic 2-sum problem 😎). code: https://lnkd.in/gtRVzcZY 🧠 Observation: Both give the same result — but the mathematical approach is cleaner, faster, and more efficient 💪 Sometimes, it’s not just about solving the problem… It’s about solving it smartly. 🚀 #JavaScript #CodingFun #LogicBuilding #ProblemSolving #WebDevelopment #LearnToCode #Efficiency #DeveloperLife

🚀 Mastering Array Recursion: Flattening Nested Structures Ever run into a deeply nested array and wished there was a clean, elegant way to make it flat? While built-in methods like Array.prototype.flat() are great, understanding the recursive approach is a fantastic way to sharpen your JavaScript fundamentals and master complex data structures! The Challenge 🤯 We want to transform an array like this: [1, [2, 3], [4, [5, 6]], 7] Into a flat array: [1, 2, 3, 4, 5, 6, 7] The Recursive Solution 🧠 Why Bother with Recursion? 🤔 Fundamental Skill: Recursion is a core computer science concept. Mastering it helps you better understand algorithms, tree traversals, and dynamic programming. Readability: For naturally recursive problems (like nested arrays or tree structures), the recursive solution often mirrors the problem's structure, making the code surprisingly elegant and readable. Interview Readiness: This is a classic coding interview problem designed to test your command of JavaScript and core algorithm design. Keep challenging yourself with these fundamentals! Happy coding! #JavaScript #Recursion #WebDevelopment #CodingChallenge #SoftwareEngineering

🚀 MERN + DSA Journey — Day 3: Recursion & the Power of Breaking Problems Down Today’s focus was on one of the most elegant concepts in programming — Recursion 🌀 To practice, I solved the classic problem: Implement pow(x, n) → Calculate xnx^nxn without using built-in power functions. 💡 Problem Breakdown The goal is to compute xnx^nxn efficiently — even for large exponents or negative powers. Using recursion and divide-and-conquer, we can reduce the time complexity from O(n) to O(log n).

I found a better way to create Claude Skills. Claude recently launched “Skills”, which you can generate directly inside Claude Web, great for simple setups. But I wanted more control and speed. So I switched to Cursor and honestly, it’s way better. Here’s how I do it: 1. Paste Anthropic’s docs and ask it to scaffold a create-skills project 2. It generates skill. md with YAML metadata & detailed instructions 3. Adds Python validators, templates, and linked resources automatically 4. I iterate fast, tweak prompts, rerun validation, and refine structure 5. Finally, zip and upload the finished skill to Claude Capabilities No more waiting for the web interface to catch up, Cursor turns it into a smooth, local workflow. Here’s a short demo showing how I build and deploy Claude Skills entirely inside Cursor 👇

DSA JOURNEY UPDATE — Strings from Basic ➝ Medium (Leveling Up!) Today’s DSA grind was all about mastering string manipulation — starting from the basics and moving confidently into medium-level logic. Each problem pushed me to think cleaner, faster, and more algorithmically. Here's what I tackled 👇 🔹 1. Remove Spaces (Basic) A warm-up challenge! Cleaned the given string by removing all spaces — even multiple or leading ones. Perfect refresher on simple string traversal. 🔹 2. Count the Characters (Easy) Counted how many characters occur exactly N times, with consecutive occurrences treated as a single appearance. Loved the twist — makes you think beyond simple frequency tables! 🔹 3. k-Anagram (Medium) This one tested logical thinking 🔥 Two strings are k-anagrams if they can match after changing at most k characters. Learned how frequency mismatch directly relates to minimum edits. A great interview-level question! 🔹 4. Count of Strings With Constraints (Medium) Given length n, count how many strings can be formed with letters a, b, c under constraints — at most 1 b and 2 c. A pure combinatorics problem → zero loops → O(1) logic. Super satisfying to solve! 🎯 What I Gained Today ✔ Strengthened string manipulation skills ✔ Clear idea of frequency-based logic ✔ Practical exposure to combinatorics ✔ Confidence to tackle medium-level questions next If you're also grinding DSA, remember — consistency beats intensity. Let’s keep learning, leveling up, and building momentum one problem at a time! 🚀 #dsa #codingjourney #leetcode #geeksforgeeks #javascript #programming #learningeveryday #developerjourney

🔼 Day 165 of #200DaysOfCode Today, I revisited a fundamental concept that plays a major role in data structures and algorithm design — sorting an array in ascending order using Bubble Sort (without built-in sort methods). 💡 Modern JavaScript gives us shortcuts like Array.sort(), but when we build the logic manually, we develop a much deeper understanding of: • Pairwise comparison • Value swapping in arrays • Nested looping structure • Time complexity (Bubble Sort → O(n²)) Sorting isn’t just a beginner concept — it’s the backbone of efficient searching, optimization, and real-world computational logic. 🔁 Going back to basics reminds me that advanced problem-solving ability is built on strong fundamentals, not shortcuts. 🌱 Every step forward in coding is supported by the basics we choose to master — and revisit. #JavaScript #200DaysOfCode #CodingChallenge #Sorting #Algorithms #WebDevelopment #DeveloperMindset #LearnInPublic #DSA #ProblemSolving