Implemented a function to check for array values without built-in methods

Start free on CSX and practice as you read: https://lnkd.in/eFtB-g27 In JavaScript, data types tell your code how to treat a value. Primitives are single values like text, numbers, and true/false. Composites group values together as labeled objects or ordered lists. Knowing the difference helps your conditions, loops, and functions behave predictably. Practice the data types lesson on CSX. Get instant feedback and beginner-friendly exercises. Follow for more tips.💻 ✨ #javascript #coding #webdevelopment #csx #datatypes #objects #arrays

🔼 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

🔽 Day 166 of #200DaysOfCode Today, I continued sharpening my fundamentals by implementing Bubble Sort in descending order — without using JavaScript’s built-in .sort() method. 💡 While sorting might look simple on the surface, it is one of the most essential concepts in programming — powering search algorithms, intelligent ordering systems, real-time data processing, and more. By writing this logic manually, I reinforced: ✅ How comparisons work inside loops ✅ Value swapping and index manipulation ✅ Time complexity analysis (O(n²) for Bubble Sort) ✅ Why optimized sorting algorithms matter in bigger datasets 🌱 Every advanced concept in Data Structures & Algorithms is built on these fundamentals — and revisiting them helps improve clarity, confidence, and coding discipline. 🔁 Progress in programming isn’t linear — it’s iterative. Master the basics, and everything else becomes easier. #JavaScript #166DaysOfCode #BubbleSort #Algorithms #WebDevelopment #DSA #CodingChallenge #ProblemSolving #LearnInPublic #DeveloperMindset

DSA Practice — Day 10 Solved the “Merge Sorted Array” problem on LeetCode 🧩 At first glance, it looked simple — just merge and sort. But when I started optimizing, it turned into an interesting challenge. 🧠 My Approaches: 1️⃣ Brute Force: Directly add all elements into one array and sort. (Simple, but inefficient ) 2️⃣ Two Pointer + Extra Space: Created a copy of nums1 and merged both arrays efficiently. ➤ Time Complexity: O(m + n) ➤ Space Complexity: O(n) 3️⃣ Optimized In-Place Approach: Used two pointers starting from the end of both arrays — merging in reverse order without extra space. ➤ Time Complexity: O(m + n) ➤ Space Complexity: O(1) 💡 Lesson: The best solution often hides behind simple logic — you just have to look from the right direction. #DSA #LeetCode #ProblemSolving #JavaScript #LearningInPublic #CodingJourney #BackendDeveloper #100DaysOfCode

Today, I solved an interesting LeetCode problem called “Max Sum of a Pair With Equal Sum of Digits(https://lnkd.in/gfE37qjM)". It looks simple — until you realize it’s actually two problems cleverly disguised as one. Let’s break it down: Problem 1 — Compute the Digit Sum For each number, we first need its digit sum — a classic number manipulation subproblem. 51 → 5 + 1 = 6   42 → 4 + 2 = 6   This step groups numbers by a common mathematical property — their digit sum. Problem 2 — Find the Maximum Pair Sum in Each Group Once we group numbers by their digit sum, the next challenge is to find two numbers with the same sum of digits that produce the largest total. This now becomes a hash map optimization problem: Use a map to store the largest number seen for each digit sum. For every new number, check if we already have one with the same digit sum. If yes → compute the potential pair sum → update the maximum. Approach Summary Digit Sum Calculation: O(logn) per number Hash Map Lookup: O(1) per operation Overall Time: O(n), efficient and clean Here is the solution Below #LeetCode #JavaScript #Coding

📊 Day 167 of #200DaysOfCode Today’s challenge focused on a very practical and frequently used concept in development — counting the frequency of each element in a list using JavaScript. 💡This exercise introduces a powerful concept: Using Objects as Hash Maps Frequency counting enables so many real-world applications such as: ✅ Data analytics ✅ Detecting duplicates ✅ Recommendation systems ✅ Word count in text processing ✅ Inventory & log management By implementing the logic manually, I strengthened my understanding of: • Key-value data structures • Conditional updating of values • Loop-based counting mechanism 🌱 Strong logic fundamentals transform simple problems into powerful tools for real-world solutions. Always learning. Always improving. #JavaScript #167DaysOfCode #ProblemSolving #HashMap #CodingChallenge #LearnInPublic #WebDevelopment #DSA #DeveloperMindset #FrequencyCounter

🔍 Day 168 of #200DaysOfCode Today, I focused on filtering specific values from an array — in this case, extracting only odd numbers using basic loop logic in JavaScript. ✔ This exercise reinforces how important condition checking is while working with data. ✔ Instead of using advanced built-in methods like .filter(), I wrote the logic manually — which improves clarity and confidence in how loops operate. ✅ What I practiced today: • Iterating through arrays • Checking conditions using modulo % • Selectively pushing results into a new array • Handling edge cases (like when no odd numbers exist) 🌱 Filtering is a skill that scales — from small number lists to large datasets powering real-world apps. Strong fundamentals → Strong code → Strong developer 💪 #JavaScript #168DaysOfCode #CodingChallenge #BackToBasics #LearnInPublic #ProblemSolving #WebDevelopment #DeveloperMindset #LogicBuilding

🧠 Day 20 of #100DaysOfDSA Today I practiced two classic problems from LeetCode — FizzBuzz and Reverse String. 📘 What I learned: These might look like simple problems, but they help sharpen logic building, loops, and condition handling — essential building blocks for bigger challenges. 💻 Problems Solved: 1️⃣ FizzBuzz – A fun way to practice modular arithmetic and condition prioritization. 2️⃣ Reverse String – Implemented using the two-pointer approach for an in-place reversal. 💡 Key Takeaways: FizzBuzz reinforces thinking through branching logic. The two-pointer method is efficient for array and string manipulation. Small problems like these build the foundation for complex algorithms. 🔗 Check out my implementations here: https://lnkd.in/gxs9yaen #100DaysOfCode #DSA #LeetCode #JavaScript #CodingJourney #ProblemSolving #LearningInPublic

Day 7/30 of #30DaysOfCoding Implemented a palindrome checker for @iCodeThis Functional Challenge - pure logic, no UI fluff.  Key Logic: Normalize input: `toLowerCase()` + strip non-alphanumerics, Compare string with its reverse via `split('').reverse().join('')`  Learnings: Clean string manipulation is foundational for data validation and algorithms.  🛠 Vanilla JavaScript Feedback on regex optimization welcome!   #30DaysOfCode #JavaScript #Algorithms #iCodeThis #FrontendDev

🎯 Day 172 of #200DaysOfCode Today’s challenge was all about finding all pairs in an array whose sum equals a given target number — a classic logic-building problem that strengthens both your thinking pattern and problem-solving flow. 💡 While most developers would jump to use built-in methods or advanced structures, I implemented it manually using nested loops — because fundamentals matter the most. 📘 Concepts reinforced today: • Nested loop logic • Pair combination generation • Conditional validation • Edge case handling (no valid pairs found) 🌍 Real-world use cases: ✅ Matching data pairs (like prices or scores) ✅ Detecting patterns in datasets ✅ Implementing basic algorithmic logic for interviews 🔥 The beauty of coding lies in building clarity — not just functionality. Every problem solved sharpens your analytical edge! #JavaScript #172DaysOfCode #ProblemSolving #LearnInPublic #WebDevelopment #CodingChallenge #LogicBuilding #BackToBasics #DeveloperMindset