Jatin Dhamija’s Post

𝗗𝗮𝘆 𝟮𝟲: The Adventure Begins — Introduction to JavaScript! 🌟💻 The moment we’ve been waiting for has arrived! Day 26 of the AI Powered Cohort marked the official start of our JavaScript module. Today was all about getting a solid introduction and overview of this fundamental programming language: 𝗪𝗵𝗮𝘁 𝗶𝘀 𝗝𝗮𝘃𝗮𝗦𝗰𝗿𝗶𝗽𝘁? We learned that it's a high-level, interpreted scripting language primarily used to create interactive and dynamic content on websites. It’s the "behavior" layer of the web! 𝗖𝗼𝗿𝗲 𝗙𝘂𝗻𝗱𝗮𝗺𝗲𝗻𝘁𝗮𝗹𝘀: We started with the absolute basics, covering how to execute simple JS code in the browser console and understanding the role of the JS engine. 𝗕𝗮𝘀𝗶𝗰 𝗦𝘆𝗻𝘁𝗮𝘅 𝗢𝘃𝗲𝗿𝘃𝗶𝗲𝘄: Got a quick look at variables, data types, and simple operations—the building blocks of any JS program. The transition from the declarative languages (HTML/CSS) to a procedural language like JavaScript is challenging but thrilling. This foundational session was crucial for setting the right perspective for the complex topics ahead. Excited for the practical coding to come! #Day26 #CodingJourney #AIpoweredCohort #JavaScriptIntroduction #ProgrammingBasics #WebDevelopment #Frontend #SheryiansCodingSchool #TechEducation

🧮 Day 42 | In-Built Objects in JavaScript Explored Math and Date objects in JavaScript today — the foundation of many logical operations. 🧠 Learned about: • Math constants & methods (PI, round, random, pow, sqrt) • Date creation, formatting & manipulation • Time control using get and set methods ✨ Key Takeaway: JS comes packed with powerful tools — we just need to know how to use them right! 🔗 GitHub: https://lnkd.in/dtdU9-zZ #WebDevelopment #JavaScript #CodingJourney #Frontend

🚀 New Video in our DSA in JavaScript Series! In this video, we continue our Stack chapter 📚 — and solve two very popular stack problems in JavaScript 💻 You’ll learn step-by-step how to: ✅ Reverse a String using Stack ✅ Check for Balanced Parentheses (Brackets) Both are beginner-friendly but super important problems to understand how LIFO (Last In, First Out) works in real coding examples ⚙️ We’ll go through the full logic + code explanation and dry run everything inside VS Code 👇 💡 You’ll clearly understand: How Stack helps in Reversal & Matching problems Real use of push() and pop() How LIFO principle solves both questions Step-by-step dry run examples 🎥 Watch here → https://lnkd.in/etXYgrSp 📌 Watch the complete DSA in JavaScript playlist here: https://lnkd.in/g2qrGaSH 📂 Download the PPT for this topic here: https://lnkd.in/eejEhC3j #dsa #dsainjavascript #javascript #stack #datastructures #codingtutorial #dsaforbeginners #jdcodebase #javascriptdsa #stacktutorial

🧮 Finding the Median in JavaScript – Quick Tip! While working with numerical data, calculating the median is a common task. Here’s a clean and efficient way to find the median of an array in JavaScript 🧠 How it works: Sort the array in ascending order. Find the middle index. If the length is odd, return the middle element. If the length is even, return the average of the two middle elements. 💡 Output: For [1, 3, 2, 5, 4], the sorted array is [1, 2, 3, 4, 5] → Median = 3 ✅ A simple yet powerful example of handling statistics in JavaScript. #JavaScript #Coding #WebDevelopment #Learning #CodeSnippet #ProgrammingTips

“Daily Temperatures” Using Stack in JavaScript  ♨️ 👉 Day 19 / Day 93 👈 Description: 👉 The goal is to find out how many days you have to wait until a warmer temperature. ✅ Approach: 👉 Traverse the array from right to left. 👉Maintain a stack to store indices of temperatures in decreasing order. 👉 For each day, pop all smaller or equal temperatures. 👉 The difference between the current index and top of stack gives the number of days to wait. This method ensures O(n) time complexity instead of a brute-force O(n²). #JavaScript #CodingChallenge #DSA #InterviewPreparation #FrontendDeveloper #ProblemSolving #100DaysOfCode #TechLearning #LeetCode #Algorithms

