← Programming & Computer Science Foundations

Fees by level

Start at any level, or take the complete programme. The fee you pay for a level is locked for you.

All fees are in Indian Rupees and include applicable taxes. See our pricing & payment terms.

The complete curriculum

01 Introduction 1 lesson ▶

1. 1.1Introductory Video

02 Basics of Programming in Python 10 lessons ▶

1. 2.1Flowcharts
2. 2.2Variables and Data types
3. 2.3Ref and Operators
4. 2.4Conditional Statements
5. 2.5Loops
6. 2.6Jump Statements
7. 2.7Pattern Printing
8. 2.8Functions
9. 2.9Recursion
10. 2.10Scope

03 Some Important structures 9 lessons ▶

1. 3.1List
2. 3.2List Questions
3. 3.3Slicing and List comprehension
4. 3.42D Lists
5. 3.5Strings
6. 3.6Questions on Strings
7. 3.7Dictionary
8. 3.8Sets
9. 3.9Tuples

04 Array and String algorithms 8 lessons ▶

1. 4.1Kadane's Algorithm
2. 4.22D Kadane's Algorithm
3. 4.32SUM and 3SUM problems
4. 4.4DNF Algorithm
5. 4.5Moore's voting algorithm
6. 4.6Juggling Algorithm
7. 4.7KMP Algorithm
8. 4.8Miscellaneous Algorithms

05 Sorting and Complexities 8 lessons ▶

1. 5.1Time Complexity
2. 5.2Space Complexity
3. 5.3Binary Search
4. 5.4Bubble Sort
5. 5.5Selection Sort
6. 5.6Insertion Sort
7. 5.7Quick Sort
8. 5.8Merge Sort

06 Oops 7 lessons ▶

1. 6.1Intro to OOPS
2. 6.2Constructor
3. 6.3Inheritance
4. 6.4Polymorphism
5. 6.5Encapsulation and abstraction
6. 6.6Dunder/Magic methods
7. 6.7Desiging a complex number class

07 Linked List 8 lessons ▶

1. 7.1Linkedlist Intro
2. 7.2Linkedlist Operations 1
3. 7.3Linkedlist Operations 2
4. 7.4Questions on Linkedlist
5. 7.5Types of Linkedlist
6. 7.6Questions
7. 7.7Questions
8. 7.8Merge Sort for Linkedlist

08 Stacks 6 lessons ▶

1. 8.1Stack Intro
2. 8.2Stack using Linkedlist
3. 8.3Questions
4. 8.4Notations
5. 8.5Largest Rect. in a Histogram
6. 8.6Rainwater Trapping

09 Queues 3 lessons ▶

1. 9.1Queue Intro
2. 9.2Stacks and Queue
3. 9.3Question on Queues

10 Trees 9 lessons ▶

1. 10.1Intro to Trees
2. 10.2Traversal of a Tree
3. 10.3Levelorder Traversal
4. 10.4Questions
5. 10.5Left and Right view
6. 10.6Top and Bottom view
7. 10.7Construction of a Tree
8. 10.8Questions
9. 10.9Burning a Tree

11 Binary Trees 6 lessons ▶

1. 11.1Intro to BST
2. 11.2Insertion and Deletion
3. 11.3Basic Problems on BST
4. 11.4Important Questions of BST
5. 11.5Balancing a BST
6. 11.6Largest BST in a Binary Tree

12 Heaps 5 lessons ▶

1. 12.1Heaps Intro
2. 12.2Heaps Implemetation
3. 12.3Heapify Algorithm
4. 12.4Heap Sort
5. 12.5Questions on Heaps

13 Graphs 7 lessons ▶

1. 13.1Intro to Graphs
2. 13.2DFS
3. 13.3BFS
4. 13.4Cycle Detections in Undirected Graph
5. 13.5Cycle Detections in Directed Graph
6. 13.6Minimum moves by a Knight
7. 13.7Wired Connections

14 Most Important Graph Algorithms 7 lessons ▶

1. 14.1Topological Sort
2. 14.2Dijkstra's Algorithn
3. 14.3MST using Prims's Algorithm
4. 14.4DSU for Kruskal's Algorithm
5. 14.5Kruskal's Algorithm
6. 14.6Bellamn Ford Algorithm
7. 14.7Floyd Warshall Algorithm

15 Greedy 3 lessons ▶

1. 15.1Intro to Greedy(Meeting Sch.)
2. 15.2Fractional Knapsack
3. 15.3Questions on Greedy

16 Backtracking and DP 12 lessons ▶

1. 16.1Backtracking Intro(Rat in a maze)
2. 16.2N-Queen Problem
3. 16.3Intro to Dynamic Programming
4. 16.4Knapsack Problem
5. 16.5Coin Change
6. 16.6LCS
7. 16.7LCS variations
8. 16.8Questions on DP
9. 16.9Longest AP
10. 16.10Catalan Number
11. 16.11Edit Distance
12. 16.12Matrix chain multiplication

17 Number Theory 3 lessons ▶

1. 17.1Number Therory (Sieve of Erathosthenes)
2. 17.2GCD of 2 numbers
3. 17.3Modulo Arithematic and Binary Exponentiation

Tools you'll use

Related courses