Data Structures Algorithms, DSA ,BigO Analysis for every Question, Coding Interview,DP,Backtracking,Data Structures
This course includes:
- 58 hours on-demand video
- 105 coding exercises
- 87 articles
- 15 downloadable resources
- Access on mobile and TV
- Full lifetime access
- Certificate of completion
What you'll learn
- Dynamic Programming, Backtracking Techniques
- Javascript Coding Interview Problems and Solutions
- Common Data Structures such as Arrays, Hash Table,Linked List,Binary trees,Graphs etc.
- Time and Space Complexity of Algorithms, Detailed Discussion of Logic to solve questions
- Real Coding Interview Questions from Google, Meta,Amazon,Netflix ,Microsoft etc.
- Boost your Problem solving skills
Description
Student Testimonials:
"Basically I'm a beginner to JavaScript but after listening to the way of his teaching, I have no words for him. He's a fabulous person, and I recommend all to watch his course." - Mohd. Amir
"Excellent explanations and application of theory directly to practice!" - Guillermo Gabriel Kelly Schmidt
"Explanations and demonstrations are on point, and it makes grasping easier." - Emmanuel Apea
"Excellent Teaching" - Sarhan Sayyed Rasool Shaikh
"Excellent course. The teacher has mastery of what he explains, and the content is of great value." - Vyctor Vieira Guimarães
About the Course:
Welcome to the Data Structures and Algorithms Coding Interview Bootcamp with JavaScript! This comprehensive course is meticulously designed 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, ensuring consistent practice to equip you with the skills required to ace coding interviews. For the next 50 days, commit to practicing at least two coding interview questions every day. No setup is needed, as the daily coding problem challenges can be solved in the coding environment provided by Udemy. The course will automatically track your progress, allowing you to focus on making actual progress every day.
Topics Covered:
We start from the basics with Big O analysis, then move on to essential algorithmic techniques such as Recursion, Backtracking, and Dynamic Programming Patterns. Afterward, we cover common data structures and discuss real problems asked in interviews at tech giants like Google, Meta, Amazon, Netflix, Apple, and Microsoft.
For each question, we will:
- Discuss the optimal approach
- Explain time and space complexity
- Code the solution in JavaScript (you can follow along in your preferred language)
Additional Resources:
The course includes a wealth of downloadable resources, motivational trackers, and cheat sheets to enhance your learning experience. These tools are designed to provide you with a comprehensive understanding of the concepts and ensure you're well-prepared for your coding interviews.
In-Depth Interview Preparation:
This bootcamp goes beyond just teaching you how to solve problems. It focuses on understanding the underlying principles and techniques that make solutions efficient and elegant. You'll learn to think like a software engineer and develop problem-solving strategies that are critical for success in technical interviews.
Practical Application and Real-World Scenarios:
Throughout the course, you'll encounter real-world scenarios and practical applications of data structures and algorithms. This hands-on approach ensures that you can apply what you've learned to solve complex problems and handle diverse challenges in your future career.
Engaging and Interactive Learning Experience:
Our teaching methodology is designed to be engaging and interactive, with clear explanations, step-by-step demonstrations, and practical exercises. This ensures that you not only understand the concepts but also retain and apply them effectively.
Join a Community of Learners:
You'll be part of a supportive community of learners who share your goals and aspirations. Engage in discussions, share insights, and collaborate on projects to enhance your learning experience and build valuable connections.
By the end of this bootcamp, you'll have a deep understanding of data structures and algorithms, a robust problem-solving toolkit, and the confidence to tackle coding interviews at top tech companies. Enroll today and take the first step towards achieving your career goals in the tech industry!
Course Outline:
- Day 1: Arrays, Big O, Sorted Squared Array, Monotonic Array
- Day 2:Recursion,k-th symbol in Grammar,Josephus problem
- Day 3:Recursion, Tower of Hanoi, Power Sum
- Day 4:Backtracking, Permutations, Permutations 2
- Day 5:Backtracking, Subsets, Subsets 2
- Day 6:Backtracking, Combinations, Combinations Sum 1
- Day 7:Backtracking,Combinations Sum 2,Combinations Sum 3
- Day 8:Backtracking,Sudoku Solver, N Queens
- Day 9:Dynamic Programming, Fibonacci, Climbing Stairs
- Day 10:Dynamic Programming, Min Cost Climbing Stairs, Tribonacci
- Day 11:Dynamic Programming, 01 Knapsack, Unbounded Knapsack
- Day 12:Dynamic Programming, Target Sum, Partition Equal Subset Sum
- Day 13:Dynamic Programming, LCS, Edit Distance
- Day 14:Dynamic Programming, LIS, Max Length of Pair Chain, Russian Doll Envelope
- Day 15:Dynamic Programing, Palindromic Substrings, Longest Palindromic Substring, Longest Palindromic Subsequence
- Day 16:Dynamic Programming, Palindrome Partitioning, Palindrome Partitioning 2
- Day 17:Dynamic Programming, Word Break, Matrix Chain Multiplication
- Day 18:Dynamic Programming, Kadane's algorithm - Max Subarray, Maximum Product Subarray
- Day 19:Greedy Algorithms - Fractional Knpasack, Non overlapping Intervals
- Day 20:Greedy Algorithms - Jump Game 1, Minimum # of arrows to burst baloons
- Day 21:Greedy Algorithms - Two City Scheduling, Boats to Save people
- Day 22:Greedy Algorithms - Task Scheduler, Largest Number
- Day 23:Greedy Algorithms - Gas Stations, Jump Game 2
- Day 24: Arrays, Rotate Array, Container with Most Water
- Day 25: Hash Tables, Two Sum, Isomorphic Strings
- Day 26: Strings, Non-Repeating Character, Palindrome
- Day 27: Strings, Longest Unique Substring, Group Anagrams
- Day 28: Searching, Binary Search, Search in Rotated Sorted Array
- Day 29: Searching, Find First and Last Position, Search in 2D Array
- Day 30: Sorting, Bubble Sort, Insertion Sort
- Day 31: Sorting, Selection Sort, Merge Sort
- Day 32: Sorting, Quick Sort, Radix Sort
- Day 33: Singly Linked Lists, Construct SLL, Delete Duplicates
- Day 34: Singly Linked Lists, Reverse SLL, Cycle Detection
- Day 35: Singly Linked Lists, Find Duplicate, Add 2 Numbers
- Day 36: Doubly Linked Lists, DLL Remove Insert, DLL Remove All
- Day 37: Stacks, Construct Stack, Reverse Polish Notation
- Day 38: Queues, Construct Queue, Implement Queue with Stack
- Day 39: Binary Trees, Construct BST, Traversal Techniques
- Day 40: Pre order and In order Traversal of Binary Tree - Iterative
- Day 41: Post Order Traversal Iterative, Path Sum 2
- Day 42: Construct Binary Tree from Pre and In order Traversal ^ In and Post order Traversal
- Day 43: Binary Trees, Level Order Traversal, Left/Right View
- Day 44: Level order Trav 2, ZigZag Traversal
- Day 45: Vertical order Traversal, Sum root to leaf numbers
- Day 46: Binary Trees, Invert Tree, Diameter of Tree
- Day 47: Binary Trees, Convert Sorted Array to BST, Validate BST
- Day 48: Lowest common Ancestor of BST, Unique BST 2
- Day 49: Lowest common Ancestor of Binary Tree, Unique BST
- Day 50: Serialize and Deserialize Binary Tree, N-ary Tree Level Order Traversal
- Day 51: Heaps, Max Heap, Min Priority Queue
- Day 52: Graphs, BFS, DFS
- Day 53: Graphs, Number of Connected Components, Topological Sort
- Day 54: Number of Provinces, Find if path exists in Graph
- Day 55: Number of Islands, Numbers with same consecutive differences
- People looking to get into top Tech companies in Software Engineering roles
- Folks looking to ace the DSA part in Data Science Interview
- Self taught programmers looking for their first job
- Experienced developers wanting to get into MAANG companies ( top tech firms)
Also See : Data Structures Algorithm DSA | Python+Javascript LEETCODE