Day 25/90 – 90 Days DSA Challenge Today I learned how to find the factorial of a number using recursion in JavaScript 💡 🧠 Concept Recap: Recursion is a process where a function calls itself to solve smaller subproblems. In the case of factorial, we multiply the number by the factorial of the previous number until we reach 1. ⚙️ Problem Statement: 👉 Write a recursive function fact(n) that returns the factorial of a number n. 🧩 Example: Input: 5 Process: 5 * 4 * 3 * 2 * 1 Output: 120 Time Complexity: O(n) 💾 Space Complexity: O(n) (recursive call stack) ✨ Key Takeaway: Recursion simplifies problems like factorial by breaking them down into smaller, repeatable steps — clean, simple, and powerful! 🚀 #Day25 #90DaysDSAChallenge #Recursion #JavaScript #ProblemSolving #Factorial #MechCode #LearningInPublic #FrontendDeveloper #CodeEveryday

Building a Basic Calculator in JavaScript 🔹 Ever wondered how to evaluate a math expression like '1 + (4 + 5 + 2) - 3' in JavaScript without using eval()? Here's a clean way to do it using stacks. Key Concepts: Stack for previous results and signs: Keeps track of nested parentheses. Sign management: Helps handle + and - correctly. Iterative parsing: Converts string digits into numbers. Avoids the dangers of eval(). Can handle nested parentheses. Shows how stack-based algorithms can solve real-world problems elegantly.

Learning never stops — and today’s focus was on Template Literals in JavaScript ✨ Template literals are an elegant upgrade over traditional string concatenation. They make code cleaner, more readable, and dynamic — especially when dealing with multi-line strings or injecting variables directly inside strings. Example: const name = "Tom"; const course = "MERN Stack"; console.log(`Hello ${name}, welcome to the ${course} learning journey!`); Template literals also make it easy to: 1.Embed expressions directly in your strings (${expression}) 2.Create multi-line strings without messy \n 3.Combine dynamic data effortlessly This small but powerful ES6 feature makes my code not only neater but also more expressive. 🚀 #JavaScript #TemplateLiterals #ES6 #WebDevelopment #CodingJourney #LearnToCode #MERNStack #CodeEveryday #JavaScriptLearning #FrontendDevelopment #DeveloperLife #WomenInTech #100DaysOfCode #TechSkills #CodingCommunity #CleanCode #StringInterpolation #WebDevLearning #TechGrowth

Count the Number of Digits - JavaScript Logic Simplified 👉 Day 24 / Day 93👈 👉 Find how many digits a number has — without converting it to a string? 1️⃣ Handle 0 as a special case — it has 1 digit. 2️⃣ Use Math.abs() to support negative numbers. 3️⃣ Repeatedly divide the number by 10 until it becomes 0, increasing the counter each time. 💡 Example: 👉 23453 → 2345 → 234 → 23 → 2 → 0 ✅ Total digits = 5 #JavaScript #CodingTips #WebDevelopment #FrontendDeveloper #LearnToCode #ProgrammingLogic #CleanCode #ProblemSolving #100DaysOfCode #TechCommunity #CodeNewbie #Algorithms

New Video in our DSA in JavaScript Series! In this video, we start a brand-new chapter — Queue 🧠 — one of the most important data structures in DSA! You’ll learn step-by-step what a Queue is, how it follows the FIFO (First In, First Out) principle, and where it’s used in real-world applications and DSA problems. We’ll go through: - What is a Queue and how it works - Understanding the FIFO concept with real-life examples - Queue operations — Enqueue, Dequeue, Peek, isEmpty, isFull - Where Queues are used in DSA (BFS, Scheduling, Buffers, etc.) By the end of this video, you’ll clearly understand: How Queue differs from Stack (FIFO vs LIFO) Why Queues are essential in problem solving Real-life use cases like Printer Queue, Task Scheduling, etc. Foundation for upcoming topics like Circular Queue, Priority Queue, and Deque This is a concept + theory video, so make sure to watch till the end before we move to implementation in the next one! * Watch here → https://lnkd.in/gyWSuZ4V * Watch the complete DSA in JavaScript playlist here: https://lnkd.in/g2qrGaSH * Download the PPT for this topic here: https://lnkd.in/gnga7zf6