CERTIFICATES: Added JavaScript Algorithms and Data Structures certifi…

database/Certificates/CertificateDatabaseKeys.ts

@@ -27,6 +27,7 @@ enum CertificateDatabaseKeys {
   UdemyTheCompleteDataStructuresAndAlgorithmsCourseInPython = "UC-74fdc19f-c016-43c5-8b2a-3cb30941205d",
   LinkedInProgrammingFoundationsAlgorithms = "e31b0a7d9243f44e8a528fc2d184cd4a3bfbdc789c899c3a9ee47ee511e51fd7",
   LinkedInProgrammingFoundationsDataStructures = "c5c41ea1aa52982d08705831612aba2e93e69a64e35dd2cce11c28fad12b59f7",
+  UdemyJavaScriptDataStructuresAndAlgorithms = "UC-82b6ac18-df7a-40bf-aae4-8a977077beb5",
 
   //^ Artificial Intelligence
   LinkedInAppliedArtificialIntelligenceAlgorithms = "964c3b1a049a60afa6bcbb55179e326c7e5cea11db0db7b8d3390be8fc5925e1",

database/Certificates/CertificateDatabaseMap.ts

@@ -509,6 +509,144 @@ const certificateMap: Database<CertificateInterface> = {
     The course progresses from basic to advanced concepts, equipping learners with the skills to excel in professional programming and technical interviews. 
     Tailored for a diverse audience, from self-taught programmers to seasoned developers, it provides lifetime access to extensive learning materials and a supportive community, all designed to boost career prospects in the tech industry.`,
     },
+  [CertificateDatabaseKeys.UdemyJavaScriptDataStructuresAndAlgorithms]: {
+    name: "JavaScript Data Structures & Algorithms",
+    category: CertificateCategoriesEnum.AlgorithmsDataStructures,
+    issuer: CertificateIssuersEnum.Udemy,
+    certificateURL:
+      "https://www.udemy.com/certificate/UC-82b6ac18-df7a-40bf-aae4-8a977077beb5/",
+    skills: [
+      SkillDatabaseKeys.JavaScript,
+      SkillDatabaseKeys.TypeScript,
+      SkillDatabaseKeys.Algorithms,
+      SkillDatabaseKeys.DataStructures,
+      SkillDatabaseKeys.ProblemSolving,
+      SkillDatabaseKeys.CriticalThinking,
+    ],
+    description: `
+    This course makes learning to code fun and simplifies complex concepts using animations. By animating Data Structures & Algorithms, the content becomes more visually engaging, allowing students to learn more effectively and retain information longer. Throughout the course, students are guided step-by-step with visual aids, making even the most challenging topics easier to understand. The course also includes dozens of coding exercises to immediately reinforce learning. Covering essential topics such as Big O notation, arrays, linked lists, doubly linked lists, stacks, queues, binary trees, hash tables, graphs, and various sorting and searching algorithms like Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and Breadth First Search, this comprehensive program ensures students are well-prepared for coding interviews.
+    `,
+    learningOutcomes: [
+      "Understanding Big O notation",
+      "Analyzing worst-case scenarios",
+      "Identifying O(n) complexity",
+      "Dropping constants in Big O",
+      "Identifying O(n^2) complexity",
+      "Dropping non-dominant terms in Big O",
+      "Identifying O(1) complexity",
+      "Identifying O(log n) complexity",
+      "Understanding different terms for input sizes",
+      "Analyzing Big O for arrays",
+      "Reviewing key Big O concepts",
+      "Defining classes in programming",
+      "Understanding pointers",
+      "Introducing linked lists",
+      "Analyzing Big O for linked lists",
+      "Performing coding exercises with linked lists",
+      "Implementing pop operation in linked lists",
+      "Implementing unshift operation in linked lists",
+      "Implementing shift operation in linked lists",
+      "Implementing get operation in linked lists",
+      "Implementing set operation in linked lists",
+      "Implementing insert operation in linked lists",
+      "Implementing remove operation in linked lists",
+      "Implementing reverse operation in linked lists",
+      "Answering Big O questions for linked lists",
+      "Constructing linked lists",
+      "Pushing elements in linked lists",
+      "Popping elements in linked lists",
+      "Unshifting elements in linked lists",
+      "Shifting elements in linked lists",
+      "Getting elements in linked lists",
+      "Setting elements in linked lists",
+      "Inserting elements in linked lists",
+      "Removing elements in linked lists",
+      "Reversing linked lists",
+      "Finding the middle node of a linked list",
+      "Detecting loops in linked lists",
+      "Finding the kth node from the end in linked lists",
+      "Partitioning a linked list",
+      "Removing duplicates in linked lists",
+      "Converting binary to decimal in linked lists",
+      "Reversing between nodes in linked lists",
+      "Constructing doubly linked lists",
+      "Pushing elements in doubly linked lists",
+      "Popping elements in doubly linked lists",
+      "Unshifting elements in doubly linked lists",
+      "Shifting elements in doubly linked lists",
+      "Getting elements in doubly linked lists",
+      "Setting elements in doubly linked lists",
+      "Inserting elements in doubly linked lists",
+      "Removing elements in doubly linked lists",
+      "Swapping the first and last nodes in doubly linked lists",
+      "Checking if a doubly linked list is a palindrome",
+      "Swapping nodes in pairs in doubly linked lists",
+      "Introducing stacks",
+      "Constructing stacks",
+      "Pushing elements in stacks",
+      "Popping elements in stacks",
+      "Understanding stack operations with arrays",
+      "Reversing a string using a stack",
+      "Checking balanced parentheses using a stack",
+      "Sorting a stack",
+      "Implementing a queue using stacks",
+      "Introducing queues",
+      "Constructing queues",
+      "Enqueuing elements in queues",
+      "Dequeuing elements from queues",
+      "Analyzing Big O for stacks and queues",
+      "Understanding tree terminology",
+      "Analyzing Big O for binary search trees",
+      "Constructing binary search trees",
+      "Checking if a binary search tree contains a value",
+      "Introducing hash tables",
+      "Handling collisions in hash tables",
+      "Constructing hash tables",
+      "Setting key-value pairs in hash tables",
+      "Getting values by key in hash tables",
+      "Retrieving all keys in hash tables",
+      "Answering Big O questions for hash tables",
+      "Finding items in common using hash tables",
+      "Identifying the first non-repeating character using hash tables",
+      "Grouping anagrams using hash tables",
+      "Solving the two-sum problem using hash tables",
+      "Calculating subarray sums using hash tables",
+      "Introducing sets",
+      "Removing duplicates using sets",
+      "Checking if a set has unique characters",
+      "Finding pairs in sets",
+      "Finding the longest consecutive sequence using sets",
+      "Introducing graphs",
+      "Understanding adjacency matrix and list representations",
+      "Analyzing Big O for graphs",
+      "Adding vertices to graphs",
+      "Adding edges to graphs",
+      "Removing edges from graphs",
+      "Removing vertices from graphs",
+      "Understanding heap operations",
+      "Inserting elements into a heap",
+      "Removing elements from a heap",
+      "Sinking down elements in a heap",
+      "Understanding priority queues",
+      "Understanding the call stack",
+      "Calculating factorial using recursion",
+      "Implementing recursive binary search tree (rBST) operations",
+      "Traversing trees using BFS",
+      "Traversing trees using DFS (PreOrder, PostOrder, InOrder)",
+      "Understanding basic sorting algorithms (Bubble, Selection, Insertion)",
+      "Implementing bubble sort on a linked list",
+      "Implementing selection sort on a linked list",
+      "Implementing insertion sort on a linked list",
+      "Understanding and implementing merge sort",
+      "Understanding and implementing quick sort",
+      "Solving problems using dynamic programming",
+      "Understanding overlapping subproblems",
+      "Optimizing substructure in algorithms",
+      "Calculating the Fibonacci sequence",
+      "Implementing memoization",
+      "Understanding bottom-up dynamic programming",
+    ],
+  },
   [CertificateDatabaseKeys.LinkedInProgrammingFoundationsAlgorithms]: {
     name: "Programming Foundations: Algorithms",
     category: CertificateCategoriesEnum.AlgorithmsDataStructures,