Algorithms Lesson 4: Stacks & Queues
🧠 Algorithms CourseLesson 4 of 12 · 33% complete Stacks (LIFO) and queues (FIFO) are essential data structures used in…
-
-
Algorithms Lesson 10: Binary Search
🧠 Algorithms CourseLesson 10 of 12 · 83% complete Binary search eliminates half the search space with each step —…
-
Algorithms Lesson 12: Dynamic Programming
🧠 Algorithms CourseLesson 12 of 12 · 100% complete Dynamic programming breaks complex problems into overlapping sub-problems, solves each once,…
-
Algorithms Lesson 11: Recursion
🧠 Algorithms CourseLesson 11 of 12 · 92% complete Recursion is a function calling itself. Many problems that seem complex…
-
Algorithms Lesson 9: Sorting Algorithms
🧠 Algorithms CourseLesson 9 of 12 · 75% complete Sorting is fundamental. Knowing HOW sorting works (not just arr.sort()) is…
-
Algorithms Lesson 1: Big O Notation
🧠 Algorithms CourseLesson 1 of 12 · 8% complete Big O notation describes how an algorithm’s performance scales with input…
-
Algorithms Lesson 2: Arrays
🧠 Algorithms CourseLesson 2 of 12 · 17% complete Arrays are the most fundamental data structure. Understanding array operations and…
-
Algorithms Lesson 3: Linked Lists
🧠 Algorithms CourseLesson 3 of 12 · 25% complete A linked list is a chain of nodes where each node…
-
Algorithms Lesson 7: Binary Search Tree
🧠 Algorithms CourseLesson 7 of 12 · 58% complete A BST keeps data sorted: left child is always smaller, right…
-
Algorithms Lesson 5: Hash Tables
🧠 Algorithms CourseLesson 5 of 12 · 42% complete Hash tables (objects/Maps in JS) give O(1) average lookup, insert, and…
