contents.json

{"name": "Qazaqsha Compet", "type": "folder", "content": [{"name": "I. Basic techniques", "type": "folder", "content": [{"name": "1  Introduction", "type": "folder", "content": [{"name": "1.1  Programming languages", "type": "file"}, {"name": "1.2  Input and output", "type": "file"}, {"name": "1.3  Working with numbers", "type": "file"}, {"name": "1.4  Shortening code", "type": "file"}, {"name": "1.5  Mathematics", "type": "file"}, {"name": "1.6  Contests and resources", "type": "file"}]}, {"name": "2  Time complexity", "type": "folder", "content": [{"name": "2.1  Calculation rules", "type": "file"}, {"name": "2.2  Complexity classes", "type": "file"}, {"name": "2.3  Estimating efficiency", "type": "file"}, {"name": "2.4  Maximum subarray sum", "type": "file"}]}, {"name": "3  Sorting", "type": "folder", "content": [{"name": "3.1  Sorting theory", "type": "file"}, {"name": "3.2  Sorting in C++", "type": "file"}, {"name": "3.3  Binary search", "type": "file"}]}, {"name": "4  Data structures", "type": "folder", "content": [{"name": "4.1  Dynamic arrays", "type": "file"}, {"name": "4.2  Set structures", "type": "file"}, {"name": "4.3  Map structures", "type": "file"}, {"name": "4.4  Iterators and ranges", "type": "file"}, {"name": "4.5  Other structures", "type": "file"}, {"name": "4.6  Comparison to sorting", "type": "file"}]}, {"name": "5  Complete search", "type": "folder", "content": [{"name": "5.1  Generating subsets", "type": "file"}, {"name": "5.2  Generating permutations", "type": "file"}, {"name": "5.3  Backtracking", "type": "file"}, {"name": "5.4  Pruning the search", "type": "file"}, {"name": "5.5  Meet in the middle", "type": "file"}]}, {"name": "6  Greedy algorithms", "type": "folder", "content": [{"name": "6.1  Coin problem", "type": "file"}, {"name": "6.2  Scheduling", "type": "file"}, {"name": "6.3  Tasks and deadlines", "type": "file"}, {"name": "6.4  Minimizing sums", "type": "file"}, {"name": "6.5  Data compression", "type": "file"}]}, {"name": "7  Dynamic programming", "type": "folder", "content": [{"name": "7.1  Coin problem", "type": "file"}, {"name": "7.2  Longest increasing subsequence", "type": "file"}, {"name": "7.3  Paths in a grid", "type": "file"}, {"name": "7.4  Knapsack problems", "type": "file"}, {"name": "7.5  Edit distance", "type": "file"}, {"name": "7.6  Counting tilings", "type": "file"}]}, {"name": "8  Amortized analysis", "type": "folder", "content": [{"name": "8.1  Two pointers method", "type": "file"}, {"name": "8.2  Nearest smaller elements", "type": "file"}, {"name": "8.3  Sliding window minimum", "type": "file"}]}, {"name": "9  Range queries", "type": "folder", "content": [{"name": "9.1  Static array queries", "type": "file"}, {"name": "9.2  Binary indexed tree", "type": "file"}, {"name": "9.3  Segment tree", "type": "file"}, {"name": "9.4  Additional techniques", "type": "file"}]}, {"name": "10  Bit manipulation", "type": "folder", "content": [{"name": "10.1  Bit representation", "type": "file"}, {"name": "10.2  Bit operations", "type": "file"}, {"name": "10.3  Representing sets", "type": "file"}, {"name": "10.4  Bit optimizations", "type": "file"}, {"name": "10.5  Dynamic programming", "type": "file"}]}]}, {"name": "II. Graph algorithms", "type": "folder", "content": [{"name": "11  Basics of graphs", "type": "folder", "content": [{"name": "11.1  Graph terminology", "type": "file"}, {"name": "11.2  Graph representation", "type": "file"}]}, {"name": "12  Graph traversal", "type": "folder", "content": [{"name": "12.1  Depth-first search", "type": "file"}, {"name": "12.2  Breadth-first search", "type": "file"}, {"name": "12.3  Applications", "type": "file"}]}, {"name": "13  Shortest paths", "type": "folder", "content": [{"name": "13.1  Bellman\u2013Ford algorithm", "type": "file"}, {"name": "13.2  Dijkstra's algorithm", "type": "file"}, {"name": "13.3  Floyd\u2013Warshall algorithm", "type": "file"}]}, {"name": "14  Tree algorithms", "type": "folder", "content": [{"name": "14.1  Tree traversal", "type": "file"}, {"name": "14.2  Diameter", "type": "file"}, {"name": "14.3  All longest paths", "type": "file"}, {"name": "14.4  Binary trees", "type": "file"}]}, {"name": "15  Spanning trees", "type": "folder", "content": [{"name": "15.1  Kruskal's algorithm", "type": "file"}, {"name": "15.2  Union-find structure", "type": "file"}, {"name": "15.3  Prim's algorithm", "type": "file"}]}, {"name": "16  Directed graphs", "type": "folder", "content": [{"name": "16.1  Topological sorting", "type": "file"}, {"name": "16.2  Dynamic programming", "type": "file"}, {"name": "16.3  Successor paths", "type": "file"}, {"name": "16.4  Cycle detection", "type": "file"}]}, {"name": "17  Strong connectivity", "type": "folder", "content": [{"name": "17.1  Kosaraju's algorithm", "type": "file"}, {"name": "17.2  2SAT problem", "type": "file"}]}, {"name": "18  Tree queries", "type": "folder", "content": [{"name": "18.1  Finding ancestors", "type": "file"}, {"name": "18.2  Subtrees and paths", "type": "file"}, {"name": "18.3  Lowest common ancestor", "type": "file"}, {"name": "18.4  Offline algorithms", "type": "file"}]}, {"name": "19  Paths and circuits", "type": "folder", "content": [{"name": "19.1  Eulerian paths", "type": "file"}, {"name": "19.2  Hamiltonian paths", "type": "file"}, {"name": "19.3  De Bruijn sequences", "type": "file"}, {"name": "19.4  Knight's tours", "type": "file"}]}, {"name": "20  Flows and cuts", "type": "folder", "content": [{"name": "20.1  Ford\u2013Fulkerson algorithm", "type": "file"}, {"name": "20.2  Disjoint paths", "type": "file"}, {"name": "20.3  Maximum matchings", "type": "file"}, {"name": "20.4  Path covers", "type": "file"}]}]}, {"name": "III. Advanced topics", "type": "folder", "content": [{"name": "21  Number theory", "type": "folder", "content": [{"name": "21.1  Primes and factors", "type": "file"}, {"name": "21.2  Modular arithmetic", "type": "file"}, {"name": "21.3  Solving equations", "type": "file"}, {"name": "21.4  Other results", "type": "file"}]}, {"name": "22  Combinatorics", "type": "folder", "content": [{"name": "22.1  Binomial coefficients", "type": "file"}, {"name": "22.2  Catalan numbers", "type": "file"}, {"name": "22.3  Inclusion-exclusion", "type": "file"}, {"name": "22.4  Burnside's lemma", "type": "file"}, {"name": "22.5  Cayley's formula", "type": "file"}]}, {"name": "23  Matrices", "type": "folder", "content": [{"name": "23.1  Operations", "type": "file"}, {"name": "23.2  Linear recurrences", "type": "file"}, {"name": "23.3  Graphs and matrices", "type": "file"}]}, {"name": "24  Probability", "type": "folder", "content": [{"name": "24.1  Calculation", "type": "file"}, {"name": "24.2  Events", "type": "file"}, {"name": "24.3  Random variables", "type": "file"}, {"name": "24.4  Markov chains", "type": "file"}, {"name": "24.5  Randomized algorithms", "type": "file"}]}, {"name": "25  Game theory", "type": "folder", "content": [{"name": "25.1  Game states", "type": "file"}, {"name": "25.2  Nim game", "type": "file"}, {"name": "25.3  Sprague\u2013Grundy theorem", "type": "file"}]}, {"name": "26  String algorithms", "type": "folder", "content": [{"name": "26.1  String terminology", "type": "file"}, {"name": "26.2  Trie structure", "type": "file"}, {"name": "26.3  String hashing", "type": "file"}, {"name": "26.4  Z-algorithm", "type": "file"}]}, {"name": "27  Square root algorithms", "type": "folder", "content": [{"name": "27.1  Combining algorithms", "type": "file"}, {"name": "27.2  Integer partitions", "type": "file"}, {"name": "27.3  Mo's algorithm", "type": "file"}]}, {"name": "28  Segment trees revisited", "type": "folder", "content": [{"name": "28.1  Lazy propagation", "type": "file"}, {"name": "28.2  Dynamic trees", "type": "file"}, {"name": "28.3  Data structures", "type": "file"}, {"name": "28.4  Two-dimensionality", "type": "file"}]}, {"name": "29  Geometry", "type": "folder", "content": [{"name": "29.1  Complex numbers", "type": "file"}, {"name": "29.2  Points and lines", "type": "file"}, {"name": "29.3  Polygon area", "type": "file"}, {"name": "29.4  Distance functions", "type": "file"}]}, {"name": "30  Sweep line algorithms", "type": "folder", "content": [{"name": "30.1  Intersection points", "type": "file"}, {"name": "30.2  Closest pair problem", "type": "file"}, {"name": "30.3  Convex hull problem", "type": "file"}]}]}]}