وب سایت تخصصی شرکت فرین
دسته بندی دوره ها
1

70+ JavaScript Challenges: Data Structures & Algorithms

سرفصل های دوره

Build better foundational skills as a developer by doing challenges and learning about data structures and algorithms


1. Introduction
  • 1. Welcome To The Course
  • 2. Course Structure
  • 3. DSA - The What & Why
  • 4. Tools & Basic Setup
  • 5.1 traversy-js-challenges.zip
  • 5. Sandbox Environment Setup

  • 2. Basic Challenges - Part 1
  • 1. Hello World (Starter Challenge)
  • 2. Get Sum (Starter Challenege)
  • 3. Calculator
  • 4. Count Occurences
  • 5. Find Max Number
  • 6. Title Case
  • 7. Reverse String
  • 8. Palindrome
  • 9. Count Vowels
  • 10. Remove Duplicates

  • 3. Basic Challenges - Part 2
  • 1. FizzBuzz Array
  • 2. Array Intersection
  • 3. Display Likes
  • 4. Find Missing Number
  • 5. Find Missing Letter
  • 6. Are All Chars Unique
  • 7. First Non-Repeating Character
  • 8. Dice Game Simulation
  • 9. Format Phone Number
  • 10. Validate Email

  • 4. High Order Array Methods
  • 1. Simple Examples
  • 2. Sum Of Even Squares
  • 3. Calculate Total Sales
  • 4. Highest Scoring Word
  • 5. Valid Anagrams
  • 6. Hashtag Generator
  • 7. Valid IPv4
  • 8. Analyze Car Mileage
  • 9. Password Validator
  • 10. Find Missing Letter Refactor

  • 5. Recursion
  • 1. Recursion Intro (Countdown)
  • 2. Recursive Unwinding
  • 3. Reverse String Using Recursion
  • 4. Fibonacci Sequence
  • 5. Factorial
  • 6. Power
  • 7. Array Sum
  • 8. Number Range
  • 9. Flatten Array
  • 10. Permutations

  • 6. Time & Space Complexity
  • 1. What Is Time Complexity
  • 2. Big O Notation
  • 3. Constant Time Complexity - O(1)
  • 4. Linear Time Complexity - O(n)
  • 5. Quadratic Time Complexity - O(n^2)
  • 6. Logarithmic Time Complexity - O(log n)
  • 7. Space Complexity
  • 8. Max Subarray - Quadratic
  • 9. Sliding Window Technique
  • 10. Max Subarray - Linear

  • 7. Hash Tables, Maps & Sets
  • 1. Hash Table Intro
  • 2. Maps
  • 3. Word Frequency Counter
  • 4. Phone Number Directory
  • 5. Anagram Grouping
  • 6. Sets
  • 7. Symmetric Difference
  • 8. Two Sum
  • 9. Longest Consecutive
  • 10. Custom Hash Table - Part 1
  • 11. Custom Hash Table - Part 2
  • 12. Word Instance Counter Using Custom Hash Table
  • 13. Add getValues Method
  • 14. Anagram Grouping With Custom Hash Table

  • 8. Stacks, Queues & Linked Lists
  • 1. What Is A Stack
  • 2. Stack Implementation
  • 3. Reverse String Using A Stack
  • 4. Balanced Parenthesis
  • 5. What Is A Queue
  • 6. Queue Implementation
  • 7. Reverse String With A Queue
  • 8. Palindrome With A Queue & Stack
  • 9. What Is A LInked LIst
  • 10. Linked List Implementation
  • 11. Reverse String With A Linked List
  • 12. Fast & Slow Pointers
  • 13. Find Middle
  • 14. What Is A Doubly Linked List
  • 15. Doubly Linked List Implementation - Part 1
  • 16. Doubly Linked List Implementation - Part 2
  • 17. Find Pair Sum

  • 9. Binary Trees, BST & Graphs
  • 1. What Is a Tree Binary Tree
  • 2. Tree Node Class
  • 3. Depth-First Traversal
  • 4. Depth-First Traversal Using Recursion
  • 5. Breadth-First Traversal
  • 6. Maximum Depth
  • 7. What Is A Binary Search Tree
  • 8. Binary Search Tree Implementation - Part 1
  • 9. Binary Search Tree Implementation - Part 2
  • 10. Validate BST
  • 11. What Is A Graph
  • 12. Adjacency Matrix & Adjacency List
  • 13. Graph Implementation
  • 14. Graph Traversal Visualization
  • 15. Graph Depth-First Traversal
  • 16. Graph Breadth-First Traversal

  • 10. Sorting Algorithms
  • 1. What Are Sorting Algorithms
  • 2. Bubble Sort Algorithm
  • 3. Bubble Sort Implementation
  • 4. Insertion Sort Algorithm
  • 5. Insertion Sort Implementation
  • 6. Selection Sort Algorithm
  • 7. Selection Sort Implementation
  • 8. Merge Sort Algorithm
  • 9. Merge Sort Implementation
  • 10. Quick Sort Algorithm
  • 11. Quick Sort Implementation

  • 11. Wrap Up
  • 1. Wrap Up
  • 139,000 تومان
    بیش از یک محصول به صورت دانلودی میخواهید؟ محصول را به سبد خرید اضافه کنید.
    افزودن به سبد خرید
    خرید دانلودی فوری

    در این روش نیاز به افزودن محصول به سبد خرید و تکمیل اطلاعات نیست و شما پس از وارد کردن ایمیل خود و طی کردن مراحل پرداخت لینک های دریافت محصولات را در ایمیل خود دریافت خواهید کرد.

    ایمیل شما:
    تولید کننده:
    مدرس:
    شناسه: 21586
    حجم: 5715 مگابایت
    مدت زمان: 748 دقیقه
    تاریخ انتشار: ۷ آبان ۱۴۰۲
    طراحی سایت و خدمات سئو

    139,000 تومان
    افزودن به سبد خرید