Skip to content

Python Central Hub

GitHub Instagram X Email LinkedIn

Select theme

Select language

pch.sidebarNoResults

Guides
Tutorials
- Introduction to Python
- Installation Guide
- Getting Started
- Python Syntax
- Python Comments
- Python Variables
- Python Data Types
- Python Print Statement
- Python Input Statement
- Python Numbers
- Python Boolean
- Python Strings
- Python Operator
- Python Datatype Casting
- Python Control Statement
- Python Function
- Python List
- Python Tuple
- Python Set
- Python Dictionaries
- Python Array
- Python File Handling
- Python OOPS
- Python Errors and Exceptions
- Python Exception Handling
  - Exception Handling in Python
- Python Iterators and Generators
  - Iterators and Generators in Python
- Python Comprehensions
  - Comprehensions in Python
- Python Functional Programming
- Python Context Managers
  - Context Managers (with statement) in Python
- Python Threading
- Python MultiProcessing
- Python Synchronization
- Python Networking
- Python Asyncio
- Python Standard Library
- Modern Python
- Algorithms Visualized
Flask Tutorials
Python Automation and Scripting
Data Analytics
Mathematics for Machine Learning
- Mathematics for Machine Learning
- Chapter 00 - Getting Ready
- Chapter 01 - Introduction and Motivation
- Chapter 02 - Linear Algebra
- Chapter 03 - Analytic Geometry
- Chapter 04 - Matrix Decompositions
- Chapter 05 - Vector Calculus
- Chapter 06 - Probability and Distributions
- Recall Drill
Machine Learning
- Machine Learning
- Phase 01 - The ML Foundation
- Phase 02 - Data Preprocessing & Feature Engineering
- Phase 03 - Supervised Learning - Regression
- Phase 04 - Supervised Learning - Classification
- Phase 05 - Ensemble Learning
- Phase 06 - Unsupervised Learning & Dimensionality Reduction
- Phase 07 - Model Optimization & Tuning
- Phase 08 - Model Deployment (MLOps)
- Phase 09 - Interpretability & Responsible ML
- Phase 10 - Applied ML Problems
- Phase 11 - ML Engineering
- Phase 12 - Capstone Projects
Deep Learning
DSA with Python
- Start Here 8
  - 00 · Start Here
    
    Your DSA Interview Roadmap
    How to Use This Course
    The Sheets, Mapped
    NeetCode 150
    Blind 75
    LeetCode Top Interview 150
    Striver's A2Z DSA Sheet
    Striver's SDE Sheet
- Foundations 29
  - 01 · Foundations
    
    Introduction to DSA with Python
    Setup for CP and Interviews
    Big-O and Complexity Deep Dive
    Recurrences and the Master Theorem
    Space Complexity and the Call Stack
    Python Recursion and Iterative Conversion
  - 02 · Python for DSA & CP
    
    Python Data Model Speed Reality
    stdlib Power Tools for DSA
    Fast IO and Beating TLE
    Python Idioms and Tricks for CP
  - 03 · Core Data Structures
    
    Arrays and Dynamic Arrays
    Strings
    Linked Lists
    Stacks and Queues
    Hash Tables
    Heaps and Priority Queues
    Binary Trees and BST
    Balanced Trees Overview
    Tries (Prefix Trees)
    Union-Find (Disjoint Set Union)
    Graph Representations
    Ordered Structures in Python
  - 04 · Sorting & Searching
    
    Elementary Sorts
    Merge Sort
    Quick Sort
    Heap Sort
    Counting, Radix, and Bucket Sort
    Python Sorting and Timsort
    Binary Search Template and Variants
