Learning Big O Notation in Next Level Bootcamp

🔽 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

Patterns I hear it repeatedly, "Pick out the patterns." When solving coding problems this definitely rings true. Honestly it rings true in the world of nursing where I was originally from as well. When you sat down at the computer for your nursing license test it did not matter how many questions you practiced and how much of each medical problem you knew. That is not what got me or anyone else through. You have to realize the PATTERN. It was not always what they were asking, but how they were asking it. What details are they purposefully putting in the question or purposefully leaving out. Thinking out the problem, before looking at any answers provided to choose from. Very thankful for other coders who share what they have learned and what worked for them. I hope this post helps someone along their journey like it did me.

Day 30 of Cohort 2.0 🚀 Today’s wrap-up was all about diving deeper into JavaScript fundamentals and understanding how the language handles operations and logic. 💻 Here’s what I learned today: 🔹 Arithmetic Operators → Perform basic mathematical operations 🔹 Assignment Operators → Assign and update variable values 🔹 Comparison Operators → Compare values and return true/false 🔹 Logical Operators → Combine multiple conditions 🔹 Ternary Operator → Write shorter conditional statements 🔹 Type Checking (typeof) → Identify data types in JavaScript 🔹 String Operations → Work with and manipulate text 🔹 Nullish Coalescing (??) → Provide default values when dealing with null or undefined 🔹 Optional Chaining (?.) → Safely access nested object properties 🔹 Hoisting → Understand how variable and function declarations are processed before execution ✨ Key takeaway: Learning these core concepts builds a strong foundation for writing clean, efficient, and bug-free JavaScript code. Sheryians Coding School #sheryianscodingschool #cohort2 #learningjourney #dailyupdates #JavaScript #WebDevelopment #Frontend

📘 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

🔼 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

#Day49 at 10000 Coders Exploring Math, Number Methods, Scopes & Hoisting in JavaScript! ⚙️ Hey LinkedIn fam! 👋 Today marks another step forward in my web development journey with 10000 Coders, and I dove deep into some of the most interesting JavaScript fundamentals — Math, Number Methods, Scopes, and Hoisting! 💻✨ 🧠 What I Learned Today 🔹 Math Object: The Math object in JavaScript provides built-in methods and properties for mathematical operations. 🔹 Number Methods: JavaScript provides handy number methods for formatting and conversions. 🔹 Scopes: Understanding scope is key to writing bug-free code. ✅ Global Scope – accessible anywhere in the code ✅ Local/Function Scope – accessible only inside functions ✅ Block Scope (ES6 let & const) – limited to the block {} 🔹 Hoisting: JavaScript’s unique behavior where variable and function declarations are moved to the top of their scope before execution. 💡 Takeaways: 📌 Math and Number methods make numerical operations easy and precise 📌 Scopes define variable accessibility and prevent naming conflicts 📌 Hoisting is essential to understand how JavaScript executes code internally 🙏 Gratitude: A big shout-out to my mentors and the 10000 Coders team for their consistent guidance and motivation 💪 Special mentions: 📌 Harish M 📌 Spandana Chowdary 📌 Bhagavathula Srividya 📌 Ganesh Jaddu 📌 #Meghana 🔗 My Learning Repos: ▶ Python: https://lnkd.in/ehYGgYXB ▶ HTML & CSS: https://lnkd.in/d6rjQK6b ▶ JavaScript: https://lnkd.in/emMiMugS ▶ SQL: https://lnkd.in/eEkUU2-i #Day49 #JavaScript #Math #NumberMethods #Scopes #Hoisting #WebDevelopment #FrontendDevelopment #MERNStack #CodingJourney #10000Coders #DeveloperMindset #LearnToCode #ConsistencyIsKey #PracticeDaily

🌟 Day 4 — 21 Days Problem Solving Challenge 🌟 This post isn’t extraordinary — it’s just a small part of my learning story. Today, I faced lots of challenges, got stuck many times, and spent hours trying to solve problems. But in the end, I solved them all by myself — no AI, no Google, just pure logic and patience. The challenge was to solve everything without using any string or Math functions — only pure mathematics. Here’s what I worked on today 👇 1️⃣ Split Number into Digits Input: N = 12345 → Output: [1, 2, 3, 4, 5] 2️⃣ Remove the Decimal Point (Mathematically) Input: N = 12.34 → Output: 1234 3️⃣ Separate Whole and Fractional Parts Input: N = 5.75 → Output: Whole = 5, Fraction = 0.75 4️⃣ Count Whole and Fractional Digits Separately Input: N = 12.345 → Output: Whole Count = 2, Fraction Count = 3 5️⃣ Generate a Decimal Number from Whole and Fractional Digits Input: Whole = [1, 2], Fraction = [3, 4] → Output: 12.34 6️⃣ Check if a Number is a Palindrome Input: N = 121 → Output: Palindrome 7️⃣ Check if a Number is an Armstrong Number Input: N = 153 → Output: Armstrong Number ✨ Example: 1³ + 5³ + 3³ = 153 This series is really helping me sharpen my logical thinking and improve how I approach problems. If you’re an absolute beginner and want to take your problem-solving skills to the next level, I highly recommend checking out Anurag Singh’s free YouTube series. Every day is a new challenge, a new lesson, and a small victory. #WebDevelopment #FrontendDevelopment #WebDeveloper #JavaScript #HTML #CSS #ReactJS #React #TailwindCSS #Tailwind #Coding #Programming #100DaysOfCode #LearningJourney #ProjectTips #CodeChallenge #LearningToCode #BuildInPublic #CodingTips #CareerGrowth #Innovation #Technology #WebDesign #DevProjects #LogicBuilding #JSLogic

Day 113: Deep Dive into Core JavaScript & DSA Fundamentals! I spent today drilling into fundamental programming concepts, using multiple approaches for each problem to maximize my understanding and coding flexibility. This is the crucial prep work before jumping back into advanced Data Structures and Algorithms. 🎯 Today's Focus Areas: String Manipulation: Implemented String Reversal using four distinct methods: Built-in methods (.split(), .reverse(), .join()) Iterative for loop Recursion with substring() Recursion with slice() (and noted the difference between slice and substring on negative indices!) Mathematical Logic: Factorial Finder: Solved iteratively and recursively. Sum of Digits: Solved using string conversion, iterative while loop, and recursion. Power Calculation and Simple Interest Calculation. Conditional & Array Logic: Created a precise function to check for a Leap Year (year % 4 == 0 && year % 100 !== 0 || year % 400 == 0). Found the Biggest Number in an array without using the .sort() method, then compared it with Math.max(). Implemented robust Palindrome Checkers (for individual words and for finding all palindromic substrings). Wrote functions for Vowel/Consonant Counting, Finding Factors, and Calculating Average. Determined the Smallest of Three Numbers using conditional operators and Math.min(). It's been a great exercise in code efficiency and algorithmic thinking. Feeling much more confident and ready to accelerate into my DSA curriculum soon! #JavaScript #DSA #CodingChallenge #ProblemSolving #FullStack #Day113 #LearningInPublic

