Master Coding Interview :Data structures + Algorithms

Master Coding Interview :Data structures + Algorithms

Master Coding Interview :Data structures + Algorithms

Ultimate 36 Hour coding interview bootcamp. Get the job you want!

Language: english

Note: 4.6/5 (130 notes) 8,765 students

Instructor(s): Jackson Kailath

Last update: 2022-03-24

What you’ll 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

 

Requirements

  • Basic knowledge of Javascript or any other Programming language ( things like write a loop, function etc)

 

Description

Our Students Speak :

⭐️⭐️⭐️⭐️⭐️

The teacher has fantastic ability to transfer understanding of a concept not just pass along his knowledge of the concept.-Liam Bailes

⭐️⭐️⭐️⭐️⭐️

This course is excellent and a great method to learn about Data Structures and Algorithms. It’s fantastic for learning how to solve problems and construct reasoning.-Parth

⭐️⭐️⭐️⭐️⭐️

Best course. Since Data structure is one of the basic subject for programming, this course provides an complete overview of all components of Data Structures. This course is very good for students at the beginner level who wants to know the fundamentals and advanced concepts of Data Structures and Algorithms.-Newton

⭐️⭐️⭐️⭐️⭐️

The course is really helpful, Must learn course while preparing for Tier 1 companies. Explains the concepts well and in an easily understandable way.-Dennis Paul

Many More ! Check the review section below.


ABOUT THE COURSE:

Welcome to the Coding Interview Bootcamp!

Once you get an interview from a top tech company, the only thing that matters for you to get your dream Software Engineering role is your performance in the coding Interviews.

The only way to ace the coding interview is to take one problem at a time and really understand how to solve it and then do this for a lot of problems to get sufficient tools and techniques in your arsenal to face and conquer any coding interview. This is what my aim is for you with this course.

This course is structured as DAILY CODING CHALLENGES to give you a clear target for every day. By not missing a single day and by staying consistent you will have solved a variety of questions by the end of this course, getting you prepared for coding interviews and more practice on your own from Leetcode.

We start right from the basics and discuss Big O analysis and then move on to cover the common data structures and then discuss real life problems asked in Big Tech companies such as Google, Meta, Amazon, Netflix, Apple, Microsoft etc.

For Each Question we discuss :

   1. The Logic or the method by which we can approach this question in an optimal manner

   2. The Time and Space complexity of the Solution

   3. Code the Solution in Javascript ( You can follow along in any coding language of your choice)

This course also includes multiple downloadable resources, trackers to keep you motivated, and cheat sheets to make your coding interview prep smooth.

