DSA Solution

Note Preview

04_dsa_solutions/leetcode_solutions

πŸ“– Open Note
Table of Contents
    Platform & Reading Settings
    Theme & Appearance
    COLOR THEME
    READING TINT
    Reading & View Controls

    πŸ“‘ Platform Audit & Verification Report

    360
    Indexed Notes
    5.0s
    Build Time
    100%
    SPA Compliant
    60 FPS
    PixiJS Graph

    Active Platform Features

    • βœ… Multi-Track Fast Dev: Staging 2+ tracks in parallel with sub-5s full builds.
    • βœ… Obsidian Graph Engine: Emerald (DSA), Indigo (Architecture), Amber (Languages), Pink (Cloud).
    • βœ… Directed Arrows: GPU-accelerated triangular vectors indicating knowledge dependencies.
    • βœ… Lazy-Loaded Graph: Zero initial memory/CDN overhead, hydrating strictly on viewport intersection.
    • βœ… Mobile TOC Drawer: Touch-friendly bottom sheet highlighting active section headings.
    • βœ… Distraction-Free Focus: Maximize reading canvas with 1-click floating exit trigger.
    • βœ… Resilient Storage: Defensive JSON parsing preventing crashes across hard reload (Ctrl+Shift+R).

    GraphMind

    min-cut

    4 items with this tag.

    • Oct 27, 2026

      Advanced Graph Flows & Matching: Stoer-Wagner Algorithm for Global Minimum Cut

      • dsa
      • graph-theory
      • global-min-cut
      • stoer-wagner
      • max-adjacency-search
      • min-cut
      • weighted-graphs
      • algorithms
      • computer-science
      • learning-note
    • Oct 27, 2026

      Advanced Graph Flows & Matching: Dinic's Algorithm, Min-Cut Max-Flow & Hopcroft-Karp

      • dsa
      • network-flow
      • max-flow
      • min-cut
      • dinics-algorithm
      • hopcroft-karp
      • bipartite-matching
      • algorithms
      • computer-science
      • learning-note
    • Oct 27, 2026

      00. πŸ“š 07 Advanced Graph Theory β€” Master Module Overview

      • dsa
      • advanced-graph-theory
      • heavy-light-decomposition
      • hld
      • network-flow
      • dinic
      • edmonds-karp
      • mcmf
      • min-cost-max-flow
      • bipartite-matching
      • min-cut
      • overview
      • roadmap
      • algorithms
      • computer-science
      • learning-note
    • Oct 27, 2026

      01. Advanced DSA Pattern: Network Flow - Dinic's & Edmonds-Karp Maximum Flow

      • dsa
      • graph-theory
      • network-flow
      • max-flow
      • dinic-algorithm
      • edmonds-karp
      • min-cut
      • advanced-patterns
      • competitive-programming
      • algorithms
      • computer-science
      • learning-note

    Created with Quartz v5.0.0 Β© 2026

    • GitHub
    • Discord Community