𝗗𝗮𝘆 𝟯𝟴: Mastering Advanced Functions, Scope, Arrays, and Objects in JavaScript! 🧠🗃️ Day 38 of the AI Powered Cohort at Sheryians Coding School was a powerhouse session! We advanced significantly in our JavaScript journey, covering essential concepts from complex function types to mastering data structures like Arrays and Objects. A massive thank you to Harsh Vandana Sharma for guiding us through this dense and critical material. Here's a breakdown of the key topics mastered today: 𝗔𝗱𝘃𝗮𝗻𝗰𝗲𝗱 𝗙𝘂𝗻𝗰𝘁𝗶𝗼𝗻 𝗖𝗼𝗻𝗰𝗲𝗽𝘁𝘀: 𝗙𝗶𝗿𝘀𝘁-𝗖𝗹𝗮𝘀𝘀 𝗙𝘂𝗻𝗰𝘁𝗶𝗼𝗻𝘀: Understanding that functions can be treated just like any other variable. 𝗛𝗶𝗴𝗵𝗲𝗿-𝗢𝗿𝗱𝗲𝗿 𝗙𝘂𝗻𝗰𝘁𝗶𝗼𝗻𝘀 & 𝗖𝗮𝗹𝗹𝗯𝗮𝗰𝗸𝘀: Functions that take other functions as arguments or return them. 𝗔𝗻𝗼𝗻𝘆𝗺𝗼𝘂𝘀 𝗙𝘂𝗻𝗰𝘁𝗶𝗼𝗻𝘀: Functions without a name, often used as callbacks. Pure vs. Impure Functions: Distinguishing between functions that always produce the same output for the same input (pure) versus those with side effects. 𝗦𝗰𝗼𝗽𝗲 & 𝗖𝗹𝗼𝘀𝘂𝗿𝗲𝘀: We solidified our understanding of Global vs. Functional Scope and dove into the powerful concept of Closures how inner functions retain access to variables from their outer scope even after the outer function has finished executing. 𝗠𝗮𝘀𝘁𝗲𝗿𝗶𝗻𝗴 𝗔𝗿𝗿𝗮𝘆𝘀: 𝗖𝗿𝗲𝗮𝘁𝗶𝗼𝗻 & 𝗔𝗰𝗰𝗲𝘀𝘀: We learned how to build and retrieve data from arrays. 𝗘𝘀𝘀𝗲𝗻𝘁𝗶𝗮𝗹 𝗠𝗲𝘁𝗵𝗼𝗱𝘀: We practiced a huge list of array methods including push, pop, shift, unshift, indexOf, slice, reverse, sort, join, and toString. 𝗠𝗼𝗱𝗲𝗿𝗻 𝗧𝗲𝗰𝗵𝗻𝗶𝗾𝘂𝗲𝘀: Mastered Array Destructuring, the Spread Operator (...), and powerful iteration methods like map, filter, reduce, some, and forEach. 𝗢𝗯𝗷𝗲𝗰𝘁𝘀 𝗗𝗲𝗺𝘆𝘀𝘁𝗶𝗳𝗶𝗲𝗱: We explored the fundamental key-value pair structure of Objects, learning how to create them, access and delete properties, and work with complex nested objects. This session truly bridged the gap between basic syntax and powerful, functional programming patterns. I'm excited to apply these advanced array methods and object structures to build more complex applications! #Day38 #CodingJourney #AIpoweredCohort #JavaScript #AdvancedJS #Closures #Arrays #Objects #WebDevelopment #Programming #SheryiansCodingSchool #HarshVandanSharma

Ever wondered how searching in a sorted array can go from slow to lightning fast? ⚡🔍 Hey everyone! Day 290 of my 365-day coding journey, and today I focused on a fundamental algorithm: LeetCode's "Binary Search." Understanding search algorithms is crucial for efficient data retrieval, and this problem is a perfect way to strengthen that skill. Let’s dive in! 🛠️ The Problem Given a sorted array of integers nums and a target value, the task is to search for the target in nums. If the target exists, return its index; otherwise, return -1. The array is guaranteed to be sorted in ascending order. 🎯 The Approach Solution 1: Linear Search - Iterate through each element from start to end. - Compare each element with the target; return the index if matched. - Simple, but O(n) time complexity makes it inefficient for large datasets. Solution 2: Binary Search - Much more efficient for sorted arrays. - Use two pointers, left and right, to track search boundaries. - Calculate mid, compare nums[mid] with target, and adjust pointers accordingly. - Repeat until target is found or pointers cross. - O(log n) time complexity makes it ideal for large datasets. ⚡ 🧠 Key Takeaways - For sorted data, always consider Binary Search first due to its logarithmic efficiency.   - Understanding midpoint calculation and pointer adjustments is critical for correct implementation.   - Linear search is simple but quickly becomes inefficient as input size grows.  💡 Challenge for you! Can you think of scenarios where linear search might still be better than binary search, even though the latter is faster? Share your thoughts! 💬 📺 Check out my video walkthrough I demonstrate both methods and discuss their nuances in detail: https://lnkd.in/dk89dtnJ 🔥 Join the Conversation If you’re sharpening your algorithms skills or tackling daily coding challenges, let’s connect! Always great to learn and share with fellow developers. 🚀 #CodingJourney #DSA #Algorithms #BinarySearch #LeetCode #JavaScript #ProblemSolving #DataStructures #Programming #DeveloperLife #LearningEveryDay #CodeNewbies