COURSE OUTLINE

  • DAY 1: Arrays Data Structures and Algorithms

    Data Structures Introduction

    Big O

    DS: Arrays Crash Course

    Coding Interview Q1: Sorted Squared Array

    Coding Interview Q2: Monotonic Array

  • DAY 2: Arrays Data Structures and Algorithms

    Coding Interview Q1: Rotate Array

    Coding Interview Q2:Container with most Water

  • DAY 3: Hash Tables Data Structures and Algorithms

    DS: Hash Tables Crash Course

    Coding Interview Q1: Two Sum

    Coding Interview Q2:Isomorphic Strings

  • DAY 4: Recursion Algorithms

    Coding Interview Q1: Fibonacci

    Coding Interview Q2:Power Sum

  • DAY 5: Recursion Algorithms

    Coding Interview Q1: Permutations

    Coding Interview Q2:Power Set

  • DAY 6: String Data Structures and Algorithms

    DS: Strings Crash Course

    Coding Interview Q1: Non repeating character

    Coding Interview Q2: Palindrome

  • DAY 7: String Data Structures and Algorithms

    Coding Interview Q1: Longest Unique char Substring

    Coding Interview Q2: Group Anagrams

  • DAY 8: Searching Algorithms

    Coding Interview Q1: Binary Search

    Coding Interview Q2: Search in Rotated Sorted array

  • DAY 9: Searching Algorithms

    Coding Interview Q1: Find First and Last Position of Element in Sorted Array

    Coding Interview Q2: Search in 2D Array

  • DAY 10: Sorting Algorithms

    Coding Interview Q1: Bubble Sort

    Coding Interview Q2: Insertion Sort

  • DAY 11: Sorting Algorithms

    Coding Interview Q1: Selection Sort

    Coding Interview Q2: Merge Sort

  • DAY 12: Sorting Algorithms

    Coding Interview Q1: Quick Sort

    Coding Interview Q2: Radix Sort

  • DAY 13: Singly Linked List Data Structures and Algorithms

    DS: Linked List Crash Course

    Coding Interview Q1:  Construct SLL

    Coding Interview Q2: delete duplicates

  • Day 14: Singly Linked List Data Structures and Algorithms

    Coding Interview Q1:  Reverse SLL

    Coding Interview Q2: Cycle Detection

  • DAY 15: Singly Linked List Data Structures and Algorithms

    Coding Interview Q1: find duplicate number

    Coding Interview Q2: Add 2 numbers

  • DAY 16: Doubly Linked List Data Structures and Algorithms

    Coding Interview Q1: DLL remove insert

    Coding Interview Q2: DLL remove all, insert at position

  • DAY 17: Stacks Data Structures and Algorithms

    DS: Stacks Crash Course

    Coding Interview Q1:  Construct Stack

    Coding Interview Q2: Reverse Polish Notation

  • DAY 18: Queues Data Structures and Algorithms

    DS: Queues Crash Course

    Coding Interview Q1: Construct Queue

    Coding Interview Q2: Implement Queue with Stack

  • DAY 19: Binary Tree and Binary Search Tree Data Structures and Algorithms

    DS: Binary Tree, Binary Search Tree Crash Course

    Coding Interview Q1: Construct BST

    Coding Interview Q2: Traverse BST (Breadth first and Depth first – Inorder, Preorder,Post order)

  • DAY 20: Binary Tree and Binary Search Tree Data Structures and Algorithms

    Coding Interview Q1: Level Order traversal

    Coding Interview Q2: Left/Right View of binary tree

  • DAY 21: Binary Tree and Binary Search Tree Data Structures and Algorithms

    Coding Interview Q1: Invert Binary Tree

    Coding Interview Q2: Diameter of binary tree

  • DAY 22: Binary Tree and Binary Search Tree Data Structures and Algorithms

    Coding Interview Q1: Convert Sorted Array to Binary Search Tree

    Coding Interview Q2: Validate BST

  • DAY 23: Heaps and Priority Queue Data Structures and Algorithms

    DS: Heaps Crash Course

    Coding Interview Q1: Max Heap Construction

    Coding Interview Q2: min Priority Queue Construction

  • DAY 24: Graphs Data Structures and Algorithms

    DS: Graphs Crash Course

    Coding Interview Q1:  BFS – Adj List and Adj Matrix

    Coding Interview Q2: DFS – Iterative and Recursive

  • DAY 25: Graphs Data Structures and Algorithms

    Coding Interview Q1: Number of connected components

    Coding Interview Q2: Course Scheduler / Topological sort

I’m sure you’ll love this course and so we’re offering a full money-back guarantee for 30 days in case you are not sure at the moment!

Enroll today and see you inside the course !

Let’s make your dreams come true

– Jackson

 

Who this course is for

  • Students who are about to graduate and trying to get into top Tech companies as software engineers
  • Self taught programmers looking for their first job
  • Experienced developers wanting to get into MAANG companies ( top tech firms)

 

