Introduction
- Introduction to Course
- What is LeetCode, and How will we use it?
----------------------ARRAYS AND STRINGS DATA STRUCTURES------------------------
- Start of Arrays And Strings Data Structure
Arrays Data Structures: Two Sum
- Two Sum problem Statement and O(n^2) Solution
- Implementation of O(n^2) naive solution
- Optimizing Further for O(nlogn) Solution
- Implementing the O(nlogn) Solution
Arrays Data Structures Maximum Consecutive Ones
- Problem Statement
- O(n^2) Naive Solution
- O(n^2) Naive Solution Implementation
- O(n) Solution idea and optimizations
- O(n) Solution Implementation
Arrays Data Structures: Finding Maximum of three numbers
- Problem Statement
- O(n^3) Naive Solution
- O(nlogn) Improved Solution
- Implementation of O(nlogn) solution
- Optimizing further and reaching O(n) Solution
- Implementation of O(n) Solution
------------------------------STACK DATA STRUCTURE------------------------------
- Start of Stack Section
Stack Data Structure: Valid Parenthesis
- Problem Statement
- Incorrect Approaches/Algorithms to the Problem
- Recursive Algorithm Solution That runs in O(n^2) Time
- Implementation of O(n^2) Recursive Algorithm
- Optimizing further With Stacks to get O(n) Solution Idea
- O(n) Solution Implementation
Stack Data Structure: Baseball Game
- Problem Statement and Example
- Naive O(n^2) Solution with additional boolean array
- Implementation of O(n^2) Solution
- Optimizing on the last algorithm to an O(n) Solution
- Implementation of O(n) Solution
----------------------------HASH MAP DATA STRUCTURE----------------------------
- Start of Hash Map Data Structure
Hashmap and Hash Set Datastructure: Contains Duplicate II
- Problem Statement
- Bruteforce Algorithm Idea: O(nk) Solution
- Bruteforce Implementation and Time Limit Exceeded
- Optimizing Using Hashmaps to get O(n) Solution on average
- Implementing the O(n) Solution
Hash map and Hash Set Data structure: Valid Anagram
- Problem Statement
- O(n!) Brute force Solution
- O(n^2) Solution idea for Valid anagram
- O(n^2) Solution Implementation
- O(nlogn) Solution by Optimizing bottleneck
- O(nlogn) Solution Implementation
- O(n) Solution Idea, The final optimization with Hashtable
- O(n) Solution Implementation
------------------------------HEAP DATA STRUCTURE------------------------------
- Start of Heap Data Structure
Heap Data Structure: Kth Largest Element in an Array
- Problem Statement
- O(nlogn) Naive Solution Idea
- O(nlogn) Naive Solution Implementation
- O(nlogk) Optimized Solution Using a Heap
- Implementation of O(nlogk) Heap Solution
Heap Data Structure: Find K Pairs with Smallest Sums
- Problem Statement
- Idea of O(n^2Logn) Naive Solution and O(n^2logk) Optimized Solution using Heap
- Implementation of O(n^2Logn) and O(n^2Logk) Solutions
---------------------------BINARY TREE DATA STRUCTURE---------------------------
- Start of Tree Data Structure Section
Tree Data Structure: Invert Binary Tree
- Problem Statement
- O(n) Recursive Solution Idea
- O(n) Solution implementation
Tree Data Structure: Same Tree
- Problem Statement
- O(n) Recursive Solution Idea
- O(n) Solution Implementation
Tree Data Structure: Maximum Depth of Binary Tree
- Problem Statement
- O(n) Recursive Solution Idea
- O(n) Solution Implementation
------------------------------Assignments Section------------------------------
- Arrays and Strings Data Structure Assignment 1
- Arrays and Strings Data Structure Assignment 2
- Stack Data Structure Assignment 1
- Hash Table Assignment 1
- Heaps Assignment 1
- Binary Trees Assignment 1
- Binary Trees Assignment 2
- Binary Trees Assignment 3
