Data Structure & Algorithm Using Python

About Course

Master the theory and application of Data Structures and Algorithms to excel in programming contests. Ace your coding interviews by implementing each algorithmic challenge in this specialisation.

➣ 1 Year Access with Dynamically Updated Content.
➣ Crack Internal Coding Test and Get 100% Referral Guarantee.
➣ Weekly Doubt Clearing Classes.
➣ 100+ Leetcode video solutions with explanations.
➣ Offered by ACM ICPC winners and MAANG engineers.
➣ Student community, Github code review, Interview preparations.

Course Content

1. WarmUp session- 1

1.1- Introduction to array and list

21:13
1. 2 – Array Problem Find pair whose sum equal to given target Approach Discussion

11:27
1.3 – Binary Search

05:08
1.4 – Rotate an Array in clockwise

23:32
1.5 – Search in a sorted Rotated array

09:10

2. Arrays

3. Complexity Discussion + Example

4. Complexity + Binary Search + Recursion

5. Complexity + Quick Short

6. Merge Short, Generate sum from 2 number Maximum sum of k sized sub Array, Slidding window

7. Link List

8. LInkList Loop Detection, Doubly Liked List

9. Stack’s Next Greater Element, Balanced Brackets, Previous Greater Element, List with Random

10. Trapping Rain Water,Min stack, Queue, Stack to Queue, Queue to Stack

11. Stock Snap Problem, Histogram Problem

12. Priority Queue

13. Binary Tree, Pre Order Traversal, Post Order, In Order, Hight of Tree, Insertion in Tr

14. LCA Binary Tree, Print all root to leaf Path, Diameter of Tree

15. Sum Tree, Left view , right view

16. Trie , Heaps

17. Heapify , heapsort , Back Tracking

18. Maze Solver , N Queen Problem

19. Greedy Algorithm , Activiti Selection , Huffman encoding

20. Knapsack problem

21. Dynamic Programing, Subset sum problem , Equal sum partition

22. knapsack problem , Subset sum , min number of ways , LCS of 2 strings

23. LCS Problem

24. Matrix chain multiplication, Palindrom partition , Minimum edit distance

25. Graph, Disjoint set, Union

26. Graph creation , BFS , DFS , cyclic acyclic graph , MST

27. Prims algo MST , Shortest path , Topological Sort , Euler circuit Euler path

28. Bellman Ford, Strongly connected component

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

35: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:30

About Course

Course Content

1. WarmUp session- 1

1.1- Introduction to array and list

1. 2 – Array Problem Find pair whose sum equal to given target Approach Discussion

1.3 – Binary Search

1.4 – Rotate an Array in clockwise

1.5 – Search in a sorted Rotated array

2. Arrays

2.1 – Introduction to Arrays and Lists in Python 1

2.2 – List Methods and Functions in Python 1

2.3 – Sorting element in a List Bubble Sort 1

2.4 – Binary Search Explanation

Array.pdf

Array Quiz

3. Complexity Discussion + Example

3.1 – Introduction to Time Complexity

3.2 – Examples

3.3 – Big O Notation

3.4 – Other Asymptotic Notations

3.5 – Examples and Space Complexity

4. Complexity + Binary Search + Recursion

4.1 – Doubt Session

4.2 – Binary Search

4.3 – Introduction to Recursion

Binarytree.pdf

5. Complexity + Quick Short

5.1 – Doubts Discussion of Assignment

5.2 – Recursion

5.3 – Binary Search using Recursion

5.4 – Quick Sort Algorithm

Quicksort.pdf

6. Merge Short, Generate sum from 2 number Maximum sum of k sized sub Array, Slidding window

6.1 – 2-Sum Problem

6.2 – Print all pairs that sum to target

6.3 – Maximum sum for K sized subarray (Sliding Window)

6.4 – Maximum sum of a given subarray (Kadane’s Algorithm)

7. Link List

7.1 – Time Complexity of Quick Sort and Merge Sort

7.2 – Introduction to Linked List.mp4

7.3 – Insertion in Linked List at the end

7.4 – Delete Last Element in Linked List

7.5 – Insert and Delete at any Position

7.6 – Cycle Detection in Linked List

Linkedlist.pdf

Quiz

8. LInkList Loop Detection, Doubly Liked List

8.1 – Cycle Detection in Linked List

8.2 – Circular and Doubly Linked List

8.3 – Reverse a Singly Linked List

8.4 – Applications of Reversing a Linked List

9. Stack’s Next Greater Element, Balanced Brackets, Previous Greater Element, List with Random

9.1 – Introduction to Stacks

9.2 – Next Greater Element on Right

9.3 – Previous Greater Element on Left

9.4 – Balanced Brackets Problem

9.5 – Doubts Discussion

Stacks.pdf

Stack Quiz

10. Trapping Rain Water,Min stack, Queue, Stack to Queue, Queue to Stack

10.1 – Trapping Rain Water Problem

10.2 – Minimum Stack

10.3 – Introduction To Queues

10.4 – Stack To Queue

10.5 – Queue To Stack

Queue.pdf

Queue Quiz

11. Stock Snap Problem, Histogram Problem

11.1 – Stock Span Problem

11.2 – Max Area Histogram and Storage of Rain

12. Priority Queue

12.1 – Queue and Priority Queue

12.2 – Introduction to Trees

12.3 – Tree Traversals

13. Binary Tree, Pre Order Traversal, Post Order, In Order, Hight of Tree, Insertion in Tr

13.1 Tree Traversal BFS (Level Order)

13.2 Tree Traversal DFS (Preorder, In order, Post Order)

13.3 Height of Tree

13.4 Insertion and Deletion in BST

Binarytree.pdf