{"code":200,"msg":"OK","sec":"0.282652","ver":"0.8.d5326a1b","body":{"global":{"data-stream":{"name":"Data Stream","sum":4},"game-theory":{"name":"Game Theory","sum":4},"rolling-hash":{"name":"Rolling Hash","sum":1},"line-sweep":{"name":"Sweep Line","sum":1},"backtracking":{"name":"Backtracking","sum":33},"bitmask":{"name":"Bitmask","sum":6},"quickselect":{"name":"Quickselect","sum":3},"dynamic-programming":{"name":"Dynamic Programming","sum":161},"divide-and-conquer":{"name":"Divide and Conquer","sum":24},"trie":{"name":"Trie","sum":14},"union-find":{"name":"Union-Find","sum":30},"binary-indexed-tree":{"name":"Binary Indexed Tree","sum":5},"segment-tree":{"name":"Segment Tree","sum":14},"monotonic-stack":{"name":"Monotonic Stack","sum":12},"monotonic-queue":{"name":"Monotonic Queue","sum":5},"topological-sort":{"name":"Topological Sort","sum":8},"shortest-path":{"name":"Shortest Path","sum":9},"tree":{"name":"Tree","sum":66},"binary-tree":{"name":"Binary Tree","sum":56},"hash-table":{"name":"Hash Table","sum":178},"ordered-set":{"name":"Ordered Set","sum":17},"graph":{"name":"Graph Theory","sum":39},"greedy":{"name":"Greedy","sum":94},"binary-search":{"name":"Binary Search","sum":112},"depth-first-search":{"name":"Depth-First Search","sum":91},"breadth-first-search":{"name":"Breadth-First Search","sum":76},"recursion":{"name":"Recursion","sum":22},"sliding-window":{"name":"Sliding Window","sum":42},"bit-manipulation":{"name":"Bit Manipulation","sum":64},"math":{"name":"Math","sum":147},"randomized":{"name":"Randomized","sum":3},"design":{"name":"Design","sum":30},"iterator":{"name":"Iterator","sum":1},"brainteaser":{"name":"Brainteaser","sum":5},"database":{"name":"Database","sum":71},"array":{"name":"Array","sum":540},"matrix":{"name":"Matrix","sum":98},"string":{"name":"String","sum":201},"simulation":{"name":"Simulation","sum":66},"enumeration":{"name":"Enumeration","sum":24},"sorting":{"name":"Sorting","sum":137},"stack":{"name":"Stack","sum":55},"queue":{"name":"Queue","sum":18},"linked-list":{"name":"Linked List","sum":34},"two-pointers":{"name":"Two Pointers","sum":73}},"map":{"sort":["array","string","hash-table","dynamic-programming","math","sorting","binary-search","matrix","greedy","depth-first-search","breadth-first-search","two-pointers","database","tree","simulation","bit-manipulation","binary-tree","stack","sliding-window","graph","linked-list","backtracking","union-find","design","divide-and-conquer","enumeration","recursion","queue","ordered-set","trie","segment-tree","monotonic-stack","shortest-path","topological-sort","bitmask","binary-indexed-tree","monotonic-queue","brainteaser","data-stream","game-theory","quickselect","randomized","rolling-hash","line-sweep","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","line-sweep","backtracking","bitmask","quickselect","dynamic-programming","divide-and-conquer","trie","union-find","binary-indexed-tree","segment-tree","monotonic-stack","monotonic-queue","topological-sort","shortest-path"]}}}