Optimize Binary String Pattern Matching

In the "Wrong Syntax" example, the mistake lies in using the `var` keyword to declare the loop variable `i`. **The Issue:** `var` is function-scoped (or globally scoped), not block-scoped. Because of this, only one instance of the variable `i` is created for the entire loop, and its value is updated with each iteration. By the time the `setTimeout` callbacks execute (after 1000ms), the loop has finished, and `i` holds its final value of 5. Therefore, it logs "5" five times. **The Fix:** Using the `let` keyword, as shown in the "Correct Syntax" example, resolves this. `let` is block-scoped, which means a *new* variable `i` is created for each individual iteration of the loop, effectively "binding" the current value of `i` to that specific callback function. #JavaScript #CodingMistakes #Scope #WebDevelopment #ProgrammingTips

🎯 Key Learnings from Day 3 ✔ Iterating through arrays efficiently ✔ Using counters to track values ✔ Applying conditional checks inside loops ✔ Strengthening problem-solving fundamentals Small consistent steps in DSA build strong logic and better problem-solving skills. Looking forward to solving more problems tomorrow. #DSA #JavaScript #CodingJourney #ProblemSolving #100DaysOfCode #LearningInPublic

Check if a Binary String Contains Only One Segment of 1s Problem: Given a binary string s, determine whether the string contains only one contiguous segment of '1's. If we ever find a '1' that appears after a '0', it means a new segment of 1s has started — which violates the condition. Approach: -Iterate through the string. -Check if the previous character is '0' and the current character is '1'. -If that happens, it means there are multiple segments of 1s, so return false. 🔍 Time Complexity:O(n) 🔍 Space Complexity:O(1) #javascript #typescript #algorithms #datastructures #leetcode #codingpractice #frontenddeveloper #softwareengineering #problemSolving #100DaysOfCode

DSA Day 1 – Reverse String Problem Problem: Reverse a string in-place Approach: - Used two pointers (left & right) - Swapped elements until they meet Time Complexity: O(n) Space Complexity: O(1) Learned: Two-pointer approach is very useful for array/string problems. #DSA #LeetCode #JavaScript #CodingJourney #GFG

💻 JavaScript Intermediate – Remove Duplicates from an Array Duplicates in arrays can cause bugs or unnecessary processing. Here's a clean way to remove them. 📌 Problem: Get an array containing only unique values. JavaScript code function removeDuplicates(arr) { return [...new Set(arr)]; } console.log(removeDuplicates([1, 2, 2, 3])); 📤 Output: [1, 2, 3] 📖 Explanation: • Set automatically stores unique values only. • Spread operator ... converts it back to an array. 💡 Tip: Use this for data cleaning, API responses, or user inputs. #JavaScript #Coding #WebDevelopment #FrontendDevelopment #LearnToCode #ProgrammingTips

Day 59/365 💻🔥 1011. Capacity To Ship Packages Within D Days (Medium) Instead of searching in the array, we binary searched the minimum ship capacity that allows shipping all packages within the given days. Key takeaway 🧠 If a problem asks for the minimum/maximum value under a constraint, think Binary Search on Answer. #Day59 #365DaysOfCode #LeetCode #BinarySearch #JavaScript #DSA

📌 #75 DailyLeetCodeDose Today's problem: 108. Convert Sorted Array to Binary Search Tree – 🟢 Easy This is a classic divide and conquer problem – we pick the middle element as the root, then recursively construct the left subtree from the left half of the array and the right subtree from the right half. Easy :) https://lnkd.in/eyecRNEj #DailyLeetCodeDose #LeetCode #JavaScript #Algorithms #ProblemSolving #Coding

🚀 Just built a simple Live Name Filter using JavaScript Today I practiced DOM manipulation + events + regex and created a small project where: ✔️ User types their name in input field ✔️ Only letters (a-z, A-Z) & spaces are allowed ✔️ Invalid characters are automatically removed ✔️ Input is displayed live in a heading 💡 Concepts I used: DOM Selection (querySelector) Event Handling (input event) String methods (replace) Basic Regex ([^a-zA-Z ]) Small steps every day towards becoming a better developer 💻🔥 #JavaScript #WebDevelopment #LearningInPublic #CodingJourney #Frontend #ApnaCollege

📌 #68 DailyLeetCodeDose Today's problem: 86. Partition List – 🟡 Medium The goal is to rearrange a linked list so that all nodes with values less than x come before nodes greater than or equal to x, while preserving their original relative order and a clean way to solve this problem is to build two lists: 1-st one for nodes < x   2-nd for nodes >= x Then simply connect them together – this keeps the original order and runs in O(n) time with O(1) extra space. https://lnkd.in/e3Sa4AWC #DailyLeetCodeDose #LeetCode #JavaScript #Algorithms #ProblemSolving #Coding

Inconsistent syntax in a #React project almost cost me hours of debugging. In store.js, I used set-people, while in Home.jsx, I used set_people. It took a while to catch it. The problems is, after changing both to set_people, the store is now inconsistent since other cases in this switch statement use an underscore. I may change all to an underscore to keep them the same. This seems to be more common among developers than the dash when using storeReducer, despite camel case being most recommended in #JavaScript in general.