Ultimate 25 days coding interview bootcamp. DSA, BigO, Coding Interview Patterns Python Javascript Get the job you want!
WHAT YOU WILL LEARN
- Common Data Structures such as Arrays, Hash Table, Linked List, Binary trees, Graphs, etc.
- Real Coding Interview Questions from Google, Meta, Amazon, Netflix, Microsoft, etc.
- Time and Space Complexity of Algorithms, Detailed Discussion of Logic to solve questions
- Code Implementation in Javascript, Python
DESCRIPTION
Student Testimonials:
"The teacher excels in explaining complex concepts clearly." - Liam Bailes
"I have just started, but the quality of explanation is superb. I had seen many videos on time complexity, but he explained very well." - Deepak Reddy
"So far, I am finding this course really helpful, and the trainer is really sorted about what he needs to teach and is completely prepared with his plan and material. I feel this is one of the best courses available in Udemy and outside to learn DSA because it is well-structured and is delivering what we are looking for." - Ankur Saxena
"Great course. The lecturer is full of in-depth knowledge and able to pass it on. It's not easy to find this out there. Thank you." - Mark Corrigan
"Because of this course, I understand how to find the complexity of the program. The teacher has explained the concept in a very easy manner, so that anybody can understand it properly." - Amritesh Kumar Singh
"I really love the way you have explained it, and thanks for such a great course." - Soeng Kanel
"The course is a rare find for in-depth knowledge." - Mark Corrigan
"Well-structured and thorough preparation for DSA." - Ankur Saxena
"Easy to grasp concepts in a single go." - Shaik Asrar
"Effortless concept assimilation." - Elisha Benjamin
"A great foundation in DSA." - Prince Roy Sharma
"Simplifies understanding DSA." - Rahul
"Clarifies program complexity." - Amritesh Kumar Singh
"Clarified Big O notation for me." - Aaron Engelmann
"Excellent for problem-solving and reasoning." - Parth
"Comprehensive overview of Data Structures." - Newton
"Highly recommended for Tier 1 company preparation." - Dennis Paul
About the Course:
Welcome to the Coding Interview Bootcamp with a focus on Python and 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 Coding Challenges:
The course is structured around daily coding challenges. Consistent practice will equip you with the skills required for coding interviews and allow you to practice on Leetcode.
Topics Covered:
We start from the basics with Big O analysis, cover common data structures, and discuss real-life 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 downloadable resources, motivational trackers, and cheat sheets.
Course Outline:
Day 1: Arrays, Big O, Sorted Squared Array, Monotonic Array
Day 2: Arrays, Rotate Array, Container with Most Water
Day 3: Hash Tables, Two Sum, Isomorphic Strings
Day 4: Recursion, Fibonacci, Power Sum
Day 5: Recursion, Permutations, Power Set
Day 6: Strings, Non-Repeating Character, Palindrome
Day 7: Strings, Longest Unique Substring, Group Anagrams
Day 8: Searching, Binary Search, Search in Rotated Sorted Array
Day 9: Searching, Find First and Last Position, Search in 2D Array
Day 10: Sorting, Bubble Sort, Insertion Sort
Day 11: Sorting, Selection Sort, Merge Sort
Day 12: Sorting, Quick Sort, Radix Sort
Day 13: Singly Linked Lists, Construct SLL, Delete Duplicates
Day 14: Singly Linked Lists, Reverse SLL, Cycle Detection
Day 15: Singly Linked Lists, Find Duplicate, Add 2 Numbers
Day 16: Doubly Linked Lists, DLL Remove Insert, DLL Remove All
Day 17: Stacks, Construct Stack, Reverse Polish Notation
Day 18: Queues, Construct Queue, Implement Queue with Stack
Day 19: Binary Trees, Construct BST, Traversal Techniques
Day 20: Binary Trees, Level Order Traversal, Left/Right View
Day 21: Binary Trees, Invert Tree, Diameter of Tree
Day 22: Binary Trees, Convert Sorted Array to BST, Validate BST
Day 23: Heaps, Max Heap, Min Priority Queue
Day 24: Graphs, BFS, DFS
Day 25: Graphs, Number of Connected Components, Topological Sort
We offer a full money-back guarantee for 30 days. Enroll today!
Jackson
CONTENT
Certainly, here is the text you provided without formatting: Day 1: Arrays Welcome! How to make the best use of this course Day 1 Goals Introduction to Data Structures Introduction to Big O, Time Complexity Asymptotic Analysis and Big O Big O Space Complexity Big O Logarithm Arrays: Data Structure Crash Course Set up, Using Debugger Question 1: Sorted Squared Array Method 1, Big O Analysis Code our solution Code walkthrough and Big O analysis Method 2 Code our solution Code walkthrough and Big O analysis Question 2: Monotonic Array Method and Big O analysis Code the solution, Big O analysis Day 2: Arrays Day 2 Goals Question 1: Rotate Array Method and Big O analysis Code the solution Question 2: Container with most water Method 1 and Big O analysis Code the solution Code walkthrough and Big O analysis Method 2 and Big O analysis Code the solution Code walkthrough Day 3: Hash Table Day 3 Goals Hash Table: Data Structure Crash Course Question 1: Two Sum Method 1, Big O analysis Coding the solutions Code Walkthrough Method 2, Big O analysis Coding the solution Code Walkthrough Question 2: Isomorphic Strings Method and Big O analysis Code the solution Day 4: Recursion Day 4 Goals Question1: Fibonacci Method 1 and Big O analysis Code 1 Code walkthrough 1 Method 2 and Big O analysis Code 2 Code Walkthrough 2 Method 3 and Big O analysis Code 3 Code walkthrough 3 Question 2: Power Sum Method and Big O analysis Code Code walkthrough Day 5: Recursion Day 5 Goals Question 1: Permutations Method and Big O analysis Code Code Walkthrough Question 4: All Sub sets(Power set) Method and Big O analysis Code Code walkthrough Day 6: String Day 6 Goals DS Crash Course: Strings Question 1: First Non Repeating Character Method 1 and Big O analysis Code Code walkthrough Method 2 and Big O analysis Code Code walkthrough Question 2: Is Palindrome ? Method 1 and Big O analysis Code Code Walkthrough Method 2 and Big O analysis Code Code Walkthrough Method 3 and Big O analysis Code Code Walkthrough Day 7: String Day 7 Goals Question 1: Longest Sub string with Unique characters Method and Big O analysis Code Code walkthrough Question 2: Group Anagrams method and Big O analysis code Day 8: Searching Day 8 Goals Question 1: Binary Search Method and Big O analysis Code Iterative Code Recursive Question 2: Search in rotated sorted array Method and Big O analysis Code Day 9: Searching Day 9 Goals Question 1: Search for range Method and Big O analysis Code Recursive Code Iterative Question 2: Search in Matrix method and Big O analysis code Day 10: Sorting Day 10 Goals Question 1: Bubble Sort Method and Big O analysis Code Code Walkthrough Question 2: Insertion Sort, Big O analysis Code Insertion sort is a stable sort Day 11: Sorting Day 11 Goals Question 1: Selection Sort, Big O analysis Code Question 2: Merge Sort Method and Big O analysis Code Code Walkthrough Day 12: Sorting Day 12 Goals Question1: Quick Sort Optimise Time Complexity Optimise Space Complexity Code Call stack walkthrough Code walkthrough Question 2: Radix Sort, Big O analysis Code Day 13: Singly Linked List Day 13 Goals Class Syntax DS Crash Course: Linked Lists Question 1: Design a Singly Linked List Method and Big O analysis Code Question 2: Remove Duplicates Method and Big O analysis Code Code walkthrough Day 14: Singly Linked List Day 14 Goals Question 1: Reverse Method and Big O analysis Code Code walkthrough Question 2 : Cycle Detection Method and Big O analysis Code proof Day 15 : Singly Linked List Day 15 Goals Question 1: Find duplicate number method and Big O analysis code Question 2: Add 2 numbers method and Big O analysis code Day 16 Doubly Linked List Day 16 Goals Question 1: Remove Node, Insert Node Method remove Code remove walkthrough remove Insert Intro Method Insert Insert code Walkthrough Insert Question2: Remove Value, Insert at Position in Doubly Linked List Remove Val Method Code Code walkthrough Insert at Position method Code Day 17: Stacks Day 17 Goals DS Crash Course: Stacks and Queues Question 1: Design a Stack Code Question1: Reverse Polish Notation method and Big O analysis code Day 18: Queue Day 18 Goals Question 1: Design a Queue Code Question 2 : Queue with Stack method and Big O analysis code Day 19: Binary Tree / Binary Search Tree Day 19 Goals Question 1: Construct Binary Search Tree,Big O analysis Code Code Walkthrough Question 2 : Traverse - BFS and DFS,Big O analysis Code Walkthrough Day 20: Binary Tree / Binary Search Tree Day 20 Goals Question 1 - Level Order traversal Insert method Insert code Level Order Traversal Method and Big O analysis Code - Level order traversal Question 2 - Left / Right view Method and Big O analysis Code Day 21: Binary Tree Day 21 Goals Question 1 : Invert Binary Tree Iterative method and Big O analysis Iterative Code Recursive method and Big O analysis Recursive code Question 2 : Diameter of Binary Tree Method and Big O analysis Code Day 22: Binary Search Trees Day 22 Goals Question 1: sorted array to BST method and Big O analysis code Question 2 : Valid BST Method and Big O analysis Code Day 23: Heaps and Priority Queue Day 23 Goals Question 1: Construct Max Binary Heap, Big O analysis Proof of Build Binary Heap Time Complexity Code Code walkthrough Question 2: Construct Priority Queue,Big O analysis Code Walkthrough Day 24: Graphs Day 24 Goals Question 1: BFS, Adjacency List,Big O analysis Code BFS, Adjacency Matrix Code Question 2: DFS, Recursive, Big O analysis Code DFS Iterative Code Day 25: Graphs Day 25 Goals Question 1: Number of Components, Big O analysis Code, BigO Question 2: Course Scheduler Brute Force Method and Big O analysis Code - Brute Force Method Big O - Brute Force Method Topological Sort based method and Big O analysis Code Code Walkthrough
View Course on Udemy: