Data Structure & Algorithm Using Java

Course Content

1. Array

1.1. DSA Introduction

18:41
1.2 Abstract Data Type

17:20
1.3 Binary Search Over Linear

25:37
1.4 Handling the Overflow

05:24
1.5 Binary Search First and Last Occurence

23:42
1.6 Binary Search Find element in rotated sorted array

37:05
1.7 Binary Search Rotation count in anti-clockwise rotated sorted array

40:38
1.8 Binary Search Search in an almost sorted array

22:09
1.9 LeetCode Map Sum pairs Approach I

24:54
1.10 LeetCode Map Sum pairs Approach II

28:16
1.11 LeetCode Map Sum pairs Approach III

25:31
1.12 Complexity Analysis

15:37
Array.pdf
Array Quiz

2. LinkList

2.1 Array vs List

42:18
2.2 LinkList Problem Printing

12:08
2.3 LinkList Problem – Reversal

30:21
2.4 Understanding Recursion List Printing (Recusive vs Iterative)

43:44
2.5 Linklist Question Discussion Reversing from L to R

01:01:43
2.6 Linklist Question Coding Reversing from L to R

10:03
2.7 LeetCode Problem Linked List Cycle II and Linked List Cycle I

47:20
2.8 LeetCode Problem Odd Even Linked list

16:40
2.9 LeetCode Problem Sort linked list which is already sorted on absolute values

17:27
2.10 LeetCode Problem Swapping nodes in Linked list

30:26
2.11 What is done until now and upcoming lecture’s discussion

34:41
LinkList.pdf
LinkList Quiz

3. Stacks

3.1 Stack pop(), top(), isempty() and Application

14:48
3.2 Stack Implementation using array

26:51
3.3 Stack Implementation using linked list

17:35
3.4 Stack Linked list Reversal

11:26
3.5 Stack Balanced Parenthesis

25:19
3.6 Stack Recap

03:18
3.7 Notation, Operators, Operands, Order of Operation

15:10
3.8 Infix to Postfix, Prefix (Manual)

38:40
3.9 Infix to Postfix Conversion (Algorithm)

40:55
3.10 Infix to Postfix Conversion (Code)

06:48
3.11 Postfix, Prefix Evaluation (Algorithm)

13:24
3.12 Postfix, Prefix Evaluation (Code)

09:42
3.13 Evaluating Infix (Discussion)

31:41
3.14 LeetCode Next Greater Element 1 (discussion)

01:01:05
3.15 LeetCode Next Greater Element 1 (algorithimic and coding part)

50:16
3.16 LeetCode Next Greater Element 2 (discussion Coding)

49:53
3.17 LeetCode Next Greater Element 3 (discussion Algorithm)

36:26
3.18 LeetCode Next Greater Element 3 (Coding)

29:32
Stacks.pdf
Stack Quiz

4. Queue

5. Sorting

5.1 Sorting Algorithm

13:19
5.2 Counting Sort I

32:29
5.3 Counting Sort II

41:52
5.4 Radix Sort

23:50
5.5 Insertion Sort

36:25
5.6 Merge Sort I

29:11
5.7 Merge Sort II

28:26
5.8 Quick Sort I

39:20
5.9 Quick Sort II

40:32
5.10 Insert Interval and Merge Interval Leetcode Questions

59:12
5.11 Rotate Image Leetcode Question

17:36
5.12 Backspace Compare Leetcode Question

26:15
5.13 mySqrt Leetcode Question

16:33
Sorting.pdf
Sorting Quiz

6. Binary Tree

6.1 Tree Introduction

30:56
6.2 Tree Introduction & Applications

27:45
6.3 BinaryTree Complete Overview

31:54
6.4 BinaryTree TreeTraversal

46:26
6.5 BinaryTree Coding Preorder Traversal Recursive Approach

39:12
6.6 BinaryTree Coding Inorder Traversal Recursive Approach

14:15
6.7 BinaryTree Coding Postorder Traversal Recursive Approach

12:52
6.8 BinaryTree Coding Preorder Traversal Iterative Approach

26:49
6.9 LeetCode 132 Pattern

28:45
6.10 BinaryTree Level Order Traversal Discussion

41:07
6.11 BinaryTree Coding Level Order Traversal or BFS

22:21
6.12 BinaryTree Array Implementation

25:57
6.13 BinaryTree Discussion on Travesal using O(1) Space

19:03
Binary tree.pdf
Binary Tree Quiz

7. Binary Search Tree

8. Trie

8.1 Trie

35:24
8.2 Trie Representation

21:37
8.3 Trie Implementation-Insertion

33:44
8.4 Trie Implementation-Search

27:02
8.5 Binary Search Tree Deletion

28:24
8.6 Validate BST Question

41:52
8.7 In Order Successor Implementation

15:19
8.8 Height Balanced BST

15:57
8.9 Implementation of left leaning RBT

22:31
8.10 LeetCode Replace Words

12:49
8.11 LeetCode design add and search words data structure

24:41
Tries.pdf

9. Graph

9.1 Graph Introduction

17:18
9.2 Graph Types

08:12
9.3 Graph Terminologies

19:53
9.4 Graph DFS Introduction

25:42
9.5 Graph DFS All paths between two nodes

41:13
9.6 Graph BFS Introduction

08:51
9.7 Graph Comparing DFS vs BFS on shortest path between two vertices

03:16
9.8 BFS vs DFS

36:27
9.9 Graph Representations

45:50
9.10 Find if this path exist in a graph

37:40
9.11 All paths from source to target

11:08
9.12 All paths form source lead to destination

08:43
9.13 Number of the island Using DFS

28:16
9.14 Number of the island Using BFS With Implementation

30:41
9.15 Number of the island Using DFS Implementation

14:09
9.16 Rotting Oranges

09:52
9.17 Valid Sudoku

42:00
Graph.pdf
Graph Quiz

10. Dynamic Programming

11. Heaps

12. Problem Solving

1 Microsoft questions set 1 – 1

22:32
2 Microsoft questions set 1 – 2

20:46
3 Microsoft questions set 1 – 3

33:43
4 Microsoft questions set 1 – 4

23:30
5 Microsoft questions set 2 – 1

32:15
6 Microsoft questions set 2 – 2

46:14
7 Microsoft questions set 2 – 3

23:25
8 Microsoft questions set 3 – 1

29:56
9 Microsoft questions set 3 – 2

42:04
10 Microsoft questions set 3 – 3

20:46
11 Microsoft questions set 3 – 4

20:46
12 Microsoft questions set 4 – 1

31:12
13 Microsoft questions set 4 – 2

15:37
14 Microsoft questions set 4 – 3

12:34
15 Microsoft questions set 4 – 4

24:04
16 Microsoft questions set 5 – 1

24:55
17 Microsoft questions set 5 – 2

19:55
18 Microsoft questions set 6 – 1

01:06:55
19 Microsoft questions set 6 – 2

50:13
20 Microsoft questions set 6 – 3

12:56
21 Microsoft questions set 6 – 4

15:41
22 Microsoft questions set 7 – 1

14:09
23 Microsoft questions set 7 – 2

15:19
24 Microsoft questions set 7 – 3

19:20
25 Microsoft questions set 7 – 4

17:30
26 Microsoft questions set 8 – 1

15:56
27 Microsoft questions set 8 – 2

15:15
28 Microsoft questions set 8 – 3

08:28

Leetcode Video Solutions

1. Two Sum | Leetcode Easy

21:30
2. Valid Sudoku | Leetcode Medium

33:09
3. Group Anagrams | Leetcode Medium

30:33
4. Container with most Water | Leetcode Medium

21:23
5. Set Matrix Zeros | Leetcode Medium – Java, C++

32:10
5.1 Set Matrix Zeros | Leetcode Medium – PythonDraft Lesson

27:41
6. Median of two sorted arrays | Leetcode Hard

31:17
7. Trapping Rain Water | Leetcode Hard – Java, C++

33:09
7.1 Trapping Rain Water | Leetcode Hard – Python

24:05
8. Best time to buy and sell stock | Leetcode Easy

26:54
9. Best time to buy and sell stock ii | Leetcode Medium

26:54
10. Product of Array Except Self | Leetcode Medium

23:16
11. Find Minimum in Rotated Sorted array II | Leetcode Hard

30:02
12. Range Sum Query – Immutable | Leetcode Easy

22:33
13. Sort Colours | Leetcode Medium

19:38
14. Roman to Integer | Leetcode Easy

22:02
15. Candy Description | Leetcode Hard

24:36
16. Remove Duplicates from Sorted Arrays

26:22
17. Longest Substring without repeating characters | Leetcode Medium

26:45
18. Fruit into Baskets | Leetcode Medium

25:46
19. Text justification | Leetcode Hard

32:17
20. Plus One | Leetcode Easy

17:24
21. Subarray Sum Equal k | Leetcode Medium

35:08
22. Permutation in String | Leetcode Medium

