{"code":200,"msg":"OK","sec":"0.372897","ver":"0.8.d5326a1b","body":{"global":{"data-stream":{"name":"Data Stream","sum":4},"game-theory":{"name":"Game Theory","sum":12},"rolling-hash":{"name":"Rolling Hash","sum":1},"sweep-line":{"name":"Sweep Line","sum":1},"backtracking":{"name":"Backtracking","sum":34},"bitmask":{"name":"Bitmask","sum":6},"quickselect":{"name":"Quickselect","sum":3},"dynamic-programming":{"name":"Dynamic Programming","sum":179},"divide-and-conquer":{"name":"Divide and Conquer","sum":27},"trie":{"name":"Trie","sum":14},"union-find":{"name":"Union-Find","sum":34},"binary-indexed-tree":{"name":"Binary Indexed Tree","sum":6},"segment-tree":{"name":"Segment Tree","sum":20},"monotonic-stack":{"name":"Monotonic Stack","sum":13},"monotonic-queue":{"name":"Monotonic Queue","sum":5},"topological-sort":{"name":"Topological Sort","sum":9},"shortest-path":{"name":"Shortest Path","sum":11},"tree":{"name":"Tree","sum":69},"binary-tree":{"name":"Binary Tree","sum":57},"hash-table":{"name":"Hash Table","sum":197},"ordered-set":{"name":"Ordered Set","sum":20},"graph":{"name":"Graph Theory","sum":46},"greedy":{"name":"Greedy","sum":109},"binary-search":{"name":"Binary Search","sum":119},"depth-first-search":{"name":"Depth-First Search","sum":97},"breadth-first-search":{"name":"Breadth-First Search","sum":83},"recursion":{"name":"Recursion","sum":25},"sliding-window":{"name":"Sliding Window","sum":47},"bit-manipulation":{"name":"Bit Manipulation","sum":72},"math":{"name":"Math","sum":179},"randomized":{"name":"Randomized","sum":3},"design":{"name":"Design","sum":31},"iterator":{"name":"Iterator","sum":1},"brainteaser":{"name":"Brainteaser","sum":5},"database":{"name":"Database","sum":71},"array":{"name":"Array","sum":596},"matrix":{"name":"Matrix","sum":103},"string":{"name":"String","sum":228},"simulation":{"name":"Simulation","sum":73},"enumeration":{"name":"Enumeration","sum":31},"sorting":{"name":"Sorting","sum":152},"stack":{"name":"Stack","sum":56},"queue":{"name":"Queue","sum":18},"linked-list":{"name":"Linked List","sum":34},"two-pointers":{"name":"Two Pointers","sum":78}},"map":{"sort":["array","string","hash-table","dynamic-programming","math","sorting","binary-search","greedy","matrix","depth-first-search","breadth-first-search","two-pointers","simulation","bit-manipulation","database","tree","binary-tree","stack","sliding-window","graph","backtracking","union-find","linked-list","design","enumeration","divide-and-conquer","recursion","segment-tree","ordered-set","queue","trie","monotonic-stack","game-theory","shortest-path","topological-sort","bitmask","binary-indexed-tree","monotonic-queue","brainteaser","data-stream","quickselect","randomized","rolling-hash","sweep-line","iterator"],"fundamental":["array","matrix","string","simulation","enumeration","sorting","stack","queue","linked-list","two-pointers"],"intermediate":["tree","binary-tree","hash-table","ordered-set","graph","greedy","binary-search","depth-first-search","breadth-first-search","recursion","sliding-window","bit-manipulation","math","randomized","design","iterator","brainteaser","database"],"advanced":["data-stream","game-theory","rolling-hash","sweep-line","backtracking","bitmask","quickselect","dynamic-programming","divide-and-conquer","trie","union-find","binary-indexed-tree","segment-tree","monotonic-stack","monotonic-queue","topological-sort","shortest-path"]}}}