DSA with Python

By Saptarshi Dey

Last updated: 03 Feb, 2026 11:28 AM IST

Basics
• Decorators
• Iterators and generators in python
• Method Resolution Order
• Multithreadding
Cryptography
• Euler Totient Function
• Number Theory
Graphs
• Articulation points
• Basic Traversal
• Bridges in Graph
DAG
• Topological Sorting BFS
• Topological Sorting DFS
MST
• Kruskal Algorithm
• Prim's algorithm
SCC
• Kosaraju's Algorithm
• Tarjan's Algorithm
Shortest Path
• Bellman Ford
• Dijkstra’s Algorithm
• Floyd Warshall
Mathematics
• Circle Intersection
• Derangements
• Horner's Method
• Mathematics Hackerrank
Matrix
• Covariance Matrix
• Eigen values & vectors
• Matrix Chain Multiplication
• Matrix Determinant
• Strassens Algorithm
• Recursive Trigonometric Functions
• Triangle Point
OpenGL
• OpenGL Basics
Triangle
• OpenGL Triangle
Operating System
Disk Scheduling Algorithms
• FCFS and SSTF
• SCAN, C-SCAN, LOOK and C-LOOK
• LRU Cache
Others
• Kadane's algorithm
• LCS and SCS
• Linked List
• Parenthesis DSA
String compression
• Huffman Encoding
• Tile Game solution
• Trie Implementation
Theory of Computation
• CYK Membership Algorithm
Trees
• AVL Tree
• BTrees from Traversal
• Binary Search Tree
• Binary Trees
• Segment Tree