{
    "api": "YAML JSON TOON Database",
    "version": "1.0.0",
    "format": "json",
    "category": {
        "id": 3,
        "slug": "data-structures",
        "name": "Data Structures",
        "description": "Fundamental data structures with properties and complexity analysis.",
        "icon": "layers",
        "created_at": 1783090350
    },
    "datasets": [
        {
            "id": 1,
            "slug": "advanced-graph-algorithms",
            "title": "Advanced Graph Algorithms",
            "description": "Advanced graph algorithms: strongly connected components (Tarjan's, Kosaraju's), max flow (Ford-Fulkerson, Edmonds-Karp, Dinic), matching, and graph coloring.",
            "tags": "graphs,algorithms,max-flow,matching,strongly-connected-components,graph-coloring,ford-fulkerson",
            "view_count": 0,
            "created_at": 1783090350
        },
        {
            "id": 2,
            "slug": "concurrent-data-structures",
            "title": "Concurrent Data Structures",
            "description": "Thread-safe data structures: concurrent hash maps, skip lists, queues, stacks, read-write locks, lock-free algorithms, and compare-and-swap patterns.",
            "tags": "concurrency,lock-free,compare-and-swap,concurrent-hash-map,concurrent-queue,read-write-lock,atomic",
            "view_count": 0,
            "created_at": 1783090350
        },
        {
            "id": 3,
            "slug": "complexity-analysis",
            "title": "Data Structure Complexity Analysis",
            "description": "Time and space complexity analysis of common data structures: Array, Linked List, Binary Search Tree, Hash Table, Heap, and Graph with Big-O notation.",
            "tags": "algorithms,complexity,big-o,data structures",
            "view_count": 0,
            "created_at": 1783090350
        },
        {
            "id": 4,
            "slug": "graph-algorithms",
            "title": "Graph Algorithms",
            "description": "Essential graph algorithms: traversals (BFS, DFS), shortest path (Dijkstra, Bellman-Ford), minimum spanning tree (Prim, Kruskal), topological sort, and network flow.",
            "tags": "graphs,algorithms,bfs,dfs,dijkstra,mst,topological-sort,network-flow",
            "view_count": 0,
            "created_at": 1783090350
        },
        {
            "id": 5,
            "slug": "hash-tables",
            "title": "Hash Tables & Hash Functions",
            "description": "Hash table implementations, collision resolution strategies, hash functions, load factor, and performance characteristics.",
            "tags": "hash-tables,dictionaries,associative-arrays,collision-resolution,hashing",
            "view_count": 0,
            "created_at": 1783090350
        },
        {
            "id": 6,
            "slug": "bloom-filters-probabilistic",
            "title": "Probabilistic Data Structures: Bloom Filters & Beyond",
            "description": "Probabilistic data structures for approximate set membership, counting, and cardinality estimation: Bloom filters, Count-Min Sketch, HyperLogLog, and Cuckoo filters.",
            "tags": "bloom-filter,probabilistic,data-structures,hyperloglog,cuckoo-filter,count-min-sketch",
            "view_count": 0,
            "created_at": 1783090350
        },
        {
            "id": 7,
            "slug": "sorting-algorithms-comparison",
            "title": "Sorting Algorithms Comparison",
            "description": "Time and space complexity comparison of sorting algorithms: Bubble, Selection, Insertion, Merge, Quick, Heap, Counting, and Radix Sort with stability notes.",
            "tags": "algorithms,sorting,complexity,big-o",
            "view_count": 0,
            "created_at": 1783090350
        },
        {
            "id": 8,
            "slug": "spatial-data-structures",
            "title": "Spatial Data Structures",
            "description": "Spatial indexing structures for multi-dimensional data: k-d trees, R-trees, quadtrees, octrees, grid files, and space-filling curves (Z-order, Hilbert).",
            "tags": "spatial,kd-tree,rtree,quadtree,octree,space-filling-curves,geospatial,nearest-neighbor",
            "view_count": 0,
            "created_at": 1783090350
        },
        {
            "id": 9,
            "slug": "string-algorithms",
            "title": "String Algorithms and Pattern Matching",
            "description": "String processing algorithms: KMP, Rabin-Karp, Z-algorithm, suffix trees/arrays, Aho-Corasick, and edit distance (Levenshtein).",
            "tags": "strings,pattern-matching,kmp,rabin-karp,z-algorithm,suffix-tree,aho-corasick,levenshtein",
            "view_count": 0,
            "created_at": 1783090350
        },
        {
            "id": 10,
            "slug": "tree-data-structures",
            "title": "Tree Data Structures",
            "description": "Complete reference of tree data structures: binary trees, BST, AVL, Red-Black, B-trees, B+ trees, segment trees, and trie.",
            "tags": "trees,bst,avl,red-black,b-tree,trie,data-structures,algorithms",
            "view_count": 0,
            "created_at": 1783090350
        }
    ]
}