Free Udemy Course: 50Days of DSA JavaScript Data Structures Algorithms LEETCODE

About the Course:Welcome to the Data Structures and Algorithms Coding Interview Bootcamp with Javascript!The primary goal of this course is to prepare you for coding interviews at top tech companies. By tackling one problem at a time and understanding its solution, you'll accumulate a variety of tools and techniques for conquering any coding interview.Daily Data Structures and Algorithms Coding Challenges:The course is structured around daily coding challenges. Consistent practice will equip you with the skills required to ace coding interviews. For the next 50 days commit to yourself to practice atleast 2 coding interview questions everyday. You don't need any setup for this as the daily coding problem challenges can be solved in the coding environment provided by Udemy. The course will automatically track your progress and you just need to spend your time making actual progress everyday.Topics Covered:We start from the basics with Big O analysis, then move on to very important algorithmic techniques such as Recursion, Backtracking and Dynamic Programming Patters. After this we move to cover common data structures, and discuss real problems asked in interviews at tech giants such as Google, Meta, Amazon, Netflix, Apple, and Microsoft.For each question, we will:Discuss the optimal approachExplain time and space complexityCode the solution in Javascript (you can follow along in your preferred language)Additional Resources :The course includes downloadable resources, motivational trackers, and cheat sheets.Course Outline:Day 1: Arrays, Big O, Sorted Squared Array, Monotonic ArrayDay 2:Recursion,k-th symbol in Grammar,Josephus problemDay 3:Recursion, Tower of Hanoi, Power SumDay 4:Backtracking, Permutations, Permutations 2Day 5:Backtracking, Subsets, Subsets 2Day 6:Backtracking, Combinations, Combinations Sum 1Day 7:Backtracking,Combinations Sum 2,Combinations Sum 3Day 8:Backtracking,Sudoku Solver, N QueensDay 9:Dynamic Programming, Fibonacci, Climbing StairsDay 10:Dynamic Programming, Min Cost Climbing Stairs, TribonacciDay 11:Dynamic Programming, 01 Knapsack, Unbounded KnapsackDay 12:Dynamic Programming, Target Sum, Partition Equal Subset SumDay 13:Dynamic Programming, LCS, Edit DistanceDay 14:Dynamic Programming, LIS, Max Length of Pair Chain, Russian Doll EnvelopesDay 15:Dynamic Programming, Palindromic Substrings, Longest Palindromic Substring, Longest Palindromic SubsequenceDay 16:Dynamic Programming, Palindrome Partitioning, Palindrome Partitioning 2Day 17:Dynamic Programming, Word Break, Matrix Chain MultiplicationDay 18:Dynamic Programming, Kadane's algorithm - Max Subarray, Maximum Product SubarrayDay 19:Greedy Algorithms - Fractional Knpasack, Non overlapping IntervalsDay 20:Greedy Algorithms - Jump Game 1, Minimum # of arrows to burst baloonsDay 21:Greedy Algorithms - Two City Scheduling, Boats to Save peopleDay 22:Greedy Algorithms - Task Scheduler, Largest NumberDay 23:Greedy Algorithms - Gas Stations,  Jump Game 2Day 24: Arrays, Rotate Array, Container with Most WaterDay 25: Hash Tables, Two Sum, Isomorphic StringsDay 26: Strings, Non-Repeating Character, PalindromeDay 27: Strings, Longest Unique Substring, Group AnagramsDay 28: Searching, Binary Search, Search in Rotated Sorted ArrayDay 29: Searching, Find First and Last Position, Search in 2D ArrayDay 30: Sorting, Bubble Sort, Insertion SortDay 31: Sorting, Selection Sort, Merge SortDay 32: Sorting, Quick Sort, Radix SortDay 33: Singly Linked Lists, Construct SLL, Delete DuplicatesDay 34: Singly Linked Lists, Reverse SLL, Cycle DetectionDay 35: Singly Linked Lists, Find Duplicate, Add 2 NumbersDay 36: Doubly Linked Lists, DLL Remove Insert, DLL Remove AllDay 37: Stacks, Construct Stack, Reverse Polish NotationDay 38: Queues, Construct Queue, Implement Queue with StackDay 39: Binary Trees, Construct BST, Traversal TechniquesDay 40: Pre order and In order Traversal of Binary Tree - IterativeDay 41: Post Order Traversal Iterative, Path Sum 2Day 42: Construct Binary Tree from Pre and In order Traversal ^ In and Post order TraversalDay 43: Binary Trees, Level Order Traversal, Left/Right ViewDay 44: Level order Trav 2, ZigZag TraversalDay 45: Vertical order Traversal, Sum root to leaf numbersDay 46: Binary Trees, Invert Tree, Diameter of TreeDay 47: Binary Trees, Convert Sorted Array to BST, Validate BSTDay 48: Lowest common Ancestor of BST, Unique BST 2Day 49: Lowest common Ancestor of Binary Tree, Unique BST 1Day 50: Serialize and Deserialize Binary Tree, N-ary Tree Level Order TraversalDay 51: Heaps, Max Heap, Min Priority QueueDay 52: Graphs, BFS, DFSDay 53: Graphs, Number of Connected Components, Topological SortDay 54: Number of Provinces, Find if path exists in GraphDay 55: Number of Islands, Numbers with same consecutive differencesMy confidence in your satisfaction with this course is so high that we offer a complete money-back guarantee for 30 days! Thus, it's a totally risk-free opportunity. Register today, facing ZERO risk and standing to gain EVERYTHING.So what are you waiting for? Join the best Javascript Data Structures & Algorithms Bootcamp on Udemy.I'm eager to see you in the course.Let's kick things off! :-) Jackson