JavaScript | Blind 75 Algorithms | Easy Level | LeetCode
All the easy level algorithms from the Leetcode's blind 75 algorithms are explained in this course
Updated on Jun, 2025
Language - English
Development ,Programming Languages,Object Oriented Programming
Lectures -49
Quizzes -3
Duration -3 hours
Lifetime Access
Lifetime Access
30-days Money-Back Guarantee
Get your team access to 10000+ top Tutorials Point courses anytime, anywhere.
Course Description
Welcome to the beginner-friendly course "Blind 75 Algorithms from LeetCode | JavaScript". It will include a specially filtered list of the most popular interview questions that will get you started with algorithms and data structures which are set to give you the basic skills to become proficient.
We will have more than 3 hours of video tutorials to explain multiple ways step-by-step of solving each algorithm, and we will take the time to break down each of the problems to discuss the measurement of performance by a time and space complexity, including many examples so that students grasp the concepts easily.
Let us hear from you and find out how we can improve the course even further. It will help us perfect future videos and content so that we give you your best learning experiences. We're looking forward to supporting you through this, and we wish you a wonderful course!
Goals
- When this course is finished, you can hope to see an immense advancement in your abilities to solve problems and even perform faster in some key areas; specifically:
- Regarding arrays and hashmaps
- About two points
- In connection with sliding windows
- Concerning stacks
- Related to linked lists
- In terms of trees
- Regarding 1D dynamic programming
- As for intervals
- Bit manipulation When this course is finished, you can hope to see an immense advancement in your abilities to solve problems and even perform faster in some key areas; specifically:
Regarding arrays and hashmaps
About two points
In connection with sliding windows
Concerning stacks
Related to linked lists
In terms of trees
Regarding 1D dynamic programming
As for intervals
Bit manipulationWhen this course is finished, you can hope to see an immense advancement in your abilities to solve problems and even perform faster in some key areas; specifically:
Regarding arrays and hashmaps
About two points
In connection with sliding windows
Concerning stacks
Prerequisites
Basic understanding of Javascript programming language (helpful for coding but not necessary to grasp the techniques)
Curriculum
Check out the detailed breakdown of what’s inside the course
Introduction
1 Lectures
-
Welcome
02:07
02:07
Arrays and Hashmaps
8 Lectures
Two Pointers
3 Lectures
Sliding Window
2 Lectures
Stacks
4 Lectures
Linked Lists
8 Lectures
Trees
10 Lectures
1D Dynamic
2 Lectures
Intervals
2 Lectures
Bit Manipulation
9 Lectures
Instructor Details
Jeevan Eashwar
Course Certificate
Use your certificate to make a career change or to advance in your current career.
Our students work
with the Best
Related Video Courses
View MoreAnnual Membership
Become a valued member of Tutorials Point and enjoy unlimited access to our vast library of top-rated Video Courses
Subscribe now
Online Certifications
Master prominent technologies at full length and become a valued certified professional.
Explore Now