31:17
23. Happy Number | Leetcode Easy

21:44
24. Reverse Linked List ii | Leetcode Medium

32:14
25. Design Linked List | Leetcode Medium

48:49
26. Palindrome Linked List | Leetcode Easy

24:04
27. Odd even Linked List | Leetcode Medium

19:42
28. Split Linked List in Parts | Leetcode Medium

18:58
29. Copy List with Random Pointer | Leetcode Medium

21:17
30. Reverse Linked List | Leetcode Easy

29:45
31. Linked List Random Node | Leetcode Medium

22:09
32. Swapping Nodes in a Linked List | Leetcode Medium

14:47
33. LRU Cache | Leetcode Medium

25:21
34. Remove Linked List Elements | Leetcode Easy

20:28
35. Flatten Nested List Iterator | Leetcode Medium

23:42
36. Remove Duplicates from Sorted List ii | Leetcode Medium

23:34
37. Convert Binary Number in a Linked List to Integer

18:04
38. Rotate List | Leetcode Medium

22:54
39. Insertion Sort List | Leetcode Medium :- Java, C++

25:31

Course Content

1. Array

1.1. DSA Introduction

1.2 Abstract Data Type

1.3 Binary Search Over Linear

1.4 Handling the Overflow

1.5 Binary Search First and Last Occurence

1.6 Binary Search Find element in rotated sorted array

1.7 Binary Search Rotation count in anti-clockwise rotated sorted array

1.8 Binary Search Search in an almost sorted array

1.9 LeetCode Map Sum pairs Approach I

1.10 LeetCode Map Sum pairs Approach II

1.11 LeetCode Map Sum pairs Approach III

1.12 Complexity Analysis

Array.pdf

Array Quiz

2. LinkList

2.1 Array vs List

2.2 LinkList Problem Printing

2.3 LinkList Problem – Reversal

2.4 Understanding Recursion List Printing (Recusive vs Iterative)

2.5 Linklist Question Discussion Reversing from L to R

2.6 Linklist Question Coding Reversing from L to R

2.7 LeetCode Problem Linked List Cycle II and Linked List Cycle I

2.8 LeetCode Problem Odd Even Linked list

2.9 LeetCode Problem Sort linked list which is already sorted on absolute values

2.10 LeetCode Problem Swapping nodes in Linked list

2.11 What is done until now and upcoming lecture’s discussion

LinkList.pdf

LinkList Quiz

3. Stacks

3.1 Stack pop(), top(), isempty() and Application

3.2 Stack Implementation using array

3.3 Stack Implementation using linked list

3.4 Stack Linked list Reversal

3.5 Stack Balanced Parenthesis

3.6 Stack Recap

3.7 Notation, Operators, Operands, Order of Operation

3.8 Infix to Postfix, Prefix (Manual)

3.9 Infix to Postfix Conversion (Algorithm)

3.10 Infix to Postfix Conversion (Code)

3.11 Postfix, Prefix Evaluation (Algorithm)

3.12 Postfix, Prefix Evaluation (Code)

3.13 Evaluating Infix (Discussion)

3.14 LeetCode Next Greater Element 1 (discussion)

3.15 LeetCode Next Greater Element 1 (algorithimic and coding part)

3.16 LeetCode Next Greater Element 2 (discussion Coding)

3.17 LeetCode Next Greater Element 3 (discussion Algorithm)

3.18 LeetCode Next Greater Element 3 (Coding)

Stacks.pdf

Stack Quiz

4. Queue

4.1 Queue Introduction

4.2 Queue Operation Implementation using arrays

4.3 Queue Operation Implementation using linked list

Queue.pdf

Queue Quiz

5. Sorting

5.1 Sorting Algorithm

5.2 Counting Sort I

5.3 Counting Sort II

5.4 Radix Sort

5.5 Insertion Sort

5.6 Merge Sort I

5.7 Merge Sort II

5.8 Quick Sort I

5.9 Quick Sort II

5.10 Insert Interval and Merge Interval Leetcode Questions

5.11 Rotate Image Leetcode Question

5.12 Backspace Compare Leetcode Question

5.13 mySqrt Leetcode Question

Sorting.pdf

Sorting Quiz

6. Binary Tree

6.1 Tree Introduction

6.2 Tree Introduction & Applications

6.3 BinaryTree Complete Overview

6.4 BinaryTree TreeTraversal

6.5 BinaryTree Coding Preorder Traversal Recursive Approach

6.6 BinaryTree Coding Inorder Traversal Recursive Approach