- 01.Flow-Chart
- 01.How to approach a problem
- 02.What is flowchart
- 03.Add two numbers
- 04.Average of three numbers
- 05.Decision making algorithm
- 06.Largest of 3 numbers
- 07.Check number
- 08.Valid Triangle
- 09.Print numbers from 1 to N
- 10.Find product
- 11.Print even Numbers
- 12.Check Number is Prime
- 13.Largest of N numbers
- Assignment
- 1.Check Triangle
- 2.Sum of evens
- 3.Find GCD
- 4.All primes
- 5.All fibonacci numbers
- 6.Member of fibonacci
- 02.Introduction-to-Python
- 01.First Program in Python
- 02.Variables in Python
- 03.Data types
- 04.Python Numbers
- 05.Limit of integers
- 06.Arithmetic Operators
- 07.Taking Input
- 08.Code-Find average marks
- Assignments
- 03.Conditionals and loops
- 01.Boolean datatype
- 02.Introduction to if else
- 03.Using Relational and logical Operators
- 04.Using else if/elif
- 05.Code - Check Number
- 06.Nested Conditionals
- 07.While loop
- 08.Code - Sum of n numbers
- 09.Code - Sum of even numbers
- 10.Primality Checking
- 11.Nested Loops
- 12.Code - Fahrenheit to Celcius
- Assignment
- 1.Calculator
- 2.Reverse of a number
- 3.Palindrome number
- 4.Sum of even and odd
- 5.Nth fibonacci number
- 04.Patterns 1
- 05.Patterns 2
- 06.More on loops
- 07.Functions
- 08.Arrays and Lists
- 09.Searching and Sorting
- 10.Strings
- 11.Two Dimensional Lists
- 12.Tuples Dictionary and Sets
- 01.Recursion - 1
- 02.Rcursion - 2
- 03.Recursion - Assignment
- 04.OOPS - 1
- 05.OOPS - 2
- 06.OOPS - 3
- 07.Time Complexity Analysis
- What is Time Complexity ?
- Experimental Analysis
- Theoretical Analysis
- Big O notation - Iterative Linear
- Theoretical Analysis - Iterative Non Linear
- Theoretical Analysis Recursive
- Theoretical Analysis - Binary Search
- Merge Sort Time Complexity
- Fibonacci Time Complexity Analysis
- 08.Space Complexity Analysis
- Space Complexity
- More Examples of Space Complexity
- Merge Sort Space Complexity Analysis
- Analysis of Quick Sort
- 09.Time Complexity Improvement
- Power of a number
- Array intersection
- Array intersection optimal solution
- Equilibrium Index
- 10.Linked List - 1
- 11.Linked List - 2
- 12.Stacks
- 13.Queues
- 14.Binary Trees - 1
- 15.Binary Trees - 2
- 16.BST-1
- 17.BST-2
- 18.Generic Trees
- 19.Dictionaries - Maps
- 20.Graphs - 1
- 21.Graphs - 2
- 22.Priority Queues - 1
- 23.Huffman Coding
- 24.Priority Queues - 2
- 25.DP - 1
- 26.Recursion - 3
- 27.Backtracking
- 28.DP - 2
- 29.2048 Game