- Interview Patterns 77
  - 05 · Arrays & Strings
    
    Two Pointers
    Sliding Window
    Monotonic Deque
    Prefix Sums and Difference Arrays
    Prefix Sum with HashMap
    Kadane and Maximum Subarray
    Cyclic Sort
    Matrix and Grid Manipulation
    Monotonic Stack
    Stack Parsing and Expression Evaluation
    Frequency and Anagram Counting
    Palindrome Patterns
    Trie Patterns
    Dutch National Flag and In-place Partitioning
  - 06 · Search & Selection
    
    Binary Search on Rotated Arrays and Matrices
    Binary Search on Answer
    Quickselect and Nth Element
    Top K Elements
    Two Heaps and Running Median
    K-way Merge
  - 07 · Intervals & Greedy
    
    Merge Intervals
    Sweep Line and Event Counting
    Greedy Interval Scheduling
    Greedy Reachability and Jumps
    Sorting with Custom Comparators
  - 08 · Linked Lists
    
    Fast and Slow Pointers
    In-place Linked List Reversal
    Dummy Head Rewiring and Merging
    Copy Flatten and Reorder
  - 09 · Trees
    
    Tree DFS Paths and Sums
    Tree BFS and Level Order
    BST Patterns
    Lowest Common Ancestor
    Tree Construction from Traversals
    Serialize Compare and Subtree
    Morris Traversal and O(1)-Space Tree Walks
    Binary Lifting and Sparse LCA
  - 10 · Graphs
    
    Graph Traversal and Connected Components
    Breadth First Search
    Depth First Search
    Grid Traversal Islands and Flood Fill
    Multi-source BFS
    Topological Sort
    Cycle Detection and Bipartite Checking
    Union-Find Problem Patterns
    Shortest Paths: Dijkstra, Bellman-Ford, and Floyd-Warshall
    Eulerian Paths and Reconstruct Itinerary
    BFS and Dijkstra with Extra State
    0-1 BFS and Deque Shortest Paths
  - 11 · Recursion & Backtracking
    
    Subsets and Combinations
    Permutations and Arrangements
    Backtracking
    Divide and Conquer
  - 12 · Dynamic Programming
    
    From Recursion to DP
    One Dimensional DP
    Two Dimensional DP and Knapsack
    Knapsack Variants and Subset Sum
    Classic DP: LIS, LCS, and Edit Distance
    DP on Grids and Intervals
    Bitmask and Tree DP
    DP on Stocks
    Partition DP
    String DP
    LIS Variants and Patience Sorting
    Digit DP
  - 13 · Bit Manipulation & Math
    
    Bit Manipulation Tricks
    Bitwise XOR Patterns
    Number Theory for Competitive Programming
    Math and Geometry Problems
  - 14 · Design Problems
    
    Design LRU and LFU Caches
    Design with Stacks and Queues
    Design Iterators and Flatteners
    Design with Randomization
    Design Trackers and Feeds
    Design Rate Limiter and Hit Counter
    Design HashMap and Skiplist
  - 15 · Simulation & Implementation
    
    Simulation and Stateful Iteration
- Advanced & Competitive 8
  - 16 · Advanced Graph Algorithms
    
    Minimum Spanning Trees: Kruskal and Prim
    Strongly Connected Components and Bridges
    Maximum Flow
  - 17 · Advanced CP Topics
    
    Segment Trees and Lazy Propagation
    Fenwick Tree (Binary Indexed Tree)
    Sparse Tables and Range Minimum Query
    String Algorithms: KMP, Z, and Rabin-Karp
    Advanced DP Optimizations
- Reference & Strategy 14
  - 18 · Templates & Cheatsheets
    
    Data Structure Templates
    Graph Algorithm Templates
    Algorithm Templates
    Master Complexity Cheatsheet
  - 19 · Interview & Contest Strategy
    
    FAANG Interview Playbook
    Pattern Recognition Guide
    Contest Strategy
    Study Plans and Roadmap
    Mock Interviews and Spaced Repetition
  - 20 · Problem Sets
    
    Getting Started Problem Set
    Arrays and Strings Problem Set
    Trees and Graphs Problem Set
    Dynamic Programming Problem Set
    Hard Mix Problem Set
- Company Guides 10
  - 21 · Company Guides
    
    Company Comparison Matrix
    Google Interview Guide
    Meta Interview Guide
    Amazon Interview Guide
    Microsoft Interview Guide
    Apple Interview Guide
    Netflix Interview Guide
    Uber Interview Guide
    Bloomberg Interview Guide
    ByteDance Interview Guide
- Low-Level Design 5
  - 22 · Low-Level Design (OOD)
    
    The OOD Round: How to Approach It
    Design an Elevator System
    Design a Parking Lot
    Design a Deck of Cards
    Design a Library System
- Concurrency 2
  - 23 · Concurrency
    
    Thread Ordering and Signalling
    Bounded Buffers and Deadlock
Software Testing and Quality
Projects
Reference
- Contact Us

GitHub Instagram X Email LinkedIn

Select theme

Select language

On this page

Overview

On this page

Overview

Contact Us

pch.contactIntro

pch.contactNoscript ravikishan63392@gmail.com.

pch.contactEmail *

pch.contactName *

pch.contactMessage *

pch.coffeeTagline

pch.feedbackHeading

pch.feedbackSubheading

pch.feedbackEmail *

pch.feedbackComment *

Last updated: Aug 9, 2026

Previous
URL Expander