Basics Strong
Basics Strong
  • 84
  • 140 659
Introduction
In this lecture, we're diving into the new features related to creating variables in JavaScript, along with the concept of scope.
We'll first revisit how variables were created in older versions of JavaScript using the var keyword, and explore the problems that come with it. Then, we'll move on to modern JavaScript and discuss the use of let and const, focusing on when to use each one.
Finally, we'll introduce a recent addition to JavaScript - the globalThis keyword, which helps in managing global scope in a more consistent way.
Let's start breaking these down in the upcoming lecture!
Переглядів: 7

Відео

Course on - Quick JavaScript Modern and Advanced Hacks
Переглядів 159 годин тому
Course on - Quick JavaScript Modern and Advanced Hacks Hey Guys! 👋 Welcome to our brand new course - "Quick JavaScript Crash Course on Modern and Advanced JavaScript Hacks!" 🎉 In this course, you will learn essential JavaScript concepts and hacks that will eliminate your fear of coding and boost your JavaScript skills. JavaScript - the language that people either love or hate. 🤔 Why the mixed f...
History of Java Script & What is JavaScript
Переглядів 79 годин тому
JavaScript is a lightweight, interpreted, object-oriented language with first-class functions. This means that functions can be stored in variables and passed around like any other object. While JavaScript is best known as the scripting language for web pages, it’s also used in many non-browser environments. It’s a prototype-based, multi-paradigm scripting language that is dynamic, supporting o...
How to measure complexity?
Переглядів 1599 місяців тому
In this lecture, we'll learn about the different ways to measure the complexity of algorithms. Complexity is a way of measuring how fast or slow an algorithm will run as the input size grows. There are two main types of complexity: Time complexity Space complexity In general, we want to choose algorithms that have the lowest possible complexity. However, sometimes we have to trade off time comp...
Complexity Analysis Introduction
Переглядів 659 місяців тому
In this video, we will discuss complexity analysis in more detail. I hope this video is helpful! Hashtags: #algorithms #datastructures #complexityanalysis Tags: datastructures algorithms datastructures and algorithms complexity analysis matrix chain multiplication problem rod-cutting problem levenshtein distance problem coin-change problem longest-decreasing subsequence time complexity bottom-u...
Complexity Analysis
Переглядів 11810 місяців тому
In this video, we will discuss complexity analysis. I hope this video is helpful! Hashtags: #algorithms #datastructures #complexityanalysis Tags: datastructures algorithms datastructures and algorithms complexity analysis matrix chain multiplication problem rod-cutting problem levenshtein distance problem coin-change problem longest-decreasing subsequence time complexity bottom-up approach top-...
Complexity Analysis | Matrix Chain Multiplication Problem | Dynamic Programming
Переглядів 26710 місяців тому
In this video, we will discuss the complexity analysis of the matrix chain multiplication problem. I hope this video is helpful! Visit the full course with live coding here: www.udemy.com/course/algorithms-in-python-design-techniques/ www.udemy.com/course/algorithm-design-techniques-live-coding-in-javascript/ www.udemy.com/course/algorithm-design-techniques-live-problem-solving-in-java/ Hashtag...
Matrix Chain Multiplication Problem | Dynamic Programming
Переглядів 15310 місяців тому
In this video, we will discuss how to use dynamic programming to solve the matrix chain multiplication problem. I hope this video is helpful! Visit the full course with live coding here: www.udemy.com/course/algorithms-in-python-design-techniques/ www.udemy.com/course/algorithm-design-techniques-live-coding-in-javascript/ www.udemy.com/course/algorithm-design-techniques-live-problem-solving-in-...
Complexity Analysis | Rod Cutting Problem
Переглядів 18610 місяців тому
In this video, we will discuss the complexity analysis of the rod-cutting problem. I hope this video is helpful! Visit the full course with live coding here: www.udemy.com/course/algorithms-in-python-design-techniques/ www.udemy.com/course/algorithm-design-techniques-live-coding-in-javascript/ www.udemy.com/course/algorithm-design-techniques-live-problem-solving-in-java/ Hashtags: #dynamicprogr...
Rod Cutting Problem
Переглядів 25510 місяців тому
The rod cutting problem is a problem of trying to get the most money from a rod of a certain length by cutting it into smaller pieces and selling those pieces. You can only cut the rod at certain lengths, and each length has a different price. In this video, we will discuss how to use dynamic programming to solve the rod-cutting problem. I hope this video is helpful! Visit the full course with ...
Complexity Analysis | Levenshtein distance problem | Dynamic programming
Переглядів 14410 місяців тому
In this video, we will analyze the time and space complexity of the dynamic programming solution to the Levenshtein distance problem. I hope this video is helpful! Visit the full course with live coding here: www.udemy.com/course/algorithms-in-python-design-techniques/ www.udemy.com/course/algorithm-design-techniques-live-coding-in-javascript/ www.udemy.com/course/algorithm-design-techniques-li...
Levenshtein Distance Problem
Переглядів 11610 місяців тому
In this video, we will discuss the Levenshtein distance problem. I hope this video is helpful! Visit the full course with live coding here: www.udemy.com/course/algorithms-in-python-design-techniques/ www.udemy.com/course/algorithm-design-techniques-live-coding-in-javascript/ www.udemy.com/course/algorithm-design-techniques-live-problem-solving-in-java/ Hashtags: #dynamicprogramming #algorithms...
Complexity Analysis | Coin Change Problem
Переглядів 13110 місяців тому
In this video, we will discuss the time and space complexity of the dynamic programming solution to the coin change problem. I hope this video is helpful! Visit the full course with live coding here: www.udemy.com/course/algorithms-in-python-design-techniques/ www.udemy.com/course/algorithm-design-techniques-live-coding-in-javascript/ www.udemy.com/course/algorithm-design-techniques-live-proble...
Coin Change Problem
Переглядів 4510 місяців тому
In this video, we will discuss how to use dynamic programming to solve the coin change problem. I hope this video is helpful! Visit the full course with live coding here: www.udemy.com/course/algorithms-in-python-design-techniques/ www.udemy.com/course/algorithm-design-techniques-live-coding-in-javascript/ www.udemy.com/course/algorithm-design-techniques-live-problem-solving-in-java/ Hashtags: ...
Complexity Analysis | LDS | Dynamic Programming
Переглядів 8210 місяців тому
In this video, we will discuss why the recursive solution to the longest decreasing subsequence problem has exponential time complexity. I hope this video is helpful! Visit the full course with live coding here: www.udemy.com/course/algorithms-in-python-design-techniques/ www.udemy.com/course/algorithm-design-techniques-live-coding-in-javascript/ www.udemy.com/course/algorithm-design-techniques...
Bottom-Up Approach | Complexity Analysis | Longest Decreasing Subsequence | Dynamic Programming
Переглядів 24610 місяців тому
Bottom-Up Approach | Complexity Analysis | Longest Decreasing Subsequence | Dynamic Programming
Top-Down Approach | Complexity Analysis | Longest Decreasing Subsequence | Dynamic Programming
Переглядів 21010 місяців тому
Top-Down Approach | Complexity Analysis | Longest Decreasing Subsequence | Dynamic Programming
Longest Decreasing Subsequence | Dynamic Programming
Переглядів 99510 місяців тому
Longest Decreasing Subsequence | Dynamic Programming
Complexity Analysis | Knapsack Problem | Dynamic Programming
Переглядів 20810 місяців тому
Complexity Analysis | Knapsack Problem | Dynamic Programming
0\\1 Knapsack Problem | Dynamic Programming
Переглядів 12010 місяців тому
0\\1 Knapsack Problem | Dynamic Programming
Complexity Analysis | Staircase Problem | Dynamic Programming
Переглядів 10310 місяців тому
Complexity Analysis | Staircase Problem | Dynamic Programming
Staircase Problem - Dynamic Programming
Переглядів 39110 місяців тому
Staircase Problem - Dynamic Programming
How to Approach Dynamic Programming Problems
Переглядів 14410 місяців тому
How to Approach Dynamic Programming Problems
Comparing Dynamic Programming, Recursion, Divide and Conquer, and Greedy Algorithms
Переглядів 30710 місяців тому
Comparing Dynamic Programming, Recursion, Divide and Conquer, and Greedy Algorithms
How to identify Dynamic Programming Problems
Переглядів 53710 місяців тому
How to identify Dynamic Programming Problems
Dynamic Programming - Introduction
Переглядів 12610 місяців тому
Dynamic Programming - Introduction
Dynamic Programming | playlist
Переглядів 13910 місяців тому
Dynamic Programming | playlist
Level Order Traversal Binary Tree
Переглядів 2310 місяців тому
Level Order Traversal Binary Tree
Binary Search Tree | Data Structures Algorithms
Переглядів 2210 місяців тому
Binary Search Tree | Data Structures Algorithms
Invert Binary Tree
Переглядів 3010 місяців тому
Invert Binary Tree