Course content

  • Day 1: Arrays Data Structures and Algorithms
    • Welcome! How to make best use of this course
    • Day 1 Goals
    • Introduction to Data Structures
    • Introduction to Big O, Time Complexity
    • 2 Asymptotic Analysis and Big O
    • Big O Space Complexity
    • Big O Logarithm
    • Arrays: Data Structures Crash Course
    • Set up, Using Debugger
    • Coding Interview Q1: 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
    • Coding Interview Q2: Monotonic Array
    • Method and Big O analysis
    • Code the solution, Big O analysis
  • Day 2: Arrays Data Structures and Algorithms
    • Day 2 Goals
    • Coding Interview Q1: Rotate Array
    • Method and Big O analysis
    • Code the solution
    • Coding Interview Q2: 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 Tables Data Structures and Algorithms
    • Day 3 Goals
    • Hash Table: Data Structures Crash Course
    • Coding Interview Q1: Two Sum
    • Method 1, Big O analysis
    • Coding the solutions
    • Code Walkthrough
    • Method 2, Big O analysis
    • Coding the solution
    • Code Walkthrough
    • Coding Interview Q2: Isomorphic Strings
    • Method and Big O analysis
    • Code the solution
  • Day 4 : Recursion Algorithms
    • Day 4 Goals
    • Coding Interview Q1: 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
    • Coding Interview Q2: Power Sum
    • Method and Big O analysis
    • Code
    • Code walkthrough
  • Day 5: Recursion Algorithms
    • Day 5 Goals
    • Coding Interview Q1: Permutations
    • Method and Big O analysis
    • Code
    • Code Walkthrough
    • Coding Interview Q2: All Sub sets(Power set)
    • Method and Big O analysis
    • Code
    • Code walkthrough
  • Day 6 : Strings Data Structures and Algorithms
    • Day 6 Goals
    • Data Structures Crash Course: Strings
    • Coding Interview Q1: First Non Repeating Character
    • Method 1 and Big O analysis
    • Code
    • Code walkthrough
    • Method 2 and Big O analysis
    • Code
    • Code walkthrough
    • Coding Interview Q2: 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: Strings Data Structures and Algorithms
    • Day 7 Goals
    • Coding Interview Q1: Longest Sub string with Unique characters
    • Method and Big O analysis
    • Code
    • Code walkthrough
    • Coding Interview Q2: Group Anagrams
    • method and Big O analysis
    • code
  • Day 8: Searching Algorithms
    • Day 8 Goals
    • Coding Interview Q1 : Binary Search Algorithm
    • Method and Big O analysis
    • Code Iterative
    • Code Recursive
    • Coding Interview Q2: Search in rotated sorted array
    • Method and Big O analysis
    • Code
  • Day 9: Searching Algorithms
    • Day 9 Goals
    • Coding Interview Q1: Search for range
    • Method and Big O analysis
    • Code Recursive
    • Code Iterative
    • Coding Interview Q2: Search in Matrix
    • method and Big O analysis
    • code
  • Day 10: Sorting Algorithms
    • Day 10 Goals
    • Coding Interview Q1: Bubble Sort Algorithm
    • Method and Big O analysis
    • Code
    • Code Walkthrough
    • Coding Interview Q2: Insertion Sort Algorithm, Big O analysis
    • Code
    • Insertion sort is a stable sorting Algorithm
  • Day 11: Sorting Algorithms
    • Day 11 Goals
    • Coding Interview Q1: Selection Sort Algorithm, Big O analysis
    • Code
    • Coding Interview Q2: Merge Sort Algorithm
    • Method and Big O analysis
    • Code
    • Code Walkthrough
  • Day 12: Sorting Algorithms
    • Day 12 Goals
    • Coding Interview Q1: Quick Sort Algorithm
    • Optimise Time Complexity
    • Optimise Space Complexity
    • Code
    • Call stack walkthrough
    • Code walkthrough
    • Coding Interview Q2: Radix Sort Algorithm, Big O analysis
    • Code
  • Day 13 Singly Linked List Data Structures and Algorithms
    • Day 13 Goals
    • Class Syntax
    • Data Structures Crash Course: Linked Lists
    • Coding Interview Q1: Design a Singly Linked List
    • Method and Big O analysis
    • Code
    • Coding Interview Q2: Remove Duplicates
    • Method and Big O analysis
    • Code
    • Code walkthrough
  • Day 14 Singly Linked List Data Structures and Algorithms
    • Day 14 Goals
    • Coding Interview Q1: Reverse
    • Method and Big O analysis
    • Code
    • Code walkthrough
    • Coding Interview Q2 : Cycle Detection
    • Method and Big O analysis
    • Code
    • proof
  • Day 15 : Singly Linked List Data Structures and Algorithms
    • Day 15 Goals
    • Coding Interview Q1: Find duplicate number
    • method and Big O analysis
    • code
    • Coding Interview Q2: Add 2 numbers
    • method and Big O analysis
    • code
  • Day 16 Doubly Linked List Data Structures and Algorithms
    • Day 16 Goals
    • Coding Interview Q1: Remove Node, Insert Node
    • Method remove
    • Code remove
    • walkthrough remove
    • Insert Intro
    • Method Insert
    • Insert code
    • Walkthrough Insert
    • Coding Interview Q2: Remove Value, Insert at Position in Doubly Linked List
    • Remove Val Method
    • Code
    • Code walkthrough
    • Insert at Position
    • method
    • Code
  • Day 17: Stacks Data Structures and Algorithms
    • Day 17 Goals
    • Data Structures Crash Course: Stacks and Queues
    • Coding Interview Q1: Design a Stack
    • Code
    • Coding Interview Q2: Reverse Polish Notation
    • method and Big O analysis
    • code
  • Day 18: Queue Data Structures and Algorithms
    • Day 18 Goals
    • Coding Interview Q1: Design a Queue
    • Code
    • Coding Interview Q2 : Queue with Stack
    • method and Big O analysis
    • code
  • Day 19: Binary Tree / Binary Search Tree Data Structures and Algorithms
    • Day 19 Goals
    • Data Structures Crash Course: Trees Introduction
    • Theory: Binary Trees 1
    • Proof : height of Balanced Binary tree is floor(log N)
    • Theory: Binary Tree Terminaologies
    • What is a BST – Binary Search Tree
    • Coding Interview Q1: Construct Binary Search Tree,Big O analysis
    • Code
    • Code Walkthrough
    • Coding Interview Q2 : Traverse – BFS and DFS,Big O analysis
    • Code
    • Walkthrough
  • Day 20: Binary Tree / Binary Search Tree Data Structures and Algorithms
    • Day 20 Goals
    • Coding Interview Q1: Level Order traversal
    • Insert method
    • Insert code
    • Level Order Traversal Method and Big O analysis
    • Code – Level order traversal
    • Coding Interview Q2: Left / Right view
    • Method and Big O analysis
    • Code
  • Day 21: Binary Tree Data Structures and Algorithms
    • Day 21 Goals
    • Coding Interview Q1 : Invert Binary Tree
    • Iterative method and Big O analysis
    • Iterative Code
    • Recursive method and Big O analysis
    • Recursive code
    • Coding Interview Q2 : Diameter of Binary Tree
    • Method and Big O analysis
    • Code
  • Day 22: Binary Search Trees Data Structures and Algorithms
    • Day 22 Goals
    • Coding Interview Q1: sorted array to BST
    • method and Big O analysis
    • code
    • Coding Interview Q2 : Valid BST
    • Method and Big O analysis
    • Code
  • Day 23: Heaps and Priority Queue Data Structures and Algorithms
    • Day 23 Goals
    • Binary Heap: Data Structure Crash Course
    • Coding Interview Q1: Construct Max Binary Heap, Big O analysis
    • Proof of Build Binary Heap Time Complexity
    • Code
    • Code walkthrough
    • Introduction to Priority Queue
    • Coding Interview Q2: Construct Priority Queue,Big O analysis
    • Code
    • Walkthrough
  • Day 24: Graphs Data Structures and Algorithms
    • Day 24 Goals
    • Coding Interview Q1: BFS, Adjacency List,Big O analysis
    • Code
    • BFS, Adjacency Matrix
    • Code
    • Coding Interview Q2: DFS, Recursive, Big O analysis
    • Code
    • DFS Iterative
    • Code
  • Day 25: Graphs Data Structures and Algorithms
    • Day 25 Goals
    • Coding Interview Q1: Number of Components, Big O analysis
    • Code, BigO
    • Coding Interview Q2: 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

 

Master Coding Interview :Data structures + AlgorithmsMaster Coding Interview :Data structures + Algorithms

Time remaining or 735 enrolls left

 

Don’t miss any coupons by joining our Telegram group 

Udemy Coupon Code 100% off | Udemy Free Course | Udemy offer | Course with certificate