Data Structures Algorithm DSA | Python+Javascript LEETCODE

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

Description

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

Get Instant Notification of New Courses on our Telegram channel.

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: ArraysData Structures IntroductionBig ODS: Arrays Crash CourseQuestion 1: Sorted Squared ArrayQuestion 2: Monotonic Array
DAY 2: ArraysQuestion 1: Rotate ArrayQuestion 2:Container with most Water
DAY 3: Hash TableDS: Hash Tables Crash CourseQuestion 1: Two SumQuestion 2:Isomorphic Strings
DAY 4: RecursionQuestion 1: FibonacciQuestion 2:Power Sum
DAY 5: RecursionQuestion 1: PermutationsQuestion 2:Power Set
DAY 6: StringDS: Strings Crash CourseQuestion 1: Non repeating characterQuestion 2: Palindrome
DAY 7: StringQuestion 1: Longest Unique char SubstringQuestion 2: Group Anagrams
DAY 8: SearchingQuestion 1: Binary SearchQuestion 2: Search in Rotated Sorted array
DAY 9: SearchingQuestion 1: Find First and Last Position of Element in Sorted ArrayQuestion 2: Search in 2D Array
DAY 10: SortingQuestion 1: Bubble SortQuestion 2: Insertion Sort
DAY 11: SortingQuestion 1: Selection SortQuestion 2: Merge Sort
DAY 12: SortingQuestion 1: Quick SortQuestion 2: Radix Sort
DAY 13: Singly Linked ListDS: Linked List Crash CourseQuestion 1: Construct SLLQuestion 2: delete duplicates
Day 14: Singly Linked ListQuestion 1: Reverse SLLQuestion 2: Cycle Detection
DAY 15: Singly Linked ListQuestion 1: find duplicate numberQuestion 2: Add 2 numbers
DAY 16: Doubly Linked ListQuestion 1: DLL remove insertQuestion 2: DLL remove all, insert at position
DAY 17: StacksDS: Stacks Crash CourseQuestion 1: Construct StackQuestion 2: Reverse Polish Notation
DAY 18: QueuesDS: Queues Crash CourseQuestion 1: Construct QueueQuestion 2: Implement Queue with Stack
DAY 19: Binary Tree and Binary Search TreeDS: Binary Tree, Binary Search Tree Crash CourseQuestion 1: Construct BSTQuestion 2: Traverse BST (Breadth first and Depth first – Inorder, Preorder,Post order)
DAY 20: Binary Tree and Binary Search TreeQuestion 1: Level Order traversalQuestion 2: Left/Right View of binary tree
DAY 21: Binary Tree and Binary Search TreeQuestion 1: Invert Binary TreeQuestion 2: Diameter of binary tree
DAY 22: Binary Tree and Binary Search TreeQuestion 1: Convert Sorted Array to Binary Search TreeQuestion 2: Validate BST
DAY 23: Heaps and Priority QueueDS: Heaps Crash CourseQuestion 1: Max Heap ConstructionQuestion 2: min Priority Queue Construction
DAY 24: GraphsDS: Graphs Crash CourseQuestion 1: BFS – Adj List and Adj MatrixQuestion 2: DFS – Iterative and Recursive
DAY 25: GraphsQuestion 1: Number of connected componentsQuestion 2: 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

English

language

Content

Day 1: Arrays

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 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

Enroll for Free

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

Day 1: Arrays

Day 2: Arrays

Day 3: Hash Table

Day 4 : Recursion

Day 5: Recursion

Day 6 : String

Day 7: String

Day 8: Searching

Day 9: Searching

Day 10: Sorting

Day 11: Sorting

Day 12: Sorting

Day 13 Singly Linked List

Day 14 Singly Linked List

Day 15 : Singly Linked List

Day 16 Doubly Linked List

Day 17: Stacks

Day 18: Queue

Day 19: Binary Tree / Binary Search Tree

Day 20: Binary Tree / Binary Search Tree

Day 21: Binary Tree

Day 22: Binary Search Trees

Day 23: Heaps and Priority Queue

Day 24: Graphs

Day 25: Graphs

💠 Follow this Video to Get Free Courses on Every Udemy Topics! 💠