Arduino, Backend Development, Cyber Security & Ethical Hacking, Data Structures & Algorithms, DevOps, Frontend Development, Game Development, Hardware & Electronics, IT & Networking, Linux Administration, Mobile Development, Programming & Development, Raspberry Pi, Robotics, Software Engineering, Web Development
Overview
Overview
COURSE DESCRIPTION
Mastering data structures and algorithms is your key to advancing in the programming world, especially in technical job interviews.
In this course, you’ll learn essential data structures and algorithms using JavaScript in a practical and easy-to-understand way. Direct application of LeetCode exercises will help you gain a deep understanding, improve your programming thinking, and increase your chances of success in global company exams.
You’ll cover fundamental concepts such as arrays, stacks, queues, linked lists, hash maps, trees, and graphs, as well as search and sorting algorithms and Time & Space Complexity analysis.
Each section includes real-world LeetCode exercises to solve step-by-step, enabling you to write clean, fast, and clear code.
Course Features
- Lectures 101
- Quiz 0
- Duration Lifetime access
- Skill level All levels
- Language English
- Students 5
- Certificate No
- Assessments Yes
Curriculum
Curriculum
- 14 Sections
- 101 Lessons
- Lifetime
Expand all sectionsCollapse all sections
- 01 - IntroductionOverview (Please Watch) + Code Editor2
- 02 - Big OBig O Intro + Big O Worst Case + Big O O(n) + Big O Drop Constants + Big O O(n^2) + Big O Drop Non-Dominants + Big O O(1) + Big O O(log n) + Big O Different Terms for Input + Big O Arrays + Big O Wrap Up11
- 2.1Big O Intro Lessons 13 Minutes
- 2.2Big O Worst Case Lessons 22 Minutes
- 2.3Big O O(n) Lessons 32 Minutes
- 2.4Big O Drop Constants Lessons 42 Minutes
- 2.5Big O O(n^2) Lessons 53 Minutes
- 2.6Big O Drop Non-Dominants Lessons 62 Minutes
- 2.7Big O O(1) Lessons 72 Minutes
- 2.8Big O O(log n) Lessons 85 Minutes
- 2.9Big O Different Terms for Input Lessons 92 Minutes
- 2.10Big O Arrays Lessosns 106 Minutes
- 2.11Big O Wrap Up Lessons 115 Minutes
- 03 - Classes & PointersClasses + Pointers2
- 04 - Linked ListsLinked List Intro + LL Big O + LL Under the Hood + LL Constructor + Coding Exercises (Important) + LL Push + LL Pop - Intro + LL Pop - Code +LL Unshift + LL Shift + LL Get + LL Set + LL Insert + LL Remove + LL Reverse15
- 4.1Linked List Intro Lessons 12 Minutes
- 4.2LL Big O Lessons 26 Minutes
- 4.3LL Under the Hood Lessons 33 Minutes
- 4.4LL Constructor Lessons 47 Minutes
- 4.5Coding Exercises (Important) Lessons 51 Minute
- 4.6LL Push Lessons 66 Minutes
- 4.7LL Pop – Intro Lessons 76 Minutes
- 4.8LL Pop – Code Lessons 88 Minutes
- 4.9LL Unshift Lessons 94 Minutes
- 4.10LL Shift Lessons 105 Minutes
- 4.11LL Get Lessons 114 Minutes
- 4.12LL Set Lessons 125 Minutes
- 4.13LL Insert Lessons 136 Minutes
- 4.14LL Remove Lessons 145 Minutes
- 4.15LL Reverse Lessons 156 Minutes
- 05 - Doubly Linked ListsDLL Constructor + DLL Push + DLL Pop + DLL Unshift + DLL Shift + DLL Get + DLL Set + DLL Insert + DLL Remove9
- 6 - Stacks & QueuesStack Intro + Stack Constructor + Stack Push + Stack Pop + Queue Intro + Queue Constructor + Queue Enqueue + Queue Dequeue8
- 7 - TreesTrees Intro & Terminology + Binary Search Trees Example + BST Big O + BST Constructor + BST Insert - Intro + BST Insert - Code + BST Contains + BST Minimum Value8
- 7.1Trees Intro & Terminology Lessons 15 Minutes
- 7.2Binary Search Trees Example Lessons 23 Minutes
- 7.3BST Big O Lessons 37 Minutes
- 7.4BST Constructor Lessons 44 Minutes
- 7.5BST Insert Lessons 56 Minutes
- 7.6BST Insert – Code Lessons 610 Minutes
- 7.7BST Contains Lessons 79 Minutes
- 7.8BST Minimum Value Lessons 8
- 8 - Hash TablesHash Table Intro + HT Collisions + HT Constructor z + HT Set + HT Get + HT Keys + HT Big O + HT Interview Question8
- 9 - GraphsGraph Intro + Graph Adjacency Matrix + Graph Adjacency List + Graph Big O + Graph Add Vertex + Graph Add Edge + Graph Remove Edge + Graph Remove Vertex8
- 9.1Graph Intro Lessons 14 Minutes
- 9.2Graph Adjacency Matrix Lessons 23 Minutes
- 9.3Graph Adjacency List Lessons 31 Minute
- 9.4Graph Big O Lessons 46 Minutes
- 9.5Graph Add Vertex Lessons 53 Minutes
- 9.6Graph Add Edge Lessons 63 Minutes
- 9.7Graph Remove Edge Lessons 74 Minutes
- 9.8Graph Remove Vertex Lessons 87 Minutes
- 10 - RecursionRecursion Intro + Call Stack + Factorial3
- 11 - Basic SortsBubble Sort Intro + Bubble Sort Code + Selection Sort Intro + Selection Sort Code + Insertion Sort Intro + Insertion Sort Code + Insertion Sort Big O7
- 12 - Merge SortMerge Sort Overview + Merge Intro + Merge Code + Merge Sort Intro + Merge Sort Code + Merge Sort Big O6
- 13 - Quick SortQuick Sort Intro + Pivot Intro + Pivot Code + Quick Sort Code + Quick Sort Big5
- 14 - Tree TraversalTree Traversal Intro + BFS (Breadth First Search) Intro + BFS Code + DFS (Depth First Search) PreOrder - Intro + DFS PreOrder - Code + FS PostOrder - Intro + DFS PostOrder - Code + DFS InOrder - Intro + DFS InOrder - Code9
- 14.1Tree Traversal Intro Lessons 12 Minutes
- 14.2BFS Code Lessons 36 Minutes
- 14.3DFS (Depth First Search) PreOrder – Intro Lessons 41 Minute
- 14.4DFS PreOrder – Code Lessons 57 Minutes
- 14.5BFS (Breadth First Search) Intro Lessons 24 Minutes
- 14.6FS PostOrder – Intro Lessons 62 Minutes
- 14.7DFS PostOrder – Code Lessons 75 Minutes
- 14.8DFS InOrder – Intro Lessons 82 Minutes
- 14.9DFS InOrder – Code Lessons 94 Minutes
Instructor
Instructor
Requirements
- Basic knowledge of JavaScript (variables, functions, loops). A basic understanding of programming in general. A computer and internet connection. No prior experience with algorithms is required.
Features
- Clear and easy-to-understand explanations of the most commonly used data structures. Practical applications and step-by-step solutions to LeetCode exercises. A deep understanding of search, sorting, and complexity analysis algorithms. Practices that help you develop your problem-solving skills. Numerous JavaScript examples suitable for all skill levels. Content suitable for interviews at companies like Google, Meta, Amazon, and others.
Target audiences
- Developers who want to improve their skills in algorithms and data structures. People preparing for technical job interviews. University students studying programming who want a strong foundation. Anyone who wants to develop their analytical and programming skills.
You May Like
You May Like
Risk Management for Cybersecurity and IT Managers
"Learn how to build an effective cyber risk management system within your organization, and know how to assess threats, prioritize them, and develop real response...