Full Code of krahets/hello-algo for AI

gitextract_4c8t4fps/

├── .gitattributes
├── .github/
│   ├── pull_request_template.md
│   └── workflows/
│       ├── c.yml
│       ├── cpp.yml
│       ├── dart.yml
│       ├── dotnet.yml
│       ├── go.yml
│       ├── java.yml
│       ├── javascript.yml
│       ├── kotlin.yml
│       ├── python.yml
│       ├── ruby.yml
│       ├── rust.yml
│       ├── swift.yml
│       └── typescript.yml
├── .gitignore
├── Dockerfile
├── LICENSE
├── README.md
├── codes/
│   ├── Dockerfile
│   ├── c/
│   │   ├── .gitignore
│   │   ├── CMakeLists.txt
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── array.c
│   │   │   ├── linked_list.c
│   │   │   └── my_list.c
│   │   ├── chapter_backtracking/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── n_queens.c
│   │   │   ├── permutations_i.c
│   │   │   ├── permutations_ii.c
│   │   │   ├── preorder_traversal_i_compact.c
│   │   │   ├── preorder_traversal_ii_compact.c
│   │   │   ├── preorder_traversal_iii_compact.c
│   │   │   ├── preorder_traversal_iii_template.c
│   │   │   ├── subset_sum_i.c
│   │   │   ├── subset_sum_i_naive.c
│   │   │   └── subset_sum_ii.c
│   │   ├── chapter_computational_complexity/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── iteration.c
│   │   │   ├── recursion.c
│   │   │   ├── space_complexity.c
│   │   │   ├── time_complexity.c
│   │   │   └── worst_best_time_complexity.c
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── binary_search_recur.c
│   │   │   ├── build_tree.c
│   │   │   └── hanota.c
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── climbing_stairs_backtrack.c
│   │   │   ├── climbing_stairs_constraint_dp.c
│   │   │   ├── climbing_stairs_dfs.c
│   │   │   ├── climbing_stairs_dfs_mem.c
│   │   │   ├── climbing_stairs_dp.c
│   │   │   ├── coin_change.c
│   │   │   ├── coin_change_ii.c
│   │   │   ├── edit_distance.c
│   │   │   ├── knapsack.c
│   │   │   ├── min_cost_climbing_stairs_dp.c
│   │   │   ├── min_path_sum.c
│   │   │   └── unbounded_knapsack.c
│   │   ├── chapter_graph/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── graph_adjacency_list.c
│   │   │   ├── graph_adjacency_list_test.c
│   │   │   ├── graph_adjacency_matrix.c
│   │   │   ├── graph_bfs.c
│   │   │   └── graph_dfs.c
│   │   ├── chapter_greedy/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── coin_change_greedy.c
│   │   │   ├── fractional_knapsack.c
│   │   │   ├── max_capacity.c
│   │   │   └── max_product_cutting.c
│   │   ├── chapter_hashing/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── array_hash_map.c
│   │   │   ├── hash_map_chaining.c
│   │   │   ├── hash_map_open_addressing.c
│   │   │   └── simple_hash.c
│   │   ├── chapter_heap/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── my_heap.c
│   │   │   ├── my_heap_test.c
│   │   │   └── top_k.c
│   │   ├── chapter_searching/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── binary_search.c
│   │   │   ├── binary_search_edge.c
│   │   │   ├── binary_search_insertion.c
│   │   │   └── two_sum.c
│   │   ├── chapter_sorting/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── bubble_sort.c
│   │   │   ├── bucket_sort.c
│   │   │   ├── counting_sort.c
│   │   │   ├── heap_sort.c
│   │   │   ├── insertion_sort.c
│   │   │   ├── merge_sort.c
│   │   │   ├── quick_sort.c
│   │   │   ├── radix_sort.c
│   │   │   └── selection_sort.c
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── array_deque.c
│   │   │   ├── array_queue.c
│   │   │   ├── array_stack.c
│   │   │   ├── linkedlist_deque.c
│   │   │   ├── linkedlist_queue.c
│   │   │   └── linkedlist_stack.c
│   │   ├── chapter_tree/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── array_binary_tree.c
│   │   │   ├── avl_tree.c
│   │   │   ├── binary_search_tree.c
│   │   │   ├── binary_tree.c
│   │   │   ├── binary_tree_bfs.c
│   │   │   └── binary_tree_dfs.c
│   │   └── utils/
│   │       ├── CMakeLists.txt
│   │       ├── common.h
│   │       ├── common_test.c
│   │       ├── list_node.h
│   │       ├── print_util.h
│   │       ├── tree_node.h
│   │       ├── uthash.h
│   │       ├── vector.h
│   │       └── vertex.h
│   ├── cpp/
│   │   ├── .gitignore
│   │   ├── CMakeLists.txt
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── array.cpp
│   │   │   ├── linked_list.cpp
│   │   │   ├── list.cpp
│   │   │   └── my_list.cpp
│   │   ├── chapter_backtracking/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── n_queens.cpp
│   │   │   ├── permutations_i.cpp
│   │   │   ├── permutations_ii.cpp
│   │   │   ├── preorder_traversal_i_compact.cpp
│   │   │   ├── preorder_traversal_ii_compact.cpp
│   │   │   ├── preorder_traversal_iii_compact.cpp
│   │   │   ├── preorder_traversal_iii_template.cpp
│   │   │   ├── subset_sum_i.cpp
│   │   │   ├── subset_sum_i_naive.cpp
│   │   │   └── subset_sum_ii.cpp
│   │   ├── chapter_computational_complexity/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── iteration.cpp
│   │   │   ├── recursion.cpp
│   │   │   ├── space_complexity.cpp
│   │   │   ├── time_complexity.cpp
│   │   │   └── worst_best_time_complexity.cpp
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── binary_search_recur.cpp
│   │   │   ├── build_tree.cpp
│   │   │   └── hanota.cpp
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── climbing_stairs_backtrack.cpp
│   │   │   ├── climbing_stairs_constraint_dp.cpp
│   │   │   ├── climbing_stairs_dfs.cpp
│   │   │   ├── climbing_stairs_dfs_mem.cpp
│   │   │   ├── climbing_stairs_dp.cpp
│   │   │   ├── coin_change.cpp
│   │   │   ├── coin_change_ii.cpp
│   │   │   ├── edit_distance.cpp
│   │   │   ├── knapsack.cpp
│   │   │   ├── min_cost_climbing_stairs_dp.cpp
│   │   │   ├── min_path_sum.cpp
│   │   │   └── unbounded_knapsack.cpp
│   │   ├── chapter_graph/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── graph_adjacency_list.cpp
│   │   │   ├── graph_adjacency_list_test.cpp
│   │   │   ├── graph_adjacency_matrix.cpp
│   │   │   ├── graph_bfs.cpp
│   │   │   └── graph_dfs.cpp
│   │   ├── chapter_greedy/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── coin_change_greedy.cpp
│   │   │   ├── fractional_knapsack.cpp
│   │   │   ├── max_capacity.cpp
│   │   │   └── max_product_cutting.cpp
│   │   ├── chapter_hashing/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── array_hash_map.cpp
│   │   │   ├── array_hash_map_test.cpp
│   │   │   ├── built_in_hash.cpp
│   │   │   ├── hash_map.cpp
│   │   │   ├── hash_map_chaining.cpp
│   │   │   ├── hash_map_open_addressing.cpp
│   │   │   └── simple_hash.cpp
│   │   ├── chapter_heap/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── heap.cpp
│   │   │   ├── my_heap.cpp
│   │   │   └── top_k.cpp
│   │   ├── chapter_searching/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── binary_search.cpp
│   │   │   ├── binary_search_edge.cpp
│   │   │   ├── binary_search_insertion.cpp
│   │   │   ├── hashing_search.cpp
│   │   │   ├── linear_search.cpp
│   │   │   └── two_sum.cpp
│   │   ├── chapter_sorting/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── bubble_sort.cpp
│   │   │   ├── bucket_sort.cpp
│   │   │   ├── counting_sort.cpp
│   │   │   ├── heap_sort.cpp
│   │   │   ├── insertion_sort.cpp
│   │   │   ├── merge_sort.cpp
│   │   │   ├── quick_sort.cpp
│   │   │   ├── radix_sort.cpp
│   │   │   └── selection_sort.cpp
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── array_deque.cpp
│   │   │   ├── array_queue.cpp
│   │   │   ├── array_stack.cpp
│   │   │   ├── deque.cpp
│   │   │   ├── linkedlist_deque.cpp
│   │   │   ├── linkedlist_queue.cpp
│   │   │   ├── linkedlist_stack.cpp
│   │   │   ├── queue.cpp
│   │   │   └── stack.cpp
│   │   ├── chapter_tree/
│   │   │   ├── CMakeLists.txt
│   │   │   ├── array_binary_tree.cpp
│   │   │   ├── avl_tree.cpp
│   │   │   ├── binary_search_tree.cpp
│   │   │   ├── binary_tree.cpp
│   │   │   ├── binary_tree_bfs.cpp
│   │   │   └── binary_tree_dfs.cpp
│   │   └── utils/
│   │       ├── CMakeLists.txt
│   │       ├── common.hpp
│   │       ├── list_node.hpp
│   │       ├── print_utils.hpp
│   │       ├── tree_node.hpp
│   │       └── vertex.hpp
│   ├── csharp/
│   │   ├── .editorconfig
│   │   ├── .gitignore
│   │   ├── GlobalUsing.cs
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.cs
│   │   │   ├── linked_list.cs
│   │   │   ├── list.cs
│   │   │   └── my_list.cs
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.cs
│   │   │   ├── permutations_i.cs
│   │   │   ├── permutations_ii.cs
│   │   │   ├── preorder_traversal_i_compact.cs
│   │   │   ├── preorder_traversal_ii_compact.cs
│   │   │   ├── preorder_traversal_iii_compact.cs
│   │   │   ├── preorder_traversal_iii_template.cs
│   │   │   ├── subset_sum_i.cs
│   │   │   ├── subset_sum_i_naive.cs
│   │   │   └── subset_sum_ii.cs
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.cs
│   │   │   ├── recursion.cs
│   │   │   ├── space_complexity.cs
│   │   │   ├── time_complexity.cs
│   │   │   └── worst_best_time_complexity.cs
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.cs
│   │   │   ├── build_tree.cs
│   │   │   └── hanota.cs
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.cs
│   │   │   ├── climbing_stairs_constraint_dp.cs
│   │   │   ├── climbing_stairs_dfs.cs
│   │   │   ├── climbing_stairs_dfs_mem.cs
│   │   │   ├── climbing_stairs_dp.cs
│   │   │   ├── coin_change.cs
│   │   │   ├── coin_change_ii.cs
│   │   │   ├── edit_distance.cs
│   │   │   ├── knapsack.cs
│   │   │   ├── min_cost_climbing_stairs_dp.cs
│   │   │   ├── min_path_sum.cs
│   │   │   └── unbounded_knapsack.cs
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.cs
│   │   │   ├── graph_adjacency_matrix.cs
│   │   │   ├── graph_bfs.cs
│   │   │   └── graph_dfs.cs
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.cs
│   │   │   ├── fractional_knapsack.cs
│   │   │   ├── max_capacity.cs
│   │   │   └── max_product_cutting.cs
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.cs
│   │   │   ├── built_in_hash.cs
│   │   │   ├── hash_map.cs
│   │   │   ├── hash_map_chaining.cs
│   │   │   ├── hash_map_open_addressing.cs
│   │   │   └── simple_hash.cs
│   │   ├── chapter_heap/
│   │   │   ├── heap.cs
│   │   │   ├── my_heap.cs
│   │   │   └── top_k.cs
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.cs
│   │   │   ├── binary_search_edge.cs
│   │   │   ├── binary_search_insertion.cs
│   │   │   ├── hashing_search.cs
│   │   │   ├── linear_search.cs
│   │   │   └── two_sum.cs
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.cs
│   │   │   ├── bucket_sort.cs
│   │   │   ├── counting_sort.cs
│   │   │   ├── heap_sort.cs
│   │   │   ├── insertion_sort.cs
│   │   │   ├── merge_sort.cs
│   │   │   ├── quick_sort.cs
│   │   │   ├── radix_sort.cs
│   │   │   └── selection_sort.cs
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_deque.cs
│   │   │   ├── array_queue.cs
│   │   │   ├── array_stack.cs
│   │   │   ├── deque.cs
│   │   │   ├── linkedlist_deque.cs
│   │   │   ├── linkedlist_queue.cs
│   │   │   ├── linkedlist_stack.cs
│   │   │   ├── queue.cs
│   │   │   └── stack.cs
│   │   ├── chapter_tree/
│   │   │   ├── array_binary_tree.cs
│   │   │   ├── avl_tree.cs
│   │   │   ├── binary_search_tree.cs
│   │   │   ├── binary_tree.cs
│   │   │   ├── binary_tree_bfs.cs
│   │   │   └── binary_tree_dfs.cs
│   │   ├── csharp.sln
│   │   ├── hello-algo.csproj
│   │   └── utils/
│   │       ├── ListNode.cs
│   │       ├── PrintUtil.cs
│   │       ├── TreeNode.cs
│   │       └── Vertex.cs
│   ├── dart/
│   │   ├── build.dart
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.dart
│   │   │   ├── linked_list.dart
│   │   │   ├── list.dart
│   │   │   └── my_list.dart
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.dart
│   │   │   ├── permutations_i.dart
│   │   │   ├── permutations_ii.dart
│   │   │   ├── preorder_traversal_i_compact.dart
│   │   │   ├── preorder_traversal_ii_compact.dart
│   │   │   ├── preorder_traversal_iii_compact.dart
│   │   │   ├── preorder_traversal_iii_template.dart
│   │   │   ├── subset_sum_i.dart
│   │   │   ├── subset_sum_i_naive.dart
│   │   │   └── subset_sum_ii.dart
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.dart
│   │   │   ├── recursion.dart
│   │   │   ├── space_complexity.dart
│   │   │   ├── time_complexity.dart
│   │   │   └── worst_best_time_complexity.dart
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.dart
│   │   │   ├── build_tree.dart
│   │   │   └── hanota.dart
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.dart
│   │   │   ├── climbing_stairs_constraint_dp.dart
│   │   │   ├── climbing_stairs_dfs.dart
│   │   │   ├── climbing_stairs_dfs_mem.dart
│   │   │   ├── climbing_stairs_dp.dart
│   │   │   ├── coin_change.dart
│   │   │   ├── coin_change_ii.dart
│   │   │   ├── edit_distance.dart
│   │   │   ├── knapsack.dart
│   │   │   ├── min_cost_climbing_stairs_dp.dart
│   │   │   ├── min_path_sum.dart
│   │   │   └── unbounded_knapsack.dart
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.dart
│   │   │   ├── graph_adjacency_matrix.dart
│   │   │   ├── graph_bfs.dart
│   │   │   └── graph_dfs.dart
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.dart
│   │   │   ├── fractional_knapsack.dart
│   │   │   ├── max_capacity.dart
│   │   │   └── max_product_cutting.dart
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.dart
│   │   │   ├── built_in_hash.dart
│   │   │   ├── hash_map.dart
│   │   │   ├── hash_map_chaining.dart
│   │   │   ├── hash_map_open_addressing.dart
│   │   │   └── simple_hash.dart
│   │   ├── chapter_heap/
│   │   │   ├── my_heap.dart
│   │   │   └── top_k.dart
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.dart
│   │   │   ├── binary_search_edge.dart
│   │   │   ├── binary_search_insertion.dart
│   │   │   ├── hashing_search.dart
│   │   │   ├── linear_search.dart
│   │   │   └── two_sum.dart
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.dart
│   │   │   ├── bucket_sort.dart
│   │   │   ├── counting_sort.dart
│   │   │   ├── heap_sort.dart
│   │   │   ├── insertion_sort.dart
│   │   │   ├── merge_sort.dart
│   │   │   ├── quick_sort.dart
│   │   │   ├── radix_sort.dart
│   │   │   └── selection_sort.dart
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_deque.dart
│   │   │   ├── array_queue.dart
│   │   │   ├── array_stack.dart
│   │   │   ├── deque.dart
│   │   │   ├── linkedlist_deque.dart
│   │   │   ├── linkedlist_queue.dart
│   │   │   ├── linkedlist_stack.dart
│   │   │   ├── queue.dart
│   │   │   └── stack.dart
│   │   ├── chapter_tree/
│   │   │   ├── array_binary_tree.dart
│   │   │   ├── avl_tree.dart
│   │   │   ├── binary_search_tree.dart
│   │   │   ├── binary_tree.dart
│   │   │   ├── binary_tree_bfs.dart
│   │   │   └── binary_tree_dfs.dart
│   │   └── utils/
│   │       ├── list_node.dart
│   │       ├── print_util.dart
│   │       ├── tree_node.dart
│   │       └── vertex.dart
│   ├── docker-compose.yml
│   ├── go/
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.go
│   │   │   ├── array_test.go
│   │   │   ├── linked_list.go
│   │   │   ├── linked_list_test.go
│   │   │   ├── list_test.go
│   │   │   ├── my_list.go
│   │   │   └── my_list_test.go
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.go
│   │   │   ├── n_queens_test.go
│   │   │   ├── permutation_test.go
│   │   │   ├── permutations_i.go
│   │   │   ├── permutations_ii.go
│   │   │   ├── preorder_traversal_i_compact.go
│   │   │   ├── preorder_traversal_ii_compact.go
│   │   │   ├── preorder_traversal_iii_compact.go
│   │   │   ├── preorder_traversal_iii_template.go
│   │   │   ├── preorder_traversal_test.go
│   │   │   ├── subset_sum_i.go
│   │   │   ├── subset_sum_i_naive.go
│   │   │   ├── subset_sum_ii.go
│   │   │   └── subset_sum_test.go
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.go
│   │   │   ├── iteration_test.go
│   │   │   ├── recursion.go
│   │   │   ├── recursion_test.go
│   │   │   ├── space_complexity.go
│   │   │   ├── space_complexity_test.go
│   │   │   ├── time_complexity.go
│   │   │   ├── time_complexity_test.go
│   │   │   ├── worst_best_time_complexity.go
│   │   │   └── worst_best_time_complexity_test.go
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.go
│   │   │   ├── binary_search_recur_test.go
│   │   │   ├── build_tree.go
│   │   │   ├── build_tree_test.go
│   │   │   ├── hanota.go
│   │   │   └── hanota_test.go
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.go
│   │   │   ├── climbing_stairs_constraint_dp.go
│   │   │   ├── climbing_stairs_dfs.go
│   │   │   ├── climbing_stairs_dfs_mem.go
│   │   │   ├── climbing_stairs_dp.go
│   │   │   ├── climbing_stairs_test.go
│   │   │   ├── coin_change.go
│   │   │   ├── coin_change_ii.go
│   │   │   ├── coin_change_test.go
│   │   │   ├── edit_distance.go
│   │   │   ├── edit_distance_test.go
│   │   │   ├── knapsack.go
│   │   │   ├── knapsack_test.go
│   │   │   ├── min_cost_climbing_stairs_dp.go
│   │   │   ├── min_path_sum.go
│   │   │   ├── min_path_sum_test.go
│   │   │   └── unbounded_knapsack.go
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.go
│   │   │   ├── graph_adjacency_list_test.go
│   │   │   ├── graph_adjacency_matrix.go
│   │   │   ├── graph_adjacency_matrix_test.go
│   │   │   ├── graph_bfs.go
│   │   │   ├── graph_bfs_test.go
│   │   │   ├── graph_dfs.go
│   │   │   └── graph_dfs_test.go
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.go
│   │   │   ├── coin_change_greedy_test.go
│   │   │   ├── fractional_knapsack.go
│   │   │   ├── fractional_knapsack_test.go
│   │   │   ├── max_capacity.go
│   │   │   ├── max_capacity_test.go
│   │   │   ├── max_product_cutting.go
│   │   │   └── max_product_cutting_test.go
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.go
│   │   │   ├── array_hash_map_test.go
│   │   │   ├── hash_collision_test.go
│   │   │   ├── hash_map_chaining.go
│   │   │   ├── hash_map_open_addressing.go
│   │   │   ├── hash_map_test.go
│   │   │   └── simple_hash.go
│   │   ├── chapter_heap/
│   │   │   ├── heap.go
│   │   │   ├── heap_test.go
│   │   │   ├── my_heap.go
│   │   │   └── top_k.go
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.go
│   │   │   ├── binary_search_edge.go
│   │   │   ├── binary_search_insertion.go
│   │   │   ├── binary_search_test.go
│   │   │   ├── hashing_search.go
│   │   │   ├── hashing_search_test.go
│   │   │   ├── linear_search.go
│   │   │   ├── linear_search_test.go
│   │   │   ├── two_sum.go
│   │   │   └── two_sum_test.go
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.go
│   │   │   ├── bubble_sort_test.go
│   │   │   ├── bucket_sort.go
│   │   │   ├── bucket_sort_test.go
│   │   │   ├── counting_sort.go
│   │   │   ├── counting_sort_test.go
│   │   │   ├── heap_sort.go
│   │   │   ├── heap_sort_test.go
│   │   │   ├── insertion_sort.go
│   │   │   ├── insertion_sort_test.go
│   │   │   ├── merge_sort.go
│   │   │   ├── merge_sort_test.go
│   │   │   ├── quick_sort.go
│   │   │   ├── quick_sort_test.go
│   │   │   ├── radix_sort.go
│   │   │   ├── radix_sort_test.go
│   │   │   ├── selection_sort.go
│   │   │   └── selection_sort_test.go
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_deque.go
│   │   │   ├── array_queue.go
│   │   │   ├── array_stack.go
│   │   │   ├── deque_test.go
│   │   │   ├── linkedlist_deque.go
│   │   │   ├── linkedlist_queue.go
│   │   │   ├── linkedlist_stack.go
│   │   │   ├── queue_test.go
│   │   │   └── stack_test.go
│   │   ├── chapter_tree/
│   │   │   ├── array_binary_tree.go
│   │   │   ├── array_binary_tree_test.go
│   │   │   ├── avl_tree.go
│   │   │   ├── avl_tree_test.go
│   │   │   ├── binary_search_tree.go
│   │   │   ├── binary_search_tree_test.go
│   │   │   ├── binary_tree_bfs.go
│   │   │   ├── binary_tree_bfs_test.go
│   │   │   ├── binary_tree_dfs.go
│   │   │   ├── binary_tree_dfs_test.go
│   │   │   └── binary_tree_test.go
│   │   ├── go.mod
│   │   └── pkg/
│   │       ├── list_node.go
│   │       ├── list_node_test.go
│   │       ├── print_utils.go
│   │       ├── tree_node.go
│   │       ├── tree_node_test.go
│   │       └── vertex.go
│   ├── java/
│   │   ├── .gitignore
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.java
│   │   │   ├── linked_list.java
│   │   │   ├── list.java
│   │   │   └── my_list.java
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.java
│   │   │   ├── permutations_i.java
│   │   │   ├── permutations_ii.java
│   │   │   ├── preorder_traversal_i_compact.java
│   │   │   ├── preorder_traversal_ii_compact.java
│   │   │   ├── preorder_traversal_iii_compact.java
│   │   │   ├── preorder_traversal_iii_template.java
│   │   │   ├── subset_sum_i.java
│   │   │   ├── subset_sum_i_naive.java
│   │   │   └── subset_sum_ii.java
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.java
│   │   │   ├── recursion.java
│   │   │   ├── space_complexity.java
│   │   │   ├── time_complexity.java
│   │   │   └── worst_best_time_complexity.java
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.java
│   │   │   ├── build_tree.java
│   │   │   └── hanota.java
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.java
│   │   │   ├── climbing_stairs_constraint_dp.java
│   │   │   ├── climbing_stairs_dfs.java
│   │   │   ├── climbing_stairs_dfs_mem.java
│   │   │   ├── climbing_stairs_dp.java
│   │   │   ├── coin_change.java
│   │   │   ├── coin_change_ii.java
│   │   │   ├── edit_distance.java
│   │   │   ├── knapsack.java
│   │   │   ├── min_cost_climbing_stairs_dp.java
│   │   │   ├── min_path_sum.java
│   │   │   └── unbounded_knapsack.java
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.java
│   │   │   ├── graph_adjacency_matrix.java
│   │   │   ├── graph_bfs.java
│   │   │   └── graph_dfs.java
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.java
│   │   │   ├── fractional_knapsack.java
│   │   │   ├── max_capacity.java
│   │   │   └── max_product_cutting.java
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.java
│   │   │   ├── built_in_hash.java
│   │   │   ├── hash_map.java
│   │   │   ├── hash_map_chaining.java
│   │   │   ├── hash_map_open_addressing.java
│   │   │   └── simple_hash.java
│   │   ├── chapter_heap/
│   │   │   ├── heap.java
│   │   │   ├── my_heap.java
│   │   │   └── top_k.java
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.java
│   │   │   ├── binary_search_edge.java
│   │   │   ├── binary_search_insertion.java
│   │   │   ├── hashing_search.java
│   │   │   ├── linear_search.java
│   │   │   └── two_sum.java
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.java
│   │   │   ├── bucket_sort.java
│   │   │   ├── counting_sort.java
│   │   │   ├── heap_sort.java
│   │   │   ├── insertion_sort.java
│   │   │   ├── merge_sort.java
│   │   │   ├── quick_sort.java
│   │   │   ├── radix_sort.java
│   │   │   └── selection_sort.java
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_deque.java
│   │   │   ├── array_queue.java
│   │   │   ├── array_stack.java
│   │   │   ├── deque.java
│   │   │   ├── linkedlist_deque.java
│   │   │   ├── linkedlist_queue.java
│   │   │   ├── linkedlist_stack.java
│   │   │   ├── queue.java
│   │   │   └── stack.java
│   │   ├── chapter_tree/
│   │   │   ├── array_binary_tree.java
│   │   │   ├── avl_tree.java
│   │   │   ├── binary_search_tree.java
│   │   │   ├── binary_tree.java
│   │   │   ├── binary_tree_bfs.java
│   │   │   └── binary_tree_dfs.java
│   │   └── utils/
│   │       ├── ListNode.java
│   │       ├── PrintUtil.java
│   │       ├── TreeNode.java
│   │       └── Vertex.java
│   ├── javascript/
│   │   ├── .prettierrc
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.js
│   │   │   ├── linked_list.js
│   │   │   ├── list.js
│   │   │   └── my_list.js
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.js
│   │   │   ├── permutations_i.js
│   │   │   ├── permutations_ii.js
│   │   │   ├── preorder_traversal_i_compact.js
│   │   │   ├── preorder_traversal_ii_compact.js
│   │   │   ├── preorder_traversal_iii_compact.js
│   │   │   ├── preorder_traversal_iii_template.js
│   │   │   ├── subset_sum_i.js
│   │   │   ├── subset_sum_i_naive.js
│   │   │   └── subset_sum_ii.js
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.js
│   │   │   ├── recursion.js
│   │   │   ├── space_complexity.js
│   │   │   ├── time_complexity.js
│   │   │   └── worst_best_time_complexity.js
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.js
│   │   │   ├── build_tree.js
│   │   │   └── hanota.js
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.js
│   │   │   ├── climbing_stairs_constraint_dp.js
│   │   │   ├── climbing_stairs_dfs.js
│   │   │   ├── climbing_stairs_dfs_mem.js
│   │   │   ├── climbing_stairs_dp.js
│   │   │   ├── coin_change.js
│   │   │   ├── coin_change_ii.js
│   │   │   ├── edit_distance.js
│   │   │   ├── knapsack.js
│   │   │   ├── min_cost_climbing_stairs_dp.js
│   │   │   ├── min_path_sum.js
│   │   │   └── unbounded_knapsack.js
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.js
│   │   │   ├── graph_adjacency_matrix.js
│   │   │   ├── graph_bfs.js
│   │   │   └── graph_dfs.js
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.js
│   │   │   ├── fractional_knapsack.js
│   │   │   ├── max_capacity.js
│   │   │   └── max_product_cutting.js
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.js
│   │   │   ├── hash_map.js
│   │   │   ├── hash_map_chaining.js
│   │   │   ├── hash_map_open_addressing.js
│   │   │   └── simple_hash.js
│   │   ├── chapter_heap/
│   │   │   ├── my_heap.js
│   │   │   └── top_k.js
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.js
│   │   │   ├── binary_search_edge.js
│   │   │   ├── binary_search_insertion.js
│   │   │   ├── hashing_search.js
│   │   │   ├── linear_search.js
│   │   │   └── two_sum.js
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.js
│   │   │   ├── bucket_sort.js
│   │   │   ├── counting_sort.js
│   │   │   ├── heap_sort.js
│   │   │   ├── insertion_sort.js
│   │   │   ├── merge_sort.js
│   │   │   ├── quick_sort.js
│   │   │   ├── radix_sort.js
│   │   │   └── selection_sort.js
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_deque.js
│   │   │   ├── array_queue.js
│   │   │   ├── array_stack.js
│   │   │   ├── deque.js
│   │   │   ├── linkedlist_deque.js
│   │   │   ├── linkedlist_queue.js
│   │   │   ├── linkedlist_stack.js
│   │   │   ├── queue.js
│   │   │   └── stack.js
│   │   ├── chapter_tree/
│   │   │   ├── array_binary_tree.js
│   │   │   ├── avl_tree.js
│   │   │   ├── binary_search_tree.js
│   │   │   ├── binary_tree.js
│   │   │   ├── binary_tree_bfs.js
│   │   │   └── binary_tree_dfs.js
│   │   ├── modules/
│   │   │   ├── ListNode.js
│   │   │   ├── PrintUtil.js
│   │   │   ├── TreeNode.js
│   │   │   └── Vertex.js
│   │   └── test_all.js
│   ├── kotlin/
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.kt
│   │   │   ├── linked_list.kt
│   │   │   ├── list.kt
│   │   │   └── my_list.kt
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.kt
│   │   │   ├── permutations_i.kt
│   │   │   ├── permutations_ii.kt
│   │   │   ├── preorder_traversal_i_compact.kt
│   │   │   ├── preorder_traversal_ii_compact.kt
│   │   │   ├── preorder_traversal_iii_compact.kt
│   │   │   ├── preorder_traversal_iii_template.kt
│   │   │   ├── subset_sum_i.kt
│   │   │   ├── subset_sum_i_naive.kt
│   │   │   └── subset_sum_ii.kt
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.kt
│   │   │   ├── recursion.kt
│   │   │   ├── space_complexity.kt
│   │   │   ├── time_complexity.kt
│   │   │   └── worst_best_time_complexity.kt
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.kt
│   │   │   ├── build_tree.kt
│   │   │   └── hanota.kt
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.kt
│   │   │   ├── climbing_stairs_constraint_dp.kt
│   │   │   ├── climbing_stairs_dfs.kt
│   │   │   ├── climbing_stairs_dfs_mem.kt
│   │   │   ├── climbing_stairs_dp.kt
│   │   │   ├── coin_change.kt
│   │   │   ├── coin_change_ii.kt
│   │   │   ├── edit_distance.kt
│   │   │   ├── knapsack.kt
│   │   │   ├── min_cost_climbing_stairs_dp.kt
│   │   │   ├── min_path_sum.kt
│   │   │   └── unbounded_knapsack.kt
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.kt
│   │   │   ├── graph_adjacency_matrix.kt
│   │   │   ├── graph_bfs.kt
│   │   │   └── graph_dfs.kt
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.kt
│   │   │   ├── fractional_knapsack.kt
│   │   │   ├── max_capacity.kt
│   │   │   └── max_product_cutting.kt
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.kt
│   │   │   ├── built_in_hash.kt
│   │   │   ├── hash_map.kt
│   │   │   ├── hash_map_chaining.kt
│   │   │   ├── hash_map_open_addressing.kt
│   │   │   └── simple_hash.kt
│   │   ├── chapter_heap/
│   │   │   ├── heap.kt
│   │   │   ├── my_heap.kt
│   │   │   └── top_k.kt
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.kt
│   │   │   ├── binary_search_edge.kt
│   │   │   ├── binary_search_insertion.kt
│   │   │   ├── hashing_search.kt
│   │   │   ├── linear_search.kt
│   │   │   └── two_sum.kt
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.kt
│   │   │   ├── bucket_sort.kt
│   │   │   ├── counting_sort.kt
│   │   │   ├── heap_sort.kt
│   │   │   ├── insertion_sort.kt
│   │   │   ├── merge_sort.kt
│   │   │   ├── quick_sort.kt
│   │   │   ├── radix_sort.kt
│   │   │   └── selection_sort.kt
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_deque.kt
│   │   │   ├── array_queue.kt
│   │   │   ├── array_stack.kt
│   │   │   ├── deque.kt
│   │   │   ├── linkedlist_deque.kt
│   │   │   ├── linkedlist_queue.kt
│   │   │   ├── linkedlist_stack.kt
│   │   │   ├── queue.kt
│   │   │   └── stack.kt
│   │   ├── chapter_tree/
│   │   │   ├── array_binary_tree.kt
│   │   │   ├── avl_tree.kt
│   │   │   ├── binary_search_tree.kt
│   │   │   ├── binary_tree.kt
│   │   │   ├── binary_tree_bfs.kt
│   │   │   └── binary_tree_dfs.kt
│   │   └── utils/
│   │       ├── ListNode.kt
│   │       ├── PrintUtil.kt
│   │       ├── TreeNode.kt
│   │       └── Vertex.kt
│   ├── python/
│   │   ├── .gitignore
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.py
│   │   │   ├── linked_list.py
│   │   │   ├── list.py
│   │   │   └── my_list.py
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.py
│   │   │   ├── permutations_i.py
│   │   │   ├── permutations_ii.py
│   │   │   ├── preorder_traversal_i_compact.py
│   │   │   ├── preorder_traversal_ii_compact.py
│   │   │   ├── preorder_traversal_iii_compact.py
│   │   │   ├── preorder_traversal_iii_template.py
│   │   │   ├── subset_sum_i.py
│   │   │   ├── subset_sum_i_naive.py
│   │   │   └── subset_sum_ii.py
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.py
│   │   │   ├── recursion.py
│   │   │   ├── space_complexity.py
│   │   │   ├── time_complexity.py
│   │   │   └── worst_best_time_complexity.py
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.py
│   │   │   ├── build_tree.py
│   │   │   └── hanota.py
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.py
│   │   │   ├── climbing_stairs_constraint_dp.py
│   │   │   ├── climbing_stairs_dfs.py
│   │   │   ├── climbing_stairs_dfs_mem.py
│   │   │   ├── climbing_stairs_dp.py
│   │   │   ├── coin_change.py
│   │   │   ├── coin_change_ii.py
│   │   │   ├── edit_distance.py
│   │   │   ├── knapsack.py
│   │   │   ├── min_cost_climbing_stairs_dp.py
│   │   │   ├── min_path_sum.py
│   │   │   └── unbounded_knapsack.py
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.py
│   │   │   ├── graph_adjacency_matrix.py
│   │   │   ├── graph_bfs.py
│   │   │   └── graph_dfs.py
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.py
│   │   │   ├── fractional_knapsack.py
│   │   │   ├── max_capacity.py
│   │   │   └── max_product_cutting.py
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.py
│   │   │   ├── built_in_hash.py
│   │   │   ├── hash_map.py
│   │   │   ├── hash_map_chaining.py
│   │   │   ├── hash_map_open_addressing.py
│   │   │   └── simple_hash.py
│   │   ├── chapter_heap/
│   │   │   ├── heap.py
│   │   │   ├── my_heap.py
│   │   │   └── top_k.py
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.py
│   │   │   ├── binary_search_edge.py
│   │   │   ├── binary_search_insertion.py
│   │   │   ├── hashing_search.py
│   │   │   ├── linear_search.py
│   │   │   └── two_sum.py
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.py
│   │   │   ├── bucket_sort.py
│   │   │   ├── counting_sort.py
│   │   │   ├── heap_sort.py
│   │   │   ├── insertion_sort.py
│   │   │   ├── merge_sort.py
│   │   │   ├── quick_sort.py
│   │   │   ├── radix_sort.py
│   │   │   └── selection_sort.py
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_deque.py
│   │   │   ├── array_queue.py
│   │   │   ├── array_stack.py
│   │   │   ├── deque.py
│   │   │   ├── linkedlist_deque.py
│   │   │   ├── linkedlist_queue.py
│   │   │   ├── linkedlist_stack.py
│   │   │   ├── queue.py
│   │   │   └── stack.py
│   │   ├── chapter_tree/
│   │   │   ├── array_binary_tree.py
│   │   │   ├── avl_tree.py
│   │   │   ├── binary_search_tree.py
│   │   │   ├── binary_tree.py
│   │   │   ├── binary_tree_bfs.py
│   │   │   └── binary_tree_dfs.py
│   │   ├── modules/
│   │   │   ├── __init__.py
│   │   │   ├── list_node.py
│   │   │   ├── print_util.py
│   │   │   ├── tree_node.py
│   │   │   └── vertex.py
│   │   └── test_all.py
│   ├── pythontutor/
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.md
│   │   │   ├── linked_list.md
│   │   │   └── my_list.md
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.md
│   │   │   ├── permutations_i.md
│   │   │   ├── permutations_ii.md
│   │   │   ├── preorder_traversal_i_compact.md
│   │   │   ├── preorder_traversal_ii_compact.md
│   │   │   ├── preorder_traversal_iii_compact.md
│   │   │   ├── preorder_traversal_iii_template.md
│   │   │   ├── subset_sum_i.md
│   │   │   ├── subset_sum_i_naive.md
│   │   │   └── subset_sum_ii.md
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.md
│   │   │   ├── recursion.md
│   │   │   ├── space_complexity.md
│   │   │   ├── time_complexity.md
│   │   │   └── worst_best_time_complexity.md
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.md
│   │   │   ├── build_tree.md
│   │   │   └── hanota.md
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.md
│   │   │   ├── climbing_stairs_constraint_dp.md
│   │   │   ├── climbing_stairs_dfs.md
│   │   │   ├── climbing_stairs_dfs_mem.md
│   │   │   ├── climbing_stairs_dp.md
│   │   │   ├── coin_change.md
│   │   │   ├── coin_change_ii.md
│   │   │   ├── edit_distance.md
│   │   │   ├── knapsack.md
│   │   │   ├── min_cost_climbing_stairs_dp.md
│   │   │   ├── min_path_sum.md
│   │   │   └── unbounded_knapsack.md
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.md
│   │   │   ├── graph_adjacency_matrix.md
│   │   │   ├── graph_bfs.md
│   │   │   └── graph_dfs.md
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.md
│   │   │   ├── fractional_knapsack.md
│   │   │   ├── max_capacity.md
│   │   │   └── max_product_cutting.md
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.md
│   │   │   ├── hash_map_chaining.md
│   │   │   └── simple_hash.md
│   │   ├── chapter_heap/
│   │   │   ├── my_heap.md
│   │   │   └── top_k.md
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.md
│   │   │   ├── binary_search_edge.md
│   │   │   ├── binary_search_insertion.md
│   │   │   └── two_sum.md
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.md
│   │   │   ├── bucket_sort.md
│   │   │   ├── counting_sort.md
│   │   │   ├── heap_sort.md
│   │   │   ├── insertion_sort.md
│   │   │   ├── merge_sort.md
│   │   │   ├── quick_sort.md
│   │   │   ├── radix_sort.md
│   │   │   └── selection_sort.md
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_queue.md
│   │   │   ├── array_stack.md
│   │   │   ├── linkedlist_queue.md
│   │   │   └── linkedlist_stack.md
│   │   └── chapter_tree/
│   │       ├── array_binary_tree.md
│   │       ├── binary_search_tree.md
│   │       ├── binary_tree_bfs.md
│   │       └── binary_tree_dfs.md
│   ├── ruby/
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.rb
│   │   │   ├── linked_list.rb
│   │   │   ├── list.rb
│   │   │   └── my_list.rb
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.rb
│   │   │   ├── permutations_i.rb
│   │   │   ├── permutations_ii.rb
│   │   │   ├── preorder_traversal_i_compact.rb
│   │   │   ├── preorder_traversal_ii_compact.rb
│   │   │   ├── preorder_traversal_iii_compact.rb
│   │   │   ├── preorder_traversal_iii_template.rb
│   │   │   ├── subset_sum_i.rb
│   │   │   ├── subset_sum_i_naive.rb
│   │   │   └── subset_sum_ii.rb
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.rb
│   │   │   ├── recursion.rb
│   │   │   ├── space_complexity.rb
│   │   │   ├── time_complexity.rb
│   │   │   └── worst_best_time_complexity.rb
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.rb
│   │   │   ├── build_tree.rb
│   │   │   └── hanota.rb
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.rb
│   │   │   ├── climbing_stairs_constraint_dp.rb
│   │   │   ├── climbing_stairs_dfs.rb
│   │   │   ├── climbing_stairs_dfs_mem.rb
│   │   │   ├── climbing_stairs_dp.rb
│   │   │   ├── coin_change.rb
│   │   │   ├── coin_change_ii.rb
│   │   │   ├── edit_distance.rb
│   │   │   ├── knapsack.rb
│   │   │   ├── min_cost_climbing_stairs_dp.rb
│   │   │   ├── min_path_sum.rb
│   │   │   └── unbounded_knapsack.rb
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.rb
│   │   │   ├── graph_adjacency_matrix.rb
│   │   │   ├── graph_bfs.rb
│   │   │   └── graph_dfs.rb
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.rb
│   │   │   ├── fractional_knapsack.rb
│   │   │   ├── max_capacity.rb
│   │   │   └── max_product_cutting.rb
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.rb
│   │   │   ├── built_in_hash.rb
│   │   │   ├── hash_map.rb
│   │   │   ├── hash_map_chaining.rb
│   │   │   ├── hash_map_open_addressing.rb
│   │   │   └── simple_hash.rb
│   │   ├── chapter_heap/
│   │   │   ├── my_heap.rb
│   │   │   └── top_k.rb
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.rb
│   │   │   ├── binary_search_edge.rb
│   │   │   ├── binary_search_insertion.rb
│   │   │   ├── hashing_search.rb
│   │   │   ├── linear_search.rb
│   │   │   └── two_sum.rb
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.rb
│   │   │   ├── bucket_sort.rb
│   │   │   ├── counting_sort.rb
│   │   │   ├── heap_sort.rb
│   │   │   ├── insertion_sort.rb
│   │   │   ├── merge_sort.rb
│   │   │   ├── quick_sort.rb
│   │   │   ├── radix_sort.rb
│   │   │   └── selection_sort.rb
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_deque.rb
│   │   │   ├── array_queue.rb
│   │   │   ├── array_stack.rb
│   │   │   ├── deque.rb
│   │   │   ├── linkedlist_deque.rb
│   │   │   ├── linkedlist_queue.rb
│   │   │   ├── linkedlist_stack.rb
│   │   │   ├── queue.rb
│   │   │   └── stack.rb
│   │   ├── chapter_tree/
│   │   │   ├── array_binary_tree.rb
│   │   │   ├── avl_tree.rb
│   │   │   ├── binary_search_tree.rb
│   │   │   ├── binary_tree.rb
│   │   │   ├── binary_tree_bfs.rb
│   │   │   └── binary_tree_dfs.rb
│   │   ├── test_all.rb
│   │   └── utils/
│   │       ├── list_node.rb
│   │       ├── print_util.rb
│   │       ├── tree_node.rb
│   │       └── vertex.rb
│   ├── rust/
│   │   ├── .gitignore
│   │   ├── Cargo.toml
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.rs
│   │   │   ├── linked_list.rs
│   │   │   ├── list.rs
│   │   │   └── my_list.rs
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.rs
│   │   │   ├── permutations_i.rs
│   │   │   ├── permutations_ii.rs
│   │   │   ├── preorder_traversal_i_compact.rs
│   │   │   ├── preorder_traversal_ii_compact.rs
│   │   │   ├── preorder_traversal_iii_compact.rs
│   │   │   ├── preorder_traversal_iii_template.rs
│   │   │   ├── subset_sum_i.rs
│   │   │   ├── subset_sum_i_naive.rs
│   │   │   └── subset_sum_ii.rs
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.rs
│   │   │   ├── recursion.rs
│   │   │   ├── space_complexity.rs
│   │   │   ├── time_complexity.rs
│   │   │   └── worst_best_time_complexity.rs
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.rs
│   │   │   ├── build_tree.rs
│   │   │   └── hanota.rs
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.rs
│   │   │   ├── climbing_stairs_constraint_dp.rs
│   │   │   ├── climbing_stairs_dfs.rs
│   │   │   ├── climbing_stairs_dfs_mem.rs
│   │   │   ├── climbing_stairs_dp.rs
│   │   │   ├── coin_change.rs
│   │   │   ├── coin_change_ii.rs
│   │   │   ├── edit_distance.rs
│   │   │   ├── knapsack.rs
│   │   │   ├── min_cost_climbing_stairs_dp.rs
│   │   │   ├── min_path_sum.rs
│   │   │   └── unbounded_knapsack.rs
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.rs
│   │   │   ├── graph_adjacency_matrix.rs
│   │   │   ├── graph_bfs.rs
│   │   │   └── graph_dfs.rs
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.rs
│   │   │   ├── fractional_knapsack.rs
│   │   │   ├── max_capacity.rs
│   │   │   └── max_product_cutting.rs
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.rs
│   │   │   ├── build_in_hash.rs
│   │   │   ├── hash_map.rs
│   │   │   ├── hash_map_chaining.rs
│   │   │   ├── hash_map_open_addressing.rs
│   │   │   └── simple_hash.rs
│   │   ├── chapter_heap/
│   │   │   ├── heap.rs
│   │   │   ├── my_heap.rs
│   │   │   └── top_k.rs
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.rs
│   │   │   ├── binary_search_edge.rs
│   │   │   ├── binary_search_insertion.rs
│   │   │   ├── hashing_search.rs
│   │   │   ├── linear_search.rs
│   │   │   └── two_sum.rs
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.rs
│   │   │   ├── bucket_sort.rs
│   │   │   ├── counting_sort.rs
│   │   │   ├── heap_sort.rs
│   │   │   ├── insertion_sort.rs
│   │   │   ├── merge_sort.rs
│   │   │   ├── quick_sort.rs
│   │   │   ├── radix_sort.rs
│   │   │   └── selection_sort.rs
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_deque.rs
│   │   │   ├── array_queue.rs
│   │   │   ├── array_stack.rs
│   │   │   ├── deque.rs
│   │   │   ├── linkedlist_deque.rs
│   │   │   ├── linkedlist_queue.rs
│   │   │   ├── linkedlist_stack.rs
│   │   │   ├── queue.rs
│   │   │   └── stack.rs
│   │   ├── chapter_tree/
│   │   │   ├── array_binary_tree.rs
│   │   │   ├── avl_tree.rs
│   │   │   ├── binary_search_tree.rs
│   │   │   ├── binary_tree.rs
│   │   │   ├── binary_tree_bfs.rs
│   │   │   └── binary_tree_dfs.rs
│   │   └── src/
│   │       ├── include/
│   │       │   ├── list_node.rs
│   │       │   ├── mod.rs
│   │       │   ├── print_util.rs
│   │       │   ├── tree_node.rs
│   │       │   └── vertex.rs
│   │       └── lib.rs
│   ├── swift/
│   │   ├── .gitignore
│   │   ├── Package.resolved
│   │   ├── Package.swift
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.swift
│   │   │   ├── linked_list.swift
│   │   │   ├── list.swift
│   │   │   └── my_list.swift
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.swift
│   │   │   ├── permutations_i.swift
│   │   │   ├── permutations_ii.swift
│   │   │   ├── preorder_traversal_i_compact.swift
│   │   │   ├── preorder_traversal_ii_compact.swift
│   │   │   ├── preorder_traversal_iii_compact.swift
│   │   │   ├── preorder_traversal_iii_template.swift
│   │   │   ├── subset_sum_i.swift
│   │   │   ├── subset_sum_i_naive.swift
│   │   │   └── subset_sum_ii.swift
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.swift
│   │   │   ├── recursion.swift
│   │   │   ├── space_complexity.swift
│   │   │   ├── time_complexity.swift
│   │   │   └── worst_best_time_complexity.swift
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.swift
│   │   │   ├── build_tree.swift
│   │   │   └── hanota.swift
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.swift
│   │   │   ├── climbing_stairs_constraint_dp.swift
│   │   │   ├── climbing_stairs_dfs.swift
│   │   │   ├── climbing_stairs_dfs_mem.swift
│   │   │   ├── climbing_stairs_dp.swift
│   │   │   ├── coin_change.swift
│   │   │   ├── coin_change_ii.swift
│   │   │   ├── edit_distance.swift
│   │   │   ├── knapsack.swift
│   │   │   ├── min_cost_climbing_stairs_dp.swift
│   │   │   ├── min_path_sum.swift
│   │   │   └── unbounded_knapsack.swift
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.swift
│   │   │   ├── graph_adjacency_matrix.swift
│   │   │   ├── graph_bfs.swift
│   │   │   └── graph_dfs.swift
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.swift
│   │   │   ├── fractional_knapsack.swift
│   │   │   ├── max_capacity.swift
│   │   │   └── max_product_cutting.swift
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.swift
│   │   │   ├── built_in_hash.swift
│   │   │   ├── hash_map.swift
│   │   │   ├── hash_map_chaining.swift
│   │   │   ├── hash_map_open_addressing.swift
│   │   │   └── simple_hash.swift
│   │   ├── chapter_heap/
│   │   │   ├── heap.swift
│   │   │   ├── my_heap.swift
│   │   │   └── top_k.swift
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.swift
│   │   │   ├── binary_search_edge.swift
│   │   │   ├── binary_search_insertion.swift
│   │   │   ├── hashing_search.swift
│   │   │   ├── linear_search.swift
│   │   │   └── two_sum.swift
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.swift
│   │   │   ├── bucket_sort.swift
│   │   │   ├── counting_sort.swift
│   │   │   ├── heap_sort.swift
│   │   │   ├── insertion_sort.swift
│   │   │   ├── merge_sort.swift
│   │   │   ├── quick_sort.swift
│   │   │   ├── radix_sort.swift
│   │   │   └── selection_sort.swift
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_deque.swift
│   │   │   ├── array_queue.swift
│   │   │   ├── array_stack.swift
│   │   │   ├── deque.swift
│   │   │   ├── linkedlist_deque.swift
│   │   │   ├── linkedlist_queue.swift
│   │   │   ├── linkedlist_stack.swift
│   │   │   ├── queue.swift
│   │   │   └── stack.swift
│   │   ├── chapter_tree/
│   │   │   ├── array_binary_tree.swift
│   │   │   ├── avl_tree.swift
│   │   │   ├── binary_search_tree.swift
│   │   │   ├── binary_tree.swift
│   │   │   ├── binary_tree_bfs.swift
│   │   │   └── binary_tree_dfs.swift
│   │   └── utils/
│   │       ├── ListNode.swift
│   │       ├── Pair.swift
│   │       ├── PrintUtil.swift
│   │       ├── TreeNode.swift
│   │       └── Vertex.swift
│   ├── typescript/
│   │   ├── .gitignore
│   │   ├── .prettierrc
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.ts
│   │   │   ├── linked_list.ts
│   │   │   ├── list.ts
│   │   │   └── my_list.ts
│   │   ├── chapter_backtracking/
│   │   │   ├── n_queens.ts
│   │   │   ├── permutations_i.ts
│   │   │   ├── permutations_ii.ts
│   │   │   ├── preorder_traversal_i_compact.ts
│   │   │   ├── preorder_traversal_ii_compact.ts
│   │   │   ├── preorder_traversal_iii_compact.ts
│   │   │   ├── preorder_traversal_iii_template.ts
│   │   │   ├── subset_sum_i.ts
│   │   │   ├── subset_sum_i_naive.ts
│   │   │   └── subset_sum_ii.ts
│   │   ├── chapter_computational_complexity/
│   │   │   ├── iteration.ts
│   │   │   ├── recursion.ts
│   │   │   ├── space_complexity.ts
│   │   │   ├── time_complexity.ts
│   │   │   └── worst_best_time_complexity.ts
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.ts
│   │   │   ├── build_tree.ts
│   │   │   └── hanota.ts
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── climbing_stairs_backtrack.ts
│   │   │   ├── climbing_stairs_constraint_dp.ts
│   │   │   ├── climbing_stairs_dfs.ts
│   │   │   ├── climbing_stairs_dfs_mem.ts
│   │   │   ├── climbing_stairs_dp.ts
│   │   │   ├── coin_change.ts
│   │   │   ├── coin_change_ii.ts
│   │   │   ├── edit_distance.ts
│   │   │   ├── knapsack.ts
│   │   │   ├── min_cost_climbing_stairs_dp.ts
│   │   │   ├── min_path_sum.ts
│   │   │   └── unbounded_knapsack.ts
│   │   ├── chapter_graph/
│   │   │   ├── graph_adjacency_list.ts
│   │   │   ├── graph_adjacency_matrix.ts
│   │   │   ├── graph_bfs.ts
│   │   │   └── graph_dfs.ts
│   │   ├── chapter_greedy/
│   │   │   ├── coin_change_greedy.ts
│   │   │   ├── fractional_knapsack.ts
│   │   │   ├── max_capacity.ts
│   │   │   └── max_product_cutting.ts
│   │   ├── chapter_hashing/
│   │   │   ├── array_hash_map.ts
│   │   │   ├── hash_map.ts
│   │   │   ├── hash_map_chaining.ts
│   │   │   ├── hash_map_open_addressing.ts
│   │   │   └── simple_hash.ts
│   │   ├── chapter_heap/
│   │   │   ├── my_heap.ts
│   │   │   └── top_k.ts
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.ts
│   │   │   ├── binary_search_edge.ts
│   │   │   ├── binary_search_insertion.ts
│   │   │   ├── hashing_search.ts
│   │   │   ├── linear_search.ts
│   │   │   └── two_sum.ts
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.ts
│   │   │   ├── bucket_sort.ts
│   │   │   ├── counting_sort.ts
│   │   │   ├── heap_sort.ts
│   │   │   ├── insertion_sort.ts
│   │   │   ├── merge_sort.ts
│   │   │   ├── quick_sort.ts
│   │   │   ├── radix_sort.ts
│   │   │   └── selection_sort.ts
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── array_deque.ts
│   │   │   ├── array_queue.ts
│   │   │   ├── array_stack.ts
│   │   │   ├── deque.ts
│   │   │   ├── linkedlist_deque.ts
│   │   │   ├── linkedlist_queue.ts
│   │   │   ├── linkedlist_stack.ts
│   │   │   ├── queue.ts
│   │   │   └── stack.ts
│   │   ├── chapter_tree/
│   │   │   ├── array_binary_tree.ts
│   │   │   ├── avl_tree.ts
│   │   │   ├── binary_search_tree.ts
│   │   │   ├── binary_tree.ts
│   │   │   ├── binary_tree_bfs.ts
│   │   │   └── binary_tree_dfs.ts
│   │   ├── modules/
│   │   │   ├── ListNode.ts
│   │   │   ├── PrintUtil.ts
│   │   │   ├── TreeNode.ts
│   │   │   └── Vertex.ts
│   │   ├── package.json
│   │   └── tsconfig.json
│   └── zig/
│       ├── .gitignore
│       ├── build.zig
│       ├── chapter_array_and_linkedlist/
│       │   ├── array.zig
│       │   ├── linked_list.zig
│       │   ├── list.zig
│       │   └── my_list.zig
│       ├── chapter_computational_complexity/
│       │   ├── iteration.zig
│       │   ├── recursion.zig
│       │   ├── space_complexity.zig
│       │   ├── time_complexity.zig
│       │   └── worst_best_time_complexity.zig
│       ├── chapter_dynamic_programming/
│       │   ├── climbing_stairs_backtrack.zig
│       │   ├── climbing_stairs_constraint_dp.zig
│       │   ├── climbing_stairs_dfs.zig
│       │   ├── climbing_stairs_dfs_mem.zig
│       │   ├── climbing_stairs_dp.zig
│       │   ├── coin_change.zig
│       │   ├── coin_change_ii.zig
│       │   ├── edit_distance.zig
│       │   ├── knapsack.zig
│       │   ├── min_cost_climbing_stairs_dp.zig
│       │   ├── min_path_sum.zig
│       │   └── unbounded_knapsack.zig
│       ├── chapter_hashing/
│       │   ├── array_hash_map.zig
│       │   └── hash_map.zig
│       ├── chapter_heap/
│       │   ├── heap.zig
│       │   └── my_heap.zig
│       ├── chapter_searching/
│       │   ├── binary_search.zig
│       │   ├── hashing_search.zig
│       │   ├── linear_search.zig
│       │   └── two_sum.zig
│       ├── chapter_sorting/
│       │   ├── bubble_sort.zig
│       │   ├── insertion_sort.zig
│       │   ├── merge_sort.zig
│       │   ├── quick_sort.zig
│       │   └── radix_sort.zig
│       ├── chapter_stack_and_queue/
│       │   ├── array_queue.zig
│       │   ├── array_stack.zig
│       │   ├── deque.zig
│       │   ├── linkedlist_deque.zig
│       │   ├── linkedlist_queue.zig
│       │   ├── linkedlist_stack.zig
│       │   ├── queue.zig
│       │   └── stack.zig
│       ├── chapter_tree/
│       │   ├── avl_tree.zig
│       │   ├── binary_search_tree.zig
│       │   ├── binary_tree.zig
│       │   ├── binary_tree_bfs.zig
│       │   └── binary_tree_dfs.zig
│       ├── include/
│       │   ├── PrintUtil.zig
│       │   └── include.zig
│       ├── main.zig
│       └── utils/
│           ├── ListNode.zig
│           ├── TreeNode.zig
│           ├── format.zig
│           └── utils.zig
├── docker-compose.yml
├── docs/
│   ├── chapter_appendix/
│   │   ├── contribution.md
│   │   ├── index.md
│   │   ├── installation.md
│   │   └── terminology.md
│   ├── chapter_array_and_linkedlist/
│   │   ├── array.md
│   │   ├── index.md
│   │   ├── linked_list.md
│   │   ├── list.md
│   │   ├── ram_and_cache.md
│   │   └── summary.md
│   ├── chapter_backtracking/
│   │   ├── backtracking_algorithm.md
│   │   ├── index.md
│   │   ├── n_queens_problem.md
│   │   ├── permutations_problem.md
│   │   ├── subset_sum_problem.md
│   │   └── summary.md
│   ├── chapter_computational_complexity/
│   │   ├── index.md
│   │   ├── iteration_and_recursion.md
│   │   ├── performance_evaluation.md
│   │   ├── space_complexity.md
│   │   ├── summary.md
│   │   └── time_complexity.md
│   ├── chapter_data_structure/
│   │   ├── basic_data_types.md
│   │   ├── character_encoding.md
│   │   ├── classification_of_data_structure.md
│   │   ├── index.md
│   │   ├── number_encoding.md
│   │   └── summary.md
│   ├── chapter_divide_and_conquer/
│   │   ├── binary_search_recur.md
│   │   ├── build_binary_tree_problem.md
│   │   ├── divide_and_conquer.md
│   │   ├── hanota_problem.md
│   │   ├── index.md
│   │   └── summary.md
│   ├── chapter_dynamic_programming/
│   │   ├── dp_problem_features.md
│   │   ├── dp_solution_pipeline.md
│   │   ├── edit_distance_problem.md
│   │   ├── index.md
│   │   ├── intro_to_dynamic_programming.md
│   │   ├── knapsack_problem.md
│   │   ├── summary.md
│   │   └── unbounded_knapsack_problem.md
│   ├── chapter_graph/
│   │   ├── graph.md
│   │   ├── graph_operations.md
│   │   ├── graph_traversal.md
│   │   ├── index.md
│   │   └── summary.md
│   ├── chapter_greedy/
│   │   ├── fractional_knapsack_problem.md
│   │   ├── greedy_algorithm.md
│   │   ├── index.md
│   │   ├── max_capacity_problem.md
│   │   ├── max_product_cutting_problem.md
│   │   └── summary.md
│   ├── chapter_hashing/
│   │   ├── hash_algorithm.md
│   │   ├── hash_collision.md
│   │   ├── hash_map.md
│   │   ├── index.md
│   │   └── summary.md
│   ├── chapter_heap/
│   │   ├── build_heap.md
│   │   ├── heap.md
│   │   ├── index.md
│   │   ├── summary.md
│   │   └── top_k.md
│   ├── chapter_hello_algo/
│   │   └── index.md
│   ├── chapter_introduction/
│   │   ├── algorithms_are_everywhere.md
│   │   ├── index.md
│   │   ├── summary.md
│   │   └── what_is_dsa.md
│   ├── chapter_paperbook/
│   │   └── index.md
│   ├── chapter_preface/
│   │   ├── about_the_book.md
│   │   ├── index.md
│   │   ├── suggestions.md
│   │   └── summary.md
│   ├── chapter_reference/
│   │   └── index.md
│   ├── chapter_searching/
│   │   ├── binary_search.md
│   │   ├── binary_search_edge.md
│   │   ├── binary_search_insertion.md
│   │   ├── index.md
│   │   ├── replace_linear_by_hashing.md
│   │   ├── searching_algorithm_revisited.md
│   │   └── summary.md
│   ├── chapter_sorting/
│   │   ├── bubble_sort.md
│   │   ├── bucket_sort.md
│   │   ├── counting_sort.md
│   │   ├── heap_sort.md
│   │   ├── index.md
│   │   ├── insertion_sort.md
│   │   ├── merge_sort.md
│   │   ├── quick_sort.md
│   │   ├── radix_sort.md
│   │   ├── selection_sort.md
│   │   ├── sorting_algorithm.md
│   │   └── summary.md
│   ├── chapter_stack_and_queue/
│   │   ├── deque.md
│   │   ├── index.md
│   │   ├── queue.md
│   │   ├── stack.md
│   │   └── summary.md
│   ├── chapter_tree/
│   │   ├── array_representation_of_tree.md
│   │   ├── avl_tree.md
│   │   ├── binary_search_tree.md
│   │   ├── binary_tree.md
│   │   ├── binary_tree_traversal.md
│   │   ├── index.md
│   │   └── summary.md
│   ├── index.html
│   └── index.md
├── en/
│   ├── CONTRIBUTING.md
│   ├── README.md
│   ├── codes/
│   │   ├── c/
│   │   │   ├── .gitignore
│   │   │   ├── CMakeLists.txt
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array.c
│   │   │   │   ├── linked_list.c
│   │   │   │   └── my_list.c
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── n_queens.c
│   │   │   │   ├── permutations_i.c
│   │   │   │   ├── permutations_ii.c
│   │   │   │   ├── preorder_traversal_i_compact.c
│   │   │   │   ├── preorder_traversal_ii_compact.c
│   │   │   │   ├── preorder_traversal_iii_compact.c
│   │   │   │   ├── preorder_traversal_iii_template.c
│   │   │   │   ├── subset_sum_i.c
│   │   │   │   ├── subset_sum_i_naive.c
│   │   │   │   └── subset_sum_ii.c
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── iteration.c
│   │   │   │   ├── recursion.c
│   │   │   │   ├── space_complexity.c
│   │   │   │   ├── time_complexity.c
│   │   │   │   └── worst_best_time_complexity.c
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search_recur.c
│   │   │   │   ├── build_tree.c
│   │   │   │   └── hanota.c
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── climbing_stairs_backtrack.c
│   │   │   │   ├── climbing_stairs_constraint_dp.c
│   │   │   │   ├── climbing_stairs_dfs.c
│   │   │   │   ├── climbing_stairs_dfs_mem.c
│   │   │   │   ├── climbing_stairs_dp.c
│   │   │   │   ├── coin_change.c
│   │   │   │   ├── coin_change_ii.c
│   │   │   │   ├── edit_distance.c
│   │   │   │   ├── knapsack.c
│   │   │   │   ├── min_cost_climbing_stairs_dp.c
│   │   │   │   ├── min_path_sum.c
│   │   │   │   └── unbounded_knapsack.c
│   │   │   ├── chapter_graph/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── graph_adjacency_list.c
│   │   │   │   ├── graph_adjacency_list_test.c
│   │   │   │   ├── graph_adjacency_matrix.c
│   │   │   │   ├── graph_bfs.c
│   │   │   │   └── graph_dfs.c
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── coin_change_greedy.c
│   │   │   │   ├── fractional_knapsack.c
│   │   │   │   ├── max_capacity.c
│   │   │   │   └── max_product_cutting.c
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_hash_map.c
│   │   │   │   ├── hash_map_chaining.c
│   │   │   │   ├── hash_map_open_addressing.c
│   │   │   │   └── simple_hash.c
│   │   │   ├── chapter_heap/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── my_heap.c
│   │   │   │   ├── my_heap_test.c
│   │   │   │   └── top_k.c
│   │   │   ├── chapter_searching/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search.c
│   │   │   │   ├── binary_search_edge.c
│   │   │   │   ├── binary_search_insertion.c
│   │   │   │   └── two_sum.c
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── bubble_sort.c
│   │   │   │   ├── bucket_sort.c
│   │   │   │   ├── counting_sort.c
│   │   │   │   ├── heap_sort.c
│   │   │   │   ├── insertion_sort.c
│   │   │   │   ├── merge_sort.c
│   │   │   │   ├── quick_sort.c
│   │   │   │   ├── radix_sort.c
│   │   │   │   └── selection_sort.c
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_deque.c
│   │   │   │   ├── array_queue.c
│   │   │   │   ├── array_stack.c
│   │   │   │   ├── linkedlist_deque.c
│   │   │   │   ├── linkedlist_queue.c
│   │   │   │   └── linkedlist_stack.c
│   │   │   ├── chapter_tree/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_binary_tree.c
│   │   │   │   ├── avl_tree.c
│   │   │   │   ├── binary_search_tree.c
│   │   │   │   ├── binary_tree.c
│   │   │   │   ├── binary_tree_bfs.c
│   │   │   │   └── binary_tree_dfs.c
│   │   │   └── utils/
│   │   │       ├── CMakeLists.txt
│   │   │       ├── common.h
│   │   │       ├── common_test.c
│   │   │       ├── list_node.h
│   │   │       ├── print_util.h
│   │   │       ├── tree_node.h
│   │   │       ├── uthash.h
│   │   │       ├── vector.h
│   │   │       └── vertex.h
│   │   ├── cpp/
│   │   │   ├── .gitignore
│   │   │   ├── CMakeLists.txt
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array.cpp
│   │   │   │   ├── linked_list.cpp
│   │   │   │   ├── list.cpp
│   │   │   │   └── my_list.cpp
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── n_queens.cpp
│   │   │   │   ├── permutations_i.cpp
│   │   │   │   ├── permutations_ii.cpp
│   │   │   │   ├── preorder_traversal_i_compact.cpp
│   │   │   │   ├── preorder_traversal_ii_compact.cpp
│   │   │   │   ├── preorder_traversal_iii_compact.cpp
│   │   │   │   ├── preorder_traversal_iii_template.cpp
│   │   │   │   ├── subset_sum_i.cpp
│   │   │   │   ├── subset_sum_i_naive.cpp
│   │   │   │   └── subset_sum_ii.cpp
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── iteration.cpp
│   │   │   │   ├── recursion.cpp
│   │   │   │   ├── space_complexity.cpp
│   │   │   │   ├── time_complexity.cpp
│   │   │   │   └── worst_best_time_complexity.cpp
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search_recur.cpp
│   │   │   │   ├── build_tree.cpp
│   │   │   │   └── hanota.cpp
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── climbing_stairs_backtrack.cpp
│   │   │   │   ├── climbing_stairs_constraint_dp.cpp
│   │   │   │   ├── climbing_stairs_dfs.cpp
│   │   │   │   ├── climbing_stairs_dfs_mem.cpp
│   │   │   │   ├── climbing_stairs_dp.cpp
│   │   │   │   ├── coin_change.cpp
│   │   │   │   ├── coin_change_ii.cpp
│   │   │   │   ├── edit_distance.cpp
│   │   │   │   ├── knapsack.cpp
│   │   │   │   ├── min_cost_climbing_stairs_dp.cpp
│   │   │   │   ├── min_path_sum.cpp
│   │   │   │   └── unbounded_knapsack.cpp
│   │   │   ├── chapter_graph/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── graph_adjacency_list.cpp
│   │   │   │   ├── graph_adjacency_list_test.cpp
│   │   │   │   ├── graph_adjacency_matrix.cpp
│   │   │   │   ├── graph_bfs.cpp
│   │   │   │   └── graph_dfs.cpp
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── coin_change_greedy.cpp
│   │   │   │   ├── fractional_knapsack.cpp
│   │   │   │   ├── max_capacity.cpp
│   │   │   │   └── max_product_cutting.cpp
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_hash_map.cpp
│   │   │   │   ├── array_hash_map_test.cpp
│   │   │   │   ├── built_in_hash.cpp
│   │   │   │   ├── hash_map.cpp
│   │   │   │   ├── hash_map_chaining.cpp
│   │   │   │   ├── hash_map_open_addressing.cpp
│   │   │   │   └── simple_hash.cpp
│   │   │   ├── chapter_heap/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── heap.cpp
│   │   │   │   ├── my_heap.cpp
│   │   │   │   └── top_k.cpp
│   │   │   ├── chapter_searching/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search.cpp
│   │   │   │   ├── binary_search_edge.cpp
│   │   │   │   ├── binary_search_insertion.cpp
│   │   │   │   ├── hashing_search.cpp
│   │   │   │   ├── linear_search.cpp
│   │   │   │   └── two_sum.cpp
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── bubble_sort.cpp
│   │   │   │   ├── bucket_sort.cpp
│   │   │   │   ├── counting_sort.cpp
│   │   │   │   ├── heap_sort.cpp
│   │   │   │   ├── insertion_sort.cpp
│   │   │   │   ├── merge_sort.cpp
│   │   │   │   ├── quick_sort.cpp
│   │   │   │   ├── radix_sort.cpp
│   │   │   │   └── selection_sort.cpp
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_deque.cpp
│   │   │   │   ├── array_queue.cpp
│   │   │   │   ├── array_stack.cpp
│   │   │   │   ├── deque.cpp
│   │   │   │   ├── linkedlist_deque.cpp
│   │   │   │   ├── linkedlist_queue.cpp
│   │   │   │   ├── linkedlist_stack.cpp
│   │   │   │   ├── queue.cpp
│   │   │   │   └── stack.cpp
│   │   │   ├── chapter_tree/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_binary_tree.cpp
│   │   │   │   ├── avl_tree.cpp
│   │   │   │   ├── binary_search_tree.cpp
│   │   │   │   ├── binary_tree.cpp
│   │   │   │   ├── binary_tree_bfs.cpp
│   │   │   │   └── binary_tree_dfs.cpp
│   │   │   └── utils/
│   │   │       ├── CMakeLists.txt
│   │   │       ├── common.hpp
│   │   │       ├── list_node.hpp
│   │   │       ├── print_utils.hpp
│   │   │       ├── tree_node.hpp
│   │   │       └── vertex.hpp
│   │   ├── csharp/
│   │   │   ├── .editorconfig
│   │   │   ├── .gitignore
│   │   │   ├── GlobalUsing.cs
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.cs
│   │   │   │   ├── linked_list.cs
│   │   │   │   ├── list.cs
│   │   │   │   └── my_list.cs
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.cs
│   │   │   │   ├── permutations_i.cs
│   │   │   │   ├── permutations_ii.cs
│   │   │   │   ├── preorder_traversal_i_compact.cs
│   │   │   │   ├── preorder_traversal_ii_compact.cs
│   │   │   │   ├── preorder_traversal_iii_compact.cs
│   │   │   │   ├── preorder_traversal_iii_template.cs
│   │   │   │   ├── subset_sum_i.cs
│   │   │   │   ├── subset_sum_i_naive.cs
│   │   │   │   └── subset_sum_ii.cs
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.cs
│   │   │   │   ├── recursion.cs
│   │   │   │   ├── space_complexity.cs
│   │   │   │   ├── time_complexity.cs
│   │   │   │   └── worst_best_time_complexity.cs
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.cs
│   │   │   │   ├── build_tree.cs
│   │   │   │   └── hanota.cs
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.cs
│   │   │   │   ├── climbing_stairs_constraint_dp.cs
│   │   │   │   ├── climbing_stairs_dfs.cs
│   │   │   │   ├── climbing_stairs_dfs_mem.cs
│   │   │   │   ├── climbing_stairs_dp.cs
│   │   │   │   ├── coin_change.cs
│   │   │   │   ├── coin_change_ii.cs
│   │   │   │   ├── edit_distance.cs
│   │   │   │   ├── knapsack.cs
│   │   │   │   ├── min_cost_climbing_stairs_dp.cs
│   │   │   │   ├── min_path_sum.cs
│   │   │   │   └── unbounded_knapsack.cs
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.cs
│   │   │   │   ├── graph_adjacency_matrix.cs
│   │   │   │   ├── graph_bfs.cs
│   │   │   │   └── graph_dfs.cs
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.cs
│   │   │   │   ├── fractional_knapsack.cs
│   │   │   │   ├── max_capacity.cs
│   │   │   │   └── max_product_cutting.cs
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.cs
│   │   │   │   ├── built_in_hash.cs
│   │   │   │   ├── hash_map.cs
│   │   │   │   ├── hash_map_chaining.cs
│   │   │   │   ├── hash_map_open_addressing.cs
│   │   │   │   └── simple_hash.cs
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.cs
│   │   │   │   ├── my_heap.cs
│   │   │   │   └── top_k.cs
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.cs
│   │   │   │   ├── binary_search_edge.cs
│   │   │   │   ├── binary_search_insertion.cs
│   │   │   │   ├── hashing_search.cs
│   │   │   │   ├── linear_search.cs
│   │   │   │   └── two_sum.cs
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.cs
│   │   │   │   ├── bucket_sort.cs
│   │   │   │   ├── counting_sort.cs
│   │   │   │   ├── heap_sort.cs
│   │   │   │   ├── insertion_sort.cs
│   │   │   │   ├── merge_sort.cs
│   │   │   │   ├── quick_sort.cs
│   │   │   │   ├── radix_sort.cs
│   │   │   │   └── selection_sort.cs
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.cs
│   │   │   │   ├── array_queue.cs
│   │   │   │   ├── array_stack.cs
│   │   │   │   ├── deque.cs
│   │   │   │   ├── linkedlist_deque.cs
│   │   │   │   ├── linkedlist_queue.cs
│   │   │   │   ├── linkedlist_stack.cs
│   │   │   │   ├── queue.cs
│   │   │   │   └── stack.cs
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.cs
│   │   │   │   ├── avl_tree.cs
│   │   │   │   ├── binary_search_tree.cs
│   │   │   │   ├── binary_tree.cs
│   │   │   │   ├── binary_tree_bfs.cs
│   │   │   │   └── binary_tree_dfs.cs
│   │   │   ├── csharp.sln
│   │   │   ├── hello-algo.csproj
│   │   │   └── utils/
│   │   │       ├── ListNode.cs
│   │   │       ├── PrintUtil.cs
│   │   │       ├── TreeNode.cs
│   │   │       └── Vertex.cs
│   │   ├── dart/
│   │   │   ├── build.dart
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.dart
│   │   │   │   ├── linked_list.dart
│   │   │   │   ├── list.dart
│   │   │   │   └── my_list.dart
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.dart
│   │   │   │   ├── permutations_i.dart
│   │   │   │   ├── permutations_ii.dart
│   │   │   │   ├── preorder_traversal_i_compact.dart
│   │   │   │   ├── preorder_traversal_ii_compact.dart
│   │   │   │   ├── preorder_traversal_iii_compact.dart
│   │   │   │   ├── preorder_traversal_iii_template.dart
│   │   │   │   ├── subset_sum_i.dart
│   │   │   │   ├── subset_sum_i_naive.dart
│   │   │   │   └── subset_sum_ii.dart
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.dart
│   │   │   │   ├── recursion.dart
│   │   │   │   ├── space_complexity.dart
│   │   │   │   ├── time_complexity.dart
│   │   │   │   └── worst_best_time_complexity.dart
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.dart
│   │   │   │   ├── build_tree.dart
│   │   │   │   └── hanota.dart
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.dart
│   │   │   │   ├── climbing_stairs_constraint_dp.dart
│   │   │   │   ├── climbing_stairs_dfs.dart
│   │   │   │   ├── climbing_stairs_dfs_mem.dart
│   │   │   │   ├── climbing_stairs_dp.dart
│   │   │   │   ├── coin_change.dart
│   │   │   │   ├── coin_change_ii.dart
│   │   │   │   ├── edit_distance.dart
│   │   │   │   ├── knapsack.dart
│   │   │   │   ├── min_cost_climbing_stairs_dp.dart
│   │   │   │   ├── min_path_sum.dart
│   │   │   │   └── unbounded_knapsack.dart
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.dart
│   │   │   │   ├── graph_adjacency_matrix.dart
│   │   │   │   ├── graph_bfs.dart
│   │   │   │   └── graph_dfs.dart
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.dart
│   │   │   │   ├── fractional_knapsack.dart
│   │   │   │   ├── max_capacity.dart
│   │   │   │   └── max_product_cutting.dart
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.dart
│   │   │   │   ├── built_in_hash.dart
│   │   │   │   ├── hash_map.dart
│   │   │   │   ├── hash_map_chaining.dart
│   │   │   │   ├── hash_map_open_addressing.dart
│   │   │   │   └── simple_hash.dart
│   │   │   ├── chapter_heap/
│   │   │   │   ├── my_heap.dart
│   │   │   │   └── top_k.dart
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.dart
│   │   │   │   ├── binary_search_edge.dart
│   │   │   │   ├── binary_search_insertion.dart
│   │   │   │   ├── hashing_search.dart
│   │   │   │   ├── linear_search.dart
│   │   │   │   └── two_sum.dart
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.dart
│   │   │   │   ├── bucket_sort.dart
│   │   │   │   ├── counting_sort.dart
│   │   │   │   ├── heap_sort.dart
│   │   │   │   ├── insertion_sort.dart
│   │   │   │   ├── merge_sort.dart
│   │   │   │   ├── quick_sort.dart
│   │   │   │   ├── radix_sort.dart
│   │   │   │   └── selection_sort.dart
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.dart
│   │   │   │   ├── array_queue.dart
│   │   │   │   ├── array_stack.dart
│   │   │   │   ├── deque.dart
│   │   │   │   ├── linkedlist_deque.dart
│   │   │   │   ├── linkedlist_queue.dart
│   │   │   │   ├── linkedlist_stack.dart
│   │   │   │   ├── queue.dart
│   │   │   │   └── stack.dart
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.dart
│   │   │   │   ├── avl_tree.dart
│   │   │   │   ├── binary_search_tree.dart
│   │   │   │   ├── binary_tree.dart
│   │   │   │   ├── binary_tree_bfs.dart
│   │   │   │   └── binary_tree_dfs.dart
│   │   │   └── utils/
│   │   │       ├── list_node.dart
│   │   │       ├── print_util.dart
│   │   │       ├── tree_node.dart
│   │   │       └── vertex.dart
│   │   ├── go/
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.go
│   │   │   │   ├── array_test.go
│   │   │   │   ├── linked_list.go
│   │   │   │   ├── linked_list_test.go
│   │   │   │   ├── list_test.go
│   │   │   │   ├── my_list.go
│   │   │   │   └── my_list_test.go
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.go
│   │   │   │   ├── n_queens_test.go
│   │   │   │   ├── permutation_test.go
│   │   │   │   ├── permutations_i.go
│   │   │   │   ├── permutations_ii.go
│   │   │   │   ├── preorder_traversal_i_compact.go
│   │   │   │   ├── preorder_traversal_ii_compact.go
│   │   │   │   ├── preorder_traversal_iii_compact.go
│   │   │   │   ├── preorder_traversal_iii_template.go
│   │   │   │   ├── preorder_traversal_test.go
│   │   │   │   ├── subset_sum_i.go
│   │   │   │   ├── subset_sum_i_naive.go
│   │   │   │   ├── subset_sum_ii.go
│   │   │   │   └── subset_sum_test.go
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.go
│   │   │   │   ├── iteration_test.go
│   │   │   │   ├── recursion.go
│   │   │   │   ├── recursion_test.go
│   │   │   │   ├── space_complexity.go
│   │   │   │   ├── space_complexity_test.go
│   │   │   │   ├── time_complexity.go
│   │   │   │   ├── time_complexity_test.go
│   │   │   │   ├── worst_best_time_complexity.go
│   │   │   │   └── worst_best_time_complexity_test.go
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.go
│   │   │   │   ├── binary_search_recur_test.go
│   │   │   │   ├── build_tree.go
│   │   │   │   ├── build_tree_test.go
│   │   │   │   ├── hanota.go
│   │   │   │   └── hanota_test.go
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.go
│   │   │   │   ├── climbing_stairs_constraint_dp.go
│   │   │   │   ├── climbing_stairs_dfs.go
│   │   │   │   ├── climbing_stairs_dfs_mem.go
│   │   │   │   ├── climbing_stairs_dp.go
│   │   │   │   ├── climbing_stairs_test.go
│   │   │   │   ├── coin_change.go
│   │   │   │   ├── coin_change_ii.go
│   │   │   │   ├── coin_change_test.go
│   │   │   │   ├── edit_distance.go
│   │   │   │   ├── edit_distance_test.go
│   │   │   │   ├── knapsack.go
│   │   │   │   ├── knapsack_test.go
│   │   │   │   ├── min_cost_climbing_stairs_dp.go
│   │   │   │   ├── min_path_sum.go
│   │   │   │   ├── min_path_sum_test.go
│   │   │   │   └── unbounded_knapsack.go
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.go
│   │   │   │   ├── graph_adjacency_list_test.go
│   │   │   │   ├── graph_adjacency_matrix.go
│   │   │   │   ├── graph_adjacency_matrix_test.go
│   │   │   │   ├── graph_bfs.go
│   │   │   │   ├── graph_bfs_test.go
│   │   │   │   ├── graph_dfs.go
│   │   │   │   └── graph_dfs_test.go
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.go
│   │   │   │   ├── coin_change_greedy_test.go
│   │   │   │   ├── fractional_knapsack.go
│   │   │   │   ├── fractional_knapsack_test.go
│   │   │   │   ├── max_capacity.go
│   │   │   │   ├── max_capacity_test.go
│   │   │   │   ├── max_product_cutting.go
│   │   │   │   └── max_product_cutting_test.go
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.go
│   │   │   │   ├── array_hash_map_test.go
│   │   │   │   ├── hash_collision_test.go
│   │   │   │   ├── hash_map_chaining.go
│   │   │   │   ├── hash_map_open_addressing.go
│   │   │   │   ├── hash_map_test.go
│   │   │   │   └── simple_hash.go
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.go
│   │   │   │   ├── heap_test.go
│   │   │   │   ├── my_heap.go
│   │   │   │   └── top_k.go
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.go
│   │   │   │   ├── binary_search_edge.go
│   │   │   │   ├── binary_search_insertion.go
│   │   │   │   ├── binary_search_test.go
│   │   │   │   ├── hashing_search.go
│   │   │   │   ├── hashing_search_test.go
│   │   │   │   ├── linear_search.go
│   │   │   │   ├── linear_search_test.go
│   │   │   │   ├── two_sum.go
│   │   │   │   └── two_sum_test.go
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.go
│   │   │   │   ├── bubble_sort_test.go
│   │   │   │   ├── bucket_sort.go
│   │   │   │   ├── bucket_sort_test.go
│   │   │   │   ├── counting_sort.go
│   │   │   │   ├── counting_sort_test.go
│   │   │   │   ├── heap_sort.go
│   │   │   │   ├── heap_sort_test.go
│   │   │   │   ├── insertion_sort.go
│   │   │   │   ├── insertion_sort_test.go
│   │   │   │   ├── merge_sort.go
│   │   │   │   ├── merge_sort_test.go
│   │   │   │   ├── quick_sort.go
│   │   │   │   ├── quick_sort_test.go
│   │   │   │   ├── radix_sort.go
│   │   │   │   ├── radix_sort_test.go
│   │   │   │   ├── selection_sort.go
│   │   │   │   └── selection_sort_test.go
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.go
│   │   │   │   ├── array_queue.go
│   │   │   │   ├── array_stack.go
│   │   │   │   ├── deque_test.go
│   │   │   │   ├── linkedlist_deque.go
│   │   │   │   ├── linkedlist_queue.go
│   │   │   │   ├── linkedlist_stack.go
│   │   │   │   ├── queue_test.go
│   │   │   │   └── stack_test.go
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.go
│   │   │   │   ├── array_binary_tree_test.go
│   │   │   │   ├── avl_tree.go
│   │   │   │   ├── avl_tree_test.go
│   │   │   │   ├── binary_search_tree.go
│   │   │   │   ├── binary_search_tree_test.go
│   │   │   │   ├── binary_tree_bfs.go
│   │   │   │   ├── binary_tree_bfs_test.go
│   │   │   │   ├── binary_tree_dfs.go
│   │   │   │   ├── binary_tree_dfs_test.go
│   │   │   │   └── binary_tree_test.go
│   │   │   ├── go.mod
│   │   │   └── pkg/
│   │   │       ├── list_node.go
│   │   │       ├── list_node_test.go
│   │   │       ├── print_utils.go
│   │   │       ├── tree_node.go
│   │   │       ├── tree_node_test.go
│   │   │       └── vertex.go
│   │   ├── java/
│   │   │   ├── .gitignore
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.java
│   │   │   │   ├── linked_list.java
│   │   │   │   ├── list.java
│   │   │   │   └── my_list.java
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.java
│   │   │   │   ├── permutations_i.java
│   │   │   │   ├── permutations_ii.java
│   │   │   │   ├── preorder_traversal_i_compact.java
│   │   │   │   ├── preorder_traversal_ii_compact.java
│   │   │   │   ├── preorder_traversal_iii_compact.java
│   │   │   │   ├── preorder_traversal_iii_template.java
│   │   │   │   ├── subset_sum_i.java
│   │   │   │   ├── subset_sum_i_naive.java
│   │   │   │   └── subset_sum_ii.java
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.java
│   │   │   │   ├── recursion.java
│   │   │   │   ├── space_complexity.java
│   │   │   │   ├── time_complexity.java
│   │   │   │   └── worst_best_time_complexity.java
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.java
│   │   │   │   ├── build_tree.java
│   │   │   │   └── hanota.java
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.java
│   │   │   │   ├── climbing_stairs_constraint_dp.java
│   │   │   │   ├── climbing_stairs_dfs.java
│   │   │   │   ├── climbing_stairs_dfs_mem.java
│   │   │   │   ├── climbing_stairs_dp.java
│   │   │   │   ├── coin_change.java
│   │   │   │   ├── coin_change_ii.java
│   │   │   │   ├── edit_distance.java
│   │   │   │   ├── knapsack.java
│   │   │   │   ├── min_cost_climbing_stairs_dp.java
│   │   │   │   ├── min_path_sum.java
│   │   │   │   └── unbounded_knapsack.java
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.java
│   │   │   │   ├── graph_adjacency_matrix.java
│   │   │   │   ├── graph_bfs.java
│   │   │   │   └── graph_dfs.java
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.java
│   │   │   │   ├── fractional_knapsack.java
│   │   │   │   ├── max_capacity.java
│   │   │   │   └── max_product_cutting.java
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.java
│   │   │   │   ├── built_in_hash.java
│   │   │   │   ├── hash_map.java
│   │   │   │   ├── hash_map_chaining.java
│   │   │   │   ├── hash_map_open_addressing.java
│   │   │   │   └── simple_hash.java
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.java
│   │   │   │   ├── my_heap.java
│   │   │   │   └── top_k.java
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.java
│   │   │   │   ├── binary_search_edge.java
│   │   │   │   ├── binary_search_insertion.java
│   │   │   │   ├── hashing_search.java
│   │   │   │   ├── linear_search.java
│   │   │   │   └── two_sum.java
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.java
│   │   │   │   ├── bucket_sort.java
│   │   │   │   ├── counting_sort.java
│   │   │   │   ├── heap_sort.java
│   │   │   │   ├── insertion_sort.java
│   │   │   │   ├── merge_sort.java
│   │   │   │   ├── quick_sort.java
│   │   │   │   ├── radix_sort.java
│   │   │   │   └── selection_sort.java
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.java
│   │   │   │   ├── array_queue.java
│   │   │   │   ├── array_stack.java
│   │   │   │   ├── deque.java
│   │   │   │   ├── linkedlist_deque.java
│   │   │   │   ├── linkedlist_queue.java
│   │   │   │   ├── linkedlist_stack.java
│   │   │   │   ├── queue.java
│   │   │   │   └── stack.java
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.java
│   │   │   │   ├── avl_tree.java
│   │   │   │   ├── binary_search_tree.java
│   │   │   │   ├── binary_tree.java
│   │   │   │   ├── binary_tree_bfs.java
│   │   │   │   └── binary_tree_dfs.java
│   │   │   └── utils/
│   │   │       ├── ListNode.java
│   │   │       ├── PrintUtil.java
│   │   │       ├── TreeNode.java
│   │   │       └── Vertex.java
│   │   ├── javascript/
│   │   │   ├── .prettierrc
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.js
│   │   │   │   ├── linked_list.js
│   │   │   │   ├── list.js
│   │   │   │   └── my_list.js
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.js
│   │   │   │   ├── permutations_i.js
│   │   │   │   ├── permutations_ii.js
│   │   │   │   ├── preorder_traversal_i_compact.js
│   │   │   │   ├── preorder_traversal_ii_compact.js
│   │   │   │   ├── preorder_traversal_iii_compact.js
│   │   │   │   ├── preorder_traversal_iii_template.js
│   │   │   │   ├── subset_sum_i.js
│   │   │   │   ├── subset_sum_i_naive.js
│   │   │   │   └── subset_sum_ii.js
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.js
│   │   │   │   ├── recursion.js
│   │   │   │   ├── space_complexity.js
│   │   │   │   ├── time_complexity.js
│   │   │   │   └── worst_best_time_complexity.js
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.js
│   │   │   │   ├── build_tree.js
│   │   │   │   └── hanota.js
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.js
│   │   │   │   ├── climbing_stairs_constraint_dp.js
│   │   │   │   ├── climbing_stairs_dfs.js
│   │   │   │   ├── climbing_stairs_dfs_mem.js
│   │   │   │   ├── climbing_stairs_dp.js
│   │   │   │   ├── coin_change.js
│   │   │   │   ├── coin_change_ii.js
│   │   │   │   ├── edit_distance.js
│   │   │   │   ├── knapsack.js
│   │   │   │   ├── min_cost_climbing_stairs_dp.js
│   │   │   │   ├── min_path_sum.js
│   │   │   │   └── unbounded_knapsack.js
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.js
│   │   │   │   ├── graph_adjacency_matrix.js
│   │   │   │   ├── graph_bfs.js
│   │   │   │   └── graph_dfs.js
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.js
│   │   │   │   ├── fractional_knapsack.js
│   │   │   │   ├── max_capacity.js
│   │   │   │   └── max_product_cutting.js
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.js
│   │   │   │   ├── hash_map.js
│   │   │   │   ├── hash_map_chaining.js
│   │   │   │   ├── hash_map_open_addressing.js
│   │   │   │   └── simple_hash.js
│   │   │   ├── chapter_heap/
│   │   │   │   ├── my_heap.js
│   │   │   │   └── top_k.js
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.js
│   │   │   │   ├── binary_search_edge.js
│   │   │   │   ├── binary_search_insertion.js
│   │   │   │   ├── hashing_search.js
│   │   │   │   ├── linear_search.js
│   │   │   │   └── two_sum.js
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.js
│   │   │   │   ├── bucket_sort.js
│   │   │   │   ├── counting_sort.js
│   │   │   │   ├── heap_sort.js
│   │   │   │   ├── insertion_sort.js
│   │   │   │   ├── merge_sort.js
│   │   │   │   ├── quick_sort.js
│   │   │   │   ├── radix_sort.js
│   │   │   │   └── selection_sort.js
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.js
│   │   │   │   ├── array_queue.js
│   │   │   │   ├── array_stack.js
│   │   │   │   ├── deque.js
│   │   │   │   ├── linkedlist_deque.js
│   │   │   │   ├── linkedlist_queue.js
│   │   │   │   ├── linkedlist_stack.js
│   │   │   │   ├── queue.js
│   │   │   │   └── stack.js
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.js
│   │   │   │   ├── avl_tree.js
│   │   │   │   ├── binary_search_tree.js
│   │   │   │   ├── binary_tree.js
│   │   │   │   ├── binary_tree_bfs.js
│   │   │   │   └── binary_tree_dfs.js
│   │   │   ├── modules/
│   │   │   │   ├── ListNode.js
│   │   │   │   ├── PrintUtil.js
│   │   │   │   ├── TreeNode.js
│   │   │   │   └── Vertex.js
│   │   │   └── test_all.js
│   │   ├── kotlin/
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.kt
│   │   │   │   ├── linked_list.kt
│   │   │   │   ├── list.kt
│   │   │   │   └── my_list.kt
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.kt
│   │   │   │   ├── permutations_i.kt
│   │   │   │   ├── permutations_ii.kt
│   │   │   │   ├── preorder_traversal_i_compact.kt
│   │   │   │   ├── preorder_traversal_ii_compact.kt
│   │   │   │   ├── preorder_traversal_iii_compact.kt
│   │   │   │   ├── preorder_traversal_iii_template.kt
│   │   │   │   ├── subset_sum_i.kt
│   │   │   │   ├── subset_sum_i_naive.kt
│   │   │   │   └── subset_sum_ii.kt
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.kt
│   │   │   │   ├── recursion.kt
│   │   │   │   ├── space_complexity.kt
│   │   │   │   ├── time_complexity.kt
│   │   │   │   └── worst_best_time_complexity.kt
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.kt
│   │   │   │   ├── build_tree.kt
│   │   │   │   └── hanota.kt
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.kt
│   │   │   │   ├── climbing_stairs_constraint_dp.kt
│   │   │   │   ├── climbing_stairs_dfs.kt
│   │   │   │   ├── climbing_stairs_dfs_mem.kt
│   │   │   │   ├── climbing_stairs_dp.kt
│   │   │   │   ├── coin_change.kt
│   │   │   │   ├── coin_change_ii.kt
│   │   │   │   ├── edit_distance.kt
│   │   │   │   ├── knapsack.kt
│   │   │   │   ├── min_cost_climbing_stairs_dp.kt
│   │   │   │   ├── min_path_sum.kt
│   │   │   │   └── unbounded_knapsack.kt
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.kt
│   │   │   │   ├── graph_adjacency_matrix.kt
│   │   │   │   ├── graph_bfs.kt
│   │   │   │   └── graph_dfs.kt
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.kt
│   │   │   │   ├── fractional_knapsack.kt
│   │   │   │   ├── max_capacity.kt
│   │   │   │   └── max_product_cutting.kt
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.kt
│   │   │   │   ├── built_in_hash.kt
│   │   │   │   ├── hash_map.kt
│   │   │   │   ├── hash_map_chaining.kt
│   │   │   │   ├── hash_map_open_addressing.kt
│   │   │   │   └── simple_hash.kt
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.kt
│   │   │   │   ├── my_heap.kt
│   │   │   │   └── top_k.kt
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.kt
│   │   │   │   ├── binary_search_edge.kt
│   │   │   │   ├── binary_search_insertion.kt
│   │   │   │   ├── hashing_search.kt
│   │   │   │   ├── linear_search.kt
│   │   │   │   └── two_sum.kt
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.kt
│   │   │   │   ├── bucket_sort.kt
│   │   │   │   ├── counting_sort.kt
│   │   │   │   ├── heap_sort.kt
│   │   │   │   ├── insertion_sort.kt
│   │   │   │   ├── merge_sort.kt
│   │   │   │   ├── quick_sort.kt
│   │   │   │   ├── radix_sort.kt
│   │   │   │   └── selection_sort.kt
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.kt
│   │   │   │   ├── array_queue.kt
│   │   │   │   ├── array_stack.kt
│   │   │   │   ├── deque.kt
│   │   │   │   ├── linkedlist_deque.kt
│   │   │   │   ├── linkedlist_queue.kt
│   │   │   │   ├── linkedlist_stack.kt
│   │   │   │   ├── queue.kt
│   │   │   │   └── stack.kt
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.kt
│   │   │   │   ├── avl_tree.kt
│   │   │   │   ├── binary_search_tree.kt
│   │   │   │   ├── binary_tree.kt
│   │   │   │   ├── binary_tree_bfs.kt
│   │   │   │   └── binary_tree_dfs.kt
│   │   │   └── utils/
│   │   │       ├── ListNode.kt
│   │   │       ├── PrintUtil.kt
│   │   │       ├── TreeNode.kt
│   │   │       └── Vertex.kt
│   │   ├── python/
│   │   │   ├── .gitignore
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.py
│   │   │   │   ├── linked_list.py
│   │   │   │   ├── list.py
│   │   │   │   └── my_list.py
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.py
│   │   │   │   ├── permutations_i.py
│   │   │   │   ├── permutations_ii.py
│   │   │   │   ├── preorder_traversal_i_compact.py
│   │   │   │   ├── preorder_traversal_ii_compact.py
│   │   │   │   ├── preorder_traversal_iii_compact.py
│   │   │   │   ├── preorder_traversal_iii_template.py
│   │   │   │   ├── subset_sum_i.py
│   │   │   │   ├── subset_sum_i_naive.py
│   │   │   │   └── subset_sum_ii.py
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.py
│   │   │   │   ├── recursion.py
│   │   │   │   ├── space_complexity.py
│   │   │   │   ├── time_complexity.py
│   │   │   │   └── worst_best_time_complexity.py
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.py
│   │   │   │   ├── build_tree.py
│   │   │   │   └── hanota.py
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.py
│   │   │   │   ├── climbing_stairs_constraint_dp.py
│   │   │   │   ├── climbing_stairs_dfs.py
│   │   │   │   ├── climbing_stairs_dfs_mem.py
│   │   │   │   ├── climbing_stairs_dp.py
│   │   │   │   ├── coin_change.py
│   │   │   │   ├── coin_change_ii.py
│   │   │   │   ├── edit_distance.py
│   │   │   │   ├── knapsack.py
│   │   │   │   ├── min_cost_climbing_stairs_dp.py
│   │   │   │   ├── min_path_sum.py
│   │   │   │   └── unbounded_knapsack.py
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.py
│   │   │   │   ├── graph_adjacency_matrix.py
│   │   │   │   ├── graph_bfs.py
│   │   │   │   └── graph_dfs.py
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.py
│   │   │   │   ├── fractional_knapsack.py
│   │   │   │   ├── max_capacity.py
│   │   │   │   └── max_product_cutting.py
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.py
│   │   │   │   ├── built_in_hash.py
│   │   │   │   ├── hash_map.py
│   │   │   │   ├── hash_map_chaining.py
│   │   │   │   ├── hash_map_open_addressing.py
│   │   │   │   └── simple_hash.py
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.py
│   │   │   │   ├── my_heap.py
│   │   │   │   └── top_k.py
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.py
│   │   │   │   ├── binary_search_edge.py
│   │   │   │   ├── binary_search_insertion.py
│   │   │   │   ├── hashing_search.py
│   │   │   │   ├── linear_search.py
│   │   │   │   └── two_sum.py
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.py
│   │   │   │   ├── bucket_sort.py
│   │   │   │   ├── counting_sort.py
│   │   │   │   ├── heap_sort.py
│   │   │   │   ├── insertion_sort.py
│   │   │   │   ├── merge_sort.py
│   │   │   │   ├── quick_sort.py
│   │   │   │   ├── radix_sort.py
│   │   │   │   └── selection_sort.py
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.py
│   │   │   │   ├── array_queue.py
│   │   │   │   ├── array_stack.py
│   │   │   │   ├── deque.py
│   │   │   │   ├── linkedlist_deque.py
│   │   │   │   ├── linkedlist_queue.py
│   │   │   │   ├── linkedlist_stack.py
│   │   │   │   ├── queue.py
│   │   │   │   └── stack.py
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.py
│   │   │   │   ├── avl_tree.py
│   │   │   │   ├── binary_search_tree.py
│   │   │   │   ├── binary_tree.py
│   │   │   │   ├── binary_tree_bfs.py
│   │   │   │   └── binary_tree_dfs.py
│   │   │   ├── modules/
│   │   │   │   ├── __init__.py
│   │   │   │   ├── list_node.py
│   │   │   │   ├── print_util.py
│   │   │   │   ├── tree_node.py
│   │   │   │   └── vertex.py
│   │   │   └── test_all.py
│   │   ├── ruby/
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.rb
│   │   │   │   ├── linked_list.rb
│   │   │   │   ├── list.rb
│   │   │   │   └── my_list.rb
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.rb
│   │   │   │   ├── permutations_i.rb
│   │   │   │   ├── permutations_ii.rb
│   │   │   │   ├── preorder_traversal_i_compact.rb
│   │   │   │   ├── preorder_traversal_ii_compact.rb
│   │   │   │   ├── preorder_traversal_iii_compact.rb
│   │   │   │   ├── preorder_traversal_iii_template.rb
│   │   │   │   ├── subset_sum_i.rb
│   │   │   │   ├── subset_sum_i_naive.rb
│   │   │   │   └── subset_sum_ii.rb
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.rb
│   │   │   │   ├── recursion.rb
│   │   │   │   ├── space_complexity.rb
│   │   │   │   ├── time_complexity.rb
│   │   │   │   └── worst_best_time_complexity.rb
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.rb
│   │   │   │   ├── build_tree.rb
│   │   │   │   └── hanota.rb
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.rb
│   │   │   │   ├── climbing_stairs_constraint_dp.rb
│   │   │   │   ├── climbing_stairs_dfs.rb
│   │   │   │   ├── climbing_stairs_dfs_mem.rb
│   │   │   │   ├── climbing_stairs_dp.rb
│   │   │   │   ├── coin_change.rb
│   │   │   │   ├── coin_change_ii.rb
│   │   │   │   ├── edit_distance.rb
│   │   │   │   ├── knapsack.rb
│   │   │   │   ├── min_cost_climbing_stairs_dp.rb
│   │   │   │   ├── min_path_sum.rb
│   │   │   │   └── unbounded_knapsack.rb
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.rb
│   │   │   │   ├── graph_adjacency_matrix.rb
│   │   │   │   ├── graph_bfs.rb
│   │   │   │   └── graph_dfs.rb
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.rb
│   │   │   │   ├── fractional_knapsack.rb
│   │   │   │   ├── max_capacity.rb
│   │   │   │   └── max_product_cutting.rb
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.rb
│   │   │   │   ├── built_in_hash.rb
│   │   │   │   ├── hash_map.rb
│   │   │   │   ├── hash_map_chaining.rb
│   │   │   │   ├── hash_map_open_addressing.rb
│   │   │   │   └── simple_hash.rb
│   │   │   ├── chapter_heap/
│   │   │   │   ├── my_heap.rb
│   │   │   │   └── top_k.rb
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.rb
│   │   │   │   ├── binary_search_edge.rb
│   │   │   │   ├── binary_search_insertion.rb
│   │   │   │   ├── hashing_search.rb
│   │   │   │   ├── linear_search.rb
│   │   │   │   └── two_sum.rb
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.rb
│   │   │   │   ├── bucket_sort.rb
│   │   │   │   ├── counting_sort.rb
│   │   │   │   ├── heap_sort.rb
│   │   │   │   ├── insertion_sort.rb
│   │   │   │   ├── merge_sort.rb
│   │   │   │   ├── quick_sort.rb
│   │   │   │   ├── radix_sort.rb
│   │   │   │   └── selection_sort.rb
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.rb
│   │   │   │   ├── array_queue.rb
│   │   │   │   ├── array_stack.rb
│   │   │   │   ├── deque.rb
│   │   │   │   ├── linkedlist_deque.rb
│   │   │   │   ├── linkedlist_queue.rb
│   │   │   │   ├── linkedlist_stack.rb
│   │   │   │   ├── queue.rb
│   │   │   │   └── stack.rb
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.rb
│   │   │   │   ├── avl_tree.rb
│   │   │   │   ├── binary_search_tree.rb
│   │   │   │   ├── binary_tree.rb
│   │   │   │   ├── binary_tree_bfs.rb
│   │   │   │   └── binary_tree_dfs.rb
│   │   │   ├── test_all.rb
│   │   │   └── utils/
│   │   │       ├── list_node.rb
│   │   │       ├── print_util.rb
│   │   │       ├── tree_node.rb
│   │   │       └── vertex.rb
│   │   ├── rust/
│   │   │   ├── .gitignore
│   │   │   ├── Cargo.toml
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.rs
│   │   │   │   ├── linked_list.rs
│   │   │   │   ├── list.rs
│   │   │   │   └── my_list.rs
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.rs
│   │   │   │   ├── permutations_i.rs
│   │   │   │   ├── permutations_ii.rs
│   │   │   │   ├── preorder_traversal_i_compact.rs
│   │   │   │   ├── preorder_traversal_ii_compact.rs
│   │   │   │   ├── preorder_traversal_iii_compact.rs
│   │   │   │   ├── preorder_traversal_iii_template.rs
│   │   │   │   ├── subset_sum_i.rs
│   │   │   │   ├── subset_sum_i_naive.rs
│   │   │   │   └── subset_sum_ii.rs
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.rs
│   │   │   │   ├── recursion.rs
│   │   │   │   ├── space_complexity.rs
│   │   │   │   ├── time_complexity.rs
│   │   │   │   └── worst_best_time_complexity.rs
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.rs
│   │   │   │   ├── build_tree.rs
│   │   │   │   └── hanota.rs
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.rs
│   │   │   │   ├── climbing_stairs_constraint_dp.rs
│   │   │   │   ├── climbing_stairs_dfs.rs
│   │   │   │   ├── climbing_stairs_dfs_mem.rs
│   │   │   │   ├── climbing_stairs_dp.rs
│   │   │   │   ├── coin_change.rs
│   │   │   │   ├── coin_change_ii.rs
│   │   │   │   ├── edit_distance.rs
│   │   │   │   ├── knapsack.rs
│   │   │   │   ├── min_cost_climbing_stairs_dp.rs
│   │   │   │   ├── min_path_sum.rs
│   │   │   │   └── unbounded_knapsack.rs
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.rs
│   │   │   │   ├── graph_adjacency_matrix.rs
│   │   │   │   ├── graph_bfs.rs
│   │   │   │   └── graph_dfs.rs
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.rs
│   │   │   │   ├── fractional_knapsack.rs
│   │   │   │   ├── max_capacity.rs
│   │   │   │   └── max_product_cutting.rs
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.rs
│   │   │   │   ├── build_in_hash.rs
│   │   │   │   ├── hash_map.rs
│   │   │   │   ├── hash_map_chaining.rs
│   │   │   │   ├── hash_map_open_addressing.rs
│   │   │   │   └── simple_hash.rs
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.rs
│   │   │   │   ├── my_heap.rs
│   │   │   │   └── top_k.rs
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.rs
│   │   │   │   ├── binary_search_edge.rs
│   │   │   │   ├── binary_search_insertion.rs
│   │   │   │   ├── hashing_search.rs
│   │   │   │   ├── linear_search.rs
│   │   │   │   └── two_sum.rs
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.rs
│   │   │   │   ├── bucket_sort.rs
│   │   │   │   ├── counting_sort.rs
│   │   │   │   ├── heap_sort.rs
│   │   │   │   ├── insertion_sort.rs
│   │   │   │   ├── merge_sort.rs
│   │   │   │   ├── quick_sort.rs
│   │   │   │   ├── radix_sort.rs
│   │   │   │   └── selection_sort.rs
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.rs
│   │   │   │   ├── array_queue.rs
│   │   │   │   ├── array_stack.rs
│   │   │   │   ├── deque.rs
│   │   │   │   ├── linkedlist_deque.rs
│   │   │   │   ├── linkedlist_queue.rs
│   │   │   │   ├── linkedlist_stack.rs
│   │   │   │   ├── queue.rs
│   │   │   │   └── stack.rs
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.rs
│   │   │   │   ├── avl_tree.rs
│   │   │   │   ├── binary_search_tree.rs
│   │   │   │   ├── binary_tree.rs
│   │   │   │   ├── binary_tree_bfs.rs
│   │   │   │   └── binary_tree_dfs.rs
│   │   │   └── src/
│   │   │       ├── include/
│   │   │       │   ├── list_node.rs
│   │   │       │   ├── mod.rs
│   │   │       │   ├── print_util.rs
│   │   │       │   ├── tree_node.rs
│   │   │       │   └── vertex.rs
│   │   │       └── lib.rs
│   │   ├── swift/
│   │   │   ├── .gitignore
│   │   │   ├── Package.resolved
│   │   │   ├── Package.swift
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.swift
│   │   │   │   ├── linked_list.swift
│   │   │   │   ├── list.swift
│   │   │   │   └── my_list.swift
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.swift
│   │   │   │   ├── permutations_i.swift
│   │   │   │   ├── permutations_ii.swift
│   │   │   │   ├── preorder_traversal_i_compact.swift
│   │   │   │   ├── preorder_traversal_ii_compact.swift
│   │   │   │   ├── preorder_traversal_iii_compact.swift
│   │   │   │   ├── preorder_traversal_iii_template.swift
│   │   │   │   ├── subset_sum_i.swift
│   │   │   │   ├── subset_sum_i_naive.swift
│   │   │   │   └── subset_sum_ii.swift
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.swift
│   │   │   │   ├── recursion.swift
│   │   │   │   ├── space_complexity.swift
│   │   │   │   ├── time_complexity.swift
│   │   │   │   └── worst_best_time_complexity.swift
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.swift
│   │   │   │   ├── build_tree.swift
│   │   │   │   └── hanota.swift
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.swift
│   │   │   │   ├── climbing_stairs_constraint_dp.swift
│   │   │   │   ├── climbing_stairs_dfs.swift
│   │   │   │   ├── climbing_stairs_dfs_mem.swift
│   │   │   │   ├── climbing_stairs_dp.swift
│   │   │   │   ├── coin_change.swift
│   │   │   │   ├── coin_change_ii.swift
│   │   │   │   ├── edit_distance.swift
│   │   │   │   ├── knapsack.swift
│   │   │   │   ├── min_cost_climbing_stairs_dp.swift
│   │   │   │   ├── min_path_sum.swift
│   │   │   │   └── unbounded_knapsack.swift
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.swift
│   │   │   │   ├── graph_adjacency_list_target.swift
│   │   │   │   ├── graph_adjacency_matrix.swift
│   │   │   │   ├── graph_bfs.swift
│   │   │   │   └── graph_dfs.swift
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.swift
│   │   │   │   ├── fractional_knapsack.swift
│   │   │   │   ├── max_capacity.swift
│   │   │   │   └── max_product_cutting.swift
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.swift
│   │   │   │   ├── built_in_hash.swift
│   │   │   │   ├── hash_map.swift
│   │   │   │   ├── hash_map_chaining.swift
│   │   │   │   ├── hash_map_open_addressing.swift
│   │   │   │   └── simple_hash.swift
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.swift
│   │   │   │   ├── my_heap.swift
│   │   │   │   └── top_k.swift
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.swift
│   │   │   │   ├── binary_search_edge.swift
│   │   │   │   ├── binary_search_insertion.swift
│   │   │   │   ├── binary_search_insertion_target.swift
│   │   │   │   ├── hashing_search.swift
│   │   │   │   ├── linear_search.swift
│   │   │   │   └── two_sum.swift
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.swift
│   │   │   │   ├── bucket_sort.swift
│   │   │   │   ├── counting_sort.swift
│   │   │   │   ├── heap_sort.swift
│   │   │   │   ├── insertion_sort.swift
│   │   │   │   ├── merge_sort.swift
│   │   │   │   ├── quick_sort.swift
│   │   │   │   ├── radix_sort.swift
│   │   │   │   └── selection_sort.swift
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.swift
│   │   │   │   ├── array_queue.swift
│   │   │   │   ├── array_stack.swift
│   │   │   │   ├── deque.swift
│   │   │   │   ├── linkedlist_deque.swift
│   │   │   │   ├── linkedlist_queue.swift
│   │   │   │   ├── linkedlist_stack.swift
│   │   │   │   ├── queue.swift
│   │   │   │   └── stack.swift
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.swift
│   │   │   │   ├── avl_tree.swift
│   │   │   │   ├── binary_search_tree.swift
│   │   │   │   ├── binary_tree.swift
│   │   │   │   ├── binary_tree_bfs.swift
│   │   │   │   └── binary_tree_dfs.swift
│   │   │   └── utils/
│   │   │       ├── ListNode.swift
│   │   │       ├── Pair.swift
│   │   │       ├── PrintUtil.swift
│   │   │       ├── TreeNode.swift
│   │   │       └── Vertex.swift
│   │   └── typescript/
│   │       ├── .gitignore
│   │       ├── .prettierrc
│   │       ├── chapter_array_and_linkedlist/
│   │       │   ├── array.ts
│   │       │   ├── linked_list.ts
│   │       │   ├── list.ts
│   │       │   └── my_list.ts
│   │       ├── chapter_backtracking/
│   │       │   ├── n_queens.ts
│   │       │   ├── permutations_i.ts
│   │       │   ├── permutations_ii.ts
│   │       │   ├── preorder_traversal_i_compact.ts
│   │       │   ├── preorder_traversal_ii_compact.ts
│   │       │   ├── preorder_traversal_iii_compact.ts
│   │       │   ├── preorder_traversal_iii_template.ts
│   │       │   ├── subset_sum_i.ts
│   │       │   ├── subset_sum_i_naive.ts
│   │       │   └── subset_sum_ii.ts
│   │       ├── chapter_computational_complexity/
│   │       │   ├── iteration.ts
│   │       │   ├── recursion.ts
│   │       │   ├── space_complexity.ts
│   │       │   ├── time_complexity.ts
│   │       │   └── worst_best_time_complexity.ts
│   │       ├── chapter_divide_and_conquer/
│   │       │   ├── binary_search_recur.ts
│   │       │   ├── build_tree.ts
│   │       │   └── hanota.ts
│   │       ├── chapter_dynamic_programming/
│   │       │   ├── climbing_stairs_backtrack.ts
│   │       │   ├── climbing_stairs_constraint_dp.ts
│   │       │   ├── climbing_stairs_dfs.ts
│   │       │   ├── climbing_stairs_dfs_mem.ts
│   │       │   ├── climbing_stairs_dp.ts
│   │       │   ├── coin_change.ts
│   │       │   ├── coin_change_ii.ts
│   │       │   ├── edit_distance.ts
│   │       │   ├── knapsack.ts
│   │       │   ├── min_cost_climbing_stairs_dp.ts
│   │       │   ├── min_path_sum.ts
│   │       │   └── unbounded_knapsack.ts
│   │       ├── chapter_graph/
│   │       │   ├── graph_adjacency_list.ts
│   │       │   ├── graph_adjacency_matrix.ts
│   │       │   ├── graph_bfs.ts
│   │       │   └── graph_dfs.ts
│   │       ├── chapter_greedy/
│   │       │   ├── coin_change_greedy.ts
│   │       │   ├── fractional_knapsack.ts
│   │       │   ├── max_capacity.ts
│   │       │   └── max_product_cutting.ts
│   │       ├── chapter_hashing/
│   │       │   ├── array_hash_map.ts
│   │       │   ├── hash_map.ts
│   │       │   ├── hash_map_chaining.ts
│   │       │   ├── hash_map_open_addressing.ts
│   │       │   └── simple_hash.ts
│   │       ├── chapter_heap/
│   │       │   ├── my_heap.ts
│   │       │   └── top_k.ts
│   │       ├── chapter_searching/
│   │       │   ├── binary_search.ts
│   │       │   ├── binary_search_edge.ts
│   │       │   ├── binary_search_insertion.ts
│   │       │   ├── hashing_search.ts
│   │       │   ├── linear_search.ts
│   │       │   └── two_sum.ts
│   │       ├── chapter_sorting/
│   │       │   ├── bubble_sort.ts
│   │       │   ├── bucket_sort.ts
│   │       │   ├── counting_sort.ts
│   │       │   ├── heap_sort.ts
│   │       │   ├── insertion_sort.ts
│   │       │   ├── merge_sort.ts
│   │       │   ├── quick_sort.ts
│   │       │   ├── radix_sort.ts
│   │       │   └── selection_sort.ts
│   │       ├── chapter_stack_and_queue/
│   │       │   ├── array_deque.ts
│   │       │   ├── array_queue.ts
│   │       │   ├── array_stack.ts
│   │       │   ├── deque.ts
│   │       │   ├── linkedlist_deque.ts
│   │       │   ├── linkedlist_queue.ts
│   │       │   ├── linkedlist_stack.ts
│   │       │   ├── queue.ts
│   │       │   └── stack.ts
│   │       ├── chapter_tree/
│   │       │   ├── array_binary_tree.ts
│   │       │   ├── avl_tree.ts
│   │       │   ├── binary_search_tree.ts
│   │       │   ├── binary_tree.ts
│   │       │   ├── binary_tree_bfs.ts
│   │       │   └── binary_tree_dfs.ts
│   │       ├── modules/
│   │       │   ├── ListNode.ts
│   │       │   ├── PrintUtil.ts
│   │       │   ├── TreeNode.ts
│   │       │   └── Vertex.ts
│   │       ├── package.json
│   │       └── tsconfig.json
│   ├── docs/
│   │   ├── chapter_appendix/
│   │   │   ├── contribution.md
│   │   │   ├── index.md
│   │   │   ├── installation.md
│   │   │   └── terminology.md
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.md
│   │   │   ├── index.md
│   │   │   ├── linked_list.md
│   │   │   ├── list.md
│   │   │   ├── ram_and_cache.md
│   │   │   └── summary.md
│   │   ├── chapter_backtracking/
│   │   │   ├── backtracking_algorithm.md
│   │   │   ├── index.md
│   │   │   ├── n_queens_problem.md
│   │   │   ├── permutations_problem.md
│   │   │   ├── subset_sum_problem.md
│   │   │   └── summary.md
│   │   ├── chapter_computational_complexity/
│   │   │   ├── index.md
│   │   │   ├── iteration_and_recursion.md
│   │   │   ├── performance_evaluation.md
│   │   │   ├── space_complexity.md
│   │   │   ├── summary.md
│   │   │   └── time_complexity.md
│   │   ├── chapter_data_structure/
│   │   │   ├── basic_data_types.md
│   │   │   ├── character_encoding.md
│   │   │   ├── classification_of_data_structure.md
│   │   │   ├── index.md
│   │   │   ├── number_encoding.md
│   │   │   └── summary.md
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.md
│   │   │   ├── build_binary_tree_problem.md
│   │   │   ├── divide_and_conquer.md
│   │   │   ├── hanota_problem.md
│   │   │   ├── index.md
│   │   │   └── summary.md
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── dp_problem_features.md
│   │   │   ├── dp_solution_pipeline.md
│   │   │   ├── edit_distance_problem.md
│   │   │   ├── index.md
│   │   │   ├── intro_to_dynamic_programming.md
│   │   │   ├── knapsack_problem.md
│   │   │   ├── summary.md
│   │   │   └── unbounded_knapsack_problem.md
│   │   ├── chapter_graph/
│   │   │   ├── graph.md
│   │   │   ├── graph_operations.md
│   │   │   ├── graph_traversal.md
│   │   │   ├── index.md
│   │   │   └── summary.md
│   │   ├── chapter_greedy/
│   │   │   ├── fractional_knapsack_problem.md
│   │   │   ├── greedy_algorithm.md
│   │   │   ├── index.md
│   │   │   ├── max_capacity_problem.md
│   │   │   ├── max_product_cutting_problem.md
│   │   │   └── summary.md
│   │   ├── chapter_hashing/
│   │   │   ├── hash_algorithm.md
│   │   │   ├── hash_collision.md
│   │   │   ├── hash_map.md
│   │   │   ├── index.md
│   │   │   └── summary.md
│   │   ├── chapter_heap/
│   │   │   ├── build_heap.md
│   │   │   ├── heap.md
│   │   │   ├── index.md
│   │   │   ├── summary.md
│   │   │   └── top_k.md
│   │   ├── chapter_hello_algo/
│   │   │   └── index.md
│   │   ├── chapter_introduction/
│   │   │   ├── algorithms_are_everywhere.md
│   │   │   ├── index.md
│   │   │   ├── summary.md
│   │   │   └── what_is_dsa.md
│   │   ├── chapter_preface/
│   │   │   ├── about_the_book.md
│   │   │   ├── index.md
│   │   │   ├── suggestions.md
│   │   │   └── summary.md
│   │   ├── chapter_reference/
│   │   │   └── index.md
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.md
│   │   │   ├── binary_search_edge.md
│   │   │   ├── binary_search_insertion.md
│   │   │   ├── index.md
│   │   │   ├── replace_linear_by_hashing.md
│   │   │   ├── searching_algorithm_revisited.md
│   │   │   └── summary.md
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.md
│   │   │   ├── bucket_sort.md
│   │   │   ├── counting_sort.md
│   │   │   ├── heap_sort.md
│   │   │   ├── index.md
│   │   │   ├── insertion_sort.md
│   │   │   ├── merge_sort.md
│   │   │   ├── quick_sort.md
│   │   │   ├── radix_sort.md
│   │   │   ├── selection_sort.md
│   │   │   ├── sorting_algorithm.md
│   │   │   └── summary.md
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── deque.md
│   │   │   ├── index.md
│   │   │   ├── queue.md
│   │   │   ├── stack.md
│   │   │   └── summary.md
│   │   ├── chapter_tree/
│   │   │   ├── array_representation_of_tree.md
│   │   │   ├── avl_tree.md
│   │   │   ├── binary_search_tree.md
│   │   │   ├── binary_tree.md
│   │   │   ├── binary_tree_traversal.md
│   │   │   ├── index.md
│   │   │   └── summary.md
│   │   ├── index.html
│   │   └── index.md
│   └── mkdocs.yml
├── giscus.json
├── ja/
│   ├── README.md
│   ├── codes/
│   │   ├── c/
│   │   │   ├── .gitignore
│   │   │   ├── CMakeLists.txt
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array.c
│   │   │   │   ├── linked_list.c
│   │   │   │   └── my_list.c
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── n_queens.c
│   │   │   │   ├── permutations_i.c
│   │   │   │   ├── permutations_ii.c
│   │   │   │   ├── preorder_traversal_i_compact.c
│   │   │   │   ├── preorder_traversal_ii_compact.c
│   │   │   │   ├── preorder_traversal_iii_compact.c
│   │   │   │   ├── preorder_traversal_iii_template.c
│   │   │   │   ├── subset_sum_i.c
│   │   │   │   ├── subset_sum_i_naive.c
│   │   │   │   └── subset_sum_ii.c
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── iteration.c
│   │   │   │   ├── recursion.c
│   │   │   │   ├── space_complexity.c
│   │   │   │   ├── time_complexity.c
│   │   │   │   └── worst_best_time_complexity.c
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search_recur.c
│   │   │   │   ├── build_tree.c
│   │   │   │   └── hanota.c
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── climbing_stairs_backtrack.c
│   │   │   │   ├── climbing_stairs_constraint_dp.c
│   │   │   │   ├── climbing_stairs_dfs.c
│   │   │   │   ├── climbing_stairs_dfs_mem.c
│   │   │   │   ├── climbing_stairs_dp.c
│   │   │   │   ├── coin_change.c
│   │   │   │   ├── coin_change_ii.c
│   │   │   │   ├── edit_distance.c
│   │   │   │   ├── knapsack.c
│   │   │   │   ├── min_cost_climbing_stairs_dp.c
│   │   │   │   ├── min_path_sum.c
│   │   │   │   └── unbounded_knapsack.c
│   │   │   ├── chapter_graph/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── graph_adjacency_list.c
│   │   │   │   ├── graph_adjacency_list_test.c
│   │   │   │   ├── graph_adjacency_matrix.c
│   │   │   │   ├── graph_bfs.c
│   │   │   │   └── graph_dfs.c
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── coin_change_greedy.c
│   │   │   │   ├── fractional_knapsack.c
│   │   │   │   ├── max_capacity.c
│   │   │   │   └── max_product_cutting.c
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_hash_map.c
│   │   │   │   ├── hash_map_chaining.c
│   │   │   │   ├── hash_map_open_addressing.c
│   │   │   │   └── simple_hash.c
│   │   │   ├── chapter_heap/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── my_heap.c
│   │   │   │   ├── my_heap_test.c
│   │   │   │   └── top_k.c
│   │   │   ├── chapter_searching/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search.c
│   │   │   │   ├── binary_search_edge.c
│   │   │   │   ├── binary_search_insertion.c
│   │   │   │   └── two_sum.c
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── bubble_sort.c
│   │   │   │   ├── bucket_sort.c
│   │   │   │   ├── counting_sort.c
│   │   │   │   ├── heap_sort.c
│   │   │   │   ├── insertion_sort.c
│   │   │   │   ├── merge_sort.c
│   │   │   │   ├── quick_sort.c
│   │   │   │   ├── radix_sort.c
│   │   │   │   └── selection_sort.c
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_deque.c
│   │   │   │   ├── array_queue.c
│   │   │   │   ├── array_stack.c
│   │   │   │   ├── linkedlist_deque.c
│   │   │   │   ├── linkedlist_queue.c
│   │   │   │   └── linkedlist_stack.c
│   │   │   ├── chapter_tree/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_binary_tree.c
│   │   │   │   ├── avl_tree.c
│   │   │   │   ├── binary_search_tree.c
│   │   │   │   ├── binary_tree.c
│   │   │   │   ├── binary_tree_bfs.c
│   │   │   │   └── binary_tree_dfs.c
│   │   │   └── utils/
│   │   │       ├── CMakeLists.txt
│   │   │       ├── common.h
│   │   │       ├── common_test.c
│   │   │       ├── list_node.h
│   │   │       ├── print_util.h
│   │   │       ├── tree_node.h
│   │   │       ├── uthash.h
│   │   │       ├── vector.h
│   │   │       └── vertex.h
│   │   ├── cpp/
│   │   │   ├── .gitignore
│   │   │   ├── CMakeLists.txt
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array.cpp
│   │   │   │   ├── linked_list.cpp
│   │   │   │   ├── list.cpp
│   │   │   │   └── my_list.cpp
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── n_queens.cpp
│   │   │   │   ├── permutations_i.cpp
│   │   │   │   ├── permutations_ii.cpp
│   │   │   │   ├── preorder_traversal_i_compact.cpp
│   │   │   │   ├── preorder_traversal_ii_compact.cpp
│   │   │   │   ├── preorder_traversal_iii_compact.cpp
│   │   │   │   ├── preorder_traversal_iii_template.cpp
│   │   │   │   ├── subset_sum_i.cpp
│   │   │   │   ├── subset_sum_i_naive.cpp
│   │   │   │   └── subset_sum_ii.cpp
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── iteration.cpp
│   │   │   │   ├── recursion.cpp
│   │   │   │   ├── space_complexity.cpp
│   │   │   │   ├── time_complexity.cpp
│   │   │   │   └── worst_best_time_complexity.cpp
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search_recur.cpp
│   │   │   │   ├── build_tree.cpp
│   │   │   │   └── hanota.cpp
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── climbing_stairs_backtrack.cpp
│   │   │   │   ├── climbing_stairs_constraint_dp.cpp
│   │   │   │   ├── climbing_stairs_dfs.cpp
│   │   │   │   ├── climbing_stairs_dfs_mem.cpp
│   │   │   │   ├── climbing_stairs_dp.cpp
│   │   │   │   ├── coin_change.cpp
│   │   │   │   ├── coin_change_ii.cpp
│   │   │   │   ├── edit_distance.cpp
│   │   │   │   ├── knapsack.cpp
│   │   │   │   ├── min_cost_climbing_stairs_dp.cpp
│   │   │   │   ├── min_path_sum.cpp
│   │   │   │   └── unbounded_knapsack.cpp
│   │   │   ├── chapter_graph/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── graph_adjacency_list.cpp
│   │   │   │   ├── graph_adjacency_list_test.cpp
│   │   │   │   ├── graph_adjacency_matrix.cpp
│   │   │   │   ├── graph_bfs.cpp
│   │   │   │   └── graph_dfs.cpp
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── coin_change_greedy.cpp
│   │   │   │   ├── fractional_knapsack.cpp
│   │   │   │   ├── max_capacity.cpp
│   │   │   │   └── max_product_cutting.cpp
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_hash_map.cpp
│   │   │   │   ├── array_hash_map_test.cpp
│   │   │   │   ├── built_in_hash.cpp
│   │   │   │   ├── hash_map.cpp
│   │   │   │   ├── hash_map_chaining.cpp
│   │   │   │   ├── hash_map_open_addressing.cpp
│   │   │   │   └── simple_hash.cpp
│   │   │   ├── chapter_heap/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── heap.cpp
│   │   │   │   ├── my_heap.cpp
│   │   │   │   └── top_k.cpp
│   │   │   ├── chapter_searching/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search.cpp
│   │   │   │   ├── binary_search_edge.cpp
│   │   │   │   ├── binary_search_insertion.cpp
│   │   │   │   ├── hashing_search.cpp
│   │   │   │   ├── linear_search.cpp
│   │   │   │   └── two_sum.cpp
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── bubble_sort.cpp
│   │   │   │   ├── bucket_sort.cpp
│   │   │   │   ├── counting_sort.cpp
│   │   │   │   ├── heap_sort.cpp
│   │   │   │   ├── insertion_sort.cpp
│   │   │   │   ├── merge_sort.cpp
│   │   │   │   ├── quick_sort.cpp
│   │   │   │   ├── radix_sort.cpp
│   │   │   │   └── selection_sort.cpp
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_deque.cpp
│   │   │   │   ├── array_queue.cpp
│   │   │   │   ├── array_stack.cpp
│   │   │   │   ├── deque.cpp
│   │   │   │   ├── linkedlist_deque.cpp
│   │   │   │   ├── linkedlist_queue.cpp
│   │   │   │   ├── linkedlist_stack.cpp
│   │   │   │   ├── queue.cpp
│   │   │   │   └── stack.cpp
│   │   │   ├── chapter_tree/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_binary_tree.cpp
│   │   │   │   ├── avl_tree.cpp
│   │   │   │   ├── binary_search_tree.cpp
│   │   │   │   ├── binary_tree.cpp
│   │   │   │   ├── binary_tree_bfs.cpp
│   │   │   │   └── binary_tree_dfs.cpp
│   │   │   └── utils/
│   │   │       ├── CMakeLists.txt
│   │   │       ├── common.hpp
│   │   │       ├── list_node.hpp
│   │   │       ├── print_utils.hpp
│   │   │       ├── tree_node.hpp
│   │   │       └── vertex.hpp
│   │   ├── csharp/
│   │   │   ├── .editorconfig
│   │   │   ├── .gitignore
│   │   │   ├── GlobalUsing.cs
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.cs
│   │   │   │   ├── linked_list.cs
│   │   │   │   ├── list.cs
│   │   │   │   └── my_list.cs
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.cs
│   │   │   │   ├── permutations_i.cs
│   │   │   │   ├── permutations_ii.cs
│   │   │   │   ├── preorder_traversal_i_compact.cs
│   │   │   │   ├── preorder_traversal_ii_compact.cs
│   │   │   │   ├── preorder_traversal_iii_compact.cs
│   │   │   │   ├── preorder_traversal_iii_template.cs
│   │   │   │   ├── subset_sum_i.cs
│   │   │   │   ├── subset_sum_i_naive.cs
│   │   │   │   └── subset_sum_ii.cs
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.cs
│   │   │   │   ├── recursion.cs
│   │   │   │   ├── space_complexity.cs
│   │   │   │   ├── time_complexity.cs
│   │   │   │   └── worst_best_time_complexity.cs
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.cs
│   │   │   │   ├── build_tree.cs
│   │   │   │   └── hanota.cs
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.cs
│   │   │   │   ├── climbing_stairs_constraint_dp.cs
│   │   │   │   ├── climbing_stairs_dfs.cs
│   │   │   │   ├── climbing_stairs_dfs_mem.cs
│   │   │   │   ├── climbing_stairs_dp.cs
│   │   │   │   ├── coin_change.cs
│   │   │   │   ├── coin_change_ii.cs
│   │   │   │   ├── edit_distance.cs
│   │   │   │   ├── knapsack.cs
│   │   │   │   ├── min_cost_climbing_stairs_dp.cs
│   │   │   │   ├── min_path_sum.cs
│   │   │   │   └── unbounded_knapsack.cs
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.cs
│   │   │   │   ├── graph_adjacency_matrix.cs
│   │   │   │   ├── graph_bfs.cs
│   │   │   │   └── graph_dfs.cs
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.cs
│   │   │   │   ├── fractional_knapsack.cs
│   │   │   │   ├── max_capacity.cs
│   │   │   │   └── max_product_cutting.cs
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.cs
│   │   │   │   ├── built_in_hash.cs
│   │   │   │   ├── hash_map.cs
│   │   │   │   ├── hash_map_chaining.cs
│   │   │   │   ├── hash_map_open_addressing.cs
│   │   │   │   └── simple_hash.cs
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.cs
│   │   │   │   ├── my_heap.cs
│   │   │   │   └── top_k.cs
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.cs
│   │   │   │   ├── binary_search_edge.cs
│   │   │   │   ├── binary_search_insertion.cs
│   │   │   │   ├── hashing_search.cs
│   │   │   │   ├── linear_search.cs
│   │   │   │   └── two_sum.cs
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.cs
│   │   │   │   ├── bucket_sort.cs
│   │   │   │   ├── counting_sort.cs
│   │   │   │   ├── heap_sort.cs
│   │   │   │   ├── insertion_sort.cs
│   │   │   │   ├── merge_sort.cs
│   │   │   │   ├── quick_sort.cs
│   │   │   │   ├── radix_sort.cs
│   │   │   │   └── selection_sort.cs
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.cs
│   │   │   │   ├── array_queue.cs
│   │   │   │   ├── array_stack.cs
│   │   │   │   ├── deque.cs
│   │   │   │   ├── linkedlist_deque.cs
│   │   │   │   ├── linkedlist_queue.cs
│   │   │   │   ├── linkedlist_stack.cs
│   │   │   │   ├── queue.cs
│   │   │   │   └── stack.cs
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.cs
│   │   │   │   ├── avl_tree.cs
│   │   │   │   ├── binary_search_tree.cs
│   │   │   │   ├── binary_tree.cs
│   │   │   │   ├── binary_tree_bfs.cs
│   │   │   │   └── binary_tree_dfs.cs
│   │   │   ├── csharp.sln
│   │   │   ├── hello-algo.csproj
│   │   │   └── utils/
│   │   │       ├── ListNode.cs
│   │   │       ├── PrintUtil.cs
│   │   │       ├── TreeNode.cs
│   │   │       └── Vertex.cs
│   │   ├── dart/
│   │   │   ├── build.dart
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.dart
│   │   │   │   ├── linked_list.dart
│   │   │   │   ├── list.dart
│   │   │   │   └── my_list.dart
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.dart
│   │   │   │   ├── permutations_i.dart
│   │   │   │   ├── permutations_ii.dart
│   │   │   │   ├── preorder_traversal_i_compact.dart
│   │   │   │   ├── preorder_traversal_ii_compact.dart
│   │   │   │   ├── preorder_traversal_iii_compact.dart
│   │   │   │   ├── preorder_traversal_iii_template.dart
│   │   │   │   ├── subset_sum_i.dart
│   │   │   │   ├── subset_sum_i_naive.dart
│   │   │   │   └── subset_sum_ii.dart
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.dart
│   │   │   │   ├── recursion.dart
│   │   │   │   ├── space_complexity.dart
│   │   │   │   ├── time_complexity.dart
│   │   │   │   └── worst_best_time_complexity.dart
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.dart
│   │   │   │   ├── build_tree.dart
│   │   │   │   └── hanota.dart
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.dart
│   │   │   │   ├── climbing_stairs_constraint_dp.dart
│   │   │   │   ├── climbing_stairs_dfs.dart
│   │   │   │   ├── climbing_stairs_dfs_mem.dart
│   │   │   │   ├── climbing_stairs_dp.dart
│   │   │   │   ├── coin_change.dart
│   │   │   │   ├── coin_change_ii.dart
│   │   │   │   ├── edit_distance.dart
│   │   │   │   ├── knapsack.dart
│   │   │   │   ├── min_cost_climbing_stairs_dp.dart
│   │   │   │   ├── min_path_sum.dart
│   │   │   │   └── unbounded_knapsack.dart
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.dart
│   │   │   │   ├── graph_adjacency_matrix.dart
│   │   │   │   ├── graph_bfs.dart
│   │   │   │   └── graph_dfs.dart
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.dart
│   │   │   │   ├── fractional_knapsack.dart
│   │   │   │   ├── max_capacity.dart
│   │   │   │   └── max_product_cutting.dart
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.dart
│   │   │   │   ├── built_in_hash.dart
│   │   │   │   ├── hash_map.dart
│   │   │   │   ├── hash_map_chaining.dart
│   │   │   │   ├── hash_map_open_addressing.dart
│   │   │   │   └── simple_hash.dart
│   │   │   ├── chapter_heap/
│   │   │   │   ├── my_heap.dart
│   │   │   │   └── top_k.dart
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.dart
│   │   │   │   ├── binary_search_edge.dart
│   │   │   │   ├── binary_search_insertion.dart
│   │   │   │   ├── hashing_search.dart
│   │   │   │   ├── linear_search.dart
│   │   │   │   └── two_sum.dart
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.dart
│   │   │   │   ├── bucket_sort.dart
│   │   │   │   ├── counting_sort.dart
│   │   │   │   ├── heap_sort.dart
│   │   │   │   ├── insertion_sort.dart
│   │   │   │   ├── merge_sort.dart
│   │   │   │   ├── quick_sort.dart
│   │   │   │   ├── radix_sort.dart
│   │   │   │   └── selection_sort.dart
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.dart
│   │   │   │   ├── array_queue.dart
│   │   │   │   ├── array_stack.dart
│   │   │   │   ├── deque.dart
│   │   │   │   ├── linkedlist_deque.dart
│   │   │   │   ├── linkedlist_queue.dart
│   │   │   │   ├── linkedlist_stack.dart
│   │   │   │   ├── queue.dart
│   │   │   │   └── stack.dart
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.dart
│   │   │   │   ├── avl_tree.dart
│   │   │   │   ├── binary_search_tree.dart
│   │   │   │   ├── binary_tree.dart
│   │   │   │   ├── binary_tree_bfs.dart
│   │   │   │   └── binary_tree_dfs.dart
│   │   │   └── utils/
│   │   │       ├── list_node.dart
│   │   │       ├── print_util.dart
│   │   │       ├── tree_node.dart
│   │   │       └── vertex.dart
│   │   ├── go/
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.go
│   │   │   │   ├── array_test.go
│   │   │   │   ├── linked_list.go
│   │   │   │   ├── linked_list_test.go
│   │   │   │   ├── list_test.go
│   │   │   │   ├── my_list.go
│   │   │   │   └── my_list_test.go
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.go
│   │   │   │   ├── n_queens_test.go
│   │   │   │   ├── permutation_test.go
│   │   │   │   ├── permutations_i.go
│   │   │   │   ├── permutations_ii.go
│   │   │   │   ├── preorder_traversal_i_compact.go
│   │   │   │   ├── preorder_traversal_ii_compact.go
│   │   │   │   ├── preorder_traversal_iii_compact.go
│   │   │   │   ├── preorder_traversal_iii_template.go
│   │   │   │   ├── preorder_traversal_test.go
│   │   │   │   ├── subset_sum_i.go
│   │   │   │   ├── subset_sum_i_naive.go
│   │   │   │   ├── subset_sum_ii.go
│   │   │   │   └── subset_sum_test.go
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.go
│   │   │   │   ├── iteration_test.go
│   │   │   │   ├── recursion.go
│   │   │   │   ├── recursion_test.go
│   │   │   │   ├── space_complexity.go
│   │   │   │   ├── space_complexity_test.go
│   │   │   │   ├── time_complexity.go
│   │   │   │   ├── time_complexity_test.go
│   │   │   │   ├── worst_best_time_complexity.go
│   │   │   │   └── worst_best_time_complexity_test.go
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.go
│   │   │   │   ├── binary_search_recur_test.go
│   │   │   │   ├── build_tree.go
│   │   │   │   ├── build_tree_test.go
│   │   │   │   ├── hanota.go
│   │   │   │   └── hanota_test.go
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.go
│   │   │   │   ├── climbing_stairs_constraint_dp.go
│   │   │   │   ├── climbing_stairs_dfs.go
│   │   │   │   ├── climbing_stairs_dfs_mem.go
│   │   │   │   ├── climbing_stairs_dp.go
│   │   │   │   ├── climbing_stairs_test.go
│   │   │   │   ├── coin_change.go
│   │   │   │   ├── coin_change_ii.go
│   │   │   │   ├── coin_change_test.go
│   │   │   │   ├── edit_distance.go
│   │   │   │   ├── edit_distance_test.go
│   │   │   │   ├── knapsack.go
│   │   │   │   ├── knapsack_test.go
│   │   │   │   ├── min_cost_climbing_stairs_dp.go
│   │   │   │   ├── min_path_sum.go
│   │   │   │   ├── min_path_sum_test.go
│   │   │   │   └── unbounded_knapsack.go
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.go
│   │   │   │   ├── graph_adjacency_list_test.go
│   │   │   │   ├── graph_adjacency_matrix.go
│   │   │   │   ├── graph_adjacency_matrix_test.go
│   │   │   │   ├── graph_bfs.go
│   │   │   │   ├── graph_bfs_test.go
│   │   │   │   ├── graph_dfs.go
│   │   │   │   └── graph_dfs_test.go
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.go
│   │   │   │   ├── coin_change_greedy_test.go
│   │   │   │   ├── fractional_knapsack.go
│   │   │   │   ├── fractional_knapsack_test.go
│   │   │   │   ├── max_capacity.go
│   │   │   │   ├── max_capacity_test.go
│   │   │   │   ├── max_product_cutting.go
│   │   │   │   └── max_product_cutting_test.go
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.go
│   │   │   │   ├── array_hash_map_test.go
│   │   │   │   ├── hash_collision_test.go
│   │   │   │   ├── hash_map_chaining.go
│   │   │   │   ├── hash_map_open_addressing.go
│   │   │   │   ├── hash_map_test.go
│   │   │   │   └── simple_hash.go
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.go
│   │   │   │   ├── heap_test.go
│   │   │   │   ├── my_heap.go
│   │   │   │   └── top_k.go
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.go
│   │   │   │   ├── binary_search_edge.go
│   │   │   │   ├── binary_search_insertion.go
│   │   │   │   ├── binary_search_test.go
│   │   │   │   ├── hashing_search.go
│   │   │   │   ├── hashing_search_test.go
│   │   │   │   ├── linear_search.go
│   │   │   │   ├── linear_search_test.go
│   │   │   │   ├── two_sum.go
│   │   │   │   └── two_sum_test.go
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.go
│   │   │   │   ├── bubble_sort_test.go
│   │   │   │   ├── bucket_sort.go
│   │   │   │   ├── bucket_sort_test.go
│   │   │   │   ├── counting_sort.go
│   │   │   │   ├── counting_sort_test.go
│   │   │   │   ├── heap_sort.go
│   │   │   │   ├── heap_sort_test.go
│   │   │   │   ├── insertion_sort.go
│   │   │   │   ├── insertion_sort_test.go
│   │   │   │   ├── merge_sort.go
│   │   │   │   ├── merge_sort_test.go
│   │   │   │   ├── quick_sort.go
│   │   │   │   ├── quick_sort_test.go
│   │   │   │   ├── radix_sort.go
│   │   │   │   ├── radix_sort_test.go
│   │   │   │   ├── selection_sort.go
│   │   │   │   └── selection_sort_test.go
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.go
│   │   │   │   ├── array_queue.go
│   │   │   │   ├── array_stack.go
│   │   │   │   ├── deque_test.go
│   │   │   │   ├── linkedlist_deque.go
│   │   │   │   ├── linkedlist_queue.go
│   │   │   │   ├── linkedlist_stack.go
│   │   │   │   ├── queue_test.go
│   │   │   │   └── stack_test.go
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.go
│   │   │   │   ├── array_binary_tree_test.go
│   │   │   │   ├── avl_tree.go
│   │   │   │   ├── avl_tree_test.go
│   │   │   │   ├── binary_search_tree.go
│   │   │   │   ├── binary_search_tree_test.go
│   │   │   │   ├── binary_tree_bfs.go
│   │   │   │   ├── binary_tree_bfs_test.go
│   │   │   │   ├── binary_tree_dfs.go
│   │   │   │   ├── binary_tree_dfs_test.go
│   │   │   │   └── binary_tree_test.go
│   │   │   ├── go.mod
│   │   │   └── pkg/
│   │   │       ├── list_node.go
│   │   │       ├── list_node_test.go
│   │   │       ├── print_utils.go
│   │   │       ├── tree_node.go
│   │   │       ├── tree_node_test.go
│   │   │       └── vertex.go
│   │   ├── java/
│   │   │   ├── .gitignore
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.java
│   │   │   │   ├── linked_list.java
│   │   │   │   ├── list.java
│   │   │   │   └── my_list.java
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.java
│   │   │   │   ├── permutations_i.java
│   │   │   │   ├── permutations_ii.java
│   │   │   │   ├── preorder_traversal_i_compact.java
│   │   │   │   ├── preorder_traversal_ii_compact.java
│   │   │   │   ├── preorder_traversal_iii_compact.java
│   │   │   │   ├── preorder_traversal_iii_template.java
│   │   │   │   ├── subset_sum_i.java
│   │   │   │   ├── subset_sum_i_naive.java
│   │   │   │   └── subset_sum_ii.java
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.java
│   │   │   │   ├── recursion.java
│   │   │   │   ├── space_complexity.java
│   │   │   │   ├── time_complexity.java
│   │   │   │   └── worst_best_time_complexity.java
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.java
│   │   │   │   ├── build_tree.java
│   │   │   │   └── hanota.java
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.java
│   │   │   │   ├── climbing_stairs_constraint_dp.java
│   │   │   │   ├── climbing_stairs_dfs.java
│   │   │   │   ├── climbing_stairs_dfs_mem.java
│   │   │   │   ├── climbing_stairs_dp.java
│   │   │   │   ├── coin_change.java
│   │   │   │   ├── coin_change_ii.java
│   │   │   │   ├── edit_distance.java
│   │   │   │   ├── knapsack.java
│   │   │   │   ├── min_cost_climbing_stairs_dp.java
│   │   │   │   ├── min_path_sum.java
│   │   │   │   └── unbounded_knapsack.java
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.java
│   │   │   │   ├── graph_adjacency_matrix.java
│   │   │   │   ├── graph_bfs.java
│   │   │   │   └── graph_dfs.java
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.java
│   │   │   │   ├── fractional_knapsack.java
│   │   │   │   ├── max_capacity.java
│   │   │   │   └── max_product_cutting.java
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.java
│   │   │   │   ├── built_in_hash.java
│   │   │   │   ├── hash_map.java
│   │   │   │   ├── hash_map_chaining.java
│   │   │   │   ├── hash_map_open_addressing.java
│   │   │   │   └── simple_hash.java
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.java
│   │   │   │   ├── my_heap.java
│   │   │   │   └── top_k.java
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.java
│   │   │   │   ├── binary_search_edge.java
│   │   │   │   ├── binary_search_insertion.java
│   │   │   │   ├── hashing_search.java
│   │   │   │   ├── linear_search.java
│   │   │   │   └── two_sum.java
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.java
│   │   │   │   ├── bucket_sort.java
│   │   │   │   ├── counting_sort.java
│   │   │   │   ├── heap_sort.java
│   │   │   │   ├── insertion_sort.java
│   │   │   │   ├── merge_sort.java
│   │   │   │   ├── quick_sort.java
│   │   │   │   ├── radix_sort.java
│   │   │   │   └── selection_sort.java
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.java
│   │   │   │   ├── array_queue.java
│   │   │   │   ├── array_stack.java
│   │   │   │   ├── deque.java
│   │   │   │   ├── linkedlist_deque.java
│   │   │   │   ├── linkedlist_queue.java
│   │   │   │   ├── linkedlist_stack.java
│   │   │   │   ├── queue.java
│   │   │   │   └── stack.java
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.java
│   │   │   │   ├── avl_tree.java
│   │   │   │   ├── binary_search_tree.java
│   │   │   │   ├── binary_tree.java
│   │   │   │   ├── binary_tree_bfs.java
│   │   │   │   └── binary_tree_dfs.java
│   │   │   └── utils/
│   │   │       ├── ListNode.java
│   │   │       ├── PrintUtil.java
│   │   │       ├── TreeNode.java
│   │   │       └── Vertex.java
│   │   ├── javascript/
│   │   │   ├── .prettierrc
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.js
│   │   │   │   ├── linked_list.js
│   │   │   │   ├── list.js
│   │   │   │   └── my_list.js
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.js
│   │   │   │   ├── permutations_i.js
│   │   │   │   ├── permutations_ii.js
│   │   │   │   ├── preorder_traversal_i_compact.js
│   │   │   │   ├── preorder_traversal_ii_compact.js
│   │   │   │   ├── preorder_traversal_iii_compact.js
│   │   │   │   ├── preorder_traversal_iii_template.js
│   │   │   │   ├── subset_sum_i.js
│   │   │   │   ├── subset_sum_i_naive.js
│   │   │   │   └── subset_sum_ii.js
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.js
│   │   │   │   ├── recursion.js
│   │   │   │   ├── space_complexity.js
│   │   │   │   ├── time_complexity.js
│   │   │   │   └── worst_best_time_complexity.js
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.js
│   │   │   │   ├── build_tree.js
│   │   │   │   └── hanota.js
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.js
│   │   │   │   ├── climbing_stairs_constraint_dp.js
│   │   │   │   ├── climbing_stairs_dfs.js
│   │   │   │   ├── climbing_stairs_dfs_mem.js
│   │   │   │   ├── climbing_stairs_dp.js
│   │   │   │   ├── coin_change.js
│   │   │   │   ├── coin_change_ii.js
│   │   │   │   ├── edit_distance.js
│   │   │   │   ├── knapsack.js
│   │   │   │   ├── min_cost_climbing_stairs_dp.js
│   │   │   │   ├── min_path_sum.js
│   │   │   │   └── unbounded_knapsack.js
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.js
│   │   │   │   ├── graph_adjacency_matrix.js
│   │   │   │   ├── graph_bfs.js
│   │   │   │   └── graph_dfs.js
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.js
│   │   │   │   ├── fractional_knapsack.js
│   │   │   │   ├── max_capacity.js
│   │   │   │   └── max_product_cutting.js
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.js
│   │   │   │   ├── hash_map.js
│   │   │   │   ├── hash_map_chaining.js
│   │   │   │   ├── hash_map_open_addressing.js
│   │   │   │   └── simple_hash.js
│   │   │   ├── chapter_heap/
│   │   │   │   ├── my_heap.js
│   │   │   │   └── top_k.js
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.js
│   │   │   │   ├── binary_search_edge.js
│   │   │   │   ├── binary_search_insertion.js
│   │   │   │   ├── hashing_search.js
│   │   │   │   ├── linear_search.js
│   │   │   │   └── two_sum.js
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.js
│   │   │   │   ├── bucket_sort.js
│   │   │   │   ├── counting_sort.js
│   │   │   │   ├── heap_sort.js
│   │   │   │   ├── insertion_sort.js
│   │   │   │   ├── merge_sort.js
│   │   │   │   ├── quick_sort.js
│   │   │   │   ├── radix_sort.js
│   │   │   │   └── selection_sort.js
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.js
│   │   │   │   ├── array_queue.js
│   │   │   │   ├── array_stack.js
│   │   │   │   ├── deque.js
│   │   │   │   ├── linkedlist_deque.js
│   │   │   │   ├── linkedlist_queue.js
│   │   │   │   ├── linkedlist_stack.js
│   │   │   │   ├── queue.js
│   │   │   │   └── stack.js
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.js
│   │   │   │   ├── avl_tree.js
│   │   │   │   ├── binary_search_tree.js
│   │   │   │   ├── binary_tree.js
│   │   │   │   ├── binary_tree_bfs.js
│   │   │   │   └── binary_tree_dfs.js
│   │   │   ├── modules/
│   │   │   │   ├── ListNode.js
│   │   │   │   ├── PrintUtil.js
│   │   │   │   ├── TreeNode.js
│   │   │   │   └── Vertex.js
│   │   │   └── test_all.js
│   │   ├── kotlin/
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.kt
│   │   │   │   ├── linked_list.kt
│   │   │   │   ├── list.kt
│   │   │   │   └── my_list.kt
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.kt
│   │   │   │   ├── permutations_i.kt
│   │   │   │   ├── permutations_ii.kt
│   │   │   │   ├── preorder_traversal_i_compact.kt
│   │   │   │   ├── preorder_traversal_ii_compact.kt
│   │   │   │   ├── preorder_traversal_iii_compact.kt
│   │   │   │   ├── preorder_traversal_iii_template.kt
│   │   │   │   ├── subset_sum_i.kt
│   │   │   │   ├── subset_sum_i_naive.kt
│   │   │   │   └── subset_sum_ii.kt
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.kt
│   │   │   │   ├── recursion.kt
│   │   │   │   ├── space_complexity.kt
│   │   │   │   ├── time_complexity.kt
│   │   │   │   └── worst_best_time_complexity.kt
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.kt
│   │   │   │   ├── build_tree.kt
│   │   │   │   └── hanota.kt
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.kt
│   │   │   │   ├── climbing_stairs_constraint_dp.kt
│   │   │   │   ├── climbing_stairs_dfs.kt
│   │   │   │   ├── climbing_stairs_dfs_mem.kt
│   │   │   │   ├── climbing_stairs_dp.kt
│   │   │   │   ├── coin_change.kt
│   │   │   │   ├── coin_change_ii.kt
│   │   │   │   ├── edit_distance.kt
│   │   │   │   ├── knapsack.kt
│   │   │   │   ├── min_cost_climbing_stairs_dp.kt
│   │   │   │   ├── min_path_sum.kt
│   │   │   │   └── unbounded_knapsack.kt
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.kt
│   │   │   │   ├── graph_adjacency_matrix.kt
│   │   │   │   ├── graph_bfs.kt
│   │   │   │   └── graph_dfs.kt
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.kt
│   │   │   │   ├── fractional_knapsack.kt
│   │   │   │   ├── max_capacity.kt
│   │   │   │   └── max_product_cutting.kt
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.kt
│   │   │   │   ├── built_in_hash.kt
│   │   │   │   ├── hash_map.kt
│   │   │   │   ├── hash_map_chaining.kt
│   │   │   │   ├── hash_map_open_addressing.kt
│   │   │   │   └── simple_hash.kt
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.kt
│   │   │   │   ├── my_heap.kt
│   │   │   │   └── top_k.kt
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.kt
│   │   │   │   ├── binary_search_edge.kt
│   │   │   │   ├── binary_search_insertion.kt
│   │   │   │   ├── hashing_search.kt
│   │   │   │   ├── linear_search.kt
│   │   │   │   └── two_sum.kt
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.kt
│   │   │   │   ├── bucket_sort.kt
│   │   │   │   ├── counting_sort.kt
│   │   │   │   ├── heap_sort.kt
│   │   │   │   ├── insertion_sort.kt
│   │   │   │   ├── merge_sort.kt
│   │   │   │   ├── quick_sort.kt
│   │   │   │   ├── radix_sort.kt
│   │   │   │   └── selection_sort.kt
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.kt
│   │   │   │   ├── array_queue.kt
│   │   │   │   ├── array_stack.kt
│   │   │   │   ├── deque.kt
│   │   │   │   ├── linkedlist_deque.kt
│   │   │   │   ├── linkedlist_queue.kt
│   │   │   │   ├── linkedlist_stack.kt
│   │   │   │   ├── queue.kt
│   │   │   │   └── stack.kt
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.kt
│   │   │   │   ├── avl_tree.kt
│   │   │   │   ├── binary_search_tree.kt
│   │   │   │   ├── binary_tree.kt
│   │   │   │   ├── binary_tree_bfs.kt
│   │   │   │   └── binary_tree_dfs.kt
│   │   │   └── utils/
│   │   │       ├── ListNode.kt
│   │   │       ├── PrintUtil.kt
│   │   │       ├── TreeNode.kt
│   │   │       └── Vertex.kt
│   │   ├── python/
│   │   │   ├── .gitignore
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.py
│   │   │   │   ├── linked_list.py
│   │   │   │   ├── list.py
│   │   │   │   └── my_list.py
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.py
│   │   │   │   ├── permutations_i.py
│   │   │   │   ├── permutations_ii.py
│   │   │   │   ├── preorder_traversal_i_compact.py
│   │   │   │   ├── preorder_traversal_ii_compact.py
│   │   │   │   ├── preorder_traversal_iii_compact.py
│   │   │   │   ├── preorder_traversal_iii_template.py
│   │   │   │   ├── subset_sum_i.py
│   │   │   │   ├── subset_sum_i_naive.py
│   │   │   │   └── subset_sum_ii.py
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.py
│   │   │   │   ├── recursion.py
│   │   │   │   ├── space_complexity.py
│   │   │   │   ├── time_complexity.py
│   │   │   │   └── worst_best_time_complexity.py
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.py
│   │   │   │   ├── build_tree.py
│   │   │   │   └── hanota.py
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.py
│   │   │   │   ├── climbing_stairs_constraint_dp.py
│   │   │   │   ├── climbing_stairs_dfs.py
│   │   │   │   ├── climbing_stairs_dfs_mem.py
│   │   │   │   ├── climbing_stairs_dp.py
│   │   │   │   ├── coin_change.py
│   │   │   │   ├── coin_change_ii.py
│   │   │   │   ├── edit_distance.py
│   │   │   │   ├── knapsack.py
│   │   │   │   ├── min_cost_climbing_stairs_dp.py
│   │   │   │   ├── min_path_sum.py
│   │   │   │   └── unbounded_knapsack.py
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.py
│   │   │   │   ├── graph_adjacency_matrix.py
│   │   │   │   ├── graph_bfs.py
│   │   │   │   └── graph_dfs.py
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.py
│   │   │   │   ├── fractional_knapsack.py
│   │   │   │   ├── max_capacity.py
│   │   │   │   └── max_product_cutting.py
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.py
│   │   │   │   ├── built_in_hash.py
│   │   │   │   ├── hash_map.py
│   │   │   │   ├── hash_map_chaining.py
│   │   │   │   ├── hash_map_open_addressing.py
│   │   │   │   └── simple_hash.py
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.py
│   │   │   │   ├── my_heap.py
│   │   │   │   └── top_k.py
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.py
│   │   │   │   ├── binary_search_edge.py
│   │   │   │   ├── binary_search_insertion.py
│   │   │   │   ├── hashing_search.py
│   │   │   │   ├── linear_search.py
│   │   │   │   └── two_sum.py
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.py
│   │   │   │   ├── bucket_sort.py
│   │   │   │   ├── counting_sort.py
│   │   │   │   ├── heap_sort.py
│   │   │   │   ├── insertion_sort.py
│   │   │   │   ├── merge_sort.py
│   │   │   │   ├── quick_sort.py
│   │   │   │   ├── radix_sort.py
│   │   │   │   └── selection_sort.py
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.py
│   │   │   │   ├── array_queue.py
│   │   │   │   ├── array_stack.py
│   │   │   │   ├── deque.py
│   │   │   │   ├── linkedlist_deque.py
│   │   │   │   ├── linkedlist_queue.py
│   │   │   │   ├── linkedlist_stack.py
│   │   │   │   ├── queue.py
│   │   │   │   └── stack.py
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.py
│   │   │   │   ├── avl_tree.py
│   │   │   │   ├── binary_search_tree.py
│   │   │   │   ├── binary_tree.py
│   │   │   │   ├── binary_tree_bfs.py
│   │   │   │   └── binary_tree_dfs.py
│   │   │   ├── modules/
│   │   │   │   ├── __init__.py
│   │   │   │   ├── list_node.py
│   │   │   │   ├── print_util.py
│   │   │   │   ├── tree_node.py
│   │   │   │   └── vertex.py
│   │   │   └── test_all.py
│   │   ├── pythontutor/
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.md
│   │   │   │   ├── linked_list.md
│   │   │   │   └── my_list.md
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.md
│   │   │   │   ├── permutations_i.md
│   │   │   │   ├── permutations_ii.md
│   │   │   │   ├── preorder_traversal_i_compact.md
│   │   │   │   ├── preorder_traversal_ii_compact.md
│   │   │   │   ├── preorder_traversal_iii_compact.md
│   │   │   │   ├── preorder_traversal_iii_template.md
│   │   │   │   ├── subset_sum_i.md
│   │   │   │   ├── subset_sum_i_naive.md
│   │   │   │   └── subset_sum_ii.md
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.md
│   │   │   │   ├── recursion.md
│   │   │   │   ├── space_complexity.md
│   │   │   │   ├── time_complexity.md
│   │   │   │   └── worst_best_time_complexity.md
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.md
│   │   │   │   ├── build_tree.md
│   │   │   │   └── hanota.md
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.md
│   │   │   │   ├── climbing_stairs_constraint_dp.md
│   │   │   │   ├── climbing_stairs_dfs.md
│   │   │   │   ├── climbing_stairs_dfs_mem.md
│   │   │   │   ├── climbing_stairs_dp.md
│   │   │   │   ├── coin_change.md
│   │   │   │   ├── coin_change_ii.md
│   │   │   │   ├── edit_distance.md
│   │   │   │   ├── knapsack.md
│   │   │   │   ├── min_cost_climbing_stairs_dp.md
│   │   │   │   ├── min_path_sum.md
│   │   │   │   └── unbounded_knapsack.md
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.md
│   │   │   │   ├── graph_adjacency_matrix.md
│   │   │   │   ├── graph_bfs.md
│   │   │   │   └── graph_dfs.md
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.md
│   │   │   │   ├── fractional_knapsack.md
│   │   │   │   ├── max_capacity.md
│   │   │   │   └── max_product_cutting.md
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.md
│   │   │   │   ├── hash_map_chaining.md
│   │   │   │   └── simple_hash.md
│   │   │   ├── chapter_heap/
│   │   │   │   ├── my_heap.md
│   │   │   │   └── top_k.md
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.md
│   │   │   │   ├── binary_search_edge.md
│   │   │   │   ├── binary_search_insertion.md
│   │   │   │   └── two_sum.md
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.md
│   │   │   │   ├── bucket_sort.md
│   │   │   │   ├── counting_sort.md
│   │   │   │   ├── heap_sort.md
│   │   │   │   ├── insertion_sort.md
│   │   │   │   ├── merge_sort.md
│   │   │   │   ├── quick_sort.md
│   │   │   │   ├── radix_sort.md
│   │   │   │   └── selection_sort.md
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_queue.md
│   │   │   │   ├── array_stack.md
│   │   │   │   ├── linkedlist_queue.md
│   │   │   │   └── linkedlist_stack.md
│   │   │   └── chapter_tree/
│   │   │       ├── array_binary_tree.md
│   │   │       ├── binary_search_tree.md
│   │   │       ├── binary_tree_bfs.md
│   │   │       └── binary_tree_dfs.md
│   │   ├── ruby/
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.rb
│   │   │   │   ├── linked_list.rb
│   │   │   │   ├── list.rb
│   │   │   │   └── my_list.rb
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.rb
│   │   │   │   ├── permutations_i.rb
│   │   │   │   ├── permutations_ii.rb
│   │   │   │   ├── preorder_traversal_i_compact.rb
│   │   │   │   ├── preorder_traversal_ii_compact.rb
│   │   │   │   ├── preorder_traversal_iii_compact.rb
│   │   │   │   ├── preorder_traversal_iii_template.rb
│   │   │   │   ├── subset_sum_i.rb
│   │   │   │   ├── subset_sum_i_naive.rb
│   │   │   │   └── subset_sum_ii.rb
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.rb
│   │   │   │   ├── recursion.rb
│   │   │   │   ├── space_complexity.rb
│   │   │   │   ├── time_complexity.rb
│   │   │   │   └── worst_best_time_complexity.rb
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.rb
│   │   │   │   ├── build_tree.rb
│   │   │   │   └── hanota.rb
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.rb
│   │   │   │   ├── climbing_stairs_constraint_dp.rb
│   │   │   │   ├── climbing_stairs_dfs.rb
│   │   │   │   ├── climbing_stairs_dfs_mem.rb
│   │   │   │   ├── climbing_stairs_dp.rb
│   │   │   │   ├── coin_change.rb
│   │   │   │   ├── coin_change_ii.rb
│   │   │   │   ├── edit_distance.rb
│   │   │   │   ├── knapsack.rb
│   │   │   │   ├── min_cost_climbing_stairs_dp.rb
│   │   │   │   ├── min_path_sum.rb
│   │   │   │   └── unbounded_knapsack.rb
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.rb
│   │   │   │   ├── graph_adjacency_matrix.rb
│   │   │   │   ├── graph_bfs.rb
│   │   │   │   └── graph_dfs.rb
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.rb
│   │   │   │   ├── fractional_knapsack.rb
│   │   │   │   ├── max_capacity.rb
│   │   │   │   └── max_product_cutting.rb
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.rb
│   │   │   │   ├── built_in_hash.rb
│   │   │   │   ├── hash_map.rb
│   │   │   │   ├── hash_map_chaining.rb
│   │   │   │   ├── hash_map_open_addressing.rb
│   │   │   │   └── simple_hash.rb
│   │   │   ├── chapter_heap/
│   │   │   │   ├── my_heap.rb
│   │   │   │   └── top_k.rb
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.rb
│   │   │   │   ├── binary_search_edge.rb
│   │   │   │   ├── binary_search_insertion.rb
│   │   │   │   ├── hashing_search.rb
│   │   │   │   ├── linear_search.rb
│   │   │   │   └── two_sum.rb
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.rb
│   │   │   │   ├── bucket_sort.rb
│   │   │   │   ├── counting_sort.rb
│   │   │   │   ├── heap_sort.rb
│   │   │   │   ├── insertion_sort.rb
│   │   │   │   ├── merge_sort.rb
│   │   │   │   ├── quick_sort.rb
│   │   │   │   ├── radix_sort.rb
│   │   │   │   └── selection_sort.rb
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.rb
│   │   │   │   ├── array_queue.rb
│   │   │   │   ├── array_stack.rb
│   │   │   │   ├── deque.rb
│   │   │   │   ├── linkedlist_deque.rb
│   │   │   │   ├── linkedlist_queue.rb
│   │   │   │   ├── linkedlist_stack.rb
│   │   │   │   ├── queue.rb
│   │   │   │   └── stack.rb
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.rb
│   │   │   │   ├── avl_tree.rb
│   │   │   │   ├── binary_search_tree.rb
│   │   │   │   ├── binary_tree.rb
│   │   │   │   ├── binary_tree_bfs.rb
│   │   │   │   └── binary_tree_dfs.rb
│   │   │   ├── test_all.rb
│   │   │   └── utils/
│   │   │       ├── list_node.rb
│   │   │       ├── print_util.rb
│   │   │       ├── tree_node.rb
│   │   │       └── vertex.rb
│   │   ├── rust/
│   │   │   ├── .gitignore
│   │   │   ├── Cargo.toml
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.rs
│   │   │   │   ├── linked_list.rs
│   │   │   │   ├── list.rs
│   │   │   │   └── my_list.rs
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.rs
│   │   │   │   ├── permutations_i.rs
│   │   │   │   ├── permutations_ii.rs
│   │   │   │   ├── preorder_traversal_i_compact.rs
│   │   │   │   ├── preorder_traversal_ii_compact.rs
│   │   │   │   ├── preorder_traversal_iii_compact.rs
│   │   │   │   ├── preorder_traversal_iii_template.rs
│   │   │   │   ├── subset_sum_i.rs
│   │   │   │   ├── subset_sum_i_naive.rs
│   │   │   │   └── subset_sum_ii.rs
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.rs
│   │   │   │   ├── recursion.rs
│   │   │   │   ├── space_complexity.rs
│   │   │   │   ├── time_complexity.rs
│   │   │   │   └── worst_best_time_complexity.rs
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.rs
│   │   │   │   ├── build_tree.rs
│   │   │   │   └── hanota.rs
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.rs
│   │   │   │   ├── climbing_stairs_constraint_dp.rs
│   │   │   │   ├── climbing_stairs_dfs.rs
│   │   │   │   ├── climbing_stairs_dfs_mem.rs
│   │   │   │   ├── climbing_stairs_dp.rs
│   │   │   │   ├── coin_change.rs
│   │   │   │   ├── coin_change_ii.rs
│   │   │   │   ├── edit_distance.rs
│   │   │   │   ├── knapsack.rs
│   │   │   │   ├── min_cost_climbing_stairs_dp.rs
│   │   │   │   ├── min_path_sum.rs
│   │   │   │   └── unbounded_knapsack.rs
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.rs
│   │   │   │   ├── graph_adjacency_matrix.rs
│   │   │   │   ├── graph_bfs.rs
│   │   │   │   └── graph_dfs.rs
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.rs
│   │   │   │   ├── fractional_knapsack.rs
│   │   │   │   ├── max_capacity.rs
│   │   │   │   └── max_product_cutting.rs
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.rs
│   │   │   │   ├── build_in_hash.rs
│   │   │   │   ├── hash_map.rs
│   │   │   │   ├── hash_map_chaining.rs
│   │   │   │   ├── hash_map_open_addressing.rs
│   │   │   │   └── simple_hash.rs
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.rs
│   │   │   │   ├── my_heap.rs
│   │   │   │   └── top_k.rs
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.rs
│   │   │   │   ├── binary_search_edge.rs
│   │   │   │   ├── binary_search_insertion.rs
│   │   │   │   ├── hashing_search.rs
│   │   │   │   ├── linear_search.rs
│   │   │   │   └── two_sum.rs
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.rs
│   │   │   │   ├── bucket_sort.rs
│   │   │   │   ├── counting_sort.rs
│   │   │   │   ├── heap_sort.rs
│   │   │   │   ├── insertion_sort.rs
│   │   │   │   ├── merge_sort.rs
│   │   │   │   ├── quick_sort.rs
│   │   │   │   ├── radix_sort.rs
│   │   │   │   └── selection_sort.rs
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.rs
│   │   │   │   ├── array_queue.rs
│   │   │   │   ├── array_stack.rs
│   │   │   │   ├── deque.rs
│   │   │   │   ├── linkedlist_deque.rs
│   │   │   │   ├── linkedlist_queue.rs
│   │   │   │   ├── linkedlist_stack.rs
│   │   │   │   ├── queue.rs
│   │   │   │   └── stack.rs
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.rs
│   │   │   │   ├── avl_tree.rs
│   │   │   │   ├── binary_search_tree.rs
│   │   │   │   ├── binary_tree.rs
│   │   │   │   ├── binary_tree_bfs.rs
│   │   │   │   └── binary_tree_dfs.rs
│   │   │   └── src/
│   │   │       ├── include/
│   │   │       │   ├── list_node.rs
│   │   │       │   ├── mod.rs
│   │   │       │   ├── print_util.rs
│   │   │       │   ├── tree_node.rs
│   │   │       │   └── vertex.rs
│   │   │       └── lib.rs
│   │   ├── swift/
│   │   │   ├── .gitignore
│   │   │   ├── Package.resolved
│   │   │   ├── Package.swift
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.swift
│   │   │   │   ├── linked_list.swift
│   │   │   │   ├── list.swift
│   │   │   │   └── my_list.swift
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.swift
│   │   │   │   ├── permutations_i.swift
│   │   │   │   ├── permutations_ii.swift
│   │   │   │   ├── preorder_traversal_i_compact.swift
│   │   │   │   ├── preorder_traversal_ii_compact.swift
│   │   │   │   ├── preorder_traversal_iii_compact.swift
│   │   │   │   ├── preorder_traversal_iii_template.swift
│   │   │   │   ├── subset_sum_i.swift
│   │   │   │   ├── subset_sum_i_naive.swift
│   │   │   │   └── subset_sum_ii.swift
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.swift
│   │   │   │   ├── recursion.swift
│   │   │   │   ├── space_complexity.swift
│   │   │   │   ├── time_complexity.swift
│   │   │   │   └── worst_best_time_complexity.swift
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.swift
│   │   │   │   ├── build_tree.swift
│   │   │   │   └── hanota.swift
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.swift
│   │   │   │   ├── climbing_stairs_constraint_dp.swift
│   │   │   │   ├── climbing_stairs_dfs.swift
│   │   │   │   ├── climbing_stairs_dfs_mem.swift
│   │   │   │   ├── climbing_stairs_dp.swift
│   │   │   │   ├── coin_change.swift
│   │   │   │   ├── coin_change_ii.swift
│   │   │   │   ├── edit_distance.swift
│   │   │   │   ├── knapsack.swift
│   │   │   │   ├── min_cost_climbing_stairs_dp.swift
│   │   │   │   ├── min_path_sum.swift
│   │   │   │   └── unbounded_knapsack.swift
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.swift
│   │   │   │   ├── graph_adjacency_list_target.swift
│   │   │   │   ├── graph_adjacency_matrix.swift
│   │   │   │   ├── graph_bfs.swift
│   │   │   │   └── graph_dfs.swift
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.swift
│   │   │   │   ├── fractional_knapsack.swift
│   │   │   │   ├── max_capacity.swift
│   │   │   │   └── max_product_cutting.swift
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.swift
│   │   │   │   ├── built_in_hash.swift
│   │   │   │   ├── hash_map.swift
│   │   │   │   ├── hash_map_chaining.swift
│   │   │   │   ├── hash_map_open_addressing.swift
│   │   │   │   └── simple_hash.swift
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.swift
│   │   │   │   ├── my_heap.swift
│   │   │   │   └── top_k.swift
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.swift
│   │   │   │   ├── binary_search_edge.swift
│   │   │   │   ├── binary_search_insertion.swift
│   │   │   │   ├── binary_search_insertion_target.swift
│   │   │   │   ├── hashing_search.swift
│   │   │   │   ├── linear_search.swift
│   │   │   │   └── two_sum.swift
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.swift
│   │   │   │   ├── bucket_sort.swift
│   │   │   │   ├── counting_sort.swift
│   │   │   │   ├── heap_sort.swift
│   │   │   │   ├── insertion_sort.swift
│   │   │   │   ├── merge_sort.swift
│   │   │   │   ├── quick_sort.swift
│   │   │   │   ├── radix_sort.swift
│   │   │   │   └── selection_sort.swift
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.swift
│   │   │   │   ├── array_queue.swift
│   │   │   │   ├── array_stack.swift
│   │   │   │   ├── deque.swift
│   │   │   │   ├── linkedlist_deque.swift
│   │   │   │   ├── linkedlist_queue.swift
│   │   │   │   ├── linkedlist_stack.swift
│   │   │   │   ├── queue.swift
│   │   │   │   └── stack.swift
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.swift
│   │   │   │   ├── avl_tree.swift
│   │   │   │   ├── binary_search_tree.swift
│   │   │   │   ├── binary_tree.swift
│   │   │   │   ├── binary_tree_bfs.swift
│   │   │   │   └── binary_tree_dfs.swift
│   │   │   └── utils/
│   │   │       ├── ListNode.swift
│   │   │       ├── Pair.swift
│   │   │       ├── PrintUtil.swift
│   │   │       ├── TreeNode.swift
│   │   │       └── Vertex.swift
│   │   ├── typescript/
│   │   │   ├── .gitignore
│   │   │   ├── .prettierrc
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.ts
│   │   │   │   ├── linked_list.ts
│   │   │   │   ├── list.ts
│   │   │   │   └── my_list.ts
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.ts
│   │   │   │   ├── permutations_i.ts
│   │   │   │   ├── permutations_ii.ts
│   │   │   │   ├── preorder_traversal_i_compact.ts
│   │   │   │   ├── preorder_traversal_ii_compact.ts
│   │   │   │   ├── preorder_traversal_iii_compact.ts
│   │   │   │   ├── preorder_traversal_iii_template.ts
│   │   │   │   ├── subset_sum_i.ts
│   │   │   │   ├── subset_sum_i_naive.ts
│   │   │   │   └── subset_sum_ii.ts
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.ts
│   │   │   │   ├── recursion.ts
│   │   │   │   ├── space_complexity.ts
│   │   │   │   ├── time_complexity.ts
│   │   │   │   └── worst_best_time_complexity.ts
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.ts
│   │   │   │   ├── build_tree.ts
│   │   │   │   └── hanota.ts
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.ts
│   │   │   │   ├── climbing_stairs_constraint_dp.ts
│   │   │   │   ├── climbing_stairs_dfs.ts
│   │   │   │   ├── climbing_stairs_dfs_mem.ts
│   │   │   │   ├── climbing_stairs_dp.ts
│   │   │   │   ├── coin_change.ts
│   │   │   │   ├── coin_change_ii.ts
│   │   │   │   ├── edit_distance.ts
│   │   │   │   ├── knapsack.ts
│   │   │   │   ├── min_cost_climbing_stairs_dp.ts
│   │   │   │   ├── min_path_sum.ts
│   │   │   │   └── unbounded_knapsack.ts
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.ts
│   │   │   │   ├── graph_adjacency_matrix.ts
│   │   │   │   ├── graph_bfs.ts
│   │   │   │   └── graph_dfs.ts
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.ts
│   │   │   │   ├── fractional_knapsack.ts
│   │   │   │   ├── max_capacity.ts
│   │   │   │   └── max_product_cutting.ts
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.ts
│   │   │   │   ├── hash_map.ts
│   │   │   │   ├── hash_map_chaining.ts
│   │   │   │   ├── hash_map_open_addressing.ts
│   │   │   │   └── simple_hash.ts
│   │   │   ├── chapter_heap/
│   │   │   │   ├── my_heap.ts
│   │   │   │   └── top_k.ts
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.ts
│   │   │   │   ├── binary_search_edge.ts
│   │   │   │   ├── binary_search_insertion.ts
│   │   │   │   ├── hashing_search.ts
│   │   │   │   ├── linear_search.ts
│   │   │   │   └── two_sum.ts
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.ts
│   │   │   │   ├── bucket_sort.ts
│   │   │   │   ├── counting_sort.ts
│   │   │   │   ├── heap_sort.ts
│   │   │   │   ├── insertion_sort.ts
│   │   │   │   ├── merge_sort.ts
│   │   │   │   ├── quick_sort.ts
│   │   │   │   ├── radix_sort.ts
│   │   │   │   └── selection_sort.ts
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.ts
│   │   │   │   ├── array_queue.ts
│   │   │   │   ├── array_stack.ts
│   │   │   │   ├── deque.ts
│   │   │   │   ├── linkedlist_deque.ts
│   │   │   │   ├── linkedlist_queue.ts
│   │   │   │   ├── linkedlist_stack.ts
│   │   │   │   ├── queue.ts
│   │   │   │   └── stack.ts
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.ts
│   │   │   │   ├── avl_tree.ts
│   │   │   │   ├── binary_search_tree.ts
│   │   │   │   ├── binary_tree.ts
│   │   │   │   ├── binary_tree_bfs.ts
│   │   │   │   └── binary_tree_dfs.ts
│   │   │   ├── modules/
│   │   │   │   ├── ListNode.ts
│   │   │   │   ├── PrintUtil.ts
│   │   │   │   ├── TreeNode.ts
│   │   │   │   └── Vertex.ts
│   │   │   ├── package.json
│   │   │   └── tsconfig.json
│   │   └── zig/
│   │       ├── .gitignore
│   │       ├── build.zig
│   │       ├── chapter_array_and_linkedlist/
│   │       │   ├── array.zig
│   │       │   ├── linked_list.zig
│   │       │   ├── list.zig
│   │       │   └── my_list.zig
│   │       ├── chapter_computational_complexity/
│   │       │   ├── iteration.zig
│   │       │   ├── recursion.zig
│   │       │   ├── space_complexity.zig
│   │       │   ├── time_complexity.zig
│   │       │   └── worst_best_time_complexity.zig
│   │       ├── chapter_dynamic_programming/
│   │       │   ├── climbing_stairs_backtrack.zig
│   │       │   ├── climbing_stairs_constraint_dp.zig
│   │       │   ├── climbing_stairs_dfs.zig
│   │       │   ├── climbing_stairs_dfs_mem.zig
│   │       │   ├── climbing_stairs_dp.zig
│   │       │   ├── coin_change.zig
│   │       │   ├── coin_change_ii.zig
│   │       │   ├── edit_distance.zig
│   │       │   ├── knapsack.zig
│   │       │   ├── min_cost_climbing_stairs_dp.zig
│   │       │   ├── min_path_sum.zig
│   │       │   └── unbounded_knapsack.zig
│   │       ├── chapter_hashing/
│   │       │   ├── array_hash_map.zig
│   │       │   └── hash_map.zig
│   │       ├── chapter_heap/
│   │       │   ├── heap.zig
│   │       │   └── my_heap.zig
│   │       ├── chapter_searching/
│   │       │   ├── binary_search.zig
│   │       │   ├── hashing_search.zig
│   │       │   ├── linear_search.zig
│   │       │   └── two_sum.zig
│   │       ├── chapter_sorting/
│   │       │   ├── bubble_sort.zig
│   │       │   ├── insertion_sort.zig
│   │       │   ├── merge_sort.zig
│   │       │   ├── quick_sort.zig
│   │       │   └── radix_sort.zig
│   │       ├── chapter_stack_and_queue/
│   │       │   ├── array_queue.zig
│   │       │   ├── array_stack.zig
│   │       │   ├── deque.zig
│   │       │   ├── linkedlist_deque.zig
│   │       │   ├── linkedlist_queue.zig
│   │       │   ├── linkedlist_stack.zig
│   │       │   ├── queue.zig
│   │       │   └── stack.zig
│   │       ├── chapter_tree/
│   │       │   ├── avl_tree.zig
│   │       │   ├── binary_search_tree.zig
│   │       │   ├── binary_tree.zig
│   │       │   ├── binary_tree_bfs.zig
│   │       │   └── binary_tree_dfs.zig
│   │       ├── include/
│   │       │   ├── PrintUtil.zig
│   │       │   └── include.zig
│   │       ├── main.zig
│   │       └── utils/
│   │           ├── ListNode.zig
│   │           ├── TreeNode.zig
│   │           ├── format.zig
│   │           └── utils.zig
│   ├── docs/
│   │   ├── chapter_appendix/
│   │   │   ├── contribution.md
│   │   │   ├── index.md
│   │   │   ├── installation.md
│   │   │   └── terminology.md
│   │   ├── chapter_array_and_linkedlist/
│   │   │   ├── array.md
│   │   │   ├── index.md
│   │   │   ├── linked_list.md
│   │   │   ├── list.md
│   │   │   ├── ram_and_cache.md
│   │   │   └── summary.md
│   │   ├── chapter_backtracking/
│   │   │   ├── backtracking_algorithm.md
│   │   │   ├── index.md
│   │   │   ├── n_queens_problem.md
│   │   │   ├── permutations_problem.md
│   │   │   ├── subset_sum_problem.md
│   │   │   └── summary.md
│   │   ├── chapter_computational_complexity/
│   │   │   ├── index.md
│   │   │   ├── iteration_and_recursion.md
│   │   │   ├── performance_evaluation.md
│   │   │   ├── space_complexity.md
│   │   │   ├── summary.md
│   │   │   └── time_complexity.md
│   │   ├── chapter_data_structure/
│   │   │   ├── basic_data_types.md
│   │   │   ├── character_encoding.md
│   │   │   ├── classification_of_data_structure.md
│   │   │   ├── index.md
│   │   │   ├── number_encoding.md
│   │   │   └── summary.md
│   │   ├── chapter_divide_and_conquer/
│   │   │   ├── binary_search_recur.md
│   │   │   ├── build_binary_tree_problem.md
│   │   │   ├── divide_and_conquer.md
│   │   │   ├── hanota_problem.md
│   │   │   ├── index.md
│   │   │   └── summary.md
│   │   ├── chapter_dynamic_programming/
│   │   │   ├── dp_problem_features.md
│   │   │   ├── dp_solution_pipeline.md
│   │   │   ├── edit_distance_problem.md
│   │   │   ├── index.md
│   │   │   ├── intro_to_dynamic_programming.md
│   │   │   ├── knapsack_problem.md
│   │   │   ├── summary.md
│   │   │   └── unbounded_knapsack_problem.md
│   │   ├── chapter_graph/
│   │   │   ├── graph.md
│   │   │   ├── graph_operations.md
│   │   │   ├── graph_traversal.md
│   │   │   ├── index.md
│   │   │   └── summary.md
│   │   ├── chapter_greedy/
│   │   │   ├── fractional_knapsack_problem.md
│   │   │   ├── greedy_algorithm.md
│   │   │   ├── index.md
│   │   │   ├── max_capacity_problem.md
│   │   │   ├── max_product_cutting_problem.md
│   │   │   └── summary.md
│   │   ├── chapter_hashing/
│   │   │   ├── hash_algorithm.md
│   │   │   ├── hash_collision.md
│   │   │   ├── hash_map.md
│   │   │   ├── index.md
│   │   │   └── summary.md
│   │   ├── chapter_heap/
│   │   │   ├── build_heap.md
│   │   │   ├── heap.md
│   │   │   ├── index.md
│   │   │   ├── summary.md
│   │   │   └── top_k.md
│   │   ├── chapter_hello_algo/
│   │   │   └── index.md
│   │   ├── chapter_introduction/
│   │   │   ├── algorithms_are_everywhere.md
│   │   │   ├── index.md
│   │   │   ├── summary.md
│   │   │   └── what_is_dsa.md
│   │   ├── chapter_paperbook/
│   │   │   └── index.md
│   │   ├── chapter_preface/
│   │   │   ├── about_the_book.md
│   │   │   ├── index.md
│   │   │   ├── suggestions.md
│   │   │   └── summary.md
│   │   ├── chapter_reference/
│   │   │   └── index.md
│   │   ├── chapter_searching/
│   │   │   ├── binary_search.md
│   │   │   ├── binary_search_edge.md
│   │   │   ├── binary_search_insertion.md
│   │   │   ├── index.md
│   │   │   ├── replace_linear_by_hashing.md
│   │   │   ├── searching_algorithm_revisited.md
│   │   │   └── summary.md
│   │   ├── chapter_sorting/
│   │   │   ├── bubble_sort.md
│   │   │   ├── bucket_sort.md
│   │   │   ├── counting_sort.md
│   │   │   ├── heap_sort.md
│   │   │   ├── index.md
│   │   │   ├── insertion_sort.md
│   │   │   ├── merge_sort.md
│   │   │   ├── quick_sort.md
│   │   │   ├── radix_sort.md
│   │   │   ├── selection_sort.md
│   │   │   ├── sorting_algorithm.md
│   │   │   └── summary.md
│   │   ├── chapter_stack_and_queue/
│   │   │   ├── deque.md
│   │   │   ├── index.md
│   │   │   ├── queue.md
│   │   │   ├── stack.md
│   │   │   └── summary.md
│   │   ├── chapter_tree/
│   │   │   ├── array_representation_of_tree.md
│   │   │   ├── avl_tree.md
│   │   │   ├── binary_search_tree.md
│   │   │   ├── binary_tree.md
│   │   │   ├── binary_tree_traversal.md
│   │   │   ├── index.md
│   │   │   └── summary.md
│   │   ├── index.html
│   │   └── index.md
│   └── mkdocs.yml
├── mkdocs.yml
├── overrides/
│   ├── javascripts/
│   │   ├── katex.js
│   │   ├── mathjax.js
│   │   └── starfield.js
│   ├── main.html
│   ├── partials/
│   │   ├── LICENSE
│   │   ├── actions.html
│   │   ├── comments.html
│   │   └── content.html
│   ├── stylesheets/
│   │   ├── extra.css
│   │   ├── giscus-dark.css
│   │   └── giscus-light.css
│   └── zensical/
│       ├── javascripts/
│       │   └── animation_player.js
│       ├── stylesheets/
│       │   ├── animation_player.css
│       │   └── extra.css
│       └── zensical.toml
├── ru/
│   ├── README.md
│   ├── codes/
│   │   ├── Dockerfile
│   │   ├── c/
│   │   │   ├── .gitignore
│   │   │   ├── CMakeLists.txt
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array.c
│   │   │   │   ├── linked_list.c
│   │   │   │   └── my_list.c
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── n_queens.c
│   │   │   │   ├── permutations_i.c
│   │   │   │   ├── permutations_ii.c
│   │   │   │   ├── preorder_traversal_i_compact.c
│   │   │   │   ├── preorder_traversal_ii_compact.c
│   │   │   │   ├── preorder_traversal_iii_compact.c
│   │   │   │   ├── preorder_traversal_iii_template.c
│   │   │   │   ├── subset_sum_i.c
│   │   │   │   ├── subset_sum_i_naive.c
│   │   │   │   └── subset_sum_ii.c
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── iteration.c
│   │   │   │   ├── recursion.c
│   │   │   │   ├── space_complexity.c
│   │   │   │   ├── time_complexity.c
│   │   │   │   └── worst_best_time_complexity.c
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search_recur.c
│   │   │   │   ├── build_tree.c
│   │   │   │   └── hanota.c
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── climbing_stairs_backtrack.c
│   │   │   │   ├── climbing_stairs_constraint_dp.c
│   │   │   │   ├── climbing_stairs_dfs.c
│   │   │   │   ├── climbing_stairs_dfs_mem.c
│   │   │   │   ├── climbing_stairs_dp.c
│   │   │   │   ├── coin_change.c
│   │   │   │   ├── coin_change_ii.c
│   │   │   │   ├── edit_distance.c
│   │   │   │   ├── knapsack.c
│   │   │   │   ├── min_cost_climbing_stairs_dp.c
│   │   │   │   ├── min_path_sum.c
│   │   │   │   └── unbounded_knapsack.c
│   │   │   ├── chapter_graph/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── graph_adjacency_list.c
│   │   │   │   ├── graph_adjacency_list_test.c
│   │   │   │   ├── graph_adjacency_matrix.c
│   │   │   │   ├── graph_bfs.c
│   │   │   │   └── graph_dfs.c
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── coin_change_greedy.c
│   │   │   │   ├── fractional_knapsack.c
│   │   │   │   ├── max_capacity.c
│   │   │   │   └── max_product_cutting.c
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_hash_map.c
│   │   │   │   ├── hash_map_chaining.c
│   │   │   │   ├── hash_map_open_addressing.c
│   │   │   │   └── simple_hash.c
│   │   │   ├── chapter_heap/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── my_heap.c
│   │   │   │   ├── my_heap_test.c
│   │   │   │   └── top_k.c
│   │   │   ├── chapter_searching/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search.c
│   │   │   │   ├── binary_search_edge.c
│   │   │   │   ├── binary_search_insertion.c
│   │   │   │   └── two_sum.c
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── bubble_sort.c
│   │   │   │   ├── bucket_sort.c
│   │   │   │   ├── counting_sort.c
│   │   │   │   ├── heap_sort.c
│   │   │   │   ├── insertion_sort.c
│   │   │   │   ├── merge_sort.c
│   │   │   │   ├── quick_sort.c
│   │   │   │   ├── radix_sort.c
│   │   │   │   └── selection_sort.c
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_deque.c
│   │   │   │   ├── array_queue.c
│   │   │   │   ├── array_stack.c
│   │   │   │   ├── linkedlist_deque.c
│   │   │   │   ├── linkedlist_queue.c
│   │   │   │   └── linkedlist_stack.c
│   │   │   ├── chapter_tree/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_binary_tree.c
│   │   │   │   ├── avl_tree.c
│   │   │   │   ├── binary_search_tree.c
│   │   │   │   ├── binary_tree.c
│   │   │   │   ├── binary_tree_bfs.c
│   │   │   │   └── binary_tree_dfs.c
│   │   │   └── utils/
│   │   │       ├── CMakeLists.txt
│   │   │       ├── common.h
│   │   │       ├── common_test.c
│   │   │       ├── list_node.h
│   │   │       ├── print_util.h
│   │   │       ├── tree_node.h
│   │   │       ├── uthash.h
│   │   │       ├── vector.h
│   │   │       └── vertex.h
│   │   ├── cpp/
│   │   │   ├── .gitignore
│   │   │   ├── CMakeLists.txt
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array.cpp
│   │   │   │   ├── linked_list.cpp
│   │   │   │   ├── list.cpp
│   │   │   │   └── my_list.cpp
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── n_queens.cpp
│   │   │   │   ├── permutations_i.cpp
│   │   │   │   ├── permutations_ii.cpp
│   │   │   │   ├── preorder_traversal_i_compact.cpp
│   │   │   │   ├── preorder_traversal_ii_compact.cpp
│   │   │   │   ├── preorder_traversal_iii_compact.cpp
│   │   │   │   ├── preorder_traversal_iii_template.cpp
│   │   │   │   ├── subset_sum_i.cpp
│   │   │   │   ├── subset_sum_i_naive.cpp
│   │   │   │   └── subset_sum_ii.cpp
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── iteration.cpp
│   │   │   │   ├── recursion.cpp
│   │   │   │   ├── space_complexity.cpp
│   │   │   │   ├── time_complexity.cpp
│   │   │   │   └── worst_best_time_complexity.cpp
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search_recur.cpp
│   │   │   │   ├── build_tree.cpp
│   │   │   │   └── hanota.cpp
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── climbing_stairs_backtrack.cpp
│   │   │   │   ├── climbing_stairs_constraint_dp.cpp
│   │   │   │   ├── climbing_stairs_dfs.cpp
│   │   │   │   ├── climbing_stairs_dfs_mem.cpp
│   │   │   │   ├── climbing_stairs_dp.cpp
│   │   │   │   ├── coin_change.cpp
│   │   │   │   ├── coin_change_ii.cpp
│   │   │   │   ├── edit_distance.cpp
│   │   │   │   ├── knapsack.cpp
│   │   │   │   ├── min_cost_climbing_stairs_dp.cpp
│   │   │   │   ├── min_path_sum.cpp
│   │   │   │   └── unbounded_knapsack.cpp
│   │   │   ├── chapter_graph/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── graph_adjacency_list.cpp
│   │   │   │   ├── graph_adjacency_list_test.cpp
│   │   │   │   ├── graph_adjacency_matrix.cpp
│   │   │   │   ├── graph_bfs.cpp
│   │   │   │   └── graph_dfs.cpp
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── coin_change_greedy.cpp
│   │   │   │   ├── fractional_knapsack.cpp
│   │   │   │   ├── max_capacity.cpp
│   │   │   │   └── max_product_cutting.cpp
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_hash_map.cpp
│   │   │   │   ├── array_hash_map_test.cpp
│   │   │   │   ├── built_in_hash.cpp
│   │   │   │   ├── hash_map.cpp
│   │   │   │   ├── hash_map_chaining.cpp
│   │   │   │   ├── hash_map_open_addressing.cpp
│   │   │   │   └── simple_hash.cpp
│   │   │   ├── chapter_heap/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── heap.cpp
│   │   │   │   ├── my_heap.cpp
│   │   │   │   └── top_k.cpp
│   │   │   ├── chapter_searching/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── binary_search.cpp
│   │   │   │   ├── binary_search_edge.cpp
│   │   │   │   ├── binary_search_insertion.cpp
│   │   │   │   ├── hashing_search.cpp
│   │   │   │   ├── linear_search.cpp
│   │   │   │   └── two_sum.cpp
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── bubble_sort.cpp
│   │   │   │   ├── bucket_sort.cpp
│   │   │   │   ├── counting_sort.cpp
│   │   │   │   ├── heap_sort.cpp
│   │   │   │   ├── insertion_sort.cpp
│   │   │   │   ├── merge_sort.cpp
│   │   │   │   ├── quick_sort.cpp
│   │   │   │   ├── radix_sort.cpp
│   │   │   │   └── selection_sort.cpp
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_deque.cpp
│   │   │   │   ├── array_queue.cpp
│   │   │   │   ├── array_stack.cpp
│   │   │   │   ├── deque.cpp
│   │   │   │   ├── linkedlist_deque.cpp
│   │   │   │   ├── linkedlist_queue.cpp
│   │   │   │   ├── linkedlist_stack.cpp
│   │   │   │   ├── queue.cpp
│   │   │   │   └── stack.cpp
│   │   │   ├── chapter_tree/
│   │   │   │   ├── CMakeLists.txt
│   │   │   │   ├── array_binary_tree.cpp
│   │   │   │   ├── avl_tree.cpp
│   │   │   │   ├── binary_search_tree.cpp
│   │   │   │   ├── binary_tree.cpp
│   │   │   │   ├── binary_tree_bfs.cpp
│   │   │   │   └── binary_tree_dfs.cpp
│   │   │   └── utils/
│   │   │       ├── CMakeLists.txt
│   │   │       ├── common.hpp
│   │   │       ├── list_node.hpp
│   │   │       ├── print_utils.hpp
│   │   │       ├── tree_node.hpp
│   │   │       └── vertex.hpp
│   │   ├── csharp/
│   │   │   ├── .editorconfig
│   │   │   ├── .gitignore
│   │   │   ├── GlobalUsing.cs
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.cs
│   │   │   │   ├── linked_list.cs
│   │   │   │   ├── list.cs
│   │   │   │   └── my_list.cs
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.cs
│   │   │   │   ├── permutations_i.cs
│   │   │   │   ├── permutations_ii.cs
│   │   │   │   ├── preorder_traversal_i_compact.cs
│   │   │   │   ├── preorder_traversal_ii_compact.cs
│   │   │   │   ├── preorder_traversal_iii_compact.cs
│   │   │   │   ├── preorder_traversal_iii_template.cs
│   │   │   │   ├── subset_sum_i.cs
│   │   │   │   ├── subset_sum_i_naive.cs
│   │   │   │   └── subset_sum_ii.cs
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.cs
│   │   │   │   ├── recursion.cs
│   │   │   │   ├── space_complexity.cs
│   │   │   │   ├── time_complexity.cs
│   │   │   │   └── worst_best_time_complexity.cs
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.cs
│   │   │   │   ├── build_tree.cs
│   │   │   │   └── hanota.cs
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.cs
│   │   │   │   ├── climbing_stairs_constraint_dp.cs
│   │   │   │   ├── climbing_stairs_dfs.cs
│   │   │   │   ├── climbing_stairs_dfs_mem.cs
│   │   │   │   ├── climbing_stairs_dp.cs
│   │   │   │   ├── coin_change.cs
│   │   │   │   ├── coin_change_ii.cs
│   │   │   │   ├── edit_distance.cs
│   │   │   │   ├── knapsack.cs
│   │   │   │   ├── min_cost_climbing_stairs_dp.cs
│   │   │   │   ├── min_path_sum.cs
│   │   │   │   └── unbounded_knapsack.cs
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.cs
│   │   │   │   ├── graph_adjacency_matrix.cs
│   │   │   │   ├── graph_bfs.cs
│   │   │   │   └── graph_dfs.cs
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.cs
│   │   │   │   ├── fractional_knapsack.cs
│   │   │   │   ├── max_capacity.cs
│   │   │   │   └── max_product_cutting.cs
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.cs
│   │   │   │   ├── built_in_hash.cs
│   │   │   │   ├── hash_map.cs
│   │   │   │   ├── hash_map_chaining.cs
│   │   │   │   ├── hash_map_open_addressing.cs
│   │   │   │   └── simple_hash.cs
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.cs
│   │   │   │   ├── my_heap.cs
│   │   │   │   └── top_k.cs
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.cs
│   │   │   │   ├── binary_search_edge.cs
│   │   │   │   ├── binary_search_insertion.cs
│   │   │   │   ├── hashing_search.cs
│   │   │   │   ├── linear_search.cs
│   │   │   │   └── two_sum.cs
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.cs
│   │   │   │   ├── bucket_sort.cs
│   │   │   │   ├── counting_sort.cs
│   │   │   │   ├── heap_sort.cs
│   │   │   │   ├── insertion_sort.cs
│   │   │   │   ├── merge_sort.cs
│   │   │   │   ├── quick_sort.cs
│   │   │   │   ├── radix_sort.cs
│   │   │   │   └── selection_sort.cs
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.cs
│   │   │   │   ├── array_queue.cs
│   │   │   │   ├── array_stack.cs
│   │   │   │   ├── deque.cs
│   │   │   │   ├── linkedlist_deque.cs
│   │   │   │   ├── linkedlist_queue.cs
│   │   │   │   ├── linkedlist_stack.cs
│   │   │   │   ├── queue.cs
│   │   │   │   └── stack.cs
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.cs
│   │   │   │   ├── avl_tree.cs
│   │   │   │   ├── binary_search_tree.cs
│   │   │   │   ├── binary_tree.cs
│   │   │   │   ├── binary_tree_bfs.cs
│   │   │   │   └── binary_tree_dfs.cs
│   │   │   ├── csharp.sln
│   │   │   ├── hello-algo.csproj
│   │   │   └── utils/
│   │   │       ├── ListNode.cs
│   │   │       ├── PrintUtil.cs
│   │   │       ├── TreeNode.cs
│   │   │       └── Vertex.cs
│   │   ├── dart/
│   │   │   ├── build.dart
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.dart
│   │   │   │   ├── linked_list.dart
│   │   │   │   ├── list.dart
│   │   │   │   └── my_list.dart
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.dart
│   │   │   │   ├── permutations_i.dart
│   │   │   │   ├── permutations_ii.dart
│   │   │   │   ├── preorder_traversal_i_compact.dart
│   │   │   │   ├── preorder_traversal_ii_compact.dart
│   │   │   │   ├── preorder_traversal_iii_compact.dart
│   │   │   │   ├── preorder_traversal_iii_template.dart
│   │   │   │   ├── subset_sum_i.dart
│   │   │   │   ├── subset_sum_i_naive.dart
│   │   │   │   └── subset_sum_ii.dart
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.dart
│   │   │   │   ├── recursion.dart
│   │   │   │   ├── space_complexity.dart
│   │   │   │   ├── time_complexity.dart
│   │   │   │   └── worst_best_time_complexity.dart
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.dart
│   │   │   │   ├── build_tree.dart
│   │   │   │   └── hanota.dart
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.dart
│   │   │   │   ├── climbing_stairs_constraint_dp.dart
│   │   │   │   ├── climbing_stairs_dfs.dart
│   │   │   │   ├── climbing_stairs_dfs_mem.dart
│   │   │   │   ├── climbing_stairs_dp.dart
│   │   │   │   ├── coin_change.dart
│   │   │   │   ├── coin_change_ii.dart
│   │   │   │   ├── edit_distance.dart
│   │   │   │   ├── knapsack.dart
│   │   │   │   ├── min_cost_climbing_stairs_dp.dart
│   │   │   │   ├── min_path_sum.dart
│   │   │   │   └── unbounded_knapsack.dart
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.dart
│   │   │   │   ├── graph_adjacency_matrix.dart
│   │   │   │   ├── graph_bfs.dart
│   │   │   │   └── graph_dfs.dart
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.dart
│   │   │   │   ├── fractional_knapsack.dart
│   │   │   │   ├── max_capacity.dart
│   │   │   │   └── max_product_cutting.dart
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.dart
│   │   │   │   ├── built_in_hash.dart
│   │   │   │   ├── hash_map.dart
│   │   │   │   ├── hash_map_chaining.dart
│   │   │   │   ├── hash_map_open_addressing.dart
│   │   │   │   └── simple_hash.dart
│   │   │   ├── chapter_heap/
│   │   │   │   ├── my_heap.dart
│   │   │   │   └── top_k.dart
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.dart
│   │   │   │   ├── binary_search_edge.dart
│   │   │   │   ├── binary_search_insertion.dart
│   │   │   │   ├── hashing_search.dart
│   │   │   │   ├── linear_search.dart
│   │   │   │   └── two_sum.dart
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.dart
│   │   │   │   ├── bucket_sort.dart
│   │   │   │   ├── counting_sort.dart
│   │   │   │   ├── heap_sort.dart
│   │   │   │   ├── insertion_sort.dart
│   │   │   │   ├── merge_sort.dart
│   │   │   │   ├── quick_sort.dart
│   │   │   │   ├── radix_sort.dart
│   │   │   │   └── selection_sort.dart
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.dart
│   │   │   │   ├── array_queue.dart
│   │   │   │   ├── array_stack.dart
│   │   │   │   ├── deque.dart
│   │   │   │   ├── linkedlist_deque.dart
│   │   │   │   ├── linkedlist_queue.dart
│   │   │   │   ├── linkedlist_stack.dart
│   │   │   │   ├── queue.dart
│   │   │   │   └── stack.dart
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.dart
│   │   │   │   ├── avl_tree.dart
│   │   │   │   ├── binary_search_tree.dart
│   │   │   │   ├── binary_tree.dart
│   │   │   │   ├── binary_tree_bfs.dart
│   │   │   │   └── binary_tree_dfs.dart
│   │   │   └── utils/
│   │   │       ├── list_node.dart
│   │   │       ├── print_util.dart
│   │   │       ├── tree_node.dart
│   │   │       └── vertex.dart
│   │   ├── docker-compose.yml
│   │   ├── go/
│   │   │   ├── chapter_array_and_linkedlist/
│   │   │   │   ├── array.go
│   │   │   │   ├── array_test.go
│   │   │   │   ├── linked_list.go
│   │   │   │   ├── linked_list_test.go
│   │   │   │   ├── list_test.go
│   │   │   │   ├── my_list.go
│   │   │   │   └── my_list_test.go
│   │   │   ├── chapter_backtracking/
│   │   │   │   ├── n_queens.go
│   │   │   │   ├── n_queens_test.go
│   │   │   │   ├── permutation_test.go
│   │   │   │   ├── permutations_i.go
│   │   │   │   ├── permutations_ii.go
│   │   │   │   ├── preorder_traversal_i_compact.go
│   │   │   │   ├── preorder_traversal_ii_compact.go
│   │   │   │   ├── preorder_traversal_iii_compact.go
│   │   │   │   ├── preorder_traversal_iii_template.go
│   │   │   │   ├── preorder_traversal_test.go
│   │   │   │   ├── subset_sum_i.go
│   │   │   │   ├── subset_sum_i_naive.go
│   │   │   │   ├── subset_sum_ii.go
│   │   │   │   └── subset_sum_test.go
│   │   │   ├── chapter_computational_complexity/
│   │   │   │   ├── iteration.go
│   │   │   │   ├── iteration_test.go
│   │   │   │   ├── recursion.go
│   │   │   │   ├── recursion_test.go
│   │   │   │   ├── space_complexity.go
│   │   │   │   ├── space_complexity_test.go
│   │   │   │   ├── time_complexity.go
│   │   │   │   ├── time_complexity_test.go
│   │   │   │   ├── worst_best_time_complexity.go
│   │   │   │   └── worst_best_time_complexity_test.go
│   │   │   ├── chapter_divide_and_conquer/
│   │   │   │   ├── binary_search_recur.go
│   │   │   │   ├── binary_search_recur_test.go
│   │   │   │   ├── build_tree.go
│   │   │   │   ├── build_tree_test.go
│   │   │   │   ├── hanota.go
│   │   │   │   └── hanota_test.go
│   │   │   ├── chapter_dynamic_programming/
│   │   │   │   ├── climbing_stairs_backtrack.go
│   │   │   │   ├── climbing_stairs_constraint_dp.go
│   │   │   │   ├── climbing_stairs_dfs.go
│   │   │   │   ├── climbing_stairs_dfs_mem.go
│   │   │   │   ├── climbing_stairs_dp.go
│   │   │   │   ├── climbing_stairs_test.go
│   │   │   │   ├── coin_change.go
│   │   │   │   ├── coin_change_ii.go
│   │   │   │   ├── coin_change_test.go
│   │   │   │   ├── edit_distance.go
│   │   │   │   ├── edit_distance_test.go
│   │   │   │   ├── knapsack.go
│   │   │   │   ├── knapsack_test.go
│   │   │   │   ├── min_cost_climbing_stairs_dp.go
│   │   │   │   ├── min_path_sum.go
│   │   │   │   ├── min_path_sum_test.go
│   │   │   │   └── unbounded_knapsack.go
│   │   │   ├── chapter_graph/
│   │   │   │   ├── graph_adjacency_list.go
│   │   │   │   ├── graph_adjacency_list_test.go
│   │   │   │   ├── graph_adjacency_matrix.go
│   │   │   │   ├── graph_adjacency_matrix_test.go
│   │   │   │   ├── graph_bfs.go
│   │   │   │   ├── graph_bfs_test.go
│   │   │   │   ├── graph_dfs.go
│   │   │   │   └── graph_dfs_test.go
│   │   │   ├── chapter_greedy/
│   │   │   │   ├── coin_change_greedy.go
│   │   │   │   ├── coin_change_greedy_test.go
│   │   │   │   ├── fractional_knapsack.go
│   │   │   │   ├── fractional_knapsack_test.go
│   │   │   │   ├── max_capacity.go
│   │   │   │   ├── max_capacity_test.go
│   │   │   │   ├── max_product_cutting.go
│   │   │   │   └── max_product_cutting_test.go
│   │   │   ├── chapter_hashing/
│   │   │   │   ├── array_hash_map.go
│   │   │   │   ├── array_hash_map_test.go
│   │   │   │   ├── hash_collision_test.go
│   │   │   │   ├── hash_map_chaining.go
│   │   │   │   ├── hash_map_open_addressing.go
│   │   │   │   ├── hash_map_test.go
│   │   │   │   └── simple_hash.go
│   │   │   ├── chapter_heap/
│   │   │   │   ├── heap.go
│   │   │   │   ├── heap_test.go
│   │   │   │   ├── my_heap.go
│   │   │   │   └── top_k.go
│   │   │   ├── chapter_searching/
│   │   │   │   ├── binary_search.go
│   │   │   │   ├── binary_search_edge.go
│   │   │   │   ├── binary_search_insertion.go
│   │   │   │   ├── binary_search_test.go
│   │   │   │   ├── hashing_search.go
│   │   │   │   ├── hashing_search_test.go
│   │   │   │   ├── linear_search.go
│   │   │   │   ├── linear_search_test.go
│   │   │   │   ├── two_sum.go
│   │   │   │   └── two_sum_test.go
│   │   │   ├── chapter_sorting/
│   │   │   │   ├── bubble_sort.go
│   │   │   │   ├── bubble_sort_test.go
│   │   │   │   ├── bucket_sort.go
│   │   │   │   ├── bucket_sort_test.go
│   │   │   │   ├── counting_sort.go
│   │   │   │   ├── counting_sort_test.go
│   │   │   │   ├── heap_sort.go
│   │   │   │   ├── heap_sort_test.go
│   │   │   │   ├── insertion_sort.go
│   │   │   │   ├── insertion_sort_test.go
│   │   │   │   ├── merge_sort.go
│   │   │   │   ├── merge_sort_test.go
│   │   │   │   ├── quick_sort.go
│   │   │   │   ├── quick_sort_test.go
│   │   │   │   ├── radix_sort.go
│   │   │   │   ├── radix_sort_test.go
│   │   │   │   ├── selection_sort.go
│   │   │   │   └── selection_sort_test.go
│   │   │   ├── chapter_stack_and_queue/
│   │   │   │   ├── array_deque.go
│   │   │   │   ├── array_queue.go
│   │   │   │   ├── array_stack.go
│   │   │   │   ├── deque_test.go
│   │   │   │   ├── linkedlist_deque.go
│   │   │   │   ├── linkedlist_queue.go
│   │   │   │   ├── linkedlist_stack.go
│   │   │   │   ├── queue_test.go
│   │   │   │   └── stack_test.go
│   │   │   ├── chapter_tree/
│   │   │   │   ├── array_binary_tree.go
│   │   │   │   ├── array_binary_tree_test.go
│   │   │   │   ├── avl_tree.go
│   │   │   │   ├── avl_tree_test.go
│   │   │   │   ├── binary_search_tree.go
│   │   │   │

SYMBOL INDEX (22693 symbols across 4765 files)

FILE: codes/c/chapter_array_and_linkedlist/array.c
  function randomAccess (line 10) | int randomAccess(int *nums, int size) {
  function insert (line 35) | void insert(int *nums, int size, int num, int index) {
  function removeItem (line 46) | void removeItem(int *nums, int size, int index) {
  function traverse (line 54) | void traverse(int *nums, int size) {
  function find (line 63) | int find(int *nums, int size, int target) {
  function main (line 72) | int main() {

FILE: codes/c/chapter_array_and_linkedlist/linked_list.c
  function insert (line 10) | void insert(ListNode *n0, ListNode *P) {
  function removeItem (line 18) | void removeItem(ListNode *n0) {
  function ListNode (line 30) | ListNode *access(ListNode *head, int index) {
  function find (line 40) | int find(ListNode *head, int target) {
  function main (line 52) | int main() {

FILE: codes/c/chapter_array_and_linkedlist/my_list.c
  type MyList (line 10) | typedef struct {
  function MyList (line 20) | MyList *newMyList() {
  function delMyList (line 30) | void delMyList(MyList *nums) {
  function size (line 36) | int size(MyList *nums) {
  function capacity (line 41) | int capacity(MyList *nums) {
  function get (line 46) | int get(MyList *nums, int index) {
  function set (line 52) | void set(MyList *nums, int index, int num) {
  function add (line 58) | void add(MyList *nums, int num) {
  function insert (line 67) | void insert(MyList *nums, int index, int num) {
  function removeItem (line 82) | int removeItem(MyList *nums, int index) {
  function extendCapacity (line 93) | void extendCapacity(MyList *nums) {
  function main (line 117) | int main() {

FILE: codes/c/chapter_backtracking/n_queens.c
  function backtrack (line 12) | void backtrack(int row, int n, char state[MAX_SIZE][MAX_SIZE], char ***r...
  function main (line 64) | int main() {

FILE: codes/c/chapter_backtracking/permutations_i.c
  function backtrack (line 13) | void backtrack(int *state, int stateSize, int *choices, int choicesSize,...
  function main (line 58) | int main() {

FILE: codes/c/chapter_backtracking/permutations_ii.c
  function backtrack (line 13) | void backtrack(int *state, int stateSize, int *choices, int choicesSize,...
  function main (line 60) | int main() {

FILE: codes/c/chapter_backtracking/preorder_traversal_i_compact.c
  function preOrder (line 16) | void preOrder(TreeNode *root) {
  function main (line 29) | int main() {

FILE: codes/c/chapter_backtracking/preorder_traversal_ii_compact.c
  function preOrder (line 18) | void preOrder(TreeNode *root) {
  function main (line 38) | int main() {

FILE: codes/c/chapter_backtracking/preorder_traversal_iii_compact.c
  function preOrder (line 18) | void preOrder(TreeNode *root) {
  function main (line 39) | int main() {

FILE: codes/c/chapter_backtracking/preorder_traversal_iii_template.c
  function isSolution (line 18) | bool isSolution(void) {
  function recordSolution (line 23) | void recordSolution(void) {
  function isValid (line 31) | bool isValid(TreeNode *choice) {
  function makeChoice (line 36) | void makeChoice(TreeNode *choice) {
  function undoChoice (line 41) | void undoChoice(void) {
  function backtrack (line 46) | void backtrack(TreeNode *choices[2]) {
  function main (line 69) | int main() {

FILE: codes/c/chapter_backtracking/subset_sum_i.c
  function backtrack (line 22) | void backtrack(int target, int *choices, int choicesSize, int start) {
  function cmp (line 50) | int cmp(const void *a, const void *b) {
  function subsetSumI (line 55) | void subsetSumI(int *nums, int numsSize, int target) {
  function main (line 62) | int main() {

FILE: codes/c/chapter_backtracking/subset_sum_i_naive.c
  function backtrack (line 22) | void backtrack(int target, int total, int *choices, int choicesSize) {
  function subsetSumINaive (line 47) | void subsetSumINaive(int *nums, int numsSize, int target) {
  function main (line 53) | int main() {

FILE: codes/c/chapter_backtracking/subset_sum_ii.c
  function backtrack (line 22) | void backtrack(int target, int *choices, int choicesSize, int start) {
  function cmp (line 54) | int cmp(const void *a, const void *b) {
  function subsetSumII (line 59) | void subsetSumII(int *nums, int numsSize, int target) {
  function main (line 67) | int main() {

FILE: codes/c/chapter_computational_complexity/iteration.c
  function forLoop (line 10) | int forLoop(int n) {
  function whileLoop (line 20) | int whileLoop(int n) {
  function whileLoopII (line 32) | int whileLoopII(int n) {
  function main (line 63) | int main() {

FILE: codes/c/chapter_computational_complexity/recursion.c
  function recur (line 10) | int recur(int n) {
  function forLoopRecur (line 21) | int forLoopRecur(int n) {
  function tailRecur (line 40) | int tailRecur(int n, int res) {
  function fib (line 49) | int fib(int n) {
  function main (line 60) | int main() {

FILE: codes/c/chapter_computational_complexity/space_complexity.c
  function func (line 10) | int func() {
  function constant (line 16) | void constant(int n) {
  type HashTable (line 34) | typedef struct {
  function linear (line 41) | void linear(int n) {
  function linearRecur (line 75) | void linearRecur(int n) {
  function quadratic (line 83) | void quadratic(int n) {
  function quadraticRecur (line 102) | int quadraticRecur(int n) {
  function TreeNode (line 113) | TreeNode *buildTree(int n) {
  function main (line 123) | int main() {

FILE: codes/c/chapter_computational_complexity/time_complexity.c
  function constant (line 10) | int constant(int n) {
  function linear (line 21) | int linear(int n) {
  function arrayTraversal (line 30) | int arrayTraversal(int *nums, int n) {
  function quadratic (line 40) | int quadratic(int n) {
  function bubbleSort (line 52) | int bubbleSort(int *nums, int n) {
  function exponential (line 71) | int exponential(int n) {
  function expRecur (line 86) | int expRecur(int n) {
  function logarithmic (line 93) | int logarithmic(int n) {
  function logRecur (line 103) | int logRecur(int n) {
  function linearLogRecur (line 110) | int linearLogRecur(int n) {
  function factorialRecur (line 121) | int factorialRecur(int n) {
  function main (line 132) | int main(int argc, char *argv[]) {

FILE: codes/c/chapter_computational_complexity/worst_best_time_complexity.c
  function findOne (line 28) | int findOne(int *nums, int n) {
  function main (line 39) | int main(int argc, char *argv[]) {

FILE: codes/c/chapter_divide_and_conquer/binary_search_recur.c
  function dfs (line 10) | int dfs(int nums[], int target, int i, int j) {
  function binarySearch (line 30) | int binarySearch(int nums[], int target, int numsSize) {
  function main (line 37) | int main() {

FILE: codes/c/chapter_divide_and_conquer/build_tree.c
  function TreeNode (line 13) | TreeNode *dfs(int *preorder, int *inorderMap, int i, int l, int r, int s...
  function TreeNode (line 33) | TreeNode *buildTree(int *preorder, int preorderSize, int *inorder, int i...
  function main (line 45) | int main() {

FILE: codes/c/chapter_divide_and_conquer/hanota.c
  function move (line 13) | void move(int *src, int *srcSize, int *tar, int *tarSize) {
  function dfs (line 24) | void dfs(int i, int *src, int *srcSize, int *buf, int *bufSize, int *tar...
  function solveHanota (line 39) | void solveHanota(int *A, int *ASize, int *B, int *BSize, int *C, int *CS...
  function main (line 45) | int main() {

FILE: codes/c/chapter_dynamic_programming/climbing_stairs_backtrack.c
  function backtrack (line 10) | void backtrack(int *choices, int state, int n, int *res, int len) {
  function climbingStairsBacktrack (line 27) | int climbingStairsBacktrack(int n) {
  function main (line 40) | int main() {

FILE: codes/c/chapter_dynamic_programming/climbing_stairs_constraint_dp.c
  function climbingStairsConstraintDP (line 10) | int climbingStairsConstraintDP(int n) {
  function main (line 39) | int main() {

FILE: codes/c/chapter_dynamic_programming/climbing_stairs_dfs.c
  function dfs (line 10) | int dfs(int i) {
  function climbingStairsDFS (line 20) | int climbingStairsDFS(int n) {
  function main (line 25) | int main() {

FILE: codes/c/chapter_dynamic_programming/climbing_stairs_dfs_mem.c
  function dfs (line 10) | int dfs(int i, int *mem) {
  function climbingStairsDFSMem (line 25) | int climbingStairsDFSMem(int n) {
  function main (line 37) | int main() {

FILE: codes/c/chapter_dynamic_programming/climbing_stairs_dp.c
  function climbingStairsDP (line 10) | int climbingStairsDP(int n) {
  function climbingStairsDPComp (line 28) | int climbingStairsDPComp(int n) {
  function main (line 41) | int main() {

FILE: codes/c/chapter_dynamic_programming/coin_change.c
  function myMin (line 10) | int myMin(int a, int b) {
  function coinChangeDP (line 15) | int coinChangeDP(int coins[], int amt, int coinsSize) {
  function coinChangeDPComp (line 49) | int coinChangeDPComp(int coins[], int amt, int coinsSize) {
  function main (line 78) | int main() {

FILE: codes/c/chapter_dynamic_programming/coin_change_ii.c
  function coinChangeIIDP (line 10) | int coinChangeIIDP(int coins[], int amt, int coinsSize) {
  function coinChangeIIDPComp (line 43) | int coinChangeIIDPComp(int coins[], int amt, int coinsSize) {
  function main (line 67) | int main() {

FILE: codes/c/chapter_dynamic_programming/edit_distance.c
  function myMin (line 10) | int myMin(int a, int b) {
  function editDistanceDFS (line 15) | int editDistanceDFS(char *s, char *t, int i, int j) {
  function editDistanceDFSMem (line 37) | int editDistanceDFSMem(char *s, char *t, int memCols, int **mem, int i, ...
  function editDistanceDP (line 63) | int editDistanceDP(char *s, char *t, int n, int m) {
  function editDistanceDPComp (line 96) | int editDistanceDPComp(char *s, char *t, int n, int m) {
  function main (line 127) | int main() {

FILE: codes/c/chapter_dynamic_programming/knapsack.c
  function myMax (line 10) | int myMax(int a, int b) {
  function knapsackDFS (line 15) | int knapsackDFS(int wgt[], int val[], int i, int c) {
  function knapsackDFSMem (line 32) | int knapsackDFSMem(int wgt[], int val[], int memCols, int **mem, int i, ...
  function knapsackDP (line 54) | int knapsackDP(int wgt[], int val[], int cap, int wgtSize) {
  function knapsackDPComp (line 82) | int knapsackDPComp(int wgt[], int val[], int cap, int wgtSize) {
  function main (line 103) | int main() {

FILE: codes/c/chapter_dynamic_programming/min_cost_climbing_stairs_dp.c
  function myMin (line 10) | int myMin(int a, int b) {
  function minCostClimbingStairsDP (line 15) | int minCostClimbingStairsDP(int cost[], int costSize) {
  function minCostClimbingStairsDPComp (line 35) | int minCostClimbingStairsDPComp(int cost[], int costSize) {
  function main (line 49) | int main() {

FILE: codes/c/chapter_dynamic_programming/min_path_sum.c
  function myMin (line 13) | int myMin(int a, int b) {
  function minPathSumDFS (line 18) | int minPathSumDFS(int grid[MAX_SIZE][MAX_SIZE], int i, int j) {
  function minPathSumDFSMem (line 35) | int minPathSumDFSMem(int grid[MAX_SIZE][MAX_SIZE], int mem[MAX_SIZE][MAX...
  function minPathSumDP (line 57) | int minPathSumDP(int grid[MAX_SIZE][MAX_SIZE], int n, int m) {
  function minPathSumDPComp (line 87) | int minPathSumDPComp(int grid[MAX_SIZE][MAX_SIZE], int n, int m) {
  function main (line 111) | int main() {

FILE: codes/c/chapter_dynamic_programming/unbounded_knapsack.c
  function myMax (line 10) | int myMax(int a, int b) {
  function unboundedKnapsackDP (line 15) | int unboundedKnapsackDP(int wgt[], int val[], int cap, int wgtSize) {
  function unboundedKnapsackDPComp (line 43) | int unboundedKnapsackDPComp(int wgt[], int val[], int cap, int wgtSize) {
  function main (line 66) | int main() {

FILE: codes/c/chapter_graph/graph_adjacency_list.c
  type AdjListNode (line 13) | typedef struct AdjListNode {
  type GraphAdjList (line 19) | typedef struct {
  function GraphAdjList (line 25) | GraphAdjList *newGraphAdjList() {
  function delGraphAdjList (line 38) | void delGraphAdjList(GraphAdjList *graph) {
  function AdjListNode (line 55) | AdjListNode *findNode(GraphAdjList *graph, Vertex *vet) {
  function addEdgeHelper (line 65) | void addEdgeHelper(AdjListNode *head, Vertex *vet) {
  function addEdge (line 74) | void addEdge(GraphAdjList *graph, Vertex *vet1, Vertex *vet2) {
  function removeEdgeHelper (line 84) | void removeEdgeHelper(AdjListNode *head, Vertex *vet) {
  function removeEdge (line 101) | void removeEdge(GraphAdjList *graph, Vertex *vet1, Vertex *vet2) {
  function addVertex (line 111) | void addVertex(GraphAdjList *graph, Vertex *vet) {
  function removeVertex (line 121) | void removeVertex(GraphAdjList *graph, Vertex *vet) {
  function printGraph (line 159) | void printGraph(const GraphAdjList *graph) {

FILE: codes/c/chapter_graph/graph_adjacency_list_test.c
  function main (line 10) | int main() {

FILE: codes/c/chapter_graph/graph_adjacency_matrix.c
  type GraphAdjMat (line 13) | typedef struct {
  function GraphAdjMat (line 20) | GraphAdjMat *newGraphAdjMat() {
  function delGraphAdjMat (line 32) | void delGraphAdjMat(GraphAdjMat *graph) {
  function addVertex (line 37) | void addVertex(GraphAdjMat *graph, int val) {
  function removeVertex (line 52) | void removeVertex(GraphAdjMat *graph, int index) {
  function addEdge (line 78) | void addEdge(GraphAdjMat *graph, int i, int j) {
  function removeEdge (line 89) | void removeEdge(GraphAdjMat *graph, int i, int j) {
  function printGraphAdjMat (line 99) | void printGraphAdjMat(GraphAdjMat *graph) {
  function main (line 109) | int main() {

FILE: codes/c/chapter_graph/graph_bfs.c
  type Queue (line 13) | typedef struct {
  function Queue (line 19) | Queue *newQueue() {
  function isEmpty (line 26) | int isEmpty(Queue *q) {
  function enqueue (line 31) | void enqueue(Queue *q, Vertex *vet) {
  function Vertex (line 38) | Vertex *dequeue(Queue *q) {
  function isVisited (line 46) | int isVisited(Vertex **visited, int size, Vertex *vet) {
  function graphBFS (line 57) | void graphBFS(GraphAdjList *graph, Vertex *startVet, Vertex **res, int *...
  function main (line 82) | int main() {

FILE: codes/c/chapter_graph/graph_dfs.c
  function isVisited (line 13) | int isVisited(Vertex **res, int size, Vertex *vet) {
  function dfs (line 24) | void dfs(GraphAdjList *graph, Vertex **res, int *resSize, Vertex *vet) {
  function graphDFS (line 41) | void graphDFS(GraphAdjList *graph, Vertex *startVet, Vertex **res, int *...
  function main (line 46) | int main() {

FILE: codes/c/chapter_greedy/coin_change_greedy.c
  function coinChangeGreedy (line 10) | int coinChangeGreedy(int *coins, int size, int amt) {
  function main (line 29) | int main() {

FILE: codes/c/chapter_greedy/fractional_knapsack.c
  type Item (line 10) | typedef struct {
  function sortByValueDensity (line 16) | int sortByValueDensity(const void *a, const void *b) {
  function fractionalKnapsack (line 23) | float fractionalKnapsack(int wgt[], int val[], int itemCount, int cap) {
  function main (line 50) | int main(void) {

FILE: codes/c/chapter_greedy/max_capacity.c
  function myMin (line 10) | int myMin(int a, int b) {
  function myMax (line 14) | int myMax(int a, int b) {
  function maxCapacity (line 19) | int maxCapacity(int ht[], int htLength) {
  function main (line 41) | int main(void) {

FILE: codes/c/chapter_greedy/max_product_cutting.c
  function maxProductCutting (line 10) | int maxProductCutting(int n) {
  function main (line 31) | int main(void) {

FILE: codes/c/chapter_hashing/array_hash_map.c
  type Pair (line 13) | typedef struct {
  type MapSet (line 19) | typedef struct {
  type ArrayHashMap (line 25) | typedef struct {
  function ArrayHashMap (line 30) | ArrayHashMap *newArrayHashMap() {
  function delArrayHashMap (line 39) | void delArrayHashMap(ArrayHashMap *hmap) {
  function hashFunc (line 50) | int hashFunc(int key) {
  function put (line 65) | void put(ArrayHashMap *hmap, const int key, const char *val) {
  function removeItem (line 76) | void removeItem(ArrayHashMap *hmap, const int key) {
  function pairSet (line 84) | void pairSet(ArrayHashMap *hmap, MapSet *set) {
  function keySet (line 108) | void keySet(ArrayHashMap *hmap, MapSet *set) {
  function valueSet (line 130) | void valueSet(ArrayHashMap *hmap, MapSet *set) {
  function print (line 152) | void print(ArrayHashMap *hmap) {
  function main (line 164) | int main() {

FILE: codes/c/chapter_hashing/hash_map_chaining.c
  type Pair (line 15) | typedef struct {
  type Node (line 21) | typedef struct Node {
  type HashMapChaining (line 27) | typedef struct {
  function HashMapChaining (line 36) | HashMapChaining *newHashMapChaining() {
  function delHashMapChaining (line 50) | void delHashMapChaining(HashMapChaining *hashMap) {
  function hashFunc (line 65) | int hashFunc(HashMapChaining *hashMap, int key) {
  function loadFactor (line 70) | double loadFactor(HashMapChaining *hashMap) {
  function extend (line 92) | void extend(HashMapChaining *hashMap) {
  function put (line 120) | void put(HashMapChaining *hashMap, int key, const char *val) {
  function removeItem (line 147) | void removeItem(HashMapChaining *hashMap, int key) {
  function print (line 171) | void print(HashMapChaining *hashMap) {
  function main (line 184) | int main() {

FILE: codes/c/chapter_hashing/hash_map_open_addressing.c
  type Pair (line 10) | typedef struct {
  type HashMapOpenAddressing (line 16) | typedef struct {
  function HashMapOpenAddressing (line 29) | HashMapOpenAddressing *newHashMapOpenAddressing() {
  function delHashMapOpenAddressing (line 44) | void delHashMapOpenAddressing(HashMapOpenAddressing *hashMap) {
  function hashFunc (line 58) | int hashFunc(HashMapOpenAddressing *hashMap, int key) {
  function loadFactor (line 63) | double loadFactor(HashMapOpenAddressing *hashMap) {
  function findBucket (line 68) | int findBucket(HashMapOpenAddressing *hashMap, int key) {
  function put (line 107) | void put(HashMapOpenAddressing *hashMap, int key, char *val) {
  function removeItem (line 134) | void removeItem(HashMapOpenAddressing *hashMap, int key) {
  function extend (line 148) | void extend(HashMapOpenAddressing *hashMap) {
  function print (line 169) | void print(HashMapOpenAddressing *hashMap) {
  function main (line 183) | int main() {

FILE: codes/c/chapter_hashing/simple_hash.c
  function addHash (line 10) | int addHash(char *key) {
  function mulHash (line 20) | int mulHash(char *key) {
  function xorHash (line 30) | int xorHash(char *key) {
  function rotHash (line 41) | int rotHash(char *key) {
  function main (line 52) | int main() {

FILE: codes/c/chapter_heap/my_heap.c
  type MaxHeap (line 12) | typedef struct {
  function MaxHeap (line 25) | MaxHeap *newMaxHeap(int nums[], int size) {
  function delMaxHeap (line 38) | void delMaxHeap(MaxHeap *maxHeap) {
  function left (line 44) | int left(MaxHeap *maxHeap, int i) {
  function right (line 49) | int right(MaxHeap *maxHeap, int i) {
  function parent (line 54) | int parent(MaxHeap *maxHeap, int i) {
  function swap (line 59) | void swap(MaxHeap *maxHeap, int i, int j) {
  function size (line 66) | int size(MaxHeap *maxHeap) {
  function isEmpty (line 71) | int isEmpty(MaxHeap *maxHeap) {
  function peek (line 76) | int peek(MaxHeap *maxHeap) {
  function push (line 81) | void push(MaxHeap *maxHeap, int val) {
  function pop (line 96) | int pop(MaxHeap *maxHeap) {
  function siftDown (line 115) | void siftDown(MaxHeap *maxHeap, int i) {
  function siftUp (line 139) | void siftUp(MaxHeap *maxHeap, int i) {

FILE: codes/c/chapter_heap/my_heap_test.c
  function main (line 10) | int main() {

FILE: codes/c/chapter_heap/top_k.c
  function pushMinHeap (line 10) | void pushMinHeap(MaxHeap *maxHeap, int val) {
  function popMinHeap (line 16) | int popMinHeap(MaxHeap *maxHeap) {
  function peekMinHeap (line 22) | int peekMinHeap(MaxHeap *maxHeap) {
  function main (line 62) | int main() {

FILE: codes/c/chapter_searching/binary_search.c
  function binarySearch (line 10) | int binarySearch(int *nums, int len, int target) {
  function binarySearchLCRO (line 28) | int binarySearchLCRO(int *nums, int len, int target) {
  function main (line 46) | int main() {

FILE: codes/c/chapter_searching/binary_search_edge.c
  function binarySearchInsertion (line 10) | int binarySearchInsertion(int *nums, int numSize, int target) {
  function binarySearchLeftEdge (line 25) | int binarySearchLeftEdge(int *nums, int numSize, int target) {
  function binarySearchRightEdge (line 37) | int binarySearchRightEdge(int *nums, int numSize, int target) {
  function main (line 51) | int main() {

FILE: codes/c/chapter_searching/binary_search_insertion.c
  function binarySearchInsertionSimple (line 10) | int binarySearchInsertionSimple(int *nums, int numSize, int target) {
  function binarySearchInsertion (line 27) | int binarySearchInsertion(int *nums, int numSize, int target) {
  function main (line 44) | int main() {

FILE: codes/c/chapter_searching/two_sum.c
  type HashTable (line 26) | typedef struct {
  function HashTable (line 33) | HashTable *find(HashTable *h, int key) {
  function insert (line 40) | void insert(HashTable **h, int key, int val) {
  function main (line 69) | int main() {

FILE: codes/c/chapter_sorting/bubble_sort.c
  function bubbleSort (line 10) | void bubbleSort(int nums[], int size) {
  function bubbleSortWithFlag (line 25) | void bubbleSortWithFlag(int nums[], int size) {
  function main (line 44) | int main() {

FILE: codes/c/chapter_sorting/bucket_sort.c
  function compare (line 12) | int compare(const void *a, const void *b) {
  function bucketSort (line 19) | void bucketSort(float nums[], int n) {
  function main (line 49) | int main() {

FILE: codes/c/chapter_sorting/counting_sort.c
  function countingSortNaive (line 11) | void countingSortNaive(int nums[], int size) {
  function countingSort (line 38) | void countingSort(int nums[], int size) {
  function main (line 73) | int main() {

FILE: codes/c/chapter_sorting/heap_sort.c
  function siftDown (line 10) | void siftDown(int nums[], int n, int i) {
  function heapSort (line 34) | void heapSort(int nums[], int n) {
  function main (line 51) | int main() {

FILE: codes/c/chapter_sorting/insertion_sort.c
  function insertionSort (line 10) | void insertionSort(int nums[], int size) {
  function main (line 26) | int main() {

FILE: codes/c/chapter_sorting/merge_sort.c
  function merge (line 10) | void merge(int *nums, int left, int mid, int right) {
  function mergeSort (line 41) | void mergeSort(int *nums, int left, int right) {
  function main (line 54) | int main() {

FILE: codes/c/chapter_sorting/quick_sort.c
  function swap (line 10) | void swap(int nums[], int i, int j) {
  function partition (line 17) | int partition(int nums[], int left, int right) {
  function quickSort (line 37) | void quickSort(int nums[], int left, int right) {
  function medianThree (line 52) | int medianThree(int nums[], int left, int mid, int right) {
  function partitionMedian (line 62) | int partitionMedian(int nums[], int left, int right) {
  function quickSortMedian (line 81) | void quickSortMedian(int nums[], int left, int right) {
  function quickSortTailCall (line 95) | void quickSortTailCall(int nums[], int left, int right) {
  function main (line 116) | int main() {

FILE: codes/c/chapter_sorting/radix_sort.c
  function digit (line 10) | int digit(int num, int exp) {
  function countingSortDigit (line 16) | void countingSortDigit(int nums[], int size, int exp) {
  function radixSort (line 49) | void radixSort(int nums[], int size) {
  function main (line 67) | int main() {

FILE: codes/c/chapter_sorting/selection_sort.c
  function selectionSort (line 10) | void selectionSort(int nums[], int n) {
  function main (line 27) | int main() {

FILE: codes/c/chapter_stack_and_queue/array_deque.c
  type ArrayDeque (line 10) | typedef struct {
  function ArrayDeque (line 18) | ArrayDeque *newArrayDeque(int capacity) {
  function delArrayDeque (line 28) | void delArrayDeque(ArrayDeque *deque) {
  function capacity (line 34) | int capacity(ArrayDeque *deque) {
  function size (line 39) | int size(ArrayDeque *deque) {
  function empty (line 44) | bool empty(ArrayDeque *deque) {
  function dequeIndex (line 49) | int dequeIndex(ArrayDeque *deque, int i) {
  function pushFirst (line 57) | void pushFirst(ArrayDeque *deque, int num) {
  function pushLast (line 71) | void pushLast(ArrayDeque *deque, int num) {
  function peekFirst (line 84) | int peekFirst(ArrayDeque *deque) {
  function peekLast (line 91) | int peekLast(ArrayDeque *deque) {
  function popFirst (line 99) | int popFirst(ArrayDeque *deque) {
  function popLast (line 108) | int popLast(ArrayDeque *deque) {
  function main (line 127) | int main() {

FILE: codes/c/chapter_stack_and_queue/array_queue.c
  type ArrayQueue (line 10) | typedef struct {
  function ArrayQueue (line 18) | ArrayQueue *newArrayQueue(int capacity) {
  function delArrayQueue (line 28) | void delArrayQueue(ArrayQueue *queue) {
  function capacity (line 34) | int capacity(ArrayQueue *queue) {
  function size (line 39) | int size(ArrayQueue *queue) {
  function empty (line 44) | bool empty(ArrayQueue *queue) {
  function peek (line 49) | int peek(ArrayQueue *queue) {
  function push (line 55) | void push(ArrayQueue *queue, int num) {
  function pop (line 69) | int pop(ArrayQueue *queue) {
  function main (line 90) | int main() {

FILE: codes/c/chapter_stack_and_queue/array_stack.c
  type ArrayStack (line 12) | typedef struct {
  function ArrayStack (line 18) | ArrayStack *newArrayStack() {
  function delArrayStack (line 27) | void delArrayStack(ArrayStack *stack) {
  function size (line 33) | int size(ArrayStack *stack) {
  function isEmpty (line 38) | bool isEmpty(ArrayStack *stack) {
  function push (line 43) | void push(ArrayStack *stack, int num) {
  function peek (line 53) | int peek(ArrayStack *stack) {
  function pop (line 62) | int pop(ArrayStack *stack) {
  function main (line 69) | int main() {

FILE: codes/c/chapter_stack_and_queue/linkedlist_deque.c
  type DoublyListNode (line 10) | typedef struct DoublyListNode {
  function DoublyListNode (line 17) | DoublyListNode *newDoublyListNode(int num) {
  function delDoublyListNode (line 26) | void delDoublyListNode(DoublyListNode *node) {
  type LinkedListDeque (line 31) | typedef struct {
  function LinkedListDeque (line 37) | LinkedListDeque *newLinkedListDeque() {
  function delLinkedListdeque (line 46) | void delLinkedListdeque(LinkedListDeque *deque) {
  function size (line 58) | int size(LinkedListDeque *deque) {
  function empty (line 63) | bool empty(LinkedListDeque *deque) {
  function push (line 68) | void push(LinkedListDeque *deque, int num, bool isFront) {
  function pushFirst (line 92) | void pushFirst(LinkedListDeque *deque, int num) {
  function pushLast (line 97) | void pushLast(LinkedListDeque *deque, int num) {
  function peekFirst (line 102) | int peekFirst(LinkedListDeque *deque) {
  function peekLast (line 108) | int peekLast(LinkedListDeque *deque) {
  function pop (line 114) | int pop(LinkedListDeque *deque, bool isFront) {
  function popFirst (line 145) | int popFirst(LinkedListDeque *deque) {
  function popLast (line 150) | int popLast(LinkedListDeque *deque) {
  function printLinkedListDeque (line 155) | void printLinkedListDeque(LinkedListDeque *deque) {
  function main (line 169) | int main() {

FILE: codes/c/chapter_stack_and_queue/linkedlist_queue.c
  type LinkedListQueue (line 10) | typedef struct {
  function LinkedListQueue (line 16) | LinkedListQueue *newLinkedListQueue() {
  function delLinkedListQueue (line 25) | void delLinkedListQueue(LinkedListQueue *queue) {
  function size (line 37) | int size(LinkedListQueue *queue) {
  function empty (line 42) | bool empty(LinkedListQueue *queue) {
  function push (line 47) | void push(LinkedListQueue *queue, int num) {
  function peek (line 64) | int peek(LinkedListQueue *queue) {
  function pop (line 70) | int pop(LinkedListQueue *queue) {
  function printLinkedListQueue (line 80) | void printLinkedListQueue(LinkedListQueue *queue) {
  function main (line 94) | int main() {

FILE: codes/c/chapter_stack_and_queue/linkedlist_stack.c
  type LinkedListStack (line 10) | typedef struct {
  function LinkedListStack (line 16) | LinkedListStack *newLinkedListStack() {
  function delLinkedListStack (line 24) | void delLinkedListStack(LinkedListStack *s) {
  function size (line 34) | int size(LinkedListStack *s) {
  function isEmpty (line 39) | bool isEmpty(LinkedListStack *s) {
  function push (line 44) | void push(LinkedListStack *s, int num) {
  function peek (line 53) | int peek(LinkedListStack *s) {
  function pop (line 62) | int pop(LinkedListStack *s) {
  function main (line 73) | int main() {

FILE: codes/c/chapter_tree/array_binary_tree.c
  type ArrayBinaryTree (line 10) | typedef struct {
  function ArrayBinaryTree (line 16) | ArrayBinaryTree *newArrayBinaryTree(int *arr, int arrSize) {
  function delArrayBinaryTree (line 25) | void delArrayBinaryTree(ArrayBinaryTree *abt) {
  function size (line 31) | int size(ArrayBinaryTree *abt) {
  function val (line 36) | int val(ArrayBinaryTree *abt, int i) {
  function left (line 44) | int left(int i) {
  function right (line 49) | int right(int i) {
  function parent (line 54) | int parent(int i) {
  function dfs (line 72) | void dfs(ArrayBinaryTree *abt, int i, char *order, int *res, int *index) {
  function main (line 117) | int main() {

FILE: codes/c/chapter_tree/avl_tree.c
  type AVLTree (line 10) | typedef struct {
  function AVLTree (line 15) | AVLTree *newAVLTree() {
  function delAVLTree (line 22) | void delAVLTree(AVLTree *tree) {
  function height (line 28) | int height(TreeNode *node) {
  function updateHeight (line 37) | void updateHeight(TreeNode *node) {
  function balanceFactor (line 49) | int balanceFactor(TreeNode *node) {
  function TreeNode (line 59) | TreeNode *rightRotate(TreeNode *node) {
  function TreeNode (line 74) | TreeNode *leftRotate(TreeNode *node) {
  function TreeNode (line 89) | TreeNode *rotate(TreeNode *node) {
  function TreeNode (line 119) | TreeNode *insertHelper(TreeNode *node, int val) {
  function insert (line 141) | void insert(AVLTree *tree, int val) {
  function TreeNode (line 146) | TreeNode *removeHelper(TreeNode *node, int val) {
  function removeItem (line 190) | void removeItem(AVLTree *tree, int val) {
  function TreeNode (line 195) | TreeNode *search(AVLTree *tree, int val) {
  function testInsert (line 214) | void testInsert(AVLTree *tree, int val) {
  function testRemove (line 220) | void testRemove(AVLTree *tree, int val) {
  function main (line 227) | int main() {

FILE: codes/c/chapter_tree/binary_search_tree.c
  type BinarySearchTree (line 10) | typedef struct {
  function BinarySearchTree (line 15) | BinarySearchTree *newBinarySearchTree() {
  function delBinarySearchTree (line 23) | void delBinarySearchTree(BinarySearchTree *bst) {
  function TreeNode (line 29) | TreeNode *getRoot(BinarySearchTree *bst) {
  function TreeNode (line 34) | TreeNode *search(BinarySearchTree *bst, int num) {
  function insert (line 54) | void insert(BinarySearchTree *bst, int num) {
  function removeItem (line 87) | void removeItem(BinarySearchTree *bst, int num) {
  function main (line 138) | int main() {

FILE: codes/c/chapter_tree/binary_tree.c
  function main (line 10) | int main() {

FILE: codes/c/chapter_tree/binary_tree_bfs.c
  function main (line 54) | int main() {

FILE: codes/c/chapter_tree/binary_tree_dfs.c
  function preOrder (line 15) | void preOrder(TreeNode *root, int *size) {
  function inOrder (line 25) | void inOrder(TreeNode *root, int *size) {
  function postOrder (line 35) | void postOrder(TreeNode *root, int *size) {
  function main (line 45) | int main() {

FILE: codes/c/utils/common_test.c
  function testListNode (line 9) | void testListNode() {
  function testTreeNode (line 16) | void testTreeNode() {
  function main (line 29) | int main(int argc, char *argv[]) {

FILE: codes/c/utils/list_node.h
  type ListNode (line 15) | typedef struct ListNode {
  function ListNode (line 21) | ListNode *newListNode(int val) {
  function ListNode (line 30) | ListNode *arrToLinkedList(const int *arr, size_t size) {
  function freeMemoryLinkedList (line 45) | void freeMemoryLinkedList(ListNode *cur) {

FILE: codes/c/utils/print_util.h
  function printArray (line 22) | void printArray(int arr[], int size) {
  function printArrayFloat (line 35) | void printArrayFloat(float arr[], int size) {
  function printLinkedList (line 48) | void printLinkedList(ListNode *node) {
  type Trunk (line 59) | typedef struct Trunk {
  function Trunk (line 64) | Trunk *newTrunk(Trunk *prev, char *str) {
  function showTrunks (line 72) | void showTrunks(Trunk *trunk) {
  function printTreeHelper (line 85) | void printTreeHelper(TreeNode *node, Trunk *prev, bool isRight) {
  function printTree (line 113) | void printTree(TreeNode *root) {
  function printHeap (line 118) | void printHeap(int arr[], int size) {

FILE: codes/c/utils/tree_node.h
  type TreeNode (line 19) | typedef struct TreeNode {
  function TreeNode (line 27) | TreeNode *newTreeNode(int val) {
  function TreeNode (line 55) | TreeNode *arrayToTreeDFS(int *arr, int size, int i) {
  function TreeNode (line 67) | TreeNode *arrayToTree(int *arr, int size) {
  function treeToArrayDFS (line 72) | void treeToArrayDFS(TreeNode *root, int i, int *res, int *size) {
  function freeMemoryTree (line 95) | void freeMemoryTree(TreeNode *root) {

FILE: codes/c/utils/uthash.h
  type UT_hash_bucket (line 1072) | typedef struct UT_hash_bucket {
  type UT_hash_table (line 1096) | typedef struct UT_hash_table {
  type UT_hash_handle (line 1129) | typedef struct UT_hash_handle {

FILE: codes/c/utils/vector.h
  type vector (line 15) | typedef struct vector {
  function vector (line 23) | vector *newVector() {
  function vector (line 33) | vector *_newVector(int size, void *elem, int elemSize) {
  function delVector (line 48) | void delVector(vector *v) {
  function vectorPushback (line 67) | void vectorPushback(vector *v, void *elem, int elemSize) {
  function vectorPopback (line 78) | void vectorPopback(vector *v) {
  function vectorClear (line 86) | void vectorClear(vector *v) {
  function vectorSize (line 95) | int vectorSize(vector *v) {
  function vectorSet (line 120) | void vectorSet(vector *v, int pos, void *elem, int elemSize) {
  function vectorExpand (line 132) | void vectorExpand(vector *v) {
  function vectorShrink (line 138) | void vectorShrink(vector *v) {
  function vectorInsert (line 144) | void vectorInsert(vector *v, int pos, void *elem, int elemSize) {
  function vectorErase (line 158) | void vectorErase(vector *v, int pos) {
  function vectorSwap (line 169) | void vectorSwap(vector *v, int i, int j) {
  function vectorEmpty (line 176) | bool vectorEmpty(vector *v) {
  function vectorFull (line 181) | bool vectorFull(vector *v) {
  function vectorEqual (line 186) | bool vectorEqual(vector *v1, vector *v2) {
  function vectorSort (line 203) | void vectorSort(vector *v, int (*cmp)(const void *, const void *)) {
  function printVector (line 209) | void printVector(vector *v, void (*printFunc)(vector *v, void *p)) {
  function printVectorMatrix (line 239) | void printVectorMatrix(vector *vv, void (*printFunc)(vector *v, void *p)) {

FILE: codes/c/utils/vertex.h
  type Vertex (line 15) | typedef struct {
  function Vertex (line 20) | Vertex *newVertex(int val) {
  function Vertex (line 28) | Vertex **valsToVets(int *vals, int size) {

FILE: codes/cpp/chapter_array_and_linkedlist/array.cpp
  function randomAccess (line 10) | int randomAccess(int *nums, int size) {
  function insert (line 33) | void insert(int *nums, int size, int num, int index) {
  function remove (line 43) | void remove(int *nums, int size, int index) {
  function traverse (line 51) | void traverse(int *nums, int size) {
  function find (line 60) | int find(int *nums, int size, int target) {
  function main (line 69) | int main() {

FILE: codes/cpp/chapter_array_and_linkedlist/linked_list.cpp
  function insert (line 10) | void insert(ListNode *n0, ListNode *P) {
  function remove (line 17) | void remove(ListNode *n0) {
  function ListNode (line 29) | ListNode *access(ListNode *head, int index) {
  function find (line 39) | int find(ListNode *head, int target) {
  function main (line 51) | int main() {

FILE: codes/cpp/chapter_array_and_linkedlist/list.cpp
  function main (line 10) | int main() {

FILE: codes/cpp/chapter_array_and_linkedlist/my_list.cpp
  class MyList (line 10) | class MyList {
    method MyList (line 19) | MyList() {
    method size (line 29) | int size() {
    method capacity (line 34) | int capacity() {
    method get (line 39) | int get(int index) {
    method set (line 47) | void set(int index, int num) {
    method add (line 54) | void add(int num) {
    method insert (line 64) | void insert(int index, int num) {
    method remove (line 80) | int remove(int index) {
    method extendCapacity (line 95) | void extendCapacity() {
    method toVector (line 110) | vector<int> toVector() {
  function main (line 121) | int main() {

FILE: codes/cpp/chapter_backtracking/n_queens.cpp
  function backtrack (line 10) | void backtrack(int row, int n, vector<vector<string>> &state, vector<vec...
  function nQueens (line 37) | vector<vector<vector<string>>> nQueens(int n) {
  function main (line 51) | int main() {

FILE: codes/cpp/chapter_backtracking/permutations_i.cpp
  function backtrack (line 10) | void backtrack(vector<int> &state, const vector<int> &choices, vector<bo...
  function permutationsI (line 34) | vector<vector<int>> permutationsI(vector<int> nums) {
  function main (line 43) | int main() {

FILE: codes/cpp/chapter_backtracking/permutations_ii.cpp
  function backtrack (line 10) | void backtrack(vector<int> &state, const vector<int> &choices, vector<bo...
  function permutationsII (line 36) | vector<vector<int>> permutationsII(vector<int> nums) {
  function main (line 45) | int main() {

FILE: codes/cpp/chapter_backtracking/preorder_traversal_i_compact.cpp
  function preOrder (line 12) | void preOrder(TreeNode *root) {
  function main (line 25) | int main() {

FILE: codes/cpp/chapter_backtracking/preorder_traversal_ii_compact.cpp
  function preOrder (line 13) | void preOrder(TreeNode *root) {
  function main (line 30) | int main() {

FILE: codes/cpp/chapter_backtracking/preorder_traversal_iii_compact.cpp
  function preOrder (line 13) | void preOrder(TreeNode *root) {
  function main (line 31) | int main() {

FILE: codes/cpp/chapter_backtracking/preorder_traversal_iii_template.cpp
  function isSolution (line 10) | bool isSolution(vector<TreeNode *> &state) {
  function recordSolution (line 15) | void recordSolution(vector<TreeNode *> &state, vector<vector<TreeNode *>...
  function isValid (line 20) | bool isValid(vector<TreeNode *> &state, TreeNode *choice) {
  function makeChoice (line 25) | void makeChoice(vector<TreeNode *> &state, TreeNode *choice) {
  function undoChoice (line 30) | void undoChoice(vector<TreeNode *> &state, TreeNode *choice) {
  function backtrack (line 35) | void backtrack(vector<TreeNode *> &state, vector<TreeNode *> &choices, v...
  function main (line 57) | int main() {

FILE: codes/cpp/chapter_backtracking/subset_sum_i.cpp
  function backtrack (line 10) | void backtrack(vector<int> &state, int target, vector<int> &choices, int...
  function subsetSumI (line 34) | vector<vector<int>> subsetSumI(vector<int> &nums, int target) {
  function main (line 44) | int main() {

FILE: codes/cpp/chapter_backtracking/subset_sum_i_naive.cpp
  function backtrack (line 10) | void backtrack(vector<int> &state, int target, int total, vector<int> &c...
  function subsetSumINaive (line 32) | vector<vector<int>> subsetSumINaive(vector<int> &nums, int target) {
  function main (line 41) | int main() {

FILE: codes/cpp/chapter_backtracking/subset_sum_ii.cpp
  function backtrack (line 10) | void backtrack(vector<int> &state, int target, vector<int> &choices, int...
  function subsetSumII (line 39) | vector<vector<int>> subsetSumII(vector<int> &nums, int target) {
  function main (line 49) | int main() {

FILE: codes/cpp/chapter_computational_complexity/iteration.cpp
  function forLoop (line 10) | int forLoop(int n) {
  function whileLoop (line 20) | int whileLoop(int n) {
  function whileLoopII (line 32) | int whileLoopII(int n) {
  function string (line 46) | string nestedForLoop(int n) {
  function main (line 59) | int main() {

FILE: codes/cpp/chapter_computational_complexity/recursion.cpp
  function recur (line 10) | int recur(int n) {
  function forLoopRecur (line 21) | int forLoopRecur(int n) {
  function tailRecur (line 41) | int tailRecur(int n, int res) {
  function fib (line 50) | int fib(int n) {
  function main (line 61) | int main() {

FILE: codes/cpp/chapter_computational_complexity/space_complexity.cpp
  function func (line 10) | int func() {
  function constant (line 16) | void constant(int n) {
  function linear (line 33) | void linear(int n) {
  function linearRecur (line 49) | void linearRecur(int n) {
  function quadratic (line 57) | void quadratic(int n) {
  function quadraticRecur (line 70) | int quadraticRecur(int n) {
  function TreeNode (line 79) | TreeNode *buildTree(int n) {
  function main (line 89) | int main() {

FILE: codes/cpp/chapter_computational_complexity/time_complexity.cpp
  function constant (line 10) | int constant(int n) {
  function linear (line 19) | int linear(int n) {
  function arrayTraversal (line 27) | int arrayTraversal(vector<int> &nums) {
  function quadratic (line 37) | int quadratic(int n) {
  function bubbleSort (line 49) | int bubbleSort(vector<int> &nums) {
  function exponential (line 68) | int exponential(int n) {
  function expRecur (line 82) | int expRecur(int n) {
  function logarithmic (line 89) | int logarithmic(int n) {
  function logRecur (line 99) | int logRecur(int n) {
  function linearLogRecur (line 106) | int linearLogRecur(int n) {
  function factorialRecur (line 117) | int factorialRecur(int n) {
  function main (line 129) | int main() {

FILE: codes/cpp/chapter_computational_complexity/worst_best_time_complexity.cpp
  function randomNumbers (line 10) | vector<int> randomNumbers(int n) {
  function findOne (line 24) | int findOne(vector<int> &nums) {
  function main (line 35) | int main() {

FILE: codes/cpp/chapter_divide_and_conquer/binary_search_recur.cpp
  function dfs (line 10) | int dfs(vector<int> &nums, int target, int i, int j) {
  function binarySearch (line 30) | int binarySearch(vector<int> &nums, int target) {
  function main (line 37) | int main() {

FILE: codes/cpp/chapter_divide_and_conquer/build_tree.cpp
  function TreeNode (line 10) | TreeNode *dfs(vector<int> &preorder, unordered_map<int, int> &inorderMap...
  function TreeNode (line 27) | TreeNode *buildTree(vector<int> &preorder, vector<int> &inorder) {
  function main (line 38) | int main() {

FILE: codes/cpp/chapter_divide_and_conquer/hanota.cpp
  function move (line 10) | void move(vector<int> &src, vector<int> &tar) {
  function dfs (line 19) | void dfs(int i, vector<int> &src, vector<int> &buf, vector<int> &tar) {
  function solveHanota (line 34) | void solveHanota(vector<int> &A, vector<int> &B, vector<int> &C) {
  function main (line 41) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/climbing_stairs_backtrack.cpp
  function backtrack (line 11) | void backtrack(vector<int> &choices, int state, int n, vector<int> &res) {
  function climbingStairsBacktrack (line 27) | int climbingStairsBacktrack(int n) {
  function main (line 36) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/climbing_stairs_constraint_dp.cpp
  function climbingStairsConstraintDP (line 10) | int climbingStairsConstraintDP(int n) {
  function main (line 30) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/climbing_stairs_dfs.cpp
  function dfs (line 10) | int dfs(int i) {
  function climbingStairsDFS (line 20) | int climbingStairsDFS(int n) {
  function main (line 25) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/climbing_stairs_dfs_mem.cpp
  function dfs (line 10) | int dfs(int i, vector<int> &mem) {
  function climbingStairsDFSMem (line 25) | int climbingStairsDFSMem(int n) {
  function main (line 32) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/climbing_stairs_dp.cpp
  function climbingStairsDP (line 10) | int climbingStairsDP(int n) {
  function climbingStairsDPComp (line 26) | int climbingStairsDPComp(int n) {
  function main (line 39) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/coin_change.cpp
  function coinChangeDP (line 10) | int coinChangeDP(vector<int> &coins, int amt) {
  function coinChangeDPComp (line 35) | int coinChangeDPComp(vector<int> &coins, int amt) {
  function main (line 57) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/coin_change_ii.cpp
  function coinChangeIIDP (line 10) | int coinChangeIIDP(vector<int> &coins, int amt) {
  function coinChangeIIDPComp (line 34) | int coinChangeIIDPComp(vector<int> &coins, int amt) {
  function main (line 55) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/edit_distance.cpp
  function editDistanceDFS (line 10) | int editDistanceDFS(string s, string t, int i, int j) {
  function editDistanceDFSMem (line 32) | int editDistanceDFSMem(string s, string t, vector<vector<int>> &mem, int...
  function editDistanceDP (line 58) | int editDistanceDP(string s, string t) {
  function editDistanceDPComp (line 84) | int editDistanceDPComp(string s, string t) {
  function main (line 113) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/knapsack.cpp
  function knapsackDFS (line 8) | int knapsackDFS(vector<int> &wgt, vector<int> &val, int i, int c) {
  function knapsackDFSMem (line 25) | int knapsackDFSMem(vector<int> &wgt, vector<int> &val, vector<vector<int...
  function knapsackDP (line 47) | int knapsackDP(vector<int> &wgt, vector<int> &val, int cap) {
  function knapsackDPComp (line 67) | int knapsackDPComp(vector<int> &wgt, vector<int> &val, int cap) {
  function main (line 85) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/min_cost_climbing_stairs_dp.cpp
  function minCostClimbingStairsDP (line 10) | int minCostClimbingStairsDP(vector<int> &cost) {
  function minCostClimbingStairsDPComp (line 27) | int minCostClimbingStairsDPComp(vector<int> &cost) {
  function main (line 41) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/min_path_sum.cpp
  function minPathSumDFS (line 10) | int minPathSumDFS(vector<vector<int>> &grid, int i, int j) {
  function minPathSumDFSMem (line 27) | int minPathSumDFSMem(vector<vector<int>> &grid, vector<vector<int>> &mem...
  function minPathSumDP (line 49) | int minPathSumDP(vector<vector<int>> &grid) {
  function minPathSumDPComp (line 72) | int minPathSumDPComp(vector<vector<int>> &grid) {
  function main (line 94) | int main() {

FILE: codes/cpp/chapter_dynamic_programming/unbounded_knapsack.cpp
  function unboundedKnapsackDP (line 10) | int unboundedKnapsackDP(vector<int> &wgt, vector<int> &val, int cap) {
  function unboundedKnapsackDPComp (line 30) | int unboundedKnapsackDPComp(vector<int> &wgt, vector<int> &val, int cap) {
  function main (line 50) | int main() {

FILE: codes/cpp/chapter_graph/graph_adjacency_list.cpp
  class GraphAdjList (line 10) | class GraphAdjList {
    method remove (line 16) | void remove(vector<Vertex *> &vec, Vertex *vet) {
    method GraphAdjList (line 26) | GraphAdjList(const vector<vector<Vertex *>> &edges) {
    method size (line 36) | int size() {
    method addEdge (line 41) | void addEdge(Vertex *vet1, Vertex *vet2) {
    method removeEdge (line 50) | void removeEdge(Vertex *vet1, Vertex *vet2) {
    method addVertex (line 59) | void addVertex(Vertex *vet) {
    method removeVertex (line 67) | void removeVertex(Vertex *vet) {
    method print (line 79) | void print() {

FILE: codes/cpp/chapter_graph/graph_adjacency_list_test.cpp
  function main (line 10) | int main() {

FILE: codes/cpp/chapter_graph/graph_adjacency_matrix.cpp
  class GraphAdjMat (line 10) | class GraphAdjMat {
    method GraphAdjMat (line 16) | GraphAdjMat(const vector<int> &vertices, const vector<vector<int>> &ed...
    method size (line 29) | int size() const {
    method addVertex (line 34) | void addVertex(int val) {
    method removeVertex (line 47) | void removeVertex(int index) {
    method addEdge (line 63) | void addEdge(int i, int j) {
    method removeEdge (line 75) | void removeEdge(int i, int j) {
    method print (line 85) | void print() {
  function main (line 94) | int main() {

FILE: codes/cpp/chapter_graph/graph_bfs.cpp
  function graphBFS (line 12) | vector<Vertex *> graphBFS(GraphAdjList &graph, Vertex *startVet) {
  function main (line 38) | int main() {

FILE: codes/cpp/chapter_graph/graph_dfs.cpp
  function dfs (line 11) | void dfs(GraphAdjList &graph, unordered_set<Vertex *> &visited, vector<V...
  function graphDFS (line 25) | vector<Vertex *> graphDFS(GraphAdjList &graph, Vertex *startVet) {
  function main (line 35) | int main() {

FILE: codes/cpp/chapter_greedy/coin_change_greedy.cpp
  function coinChangeGreedy (line 10) | int coinChangeGreedy(vector<int> &coins, int amt) {
  function main (line 29) | int main() {

FILE: codes/cpp/chapter_greedy/fractional_knapsack.cpp
  class Item (line 10) | class Item {
    method Item (line 15) | Item(int w, int v) : w(w), v(v) {
  function fractionalKnapsack (line 20) | double fractionalKnapsack(vector<int> &wgt, vector<int> &val, int cap) {
  function main (line 46) | int main() {

FILE: codes/cpp/chapter_greedy/max_capacity.cpp
  function maxCapacity (line 10) | int maxCapacity(vector<int> &ht) {
  function main (line 31) | int main() {

FILE: codes/cpp/chapter_greedy/max_product_cutting.cpp
  function maxProductCutting (line 10) | int maxProductCutting(int n) {
  function main (line 31) | int main() {

FILE: codes/cpp/chapter_hashing/array_hash_map.cpp
  type Pair (line 10) | struct Pair {
    method Pair (line 14) | Pair(int key, string val) {
  class ArrayHashMap (line 21) | class ArrayHashMap {
    method ArrayHashMap (line 26) | ArrayHashMap() {
    method hashFunc (line 40) | int hashFunc(int key) {
    method string (line 46) | string get(int key) {
    method put (line 55) | void put(int key, string val) {
    method remove (line 62) | void remove(int key) {
    method pairSet (line 70) | vector<Pair *> pairSet() {
    method keySet (line 81) | vector<int> keySet() {
    method valueSet (line 92) | vector<string> valueSet() {
    method print (line 103) | void print() {

FILE: codes/cpp/chapter_hashing/array_hash_map_test.cpp
  function main (line 10) | int main() {

FILE: codes/cpp/chapter_hashing/built_in_hash.cpp
  function main (line 10) | int main() {

FILE: codes/cpp/chapter_hashing/hash_map.cpp
  function main (line 10) | int main() {

FILE: codes/cpp/chapter_hashing/hash_map_chaining.cpp
  class HashMapChaining (line 10) | class HashMapChaining {
    method HashMapChaining (line 20) | HashMapChaining() : size(0), capacity(4), loadThres(2.0 / 3.0), extend...
    method hashFunc (line 35) | int hashFunc(int key) {
    method loadFactor (line 40) | double loadFactor() {
    method string (line 45) | string get(int key) {
    method put (line 58) | void put(int key, string val) {
    method remove (line 77) | void remove(int key) {
    method extend (line 93) | void extend() {
    method print (line 112) | void print() {
  function main (line 124) | int main() {

FILE: codes/cpp/chapter_hashing/hash_map_open_addressing.cpp
  class HashMapOpenAddressing (line 10) | class HashMapOpenAddressing {
    method HashMapOpenAddressing (line 21) | HashMapOpenAddressing() : size(0), buckets(capacity, nullptr) {
    method hashFunc (line 35) | int hashFunc(int key) {
    method loadFactor (line 40) | double loadFactor() {
    method findBucket (line 45) | int findBucket(int key) {
    method string (line 72) | string get(int key) {
    method put (line 84) | void put(int key, string val) {
    method remove (line 102) | void remove(int key) {
    method extend (line 114) | void extend() {
    method print (line 131) | void print() {
  function main (line 145) | int main() {

FILE: codes/cpp/chapter_hashing/simple_hash.cpp
  function addHash (line 10) | int addHash(string key) {
  function mulHash (line 20) | int mulHash(string key) {
  function xorHash (line 30) | int xorHash(string key) {
  function rotHash (line 40) | int rotHash(string key) {
  function main (line 50) | int main() {

FILE: codes/cpp/chapter_heap/heap.cpp
  function testPush (line 9) | void testPush(priority_queue<int> &heap, int val) {
  function testPop (line 15) | void testPop(priority_queue<int> &heap) {
  function main (line 23) | int main() {

FILE: codes/cpp/chapter_heap/my_heap.cpp
  class MaxHeap (line 10) | class MaxHeap {
    method left (line 16) | int left(int i) {
    method right (line 21) | int right(int i) {
    method parent (line 26) | int parent(int i) {
    method siftUp (line 31) | void siftUp(int i) {
    method siftDown (line 46) | void siftDown(int i) {
    method MaxHeap (line 65) | MaxHeap(vector<int> nums) {
    method size (line 75) | int size() {
    method isEmpty (line 80) | bool isEmpty() {
    method peek (line 85) | int peek() {
    method push (line 90) | void push(int val) {
    method pop (line 98) | void pop() {
    method print (line 112) | void print() {
  function main (line 123) | int main() {

FILE: codes/cpp/chapter_heap/top_k.cpp
  function topKHeap (line 10) | priority_queue<int, vector<int>, greater<int>> topKHeap(vector<int> &num...
  function main (line 29) | int main() {

FILE: codes/cpp/chapter_searching/binary_search.cpp
  function binarySearch (line 10) | int binarySearch(vector<int> &nums, int target) {
  function binarySearchLCRO (line 28) | int binarySearchLCRO(vector<int> &nums, int target) {
  function main (line 46) | int main() {

FILE: codes/cpp/chapter_searching/binary_search_edge.cpp
  function binarySearchInsertion (line 10) | int binarySearchInsertion(const vector<int> &nums, int target) {
  function binarySearchLeftEdge (line 25) | int binarySearchLeftEdge(vector<int> &nums, int target) {
  function binarySearchRightEdge (line 37) | int binarySearchRightEdge(vector<int> &nums, int target) {
  function main (line 51) | int main() {

FILE: codes/cpp/chapter_searching/binary_search_insertion.cpp
  function binarySearchInsertionSimple (line 10) | int binarySearchInsertionSimple(vector<int> &nums, int target) {
  function binarySearchInsertion (line 27) | int binarySearchInsertion(vector<int> &nums, int target) {
  function main (line 44) | int main() {

FILE: codes/cpp/chapter_searching/hashing_search.cpp
  function hashingSearchArray (line 10) | int hashingSearchArray(unordered_map<int, int> map, int target) {
  function ListNode (line 19) | ListNode *hashingSearchLinkedList(unordered_map<int, ListNode *> map, in...
  function main (line 28) | int main() {

FILE: codes/cpp/chapter_searching/linear_search.cpp
  function linearSearchArray (line 10) | int linearSearchArray(vector<int> &nums, int target) {
  function ListNode (line 22) | ListNode *linearSearchLinkedList(ListNode *head, int target) {
  function main (line 35) | int main() {

FILE: codes/cpp/chapter_searching/two_sum.cpp
  function twoSumBruteForce (line 10) | vector<int> twoSumBruteForce(vector<int> &nums, int target) {
  function twoSumHashTable (line 23) | vector<int> twoSumHashTable(vector<int> &nums, int target) {
  function main (line 38) | int main() {

FILE: codes/cpp/chapter_sorting/bubble_sort.cpp
  function bubbleSort (line 10) | void bubbleSort(vector<int> &nums) {
  function bubbleSortWithFlag (line 25) | void bubbleSortWithFlag(vector<int> &nums) {
  function main (line 44) | int main() {

FILE: codes/cpp/chapter_sorting/bucket_sort.cpp
  function bucketSort (line 10) | void bucketSort(vector<float> &nums) {
  function main (line 36) | int main() {

FILE: codes/cpp/chapter_sorting/counting_sort.cpp
  function countingSortNaive (line 11) | void countingSortNaive(vector<int> &nums) {
  function countingSort (line 34) | void countingSort(vector<int> &nums) {
  function main (line 65) | int main() {

FILE: codes/cpp/chapter_sorting/heap_sort.cpp
  function siftDown (line 10) | void siftDown(vector<int> &nums, int n, int i) {
  function heapSort (line 32) | void heapSort(vector<int> &nums) {
  function main (line 47) | int main() {

FILE: codes/cpp/chapter_sorting/insertion_sort.cpp
  function insertionSort (line 10) | void insertionSort(vector<int> &nums) {
  function main (line 24) | int main() {

FILE: codes/cpp/chapter_sorting/merge_sort.cpp
  function merge (line 10) | void merge(vector<int> &nums, int left, int mid, int right) {
  function mergeSort (line 37) | void mergeSort(vector<int> &nums, int left, int right) {
  function main (line 50) | int main() {

FILE: codes/cpp/chapter_sorting/quick_sort.cpp
  class QuickSort (line 10) | class QuickSort {
    method partition (line 13) | static int partition(vector<int> &nums, int left, int right) {
    method quickSort (line 29) | static void quickSort(vector<int> &nums, int left, int right) {
  class QuickSortMedian (line 42) | class QuickSortMedian {
    method medianThree (line 45) | static int medianThree(vector<int> &nums, int left, int mid, int right) {
    method partition (line 55) | static int partition(vector<int> &nums, int left, int right) {
    method quickSort (line 75) | static void quickSort(vector<int> &nums, int left, int right) {
  class QuickSortTailCall (line 88) | class QuickSortTailCall {
    method partition (line 91) | static int partition(vector<int> &nums, int left, int right) {
    method quickSort (line 107) | static void quickSort(vector<int> &nums, int left, int right) {
  function main (line 125) | int main() {

FILE: codes/cpp/chapter_sorting/radix_sort.cpp
  function digit (line 10) | int digit(int num, int exp) {
  function countingSortDigit (line 16) | void countingSortDigit(vector<int> &nums, int exp) {
  function radixSort (line 43) | void radixSort(vector<int> &nums) {
  function main (line 56) | int main() {

FILE: codes/cpp/chapter_sorting/selection_sort.cpp
  function selectionSort (line 10) | void selectionSort(vector<int> &nums) {
  function main (line 26) | int main() {

FILE: codes/cpp/chapter_stack_and_queue/array_deque.cpp
  class ArrayDeque (line 10) | class ArrayDeque {
    method ArrayDeque (line 18) | ArrayDeque(int capacity) {
    method capacity (line 24) | int capacity() {
    method size (line 29) | int size() {
    method isEmpty (line 34) | bool isEmpty() {
    method index (line 39) | int index(int i) {
    method pushFirst (line 47) | void pushFirst(int num) {
    method pushLast (line 61) | void pushLast(int num) {
    method popFirst (line 74) | int popFirst() {
    method popLast (line 83) | int popLast() {
    method peekFirst (line 90) | int peekFirst() {
    method peekLast (line 97) | int peekLast() {
    method toVector (line 106) | vector<int> toVector() {
  function main (line 117) | int main() {

FILE: codes/cpp/chapter_stack_and_queue/array_queue.cpp
  class ArrayQueue (line 10) | class ArrayQueue {
    method ArrayQueue (line 18) | ArrayQueue(int capacity) {
    method capacity (line 30) | int capacity() {
    method size (line 35) | int size() {
    method isEmpty (line 40) | bool isEmpty() {
    method push (line 45) | void push(int num) {
    method pop (line 59) | int pop() {
    method peek (line 68) | int peek() {
    method toVector (line 75) | vector<int> toVector() {
  function main (line 86) | int main() {

FILE: codes/cpp/chapter_stack_and_queue/array_stack.cpp
  class ArrayStack (line 10) | class ArrayStack {
    method size (line 16) | int size() {
    method isEmpty (line 21) | bool isEmpty() {
    method push (line 26) | void push(int num) {
    method pop (line 31) | int pop() {
    method top (line 38) | int top() {
    method toVector (line 45) | vector<int> toVector() {
  function main (line 51) | int main() {

FILE: codes/cpp/chapter_stack_and_queue/deque.cpp
  function main (line 10) | int main() {

FILE: codes/cpp/chapter_stack_and_queue/linkedlist_deque.cpp
  type DoublyListNode (line 10) | struct DoublyListNode {
    method DoublyListNode (line 14) | DoublyListNode(int val) : val(val), prev(nullptr), next(nullptr) {
  class LinkedListDeque (line 19) | class LinkedListDeque {
    method LinkedListDeque (line 26) | LinkedListDeque() : front(nullptr), rear(nullptr) {
    method size (line 41) | int size() {
    method isEmpty (line 46) | bool isEmpty() {
    method push (line 51) | void push(int num, bool isFront) {
    method pushFirst (line 73) | void pushFirst(int num) {
    method pushLast (line 78) | void pushLast(int num) {
    method pop (line 83) | int pop(bool isFront) {
    method popFirst (line 115) | int popFirst() {
    method popLast (line 120) | int popLast() {
    method peekFirst (line 125) | int peekFirst() {
    method peekLast (line 132) | int peekLast() {
    method toVector (line 139) | vector<int> toVector() {
  function main (line 151) | int main() {

FILE: codes/cpp/chapter_stack_and_queue/linkedlist_queue.cpp
  class LinkedListQueue (line 10) | class LinkedListQueue {
    method LinkedListQueue (line 16) | LinkedListQueue() {
    method size (line 28) | int size() {
    method isEmpty (line 33) | bool isEmpty() {
    method push (line 38) | void push(int num) {
    method pop (line 55) | int pop() {
    method peek (line 67) | int peek() {
    method toVector (line 74) | vector<int> toVector() {
  function main (line 86) | int main() {

FILE: codes/cpp/chapter_stack_and_queue/linkedlist_stack.cpp
  class LinkedListStack (line 10) | class LinkedListStack {
    method LinkedListStack (line 16) | LinkedListStack() {
    method size (line 27) | int size() {
    method isEmpty (line 32) | bool isEmpty() {
    method push (line 37) | void push(int num) {
    method pop (line 45) | int pop() {
    method top (line 56) | int top() {
    method toVector (line 63) | vector<int> toVector() {
  function main (line 75) | int main() {

FILE: codes/cpp/chapter_stack_and_queue/queue.cpp
  function main (line 10) | int main() {

FILE: codes/cpp/chapter_stack_and_queue/stack.cpp
  function main (line 10) | int main() {

FILE: codes/cpp/chapter_tree/array_binary_tree.cpp
  class ArrayBinaryTree (line 10) | class ArrayBinaryTree {
    method ArrayBinaryTree (line 13) | ArrayBinaryTree(vector<int> arr) {
    method size (line 18) | int size() {
    method val (line 23) | int val(int i) {
    method left (line 31) | int left(int i) {
    method right (line 36) | int right(int i) {
    method parent (line 41) | int parent(int i) {
    method levelOrder (line 46) | vector<int> levelOrder() {
    method preOrder (line 57) | vector<int> preOrder() {
    method inOrder (line 64) | vector<int> inOrder() {
    method postOrder (line 71) | vector<int> postOrder() {
    method dfs (line 81) | void dfs(int i, string order, vector<int> &res) {
  function main (line 100) | int main() {

FILE: codes/cpp/chapter_tree/avl_tree.cpp
  class AVLTree (line 10) | class AVLTree {
    method updateHeight (line 13) | void updateHeight(TreeNode *node) {
    method TreeNode (line 19) | TreeNode *rightRotate(TreeNode *node) {
    method TreeNode (line 33) | TreeNode *leftRotate(TreeNode *node) {
    method TreeNode (line 47) | TreeNode *rotate(TreeNode *node) {
    method TreeNode (line 77) | TreeNode *insertHelper(TreeNode *node, int val) {
    method TreeNode (line 95) | TreeNode *removeHelper(TreeNode *node, int val) {
    method height (line 138) | int height(TreeNode *node) {
    method balanceFactor (line 144) | int balanceFactor(TreeNode *node) {
    method insert (line 153) | void insert(int val) {
    method remove (line 158) | void remove(int val) {
    method TreeNode (line 163) | TreeNode *search(int val) {
    method AVLTree (line 182) | AVLTree() : root(nullptr) {
  function testInsert (line 191) | void testInsert(AVLTree &tree, int val) {
  function testRemove (line 197) | void testRemove(AVLTree &tree, int val) {
  function main (line 204) | int main() {

FILE: codes/cpp/chapter_tree/binary_search_tree.cpp
  class BinarySearchTree (line 10) | class BinarySearchTree {
    method BinarySearchTree (line 16) | BinarySearchTree() {
    method TreeNode (line 27) | TreeNode *getRoot() {
    method TreeNode (line 32) | TreeNode *search(int num) {
    method insert (line 51) | void insert(int num) {
    method remove (line 80) | void remove(int num) {
  function main (line 135) | int main() {

FILE: codes/cpp/chapter_tree/binary_tree.cpp
  function main (line 10) | int main() {

FILE: codes/cpp/chapter_tree/binary_tree_bfs.cpp
  function levelOrder (line 10) | vector<int> levelOrder(TreeNode *root) {
  function main (line 29) | int main() {

FILE: codes/cpp/chapter_tree/binary_tree_dfs.cpp
  function preOrder (line 13) | void preOrder(TreeNode *root) {
  function inOrder (line 23) | void inOrder(TreeNode *root) {
  function postOrder (line 33) | void postOrder(TreeNode *root) {
  function main (line 43) | int main() {

FILE: codes/cpp/utils/list_node.hpp
  type ListNode (line 15) | struct ListNode {
    method ListNode (line 18) | ListNode(int x) : val(x), next(nullptr) {
  function ListNode (line 23) | ListNode *vecToLinkedList(vector<int> list) {
    method ListNode (line 18) | ListNode(int x) : val(x), next(nullptr) {
  function freeMemoryLinkedList (line 34) | void freeMemoryLinkedList(ListNode *cur) {

FILE: codes/cpp/utils/print_utils.hpp
  function vecFind (line 17) | int vecFind(const vector<T> &vec, T ele) {
  function string (line 28) | string strJoin(const string &delim, const T &vec) {
  function string (line 40) | string strRepeat(string str, int n) {
  function printArray (line 48) | void printArray(T *arr, int n) {
  function string (line 60) | string getVectorString(vector<T> &list) {
  function printVector (line 65) | void printVector(vector<T> list) {
  function printVectorMatrix (line 70) | void printVectorMatrix(vector<vector<T>> &matrix) {
  function printLinkedList (line 78) | void printLinkedList(ListNode *head) {
  type Trunk (line 88) | struct Trunk {
    method Trunk (line 91) | Trunk(Trunk *prev, string str) {
  function showTrunks (line 97) | void showTrunks(Trunk *p) {
  function printTree (line 111) | void printTree(TreeNode *root, Trunk *prev, bool isRight) {
  function printTree (line 143) | void printTree(TreeNode *root) {
  function printStack (line 148) | void printStack(stack<T> stk) {
  function printQueue (line 170) | void printQueue(queue<T> queue) {
  function printDeque (line 186) | void printDeque(deque<T> deque) {
  function printHashMap (line 203) | void printHashMap(unordered_map<TKey, TValue> map) {
  function S (line 210) | S &Container(priority_queue<T, S, C> &pq) {
  function printHeap (line 220) | void printHeap(priority_queue<T, S, C> &heap) {

FILE: codes/cpp/utils/tree_node.hpp
  type TreeNode (line 15) | struct TreeNode {
    method TreeNode (line 21) | TreeNode() = default;
    method TreeNode (line 22) | explicit TreeNode(int x, TreeNode *parent = nullptr) : val(x), parent(...
  function TreeNode (line 43) | TreeNode *vectorToTreeDFS(vector<int> &arr, int i) {
    method TreeNode (line 21) | TreeNode() = default;
    method TreeNode (line 22) | explicit TreeNode(int x, TreeNode *parent = nullptr) : val(x), parent(...
  function TreeNode (line 54) | TreeNode *vectorToTree(vector<int> arr) {
    method TreeNode (line 21) | TreeNode() = default;
    method TreeNode (line 22) | explicit TreeNode(int x, TreeNode *parent = nullptr) : val(x), parent(...
  function treeToVecorDFS (line 59) | void treeToVecorDFS(TreeNode *root, int i, vector<int> &res) {
  function treeToVecor (line 71) | vector<int> treeToVecor(TreeNode *root) {
  function freeMemoryTree (line 78) | void freeMemoryTree(TreeNode *root) {

FILE: codes/cpp/utils/vertex.hpp
  type Vertex (line 14) | struct Vertex {
    method Vertex (line 16) | Vertex(int x) : val(x) {
  function valsToVets (line 21) | vector<Vertex *> valsToVets(vector<int> vals) {
  function vetsToVals (line 30) | vector<int> vetsToVals(vector<Vertex *> vets) {

FILE: codes/csharp/chapter_array_and_linkedlist/array.cs
  class array (line 7) | public class array {
    method RandomAccess (line 9) | int RandomAccess(int[] nums) {
    method Extend (line 19) | int[] Extend(int[] nums, int enlarge) {
    method Insert (line 31) | void Insert(int[] nums, int num, int index) {
    method Remove (line 41) | void Remove(int[] nums, int index) {
    method Traverse (line 49) | void Traverse(int[] nums) {
    method Find (line 62) | int Find(int[] nums, int target) {
    method ToString (line 71) | string ToString(int[] nums) {
    method Test (line 76) | [Test]

FILE: codes/csharp/chapter_array_and_linkedlist/linked_list.cs
  class linked_list (line 7) | public class linked_list {
    method Insert (line 9) | void Insert(ListNode n0, ListNode P) {
    method Remove (line 16) | void Remove(ListNode n0) {
    method Access (line 26) | ListNode? Access(ListNode? head, int index) {
    method Find (line 36) | int Find(ListNode? head, int target) {
    method Test (line 48) | [Test]

FILE: codes/csharp/chapter_array_and_linkedlist/list.cs
  class list (line 9) | public class list {
    method Test (line 10) | [Test]

FILE: codes/csharp/chapter_array_and_linkedlist/my_list.cs
  class MyList (line 10) | class MyList {
    method MyList (line 17) | public MyList() {
    method Size (line 22) | public int Size() {
    method Capacity (line 27) | public int Capacity() {
    method Get (line 32) | public int Get(int index) {
    method Set (line 40) | public void Set(int index, int num) {
    method Add (line 47) | public void Add(int num) {
    method Insert (line 57) | public void Insert(int index, int num) {
    method Remove (line 73) | public int Remove(int index) {
    method ExtendCapacity (line 88) | public void ExtendCapacity() {
    method ToArray (line 96) | public int[] ToArray() {
  class my_list (line 106) | public class my_list {
    method Test (line 107) | [Test]

FILE: codes/csharp/chapter_backtracking/n_queens.cs
  class n_queens (line 9) | public class n_queens {
    method Backtrack (line 11) | void Backtrack(int row, int n, List<List<string>> state, List<List<Lis...
    method NQueens (line 42) | List<List<List<string>>> NQueens(int n) {
    method Test (line 62) | [Test]

FILE: codes/csharp/chapter_backtracking/permutations_i.cs
  class permutations_i (line 9) | public class permutations_i {
    method Backtrack (line 11) | void Backtrack(List<int> state, int[] choices, bool[] selected, List<L...
    method PermutationsI (line 35) | List<List<int>> PermutationsI(int[] nums) {
    method Test (line 41) | [Test]

FILE: codes/csharp/chapter_backtracking/permutations_ii.cs
  class permutations_ii (line 9) | public class permutations_ii {
    method Backtrack (line 11) | void Backtrack(List<int> state, int[] choices, bool[] selected, List<L...
    method PermutationsII (line 37) | List<List<int>> PermutationsII(int[] nums) {
    method Test (line 43) | [Test]

FILE: codes/csharp/chapter_backtracking/preorder_traversal_i_compact.cs
  class preorder_traversal_i_compact (line 9) | public class preorder_traversal_i_compact {
    method PreOrder (line 13) | void PreOrder(TreeNode? root) {
    method Test (line 25) | [Test]

FILE: codes/csharp/chapter_backtracking/preorder_traversal_ii_compact.cs
  class preorder_traversal_ii_compact (line 9) | public class preorder_traversal_ii_compact {
    method PreOrder (line 14) | void PreOrder(TreeNode? root) {
    method Test (line 30) | [Test]

FILE: codes/csharp/chapter_backtracking/preorder_traversal_iii_compact.cs
  class preorder_traversal_iii_compact (line 9) | public class preorder_traversal_iii_compact {
    method PreOrder (line 14) | void PreOrder(TreeNode? root) {
    method Test (line 31) | [Test]

FILE: codes/csharp/chapter_backtracking/preorder_traversal_iii_template.cs
  class preorder_traversal_iii_template (line 9) | public class preorder_traversal_iii_template {
    method IsSolution (line 11) | bool IsSolution(List<TreeNode> state) {
    method RecordSolution (line 16) | void RecordSolution(List<TreeNode> state, List<List<TreeNode>> res) {
    method IsValid (line 21) | bool IsValid(List<TreeNode> state, TreeNode choice) {
    method MakeChoice (line 26) | void MakeChoice(List<TreeNode> state, TreeNode choice) {
    method UndoChoice (line 31) | void UndoChoice(List<TreeNode> state, TreeNode choice) {
    method Backtrack (line 36) | void Backtrack(List<TreeNode> state, List<TreeNode> choices, List<List...
    method Test (line 56) | [Test]

FILE: codes/csharp/chapter_backtracking/subset_sum_i.cs
  class subset_sum_i (line 9) | public class subset_sum_i {
    method Backtrack (line 11) | void Backtrack(List<int> state, int target, int[] choices, int start, ...
    method SubsetSumI (line 35) | List<List<int>> SubsetSumI(int[] nums, int target) {
    method Test (line 44) | [Test]

FILE: codes/csharp/chapter_backtracking/subset_sum_i_naive.cs
  class subset_sum_i_naive (line 9) | public class subset_sum_i_naive {
    method Backtrack (line 11) | void Backtrack(List<int> state, int target, int total, int[] choices, ...
    method SubsetSumINaive (line 33) | List<List<int>> SubsetSumINaive(int[] nums, int target) {
    method Test (line 41) | [Test]

FILE: codes/csharp/chapter_backtracking/subset_sum_ii.cs
  class subset_sum_ii (line 9) | public class subset_sum_ii {
    method Backtrack (line 11) | void Backtrack(List<int> state, int target, int[] choices, int start, ...
    method SubsetSumII (line 40) | List<List<int>> SubsetSumII(int[] nums, int target) {
    method Test (line 49) | [Test]

FILE: codes/csharp/chapter_computational_complexity/iteration.cs
  class iteration (line 9) | public class iteration {
    method ForLoop (line 11) | int ForLoop(int n) {
    method WhileLoop (line 21) | int WhileLoop(int n) {
    method WhileLoopII (line 33) | int WhileLoopII(int n) {
    method NestedForLoop (line 47) | string NestedForLoop(int n) {
    method Test (line 60) | [Test]

FILE: codes/csharp/chapter_computational_complexity/recursion.cs
  class recursion (line 9) | public class recursion {
    method Recur (line 11) | int Recur(int n) {
    method ForLoopRecur (line 22) | int ForLoopRecur(int n) {
    method TailRecur (line 41) | int TailRecur(int n, int res) {
    method Fib (line 50) | int Fib(int n) {
    method Test (line 61) | [Test]

FILE: codes/csharp/chapter_computational_complexity/space_complexity.cs
  class space_complexity (line 9) | public class space_complexity {
    method Function (line 11) | int Function() {
    method Constant (line 17) | void Constant(int n) {
    method Linear (line 34) | void Linear(int n) {
    method LinearRecur (line 50) | void LinearRecur(int n) {
    method Quadratic (line 57) | void Quadratic(int n) {
    method QuadraticRecur (line 72) | int QuadraticRecur(int n) {
    method BuildTree (line 80) | TreeNode? BuildTree(int n) {
    method Test (line 89) | [Test]

FILE: codes/csharp/chapter_computational_complexity/time_complexity.cs
  class time_complexity (line 9) | public class time_complexity {
    method Algorithm (line 10) | void Algorithm(int n) {
    method AlgorithmA (line 26) | void AlgorithmA(int n) {
    method AlgorithmB (line 31) | void AlgorithmB(int n) {
    method AlgorithmC (line 38) | void AlgorithmC(int n) {
    method Constant (line 45) | int Constant(int n) {
    method Linear (line 54) | int Linear(int n) {
    method ArrayTraversal (line 62) | int ArrayTraversal(int[] nums) {
    method Quadratic (line 72) | int Quadratic(int n) {
    method BubbleSort (line 84) | int BubbleSort(int[] nums) {
    method Exponential (line 101) | int Exponential(int n) {
    method ExpRecur (line 115) | int ExpRecur(int n) {
    method Logarithmic (line 121) | int Logarithmic(int n) {
    method LogRecur (line 131) | int LogRecur(int n) {
    method LinearLogRecur (line 137) | int LinearLogRecur(int n) {
    method FactorialRecur (line 147) | int FactorialRecur(int n) {
    method Test (line 157) | [Test]

FILE: codes/csharp/chapter_computational_complexity/worst_best_time_complexity.cs
  class worst_best_time_complexity (line 9) | public class worst_best_time_complexity {
    method RandomNumbers (line 11) | int[] RandomNumbers(int n) {
    method FindOne (line 27) | int FindOne(int[] nums) {
    method Test (line 39) | [Test]

FILE: codes/csharp/chapter_divide_and_conquer/binary_search_recur.cs
  class binary_search_recur (line 9) | public class binary_search_recur {
    method DFS (line 11) | int DFS(int[] nums, int target, int i, int j) {
    method BinarySearch (line 31) | int BinarySearch(int[] nums, int target) {
    method Test (line 37) | [Test]

FILE: codes/csharp/chapter_divide_and_conquer/build_tree.cs
  class build_tree (line 9) | public class build_tree {
    method DFS (line 11) | TreeNode? DFS(int[] preorder, Dictionary<int, int> inorderMap, int i, ...
    method BuildTree (line 28) | TreeNode? BuildTree(int[] preorder, int[] inorder) {
    method Test (line 38) | [Test]

FILE: codes/csharp/chapter_divide_and_conquer/hanota.cs
  class hanota (line 9) | public class hanota {
    method Move (line 11) | void Move(List<int> src, List<int> tar) {
    method DFS (line 20) | void DFS(int i, List<int> src, List<int> buf, List<int> tar) {
    method SolveHanota (line 35) | void SolveHanota(List<int> A, List<int> B, List<int> C) {
    method Test (line 41) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/climbing_stairs_backtrack.cs
  class climbing_stairs_backtrack (line 9) | public class climbing_stairs_backtrack {
    method Backtrack (line 11) | void Backtrack(List<int> choices, int state, int n, List<int> res) {
    method ClimbingStairsBacktrack (line 27) | int ClimbingStairsBacktrack(int n) {
    method Test (line 35) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/climbing_stairs_constraint_dp.cs
  class climbing_stairs_constraint_dp (line 9) | public class climbing_stairs_constraint_dp {
    method ClimbingStairsConstraintDP (line 11) | int ClimbingStairsConstraintDP(int n) {
    method Test (line 30) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/climbing_stairs_dfs.cs
  class climbing_stairs_dfs (line 9) | public class climbing_stairs_dfs {
    method DFS (line 11) | int DFS(int i) {
    method ClimbingStairsDFS (line 21) | int ClimbingStairsDFS(int n) {
    method Test (line 25) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/climbing_stairs_dfs_mem.cs
  class climbing_stairs_dfs_mem (line 9) | public class climbing_stairs_dfs_mem {
    method DFS (line 11) | int DFS(int i, int[] mem) {
    method ClimbingStairsDFSMem (line 26) | int ClimbingStairsDFSMem(int n) {
    method Test (line 33) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/climbing_stairs_dp.cs
  class climbing_stairs_dp (line 9) | public class climbing_stairs_dp {
    method ClimbingStairsDP (line 11) | int ClimbingStairsDP(int n) {
    method ClimbingStairsDPComp (line 27) | int ClimbingStairsDPComp(int n) {
    method Test (line 39) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/coin_change.cs
  class coin_change (line 9) | public class coin_change {
    method CoinChangeDP (line 11) | int CoinChangeDP(int[] coins, int amt) {
    method CoinChangeDPComp (line 36) | int CoinChangeDPComp(int[] coins, int amt) {
    method Test (line 58) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/coin_change_ii.cs
  class coin_change_ii (line 9) | public class coin_change_ii {
    method CoinChangeIIDP (line 11) | int CoinChangeIIDP(int[] coins, int amt) {
    method CoinChangeIIDPComp (line 35) | int CoinChangeIIDPComp(int[] coins, int amt) {
    method Test (line 55) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/edit_distance.cs
  class edit_distance (line 9) | public class edit_distance {
    method EditDistanceDFS (line 11) | int EditDistanceDFS(string s, string t, int i, int j) {
    method EditDistanceDFSMem (line 33) | int EditDistanceDFSMem(string s, string t, int[][] mem, int i, int j) {
    method EditDistanceDP (line 59) | int EditDistanceDP(string s, string t) {
    method EditDistanceDPComp (line 85) | int EditDistanceDPComp(string s, string t) {
    method Test (line 113) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/knapsack.cs
  class knapsack (line 9) | public class knapsack {
    method KnapsackDFS (line 11) | int KnapsackDFS(int[] weight, int[] val, int i, int c) {
    method KnapsackDFSMem (line 28) | int KnapsackDFSMem(int[] weight, int[] val, int[][] mem, int i, int c) {
    method KnapsackDP (line 50) | int KnapsackDP(int[] weight, int[] val, int cap) {
    method KnapsackDPComp (line 70) | int KnapsackDPComp(int[] weight, int[] val, int cap) {
    method Test (line 90) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/min_cost_climbing_stairs_dp.cs
  class min_cost_climbing_stairs_dp (line 9) | public class min_cost_climbing_stairs_dp {
    method MinCostClimbingStairsDP (line 11) | int MinCostClimbingStairsDP(int[] cost) {
    method MinCostClimbingStairsDPComp (line 28) | int MinCostClimbingStairsDPComp(int[] cost) {
    method Test (line 41) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/min_path_sum.cs
  class min_path_sum (line 9) | public class min_path_sum {
    method MinPathSumDFS (line 11) | int MinPathSumDFS(int[][] grid, int i, int j) {
    method MinPathSumDFSMem (line 28) | int MinPathSumDFSMem(int[][] grid, int[][] mem, int i, int j) {
    method MinPathSumDP (line 50) | int MinPathSumDP(int[][] grid) {
    method MinPathSumDPComp (line 73) | int MinPathSumDPComp(int[][] grid) {
    method Test (line 94) | [Test]

FILE: codes/csharp/chapter_dynamic_programming/unbounded_knapsack.cs
  class unbounded_knapsack (line 9) | public class unbounded_knapsack {
    method UnboundedKnapsackDP (line 11) | int UnboundedKnapsackDP(int[] wgt, int[] val, int cap) {
    method UnboundedKnapsackDPComp (line 31) | int UnboundedKnapsackDPComp(int[] wgt, int[] val, int cap) {
    method Test (line 50) | [Test]

FILE: codes/csharp/chapter_graph/graph_adjacency_list.cs
  class GraphAdjList (line 10) | public class GraphAdjList {
    method GraphAdjList (line 15) | public GraphAdjList(Vertex[][] edges) {
    method Size (line 26) | int Size() {
    method AddEdge (line 31) | public void AddEdge(Vertex vet1, Vertex vet2) {
    method RemoveEdge (line 40) | public void RemoveEdge(Vertex vet1, Vertex vet2) {
    method AddVertex (line 49) | public void AddVertex(Vertex vet) {
    method RemoveVertex (line 57) | public void RemoveVertex(Vertex vet) {
    method Print (line 69) | public void Print() {
  class graph_adjacency_list (line 80) | public class graph_adjacency_list {
    method Test (line 81) | [Test]

FILE: codes/csharp/chapter_graph/graph_adjacency_matrix.cs
  class GraphAdjMat (line 10) | class GraphAdjMat {
    method GraphAdjMat (line 15) | public GraphAdjMat(int[] vertices, int[][] edges) {
    method Size (line 30) | int Size() {
    method AddVertex (line 35) | public void AddVertex(int val) {
    method RemoveVertex (line 52) | public void RemoveVertex(int index) {
    method AddEdge (line 67) | public void AddEdge(int i, int j) {
    method RemoveEdge (line 78) | public void RemoveEdge(int i, int j) {
    method Print (line 87) | public void Print() {
  class graph_adjacency_matrix (line 95) | public class graph_adjacency_matrix {
    method Test (line 96) | [Test]

FILE: codes/csharp/chapter_graph/graph_bfs.cs
  class graph_bfs (line 9) | public class graph_bfs {
    method GraphBFS (line 12) | List<Vertex> GraphBFS(GraphAdjList graph, Vertex startVet) {
    method Test (line 37) | [Test]

FILE: codes/csharp/chapter_graph/graph_dfs.cs
  class graph_dfs (line 9) | public class graph_dfs {
    method DFS (line 11) | void DFS(GraphAdjList graph, HashSet<Vertex> visited, List<Vertex> res...
    method GraphDFS (line 26) | List<Vertex> GraphDFS(GraphAdjList graph, Vertex startVet) {
    method Test (line 35) | [Test]

FILE: codes/csharp/chapter_greedy/coin_change_greedy.cs
  class coin_change_greedy (line 9) | public class coin_change_greedy {
    method CoinChangeGreedy (line 11) | int CoinChangeGreedy(int[] coins, int amt) {
    method Test (line 29) | [Test]

FILE: codes/csharp/chapter_greedy/fractional_knapsack.cs
  class Item (line 10) | class Item(int w, int v) {
  class fractional_knapsack (line 15) | public class fractional_knapsack {
    method FractionalKnapsack (line 17) | double FractionalKnapsack(int[] wgt, int[] val, int cap) {
    method Test (line 42) | [Test]

FILE: codes/csharp/chapter_greedy/max_capacity.cs
  class max_capacity (line 9) | public class max_capacity {
    method MaxCapacity (line 11) | int MaxCapacity(int[] ht) {
    method Test (line 31) | [Test]

FILE: codes/csharp/chapter_greedy/max_product_cutting.cs
  class max_product_cutting (line 9) | public class max_product_cutting {
    method MaxProductCutting (line 11) | int MaxProductCutting(int n) {
    method Test (line 31) | [Test]

FILE: codes/csharp/chapter_hashing/array_hash_map.cs
  class Pair (line 10) | class Pair(int key, string val) {
  class ArrayHashMap (line 16) | class ArrayHashMap {
    method ArrayHashMap (line 18) | public ArrayHashMap() {
    method HashFunc (line 27) | int HashFunc(int key) {
    method Get (line 33) | public string? Get(int key) {
    method Put (line 41) | public void Put(int key, string val) {
    method Remove (line 48) | public void Remove(int key) {
    method PairSet (line 55) | public List<Pair> PairSet() {
    method KeySet (line 65) | public List<int> KeySet() {
    method ValueSet (line 75) | public List<string> ValueSet() {
    method Print (line 85) | public void Print() {
  class array_hash_map (line 93) | public class array_hash_map {
    method Test (line 94) | [Test]

FILE: codes/csharp/chapter_hashing/built_in_hash.cs
  class built_in_hash (line 9) | public class built_in_hash {
    method Test (line 10) | [Test]

FILE: codes/csharp/chapter_hashing/hash_map.cs
  class hash_map (line 10) | public class hash_map {
    method Test (line 11) | [Test]

FILE: codes/csharp/chapter_hashing/hash_map_chaining.cs
  class HashMapChaining (line 10) | class HashMapChaining {
    method HashMapChaining (line 18) | public HashMapChaining() {
    method HashFunc (line 30) | int HashFunc(int key) {
    method LoadFactor (line 35) | double LoadFactor() {
    method Get (line 40) | public string? Get(int key) {
    method Put (line 53) | public void Put(int key, string val) {
    method Remove (line 72) | public void Remove(int key) {
    method Extend (line 85) | void Extend() {
    method Print (line 104) | public void Print() {
  class hash_map_chaining (line 117) | public class hash_map_chaining {
    method Test (line 118) | [Test]

FILE: codes/csharp/chapter_hashing/hash_map_open_addressing.cs
  class HashMapOpenAddressing (line 10) | class HashMapOpenAddressing {
    method HashMapOpenAddressing (line 19) | public HashMapOpenAddressing() {
    method HashFunc (line 25) | int HashFunc(int key) {
    method LoadFactor (line 30) | double LoadFactor() {
    method FindBucket (line 35) | int FindBucket(int key) {
    method Get (line 62) | public string? Get(int key) {
    method Put (line 74) | public void Put(int key, string val) {
    method Remove (line 92) | public void Remove(int key) {
    method Extend (line 103) | void Extend() {
    method Print (line 119) | public void Print() {
  class hash_map_open_addressing (line 132) | public class hash_map_open_addressing {
    method Test (line 133) | [Test]

FILE: codes/csharp/chapter_hashing/simple_hash.cs
  class simple_hash (line 9) | public class simple_hash {
    method AddHash (line 11) | int AddHash(string key) {
    method MulHash (line 21) | int MulHash(string key) {
    method XorHash (line 31) | int XorHash(string key) {
    method RotHash (line 41) | int RotHash(string key) {
    method Test (line 50) | [Test]

FILE: codes/csharp/chapter_heap/heap.cs
  class heap (line 9) | public class heap {
    method TestPush (line 10) | void TestPush(PriorityQueue<int, int> heap, int val) {
    method TestPop (line 16) | void TestPop(PriorityQueue<int, int> heap) {
    method Test (line 22) | [Test]

FILE: codes/csharp/chapter_heap/my_heap.cs
  class MaxHeap (line 10) | class MaxHeap {
    method MaxHeap (line 15) | public MaxHeap() {
    method MaxHeap (line 20) | public MaxHeap(IEnumerable<int> nums) {
    method Left (line 31) | int Left(int i) {
    method Right (line 36) | int Right(int i) {
    method Parent (line 41) | int Parent(int i) {
    method Peek (line 46) | public int Peek() {
    method Push (line 51) | public void Push(int val) {
    method Size (line 59) | public int Size() {
    method IsEmpty (line 64) | public bool IsEmpty() {
    method SiftUp (line 69) | void SiftUp(int i) {
    method Pop (line 84) | public int Pop() {
    method SiftDown (line 100) | void SiftDown(int i) {
    method Swap (line 118) | void Swap(int i, int p) {
    method Print (line 123) | public void Print() {
  class my_heap (line 129) | public class my_heap {
    method Test (line 130) | [Test]

FILE: codes/csharp/chapter_heap/top_k.cs
  class top_k (line 9) | public class top_k {
    method TopKHeap (line 11) | PriorityQueue<int, int> TopKHeap(int[] nums, int k) {
    method Test (line 29) | [Test]

FILE: codes/csharp/chapter_searching/binary_search.cs
  class binary_search (line 9) | public class binary_search {
    method BinarySearch (line 11) | int BinarySearch(int[] nums, int target) {
    method BinarySearchLCRO (line 29) | int BinarySearchLCRO(int[] nums, int target) {
    method Test (line 46) | [Test]

FILE: codes/csharp/chapter_searching/binary_search_edge.cs
  class binary_search_edge (line 9) | public class binary_search_edge {
    method BinarySearchLeftEdge (line 11) | int BinarySearchLeftEdge(int[] nums, int target) {
    method BinarySearchRightEdge (line 23) | int BinarySearchRightEdge(int[] nums, int target) {
    method Test (line 36) | [Test]

FILE: codes/csharp/chapter_searching/binary_search_insertion.cs
  class binary_search_insertion (line 9) | public class binary_search_insertion {
    method BinarySearchInsertionSimple (line 11) | public static int BinarySearchInsertionSimple(int[] nums, int target) {
    method BinarySearchInsertion (line 28) | public static int BinarySearchInsertion(int[] nums, int target) {
    method Test (line 44) | [Test]

FILE: codes/csharp/chapter_searching/hashing_search.cs
  class hashing_search (line 9) | public class hashing_search {
    method HashingSearchArray (line 11) | int HashingSearchArray(Dictionary<int, int> map, int target) {
    method HashingSearchLinkedList (line 18) | ListNode? HashingSearchLinkedList(Dictionary<int, ListNode> map, int t...
    method Test (line 25) | [Test]

FILE: codes/csharp/chapter_searching/linear_search.cs
  class linear_search (line 9) | public class linear_search {
    method LinearSearchArray (line 11) | int LinearSearchArray(int[] nums, int target) {
    method LinearSearchLinkedList (line 23) | ListNode? LinearSearchLinkedList(ListNode? head, int target) {
    method Test (line 35) | [Test]

FILE: codes/csharp/chapter_searching/two_sum.cs
  class two_sum (line 9) | public class two_sum {
    method TwoSumBruteForce (line 11) | int[] TwoSumBruteForce(int[] nums, int target) {
    method TwoSumHashTable (line 24) | int[] TwoSumHashTable(int[] nums, int target) {
    method Test (line 38) | [Test]

FILE: codes/csharp/chapter_sorting/bubble_sort.cs
  class bubble_sort (line 9) | public class bubble_sort {
    method BubbleSort (line 11) | void BubbleSort(int[] nums) {
    method BubbleSortWithFlag (line 25) | void BubbleSortWithFlag(int[] nums) {
    method Test (line 41) | [Test]

FILE: codes/csharp/chapter_sorting/bucket_sort.cs
  class bucket_sort (line 9) | public class bucket_sort {
    method BucketSort (line 11) | void BucketSort(float[] nums) {
    method Test (line 39) | [Test]

FILE: codes/csharp/chapter_sorting/counting_sort.cs
  class counting_sort (line 9) | public class counting_sort {
    method CountingSortNaive (line 12) | void CountingSortNaive(int[] nums) {
    method CountingSort (line 35) | void CountingSort(int[] nums) {
    method Test (line 67) | [Test]

FILE: codes/csharp/chapter_sorting/heap_sort.cs
  class heap_sort (line 9) | public class heap_sort {
    method SiftDown (line 11) | void SiftDown(int[] nums, int n, int i) {
    method HeapSort (line 32) | void HeapSort(int[] nums) {
    method Test (line 46) | [Test]

FILE: codes/csharp/chapter_sorting/insertion_sort.cs
  class insertion_sort (line 9) | public class insertion_sort {
    method InsertionSort (line 11) | void InsertionSort(int[] nums) {
    method Test (line 24) | [Test]

FILE: codes/csharp/chapter_sorting/merge_sort.cs
  class merge_sort (line 9) | public class merge_sort {
    method Merge (line 11) | void Merge(int[] nums, int left, int mid, int right) {
    method MergeSort (line 38) | void MergeSort(int[] nums, int left, int right) {
    method Test (line 49) | [Test]

FILE: codes/csharp/chapter_sorting/quick_sort.cs
  class quickSort (line 9) | class quickSort {
    method Swap (line 11) | static void Swap(int[] nums, int i, int j) {
    method Partition (line 16) | static int Partition(int[] nums, int left, int right) {
    method QuickSort (line 31) | public static void QuickSort(int[] nums, int left, int right) {
  class QuickSortMedian (line 44) | class QuickSortMedian {
    method Swap (line 46) | static void Swap(int[] nums, int i, int j) {
    method MedianThree (line 51) | static int MedianThree(int[] nums, int left, int mid, int right) {
    method Partition (line 61) | static int Partition(int[] nums, int left, int right) {
    method QuickSort (line 80) | public static void QuickSort(int[] nums, int left, int right) {
  class QuickSortTailCall (line 93) | class QuickSortTailCall {
    method Swap (line 95) | static void Swap(int[] nums, int i, int j) {
    method Partition (line 100) | static int Partition(int[] nums, int left, int right) {
    method QuickSort (line 115) | public static void QuickSort(int[] nums, int left, int right) {
  class quick_sort (line 132) | public class quick_sort {
    method Test (line 133) | [Test]

FILE: codes/csharp/chapter_sorting/radix_sort.cs
  class radix_sort (line 9) | public class radix_sort {
    method Digit (line 11) | int Digit(int num, int exp) {
    method CountingSortDigit (line 17) | void CountingSortDigit(int[] nums, int exp) {
    method RadixSort (line 45) | void RadixSort(int[] nums) {
    method Test (line 61) | [Test]

FILE: codes/csharp/chapter_sorting/selection_sort.cs
  class selection_sort (line 9) | public class selection_sort {
    method SelectionSort (line 11) | void SelectionSort(int[] nums) {
    method Test (line 26) | [Test]

FILE: codes/csharp/chapter_stack_and_queue/array_deque.cs
  class ArrayDeque (line 10) | public class ArrayDeque {
    method ArrayDeque (line 16) | public ArrayDeque(int capacity) {
    method Capacity (line 22) | int Capacity() {
    method Size (line 27) | public int Size() {
    method IsEmpty (line 32) | public bool IsEmpty() {
    method Index (line 37) | int Index(int i) {
    method PushFirst (line 45) | public void PushFirst(int num) {
    method PushLast (line 59) | public void PushLast(int num) {
    method PopFirst (line 72) | public int PopFirst() {
    method PopLast (line 81) | public int PopLast() {
    method PeekFirst (line 88) | public int PeekFirst() {
    method PeekLast (line 96) | public int PeekLast() {
    method ToArray (line 106) | public int[] ToArray() {
  class array_deque (line 116) | public class array_deque {
    method Test (line 117) | [Test]

FILE: codes/csharp/chapter_stack_and_queue/array_queue.cs
  class ArrayQueue (line 10) | class ArrayQueue {
    method ArrayQueue (line 15) | public ArrayQueue(int capacity) {
    method Capacity (line 21) | int Capacity() {
    method Size (line 26) | public int Size() {
    method IsEmpty (line 31) | public bool IsEmpty() {
    method Push (line 36) | public void Push(int num) {
    method Pop (line 50) | public int Pop() {
    method Peek (line 59) | public int Peek() {
    method ToArray (line 66) | public int[] ToArray() {
  class array_queue (line 76) | public class array_queue {
    method Test (line 77) | [Test]

FILE: codes/csharp/chapter_stack_and_queue/array_stack.cs
  class ArrayStack (line 10) | class ArrayStack {
    method ArrayStack (line 12) | public ArrayStack() {
    method Size (line 18) | public int Size() {
    method IsEmpty (line 23) | public bool IsEmpty() {
    method Push (line 28) | public void Push(int num) {
    method Pop (line 33) | public int Pop() {
    method Peek (line 42) | public int Peek() {
    method ToArray (line 49) | public int[] ToArray() {
  class array_stack (line 54) | public class array_stack {
    method Test (line 55) | [Test]

FILE: codes/csharp/chapter_stack_and_queue/deque.cs
  class deque (line 9) | public class deque {
    method Test (line 10) | [Test]

FILE: codes/csharp/chapter_stack_and_queue/linkedlist_deque.cs
  class ListNode (line 10) | public class ListNode(int val) {
  class LinkedListDeque (line 17) | public class LinkedListDeque {
    method LinkedListDeque (line 21) | public LinkedListDeque() {
    method Size (line 27) | public int Size() {
    method IsEmpty (line 32) | public bool IsEmpty() {
    method Push (line 37) | void Push(int num, bool isFront) {
    method PushFirst (line 63) | public void PushFirst(int num) {
    method PushLast (line 68) | public void PushLast(int num) {
    method Pop (line 73) | int? Pop(bool isFront) {
    method PopFirst (line 105) | public int? PopFirst() {
    method PopLast (line 110) | public int? PopLast() {
    method PeekFirst (line 115) | public int? PeekFirst() {
    method PeekLast (line 122) | public int? PeekLast() {
    method ToArray (line 129) | public int?[] ToArray() {
  class linkedlist_deque (line 141) | public class linkedlist_deque {
    method Test (line 142) | [Test]

FILE: codes/csharp/chapter_stack_and_queue/linkedlist_queue.cs
  class LinkedListQueue (line 10) | class LinkedListQueue {
    method LinkedListQueue (line 14) | public LinkedListQueue() {
    method Size (line 20) | public int Size() {
    method IsEmpty (line 25) | public bool IsEmpty() {
    method Push (line 30) | public void Push(int num) {
    method Pop (line 46) | public int Pop() {
    method Peek (line 55) | public int Peek() {
    method ToArray (line 62) | public int[] ToArray() {
  class linkedlist_queue (line 76) | public class linkedlist_queue {
    method Test (line 77) | [Test]

FILE: codes/csharp/chapter_stack_and_queue/linkedlist_stack.cs
  class LinkedListStack (line 10) | class LinkedListStack {
    method LinkedListStack (line 14) | public LinkedListStack() {
    method Size (line 19) | public int Size() {
    method IsEmpty (line 24) | public bool IsEmpty() {
    method Push (line 29) | public void Push(int num) {
    method Pop (line 38) | public int Pop() {
    method Peek (line 46) | public int Peek() {
    method ToArray (line 53) | public int[] ToArray() {
  class linkedlist_stack (line 67) | public class linkedlist_stack {
    method Test (line 68) | [Test]

FILE: codes/csharp/chapter_stack_and_queue/queue.cs
  class queue (line 9) | public class queue {
    method Test (line 10) | [Test]

FILE: codes/csharp/chapter_stack_and_queue/stack.cs
  class stack (line 9) | public class stack {
    method Test (line 10) | [Test]

FILE: codes/csharp/chapter_tree/array_binary_tree.cs
  class ArrayBinaryTree (line 10) | public class ArrayBinaryTree(List<int?> arr) {
    method Size (line 14) | public int Size() {
    method Val (line 19) | public int? Val(int i) {
    method Left (line 27) | public int Left(int i) {
    method Right (line 32) | public int Right(int i) {
    method Parent (line 37) | public int Parent(int i) {
    method LevelOrder (line 42) | public List<int> LevelOrder() {
    method DFS (line 53) | void DFS(int i, string order, List<int> res) {
    method PreOrder (line 71) | public List<int> PreOrder() {
    method InOrder (line 78) | public List<int> InOrder() {
    method PostOrder (line 85) | public List<int> PostOrder() {
  class array_binary_tree (line 92) | public class array_binary_tree {
    method Test (line 93) | [Test]

FILE: codes/csharp/chapter_tree/avl_tree.cs
  class AVLTree (line 10) | class AVLTree {
    method Height (line 14) | int Height(TreeNode? node) {
    method UpdateHeight (line 20) | void UpdateHeight(TreeNode node) {
    method BalanceFactor (line 26) | public int BalanceFactor(TreeNode? node) {
    method RightRotate (line 34) | TreeNode? RightRotate(TreeNode? node) {
    method LeftRotate (line 48) | TreeNode? LeftRotate(TreeNode? node) {
    method Rotate (line 62) | TreeNode? Rotate(TreeNode? node) {
    method Insert (line 92) | public void Insert(int val) {
    method InsertHelper (line 97) | TreeNode? InsertHelper(TreeNode? node, int val) {
    method Remove (line 114) | public void Remove(int val) {
    method RemoveHelper (line 119) | TreeNode? RemoveHelper(TreeNode? node, int val) {
    method Search (line 153) | public TreeNode? Search(int val) {
  class avl_tree (line 172) | public class avl_tree {
    method TestInsert (line 173) | static void TestInsert(AVLTree tree, int val) {
    method TestRemove (line 179) | static void TestRemove(AVLTree tree, int val) {
    method Test (line 185) | [Test]

FILE: codes/csharp/chapter_tree/binary_search_tree.cs
  class BinarySearchTree (line 9) | class BinarySearchTree {
    method BinarySearchTree (line 12) | public BinarySearchTree() {
    method GetRoot (line 18) | public TreeNode? GetRoot() {
    method Search (line 23) | public TreeNode? Search(int num) {
    method Insert (line 42) | public void Insert(int num) {
    method Remove (line 75) | public void Remove(int num) {
  class binary_search_tree (line 126) | public class binary_search_tree {
    method Test (line 127) | [Test]

FILE: codes/csharp/chapter_tree/binary_tree.cs
  class binary_tree (line 9) | public class binary_tree {
    method Test (line 10) | [Test]

FILE: codes/csharp/chapter_tree/binary_tree_bfs.cs
  class binary_tree_bfs (line 9) | public class binary_tree_bfs {
    method LevelOrder (line 12) | List<int> LevelOrder(TreeNode root) {
    method Test (line 29) | [Test]

FILE: codes/csharp/chapter_tree/binary_tree_dfs.cs
  class binary_tree_dfs (line 9) | public class binary_tree_dfs {
    method PreOrder (line 13) | void PreOrder(TreeNode? root) {
    method InOrder (line 22) | void InOrder(TreeNode? root) {
    method PostOrder (line 31) | void PostOrder(TreeNode? root) {
    method Test (line 39) | [Test]

FILE: codes/csharp/utils/ListNode.cs
  class ListNode (line 8) | public class ListNode(int x) {
    method ArrToLinkedList (line 13) | public static ListNode? ArrToLinkedList(int[] arr) {
    method ToString (line 23) | public override string? ToString() {

FILE: codes/csharp/utils/PrintUtil.cs
  class Trunk (line 9) | public class Trunk(Trunk? prev, string str) {
  class PrintUtil (line 14) | public static class PrintUtil {
    method PrintList (line 16) | public static void PrintList<T>(IList<T> list) {
    method PrintList (line 20) | public static string PrintList<T>(this IEnumerable<T?> list) {
    method PrintMatrix (line 25) | public static void PrintMatrix<T>(T[][] matrix) {
    method PrintMatrix (line 34) | public static void PrintMatrix<T>(List<List<T>> matrix) {
    method PrintLinkedList (line 43) | public static void PrintLinkedList(ListNode? head) {
    method PrintTree (line 57) | public static void PrintTree(TreeNode? root) {
    method PrintTree (line 62) | public static void PrintTree(TreeNode? root, Trunk? prev, bool isRight) {
    method ShowTrunks (line 93) | public static void ShowTrunks(Trunk? p) {
    method PrintHashMap (line 103) | public static void PrintHashMap<K, V>(Dictionary<K, V> map) where K : ...
    method PrintHeap (line 110) | public static void PrintHeap(Queue<int> queue) {
    method PrintHeap (line 120) | public static void PrintHeap(PriorityQueue<int, int> queue) {

FILE: codes/csharp/utils/TreeNode.cs
  class TreeNode (line 10) | public class TreeNode(int? x) {
    method ListToTreeDFS (line 33) | static TreeNode? ListToTreeDFS(List<int?> arr, int i) {
    method ListToTree (line 45) | public static TreeNode? ListToTree(List<int?> arr) {
    method TreeToListDFS (line 50) | static void TreeToListDFS(TreeNode? root, int i, List<int?> res) {
    method TreeToList (line 62) | public static List<int?> TreeToList(TreeNode root) {

FILE: codes/csharp/utils/Vertex.cs
  class Vertex (line 10) | public class Vertex(int val) {
    method ValsToVets (line 14) | public static Vertex[] ValsToVets(int[] vals) {
    method VetsToVals (line 23) | public static List<int> VetsToVals(List<Vertex> vets) {

FILE: codes/dart/build.dart
  function main (line 3) | void main()

FILE: codes/dart/chapter_array_and_linkedlist/array.dart
  function randomAccess (line 12) | int randomAccess(List<int> nums)
  function extend (line 21) | List<int> extend(List<int> nums, int enlarge)
  function insert (line 33) | void insert(List<int> nums, int _num, int index)
  function remove (line 43) | void remove(List<int> nums, int index)
  function traverse (line 51) | void traverse(List<int> nums)
  function find (line 68) | int find(List<int> nums, int target)
  function main (line 76) | void main()

FILE: codes/dart/chapter_array_and_linkedlist/linked_list.dart
  function insert (line 11) | void insert(ListNode n0, ListNode P)
  function remove (line 18) | void remove(ListNode n0)
  function access (line 27) | ListNode? access(ListNode? head, int index)
  function find (line 36) | int find(ListNode? head, int target)
  function main (line 49) | void main()

FILE: codes/dart/chapter_array_and_linkedlist/list.dart
  function main (line 10) | void main()

FILE: codes/dart/chapter_array_and_linkedlist/my_list.dart
  class MyList (line 8) | class MyList {
    method size (line 20) | int size()
    method capacity (line 23) | int capacity()
    method get (line 26) | int get(int index)
    method set (line 32) | void set(int index, int _num)
    method add (line 38) | void add(int _num)
    method insert (line 47) | void insert(int index, int _num)
    method remove (line 61) | int remove(int index)
    method extendCapacity (line 75) | void extendCapacity()
    method toArray (line 87) | List<int> toArray()
  function main (line 97) | void main()

FILE: codes/dart/chapter_backtracking/n_queens.dart
  function backtrack (line 8) | void backtrack(
  function nQueens (line 50) | List<List<List<String>>> nQueens(int n)
  function main (line 64) | void main()

FILE: codes/dart/chapter_backtracking/permutations_i.dart
  function backtrack (line 8) | void backtrack(
  function permutationsI (line 37) | List<List<int>> permutationsI(List<int> nums)
  function main (line 44) | void main()

FILE: codes/dart/chapter_backtracking/permutations_ii.dart
  function backtrack (line 8) | void backtrack(
  function permutationsII (line 39) | List<List<int>> permutationsII(List<int> nums)
  function main (line 46) | void main()

FILE: codes/dart/chapter_backtracking/preorder_traversal_i_compact.dart
  function preOrder (line 11) | void preOrder(TreeNode? root, List<TreeNode> res)
  function main (line 24) | void main()

FILE: codes/dart/chapter_backtracking/preorder_traversal_ii_compact.dart
  function preOrder (line 11) | void preOrder(
  function main (line 33) | void main()

FILE: codes/dart/chapter_backtracking/preorder_traversal_iii_compact.dart
  function preOrder (line 11) | void preOrder(
  function main (line 33) | void main()

FILE: codes/dart/chapter_backtracking/preorder_traversal_iii_template.dart
  function isSolution (line 11) | bool isSolution(List<TreeNode> state)
  function recordSolution (line 16) | void recordSolution(List<TreeNode> state, List<List<TreeNode>> res)
  function isValid (line 21) | bool isValid(List<TreeNode> state, TreeNode? choice)
  function makeChoice (line 26) | void makeChoice(List<TreeNode> state, TreeNode? choice)
  function undoChoice (line 31) | void undoChoice(List<TreeNode> state, TreeNode? choice)
  function backtrack (line 36) | void backtrack(
  function main (line 61) | void main()

FILE: codes/dart/chapter_backtracking/subset_sum_i.dart
  function backtrack (line 8) | void backtrack(
  function subsetSumI (line 38) | List<List<int>> subsetSumI(List<int> nums, int target)
  function main (line 48) | void main()

FILE: codes/dart/chapter_backtracking/subset_sum_i_naive.dart
  function backtrack (line 8) | void backtrack(
  function subsetSumINaive (line 36) | List<List<int>> subsetSumINaive(List<int> nums, int target)
  function main (line 45) | void main()

FILE: codes/dart/chapter_backtracking/subset_sum_ii.dart
  function backtrack (line 8) | void backtrack(
  function subsetSumII (line 43) | List<List<int>> subsetSumII(List<int> nums, int target)
  function main (line 53) | void main()

FILE: codes/dart/chapter_computational_complexity/iteration.dart
  function forLoop (line 8) | int forLoop(int n)
  function whileLoop (line 18) | int whileLoop(int n)
  function whileLoopII (line 30) | int whileLoopII(int n)
  function nestedForLoop (line 44) | String nestedForLoop(int n)
  function main (line 57) | void main()

FILE: codes/dart/chapter_computational_complexity/recursion.dart
  function recur (line 8) | int recur(int n)
  function forLoopRecur (line 18) | int forLoopRecur(int n)
  function tailRecur (line 37) | int tailRecur(int n, int res)
  function fib (line 45) | int fib(int n)
  function main (line 55) | void main()

FILE: codes/dart/chapter_computational_complexity/space_complexity.dart
  function function (line 15) | int function()
  function constant (line 21) | void constant(int n)
  function linear (line 38) | void linear(int n)
  function linearRecur (line 54) | void linearRecur(int n)
  function quadratic (line 61) | void quadratic(int n)
  function quadraticRecur (line 76) | int quadraticRecur(int n)
  function buildTree (line 84) | TreeNode? buildTree(int n)
  function main (line 93) | void main()

FILE: codes/dart/chapter_computational_complexity/time_complexity.dart
  function constant (line 10) | int constant(int n)
  function linear (line 20) | int linear(int n)
  function arrayTraversal (line 29) | int arrayTraversal(List<int> nums)
  function quadratic (line 39) | int quadratic(int n)
  function bubbleSort (line 51) | int bubbleSort(List<int> nums)
  function exponential (line 70) | int exponential(int n)
  function expRecur (line 84) | int expRecur(int n)
  function logarithmic (line 90) | int logarithmic(int n)
  function logRecur (line 100) | int logRecur(int n)
  function linearLogRecur (line 106) | int linearLogRecur(int n)
  function factorialRecur (line 116) | int factorialRecur(int n)
  function main (line 127) | void main()

FILE: codes/dart/chapter_computational_complexity/worst_best_time_complexity.dart
  function randomNumbers (line 8) | List<int> randomNumbers(int n)
  function findOne (line 21) | int findOne(List<int> nums)
  function main (line 32) | void main()

FILE: codes/dart/chapter_divide_and_conquer/binary_search_recur.dart
  function dfs (line 8) | int dfs(List<int> nums, int target, int i, int j)
  function binarySearch (line 28) | int binarySearch(List<int> nums, int target)
  function main (line 35) | void main()

FILE: codes/dart/chapter_divide_and_conquer/build_tree.dart
  function dfs (line 11) | TreeNode? dfs(
  function buildTree (line 35) | TreeNode? buildTree(List<int> preorder, List<int> inorder)
  function main (line 46) | void main()

FILE: codes/dart/chapter_divide_and_conquer/hanota.dart
  function move (line 8) | void move(List<int> src, List<int> tar)
  function dfs (line 16) | void dfs(int i, List<int> src, List<int> buf, List<int> tar)
  function solveHanota (line 31) | void solveHanota(List<int> A, List<int> B, List<int> C)
  function main (line 38) | void main()

FILE: codes/dart/chapter_dynamic_programming/climbing_stairs_backtrack.dart
  function backtrack (line 8) | void backtrack(List<int> choices, int state, int n, List<int> res)
  function climbingStairsBacktrack (line 24) | int climbingStairsBacktrack(int n)
  function main (line 34) | void main()

FILE: codes/dart/chapter_dynamic_programming/climbing_stairs_constraint_dp.dart
  function climbingStairsConstraintDP (line 8) | int climbingStairsConstraintDP(int n)
  function main (line 28) | void main()

FILE: codes/dart/chapter_dynamic_programming/climbing_stairs_dfs.dart
  function dfs (line 8) | int dfs(int i)
  function climbingStairsDFS (line 17) | int climbingStairsDFS(int n)
  function main (line 22) | void main()

FILE: codes/dart/chapter_dynamic_programming/climbing_stairs_dfs_mem.dart
  function dfs (line 8) | int dfs(int i, List<int> mem)
  function climbingStairsDFSMem (line 21) | int climbingStairsDFSMem(int n)
  function main (line 28) | void main()

FILE: codes/dart/chapter_dynamic_programming/climbing_stairs_dp.dart
  function climbingStairsDP (line 8) | int climbingStairsDP(int n)
  function climbingStairsDPComp (line 23) | int climbingStairsDPComp(int n)
  function main (line 35) | void main()

FILE: codes/dart/chapter_dynamic_programming/coin_change.dart
  function coinChangeDP (line 10) | int coinChangeDP(List<int> coins, int amt)
  function coinChangeDPComp (line 35) | int coinChangeDPComp(List<int> coins, int amt)
  function main (line 57) | void main()

FILE: codes/dart/chapter_dynamic_programming/coin_change_ii.dart
  function coinChangeIIDP (line 8) | int coinChangeIIDP(List<int> coins, int amt)
  function coinChangeIIDPComp (line 32) | int coinChangeIIDPComp(List<int> coins, int amt)
  function main (line 53) | void main()

FILE: codes/dart/chapter_dynamic_programming/edit_distance.dart
  function editDistanceDFS (line 10) | int editDistanceDFS(String s, String t, int i, int j)
  function editDistanceDFSMem (line 28) | int editDistanceDFSMem(String s, String t, List<List<int>> mem, int i, i...
  function editDistanceDP (line 49) | int editDistanceDP(String s, String t)
  function editDistanceDPComp (line 75) | int editDistanceDPComp(String s, String t)
  function main (line 104) | void main()

FILE: codes/dart/chapter_dynamic_programming/knapsack.dart
  function knapsackDFS (line 10) | int knapsackDFS(List<int> wgt, List<int> val, int i, int c)
  function knapsackDFSMem (line 27) | int knapsackDFSMem(
  function knapsackDP (line 55) | int knapsackDP(List<int> wgt, List<int> val, int cap)
  function knapsackDPComp (line 75) | int knapsackDPComp(List<int> wgt, List<int> val, int cap)
  function main (line 93) | void main()

FILE: codes/dart/chapter_dynamic_programming/min_cost_climbing_stairs_dp.dart
  function minCostClimbingStairsDP (line 10) | int minCostClimbingStairsDP(List<int> cost)
  function minCostClimbingStairsDPComp (line 26) | int minCostClimbingStairsDPComp(List<int> cost)
  function main (line 39) | void main()

FILE: codes/dart/chapter_dynamic_programming/min_path_sum.dart
  function minPathSumDFS (line 10) | int minPathSumDFS(List<List<int>> grid, int i, int j)
  function minPathSumDFSMem (line 28) | int minPathSumDFSMem(List<List<int>> grid, List<List<int>> mem, int i, i...
  function minPathSumDP (line 51) | int minPathSumDP(List<List<int>> grid)
  function minPathSumDPComp (line 74) | int minPathSumDPComp(List<List<int>> grid)
  function main (line 95) | void main()

FILE: codes/dart/chapter_dynamic_programming/unbounded_knapsack.dart
  function unboundedKnapsackDP (line 10) | int unboundedKnapsackDP(List<int> wgt, List<int> val, int cap)
  function unboundedKnapsackDPComp (line 30) | int unboundedKnapsackDPComp(List<int> wgt, List<int> val, int cap)
  function main (line 50) | void main()

FILE: codes/dart/chapter_graph/graph_adjacency_list.dart
  class GraphAdjList (line 10) | class GraphAdjList {
    method size (line 24) | int size()
    method addEdge (line 29) | void addEdge(Vertex vet1, Vertex vet2)
    method removeEdge (line 41) | void removeEdge(Vertex vet1, Vertex vet2)
    method addVertex (line 53) | void addVertex(Vertex vet)
    method removeVertex (line 60) | void removeVertex(Vertex vet)
    method printAdjList (line 73) | void printAdjList()
  function main (line 86) | void main()

FILE: codes/dart/chapter_graph/graph_adjacency_matrix.dart
  class GraphAdjMat (line 10) | class GraphAdjMat {
    method size (line 30) | int size()
    method addVertex (line 35) | void addVertex(int val)
    method removeVertex (line 49) | void removeVertex(int index)
    method addEdge (line 65) | void addEdge(int i, int j)
    method removeEdge (line 77) | void removeEdge(int i, int j)
    method printAdjMat (line 87) | void printAdjMat()
  function main (line 95) | void main()

FILE: codes/dart/chapter_graph/graph_bfs.dart
  function graphBFS (line 13) | List<Vertex> graphBFS(GraphAdjList graph, Vertex startVet)
  function main (line 41) | void main()

FILE: codes/dart/chapter_graph/graph_dfs.dart
  function dfs (line 11) | void dfs(
  function graphDFS (line 30) | List<Vertex> graphDFS(GraphAdjList graph, Vertex startVet)
  function main (line 40) | void main()

FILE: codes/dart/chapter_greedy/coin_change_greedy.dart
  function coinChangeGreedy (line 8) | int coinChangeGreedy(List<int> coins, int amt)
  function main (line 27) | void main()

FILE: codes/dart/chapter_greedy/fractional_knapsack.dart
  class Item (line 8) | class Item {
  function fractionalKnapsack (line 16) | double fractionalKnapsack(List<int> wgt, List<int> val, int cap)
  function main (line 39) | void main()

FILE: codes/dart/chapter_greedy/max_capacity.dart
  function maxCapacity (line 10) | int maxCapacity(List<int> ht)
  function main (line 31) | void main()

FILE: codes/dart/chapter_greedy/max_product_cutting.dart
  function maxProductCutting (line 10) | int maxProductCutting(int n)
  function main (line 31) | void main()

FILE: codes/dart/chapter_hashing/array_hash_map.dart
  class Pair (line 8) | class Pair {
  class ArrayHashMap (line 15) | class ArrayHashMap {
    method _hashFunc (line 24) | int _hashFunc(int key)
    method get (line 30) | String? get(int key)
    method put (line 40) | void put(int key, String val)
    method remove (line 47) | void remove(int key)
    method pairSet (line 53) | List<Pair> pairSet()
    method keySet (line 64) | List<int> keySet()
    method values (line 75) | List<String> values()
    method printHashMap (line 86) | void printHashMap()
  function main (line 94) | void main()

FILE: codes/dart/chapter_hashing/built_in_hash.dart
  function main (line 10) | void main()

FILE: codes/dart/chapter_hashing/hash_map.dart
  function main (line 8) | void main()

FILE: codes/dart/chapter_hashing/hash_map_chaining.dart
  class HashMapChaining (line 10) | class HashMapChaining {
    method hashFunc (line 27) | int hashFunc(int key)
    method loadFactor (line 32) | double loadFactor()
    method get (line 37) | String? get(int key)
    method put (line 51) | void put(int key, String val)
    method remove (line 72) | void remove(int key)
    method extend (line 86) | void extend()
    method printHashMap (line 102) | void printHashMap()
  function main (line 114) | void main()

FILE: codes/dart/chapter_hashing/hash_map_open_addressing.dart
  class HashMapOpenAddressing (line 10) | class HashMapOpenAddressing {
    method hashFunc (line 25) | int hashFunc(int key)
    method loadFactor (line 30) | double loadFactor()
    method findBucket (line 35) | int findBucket(int key)
    method get (line 62) | String? get(int key)
    method put (line 74) | void put(int key, String val)
    method remove (line 92) | void remove(int key)
    method extend (line 103) | void extend()
    method printHashMap (line 119) | void printHashMap()
  function main (line 133) | void main()

FILE: codes/dart/chapter_hashing/simple_hash.dart
  function addHash (line 8) | int addHash(String key)
  function mulHash (line 18) | int mulHash(String key)
  function xorHash (line 28) | int xorHash(String key)
  function rotHash (line 38) | int rotHash(String key)
  function main (line 48) | void main()

FILE: codes/dart/chapter_heap/my_heap.dart
  class MaxHeap (line 10) | class MaxHeap {
    method _left (line 24) | int _left(int i)
    method _right (line 29) | int _right(int i)
    method _parent (line 34) | int _parent(int i)
    method _swap (line 39) | void _swap(int i, int j)
    method size (line 46) | int size()
    method isEmpty (line 51) | bool isEmpty()
    method peek (line 56) | int peek()
    method push (line 61) | void push(int val)
    method siftUp (line 69) | void siftUp(int i)
    method pop (line 85) | int pop()
    method siftDown (line 99) | void siftDown(int i)
    method print (line 117) | void print()
  function main (line 123) | void main()

FILE: codes/dart/chapter_heap/top_k.dart
  function topKHeap (line 10) | MinHeap topKHeap(List<int> nums, int k)
  function main (line 25) | void main()
  class MinHeap (line 35) | class MinHeap {
    method getHeap (line 49) | List<int> getHeap()
    method _left (line 54) | int _left(int i)
    method _right (line 59) | int _right(int i)
    method _parent (line 64) | int _parent(int i)
    method _swap (line 69) | void _swap(int i, int j)
    method size (line 76) | int size()
    method isEmpty (line 81) | bool isEmpty()
    method peek (line 86) | int peek()
    method push (line 91) | void push(int val)
    method siftUp (line 99) | void siftUp(int i)
    method pop (line 115) | int pop()
    method siftDown (line 129) | void siftDown(int i)
    method print (line 147) | void print()

FILE: codes/dart/chapter_searching/binary_search.dart
  function binarySearch (line 8) | int binarySearch(List<int> nums, int target)
  function binarySearchLCRO (line 30) | int binarySearchLCRO(List<int> nums, int target)
  function main (line 52) | void main()

FILE: codes/dart/chapter_searching/binary_search_edge.dart
  function binarySearchLeftEdge (line 10) | int binarySearchLeftEdge(List<int> nums, int target)
  function binarySearchRightEdge (line 22) | int binarySearchRightEdge(List<int> nums, int target)
  function main (line 36) | void main()

FILE: codes/dart/chapter_searching/binary_search_insertion.dart
  function binarySearchInsertionSimple (line 8) | int binarySearchInsertionSimple(List<int> nums, int target)
  function binarySearchInsertion (line 25) | int binarySearchInsertion(List<int> nums, int target)
  function main (line 42) | void main()

FILE: codes/dart/chapter_searching/hashing_search.dart
  function hashingSearchArray (line 11) | int hashingSearchArray(Map<int, int> map, int target)
  function hashingSearchLinkedList (line 21) | ListNode? hashingSearchLinkedList(Map<int, ListNode> map, int target)
  function main (line 31) | void main()

FILE: codes/dart/chapter_searching/linear_search.dart
  function linearSearchArray (line 10) | int linearSearchArray(List<int> nums, int target)
  function linearSearchList (line 23) | ListNode? linearSearchList(ListNode? head, int target)
  function main (line 35) | void main()

FILE: codes/dart/chapter_searching/two_sum.dart
  function twoSumBruteForce (line 10) | List<int> twoSumBruteForce(List<int> nums, int target)
  function twoSumHashTable (line 22) | List<int> twoSumHashTable(List<int> nums, int target)
  function main (line 37) | void main()

FILE: codes/dart/chapter_sorting/bubble_sort.dart
  function bubbleSort (line 8) | void bubbleSort(List<int> nums)
  function bubbleSortWithFlag (line 24) | void bubbleSortWithFlag(List<int> nums)
  function main (line 43) | void main()

FILE: codes/dart/chapter_sorting/bucket_sort.dart
  function bucketSort (line 8) | void bucketSort(List<double> nums)
  function main (line 34) | void main()

FILE: codes/dart/chapter_sorting/counting_sort.dart
  function countingSortNaive (line 10) | void countingSortNaive(List<int> nums)
  function countingSort (line 33) | void countingSort(List<int> nums)
  function main (line 64) | void main()

FILE: codes/dart/chapter_sorting/heap_sort.dart
  function siftDown (line 8) | void siftDown(List<int> nums, int n, int i)
  function heapSort (line 28) | void heapSort(List<int> nums)
  function main (line 45) | void main()

FILE: codes/dart/chapter_sorting/insertion_sort.dart
  function insertionSort (line 8) | void insertionSort(List<int> nums)
  function main (line 22) | void main()

FILE: codes/dart/chapter_sorting/merge_sort.dart
  function merge (line 8) | void merge(List<int> nums, int left, int mid, int right)
  function mergeSort (line 35) | void mergeSort(List<int> nums, int left, int right)
  function main (line 47) | void main()

FILE: codes/dart/chapter_sorting/quick_sort.dart
  class QuickSort (line 8) | class QuickSort {
    method _swap (line 10) | void _swap(List<int> nums, int i, int j)
    method _partition (line 17) | int _partition(List<int> nums, int left, int right)
    method quickSort (line 30) | void quickSort(List<int> nums, int left, int right)
  class QuickSortMedian (line 42) | class QuickSortMedian {
    method _swap (line 44) | void _swap(List<int> nums, int i, int j)
    method _medianThree (line 51) | int _medianThree(List<int> nums, int left, int mid, int right)
    method _partition (line 61) | int _partition(List<int> nums, int left, int right)
    method quickSort (line 78) | void quickSort(List<int> nums, int left, int right)
  class QuickSortTailCall (line 90) | class QuickSortTailCall {
    method _swap (line 92) | void _swap(List<int> nums, int i, int j)
    method _partition (line 99) | int _partition(List<int> nums, int left, int right)
    method quickSort (line 112) | void quickSort(List<int> nums, int left, int right)
  function main (line 130) | void main()

FILE: codes/dart/chapter_sorting/radix_sort.dart
  function digit (line 8) | int digit(int _num, int exp)
  function countingSortDigit (line 14) | void countingSortDigit(List<int> nums, int exp)
  function radixSort (line 40) | void radixSort(List<int> nums)
  function main (line 55) | void main()

FILE: codes/dart/chapter_sorting/selection_sort.dart
  function selectionSort (line 8) | void selectionSort(List<int> nums)
  function main (line 25) | void main()

FILE: codes/dart/chapter_stack_and_queue/array_deque.dart
  class ArrayDeque (line 8) | class ArrayDeque {
    method capacity (line 20) | int capacity()
    method size (line 25) | int size()
    method isEmpty (line 30) | bool isEmpty()
    method index (line 35) | int index(int i)
    method pushFirst (line 43) | void pushFirst(int _num)
    method pushLast (line 56) | void pushLast(int _num)
    method popFirst (line 68) | int popFirst()
    method popLast (line 77) | int popLast()
    method peekFirst (line 84) | int peekFirst()
    method peekLast (line 92) | int peekLast()
    method toArray (line 102) | List<int> toArray()
  function main (line 113) | void main()

FILE: codes/dart/chapter_stack_and_queue/array_queue.dart
  class ArrayQueue (line 8) | class ArrayQueue {
    method capaCity (line 19) | int capaCity()
    method size (line 24) | int size()
    method isEmpty (line 29) | bool isEmpty()
    method push (line 34) | void push(int _num)
    method pop (line 47) | int pop()
    method peek (line 56) | int peek()
    method toArray (line 64) | List<int> toArray()
  function main (line 75) | void main()

FILE: codes/dart/chapter_stack_and_queue/array_stack.dart
  class ArrayStack (line 8) | class ArrayStack {
    method size (line 15) | int size()
    method isEmpty (line 20) | bool isEmpty()
    method push (line 25) | void push(int _num)
    method pop (line 30) | int pop()
    method peek (line 38) | int peek()
    method toArray (line 46) | List<int> toArray()
  function main (line 50) | void main()

FILE: codes/dart/chapter_stack_and_queue/deque.dart
  function main (line 9) | void main()

FILE: codes/dart/chapter_stack_and_queue/linkedlist_deque.dart
  class ListNode (line 8) | class ListNode {
  class LinkedListDeque (line 17) | class LinkedListDeque {
    method size (line 28) | int size()
    method isEmpty (line 33) | bool isEmpty()
    method push (line 38) | void push(int _num, bool isFront)
    method pushFirst (line 60) | void pushFirst(int _num)
    method pushLast (line 65) | void pushLast(int _num)
    method pop (line 70) | int? pop(bool isFront)
    method popFirst (line 102) | int? popFirst()
    method popLast (line 107) | int? popLast()
    method peekFirst (line 112) | int? peekFirst()
    method peekLast (line 117) | int? peekLast()
    method toArray (line 122) | List<int> toArray()
  function main (line 134) | void main()

FILE: codes/dart/chapter_stack_and_queue/linkedlist_queue.dart
  class LinkedListQueue (line 10) | class LinkedListQueue {
    method size (line 21) | int size()
    method isEmpty (line 26) | bool isEmpty()
    method push (line 31) | void push(int _num)
    method pop (line 47) | int pop()
    method peek (line 56) | int peek()
    method toArray (line 64) | List<int> toArray()
  function main (line 76) | void main()

FILE: codes/dart/chapter_stack_and_queue/linkedlist_stack.dart
  class LinkedListStack (line 10) | class LinkedListStack {
    method size (line 19) | int size()
    method isEmpty (line 24) | bool isEmpty()
    method push (line 29) | void push(int _num)
    method pop (line 37) | int pop()
    method peek (line 45) | int peek()
    method toList (line 53) | List<int> toList()
  function main (line 66) | void main()

FILE: codes/dart/chapter_stack_and_queue/queue.dart
  function main (line 9) | void main()

FILE: codes/dart/chapter_stack_and_queue/stack.dart
  function main (line 7) | void main()

FILE: codes/dart/chapter_tree/array_binary_tree.dart
  class ArrayBinaryTree (line 11) | class ArrayBinaryTree {
    method size (line 18) | int size()
    method val (line 23) | int? val(int i)
    method left (line 32) | int? left(int i)
    method right (line 37) | int? right(int i)
    method parent (line 42) | int? parent(int i)
    method levelOrder (line 47) | List<int> levelOrder()
    method dfs (line 58) | void dfs(int i, String order, List<int?> res)
    method preOrder (line 80) | List<int?> preOrder()
    method inOrder (line 87) | List<int?> inOrder()
    method postOrder (line 94) | List<int?> postOrder()
  function main (line 102) | void main()

FILE: codes/dart/chapter_tree/avl_tree.dart
  class AVLTree (line 11) | class AVLTree {
    method height (line 20) | int height(TreeNode? node)
    method updateHeight (line 26) | void updateHeight(TreeNode? node)
    method balanceFactor (line 32) | int balanceFactor(TreeNode? node)
    method rightRotate (line 40) | TreeNode? rightRotate(TreeNode? node)
    method leftRotate (line 54) | TreeNode? leftRotate(TreeNode? node)
    method rotate (line 68) | TreeNode? rotate(TreeNode? node)
    method insert (line 98) | void insert(int val)
    method insertHelper (line 103) | TreeNode? insertHelper(TreeNode? node, int val)
    method remove (line 120) | void remove(int val)
    method removeHelper (line 125) | TreeNode? removeHelper(TreeNode? node, int val)
    method search (line 159) | TreeNode? search(int val)
  function testInsert (line 177) | void testInsert(AVLTree tree, int val)
  function testRemove (line 183) | void testRemove(AVLTree tree, int val)
  function main (line 190) | void main()

FILE: codes/dart/chapter_tree/binary_search_tree.dart
  class BinarySearchTree (line 11) | class BinarySearchTree {
    method getRoot (line 21) | TreeNode? getRoot()
    method search (line 26) | TreeNode? search(int _num)
    method insert (line 45) | void insert(int _num)
    method remove (line 74) | void remove(int _num)
  function main (line 123) | void main()

FILE: codes/dart/chapter_tree/binary_tree.dart
  function main (line 10) | void main()

FILE: codes/dart/chapter_tree/binary_tree_bfs.dart
  function levelOrder (line 12) | List<int> levelOrder(TreeNode? root)
  function main (line 28) | void main()

FILE: codes/dart/chapter_tree/binary_tree_dfs.dart
  function preOrder (line 14) | void preOrder(TreeNode? node)
  function inOrder (line 23) | void inOrder(TreeNode? node)
  function postOrder (line 32) | void postOrder(TreeNode? node)
  function main (line 41) | void main()

FILE: codes/dart/utils/list_node.dart
  class ListNode (line 8) | class ListNode {
  function listToLinkedList (line 16) | ListNode? listToLinkedList(List<int> list)

FILE: codes/dart/utils/print_util.dart
  class Trunk (line 12) | class Trunk {
  function printMatrix (line 20) | void printMatrix(List<List<int>> matrix)
  function printLinkedList (line 29) | void printLinkedList(ListNode? head)
  function printTree (line 45) | void printTree(TreeNode? root, [Trunk? prev = null, bool isRight = false])
  function showTrunks (line 75) | void showTrunks(Trunk? p)
  function printHeap (line 85) | void printHeap(List<int> heap)

FILE: codes/dart/utils/tree_node.dart
  class TreeNode (line 8) | class TreeNode {
  function listToTreeDFS (line 19) | TreeNode? listToTreeDFS(List<int?> arr, int i)
  function listToTree (line 30) | TreeNode? listToTree(List<int?> arr)
  function treeToListDFS (line 35) | void treeToListDFS(TreeNode? root, int i, List<int?> res)
  function treeToList (line 46) | List<int?> treeToList(TreeNode? root)

FILE: codes/dart/utils/vertex.dart
  class Vertex (line 8) | class Vertex {
    method valsToVets (line 13) | List<Vertex> valsToVets(List<int> vals)
    method vetsToVals (line 22) | List<int> vetsToVals(List<Vertex> vets)

FILE: codes/go/chapter_array_and_linkedlist/array.go
  function randomAccess (line 12) | func randomAccess(nums []int) (randomNum int) {
  function extend (line 21) | func extend(nums []int, enlarge int) []int {
  function insert (line 33) | func insert(nums []int, num int, index int) {
  function remove (line 43) | func remove(nums []int, index int) {
  function traverse (line 51) | func traverse(nums []int) {
  function find (line 70) | func find(nums []int, target int) (index int) {

FILE: codes/go/chapter_array_and_linkedlist/array_test.go
  function TestArray (line 18) | func TestArray(t *testing.T) {

FILE: codes/go/chapter_array_and_linkedlist/linked_list.go
  function insertNode (line 12) | func insertNode(n0 *ListNode, P *ListNode) {
  function removeItem (line 19) | func removeItem(n0 *ListNode) {
  function access (line 30) | func access(head *ListNode, index int) *ListNode {
  function findNode (line 41) | func findNode(head *ListNode, target int) int {

FILE: codes/go/chapter_array_and_linkedlist/linked_list_test.go
  function TestLinkedList (line 14) | func TestLinkedList(t *testing.T) {

FILE: codes/go/chapter_array_and_linkedlist/list_test.go
  function TestList (line 14) | func TestList(t *testing.T) {

FILE: codes/go/chapter_array_and_linkedlist/my_list.go
  type myList (line 8) | type myList struct
    method size (line 26) | func (l *myList) size() int {
    method capacity (line 31) | func (l *myList) capacity() int {
    method get (line 36) | func (l *myList) get(index int) int {
    method set (line 45) | func (l *myList) set(num, index int) {
    method add (line 53) | func (l *myList) add(num int) {
    method insert (line 64) | func (l *myList) insert(num, index int) {
    method remove (line 82) | func (l *myList) remove(index int) int {
    method extendCapacity (line 98) | func (l *myList) extendCapacity() {
    method toArray (line 106) | func (l *myList) toArray() []int {
  function newMyList (line 16) | func newMyList() *myList {

FILE: codes/go/chapter_array_and_linkedlist/my_list_test.go
  function TestMyList (line 13) | func TestMyList(t *testing.T) {

FILE: codes/go/chapter_backtracking/n_queens.go
  function backtrack (line 8) | func backtrack(row, n int, state *[][]string, res *[][][]string, cols, d...
  function nQueens (line 40) | func nQueens(n int) [][][]string {

FILE: codes/go/chapter_backtracking/n_queens_test.go
  function TestNQueens (line 12) | func TestNQueens(t *testing.T) {

FILE: codes/go/chapter_backtracking/permutation_test.go
  function TestPermutationI (line 14) | func TestPermutationI(t *testing.T) {
  function TestPermutationII (line 25) | func TestPermutationII(t *testing.T) {

FILE: codes/go/chapter_backtracking/permutations_i.go
  function backtrackI (line 8) | func backtrackI(state *[]int, choices *[]int, selected *[]bool, res *[][...
  function permutationsI (line 32) | func permutationsI(nums []int) [][]int {

FILE: codes/go/chapter_backtracking/permutations_ii.go
  function backtrackII (line 8) | func backtrackII(state *[]int, choices *[]int, selected *[]bool, res *[]...
  function permutationsII (line 35) | func permutationsII(nums []int) [][]int {

FILE: codes/go/chapter_backtracking/preorder_traversal_i_compact.go
  function preOrderI (line 12) | func preOrderI(root *TreeNode, res *[]*TreeNode) {

FILE: codes/go/chapter_backtracking/preorder_traversal_ii_compact.go
  function preOrderII (line 12) | func preOrderII(root *TreeNode, res *[][]*TreeNode, path *[]*TreeNode) {

FILE: codes/go/chapter_backtracking/preorder_traversal_iii_compact.go
  function preOrderIII (line 12) | func preOrderIII(root *TreeNode, res *[][]*TreeNode, path *[]*TreeNode) {

FILE: codes/go/chapter_backtracking/preorder_traversal_iii_template.go
  function isSolution (line 12) | func isSolution(state *[]*TreeNode) bool {
  function recordSolution (line 17) | func recordSolution(state *[]*TreeNode, res *[][]*TreeNode) {
  function isValid (line 22) | func isValid(state *[]*TreeNode, choice *TreeNode) bool {
  function makeChoice (line 27) | func makeChoice(state *[]*TreeNode, choice *TreeNode) {
  function undoChoice (line 32) | func undoChoice(state *[]*TreeNode, choice *TreeNode) {
  function backtrackIII (line 37) | func backtrackIII(state *[]*TreeNode, choices *[]*TreeNode, res *[][]*Tr...

FILE: codes/go/chapter_backtracking/preorder_traversal_test.go
  function TestPreorderTraversalICompact (line 14) | func TestPreorderTraversalICompact(t *testing.T) {
  function TestPreorderTraversalIICompact (line 31) | func TestPreorderTraversalIICompact(t *testing.T) {
  function TestPreorderTraversalIIICompact (line 51) | func TestPreorderTraversalIIICompact(t *testing.T) {
  function TestPreorderTraversalIIITemplate (line 71) | func TestPreorderTraversalIIITemplate(t *testing.T) {

FILE: codes/go/chapter_backtracking/subset_sum_i.go
  function backtrackSubsetSumI (line 10) | func backtrackSubsetSumI(start, target int, state, choices *[]int, res *...
  function subsetSumI (line 35) | func subsetSumI(nums []int, target int) [][]int {

FILE: codes/go/chapter_backtracking/subset_sum_i_naive.go
  function backtrackSubsetSumINaive (line 8) | func backtrackSubsetSumINaive(total, target int, state, choices *[]int, ...
  function subsetSumINaive (line 31) | func subsetSumINaive(nums []int, target int) [][]int {

FILE: codes/go/chapter_backtracking/subset_sum_ii.go
  function backtrackSubsetSumII (line 10) | func backtrackSubsetSumII(start, target int, state, choices *[]int, res ...
  function subsetSumII (line 40) | func subsetSumII(nums []int, target int) [][]int {

FILE: codes/go/chapter_backtracking/subset_sum_test.go
  function TestSubsetSumINaive (line 15) | func TestSubsetSumINaive(t *testing.T) {
  function TestSubsetSumI (line 30) | func TestSubsetSumI(t *testing.T) {
  function TestSubsetSumII (line 44) | func TestSubsetSumII(t *testing.T) {

FILE: codes/go/chapter_computational_complexity/iteration.go
  function forLoop (line 10) | func forLoop(n int) int {
  function whileLoop (line 20) | func whileLoop(n int) int {
  function whileLoopII (line 34) | func whileLoopII(n int) int {
  function nestedForLoop (line 49) | func nestedForLoop(n int) string {

FILE: codes/go/chapter_computational_complexity/iteration_test.go
  function TestIteration (line 13) | func TestIteration(t *testing.T) {

FILE: codes/go/chapter_computational_complexity/recursion.go
  function recur (line 10) | func recur(n int) int {
  function forLoopRecur (line 22) | func forLoopRecur(n int) int {
  function tailRecur (line 42) | func tailRecur(n int, res int) int {
  function fib (line 52) | func fib(n int) int {

FILE: codes/go/chapter_computational_complexity/recursion_test.go
  function TestRecursion (line 13) | func TestRecursion(t *testing.T) {

FILE: codes/go/chapter_computational_complexity/space_complexity.go
  type node (line 15) | type node struct
  function newNode (line 21) | func newNode(val int) *node {
  function function (line 26) | func function() int {
  function spaceConstant (line 32) | func spaceConstant(n int) {
  function spaceLinear (line 54) | func spaceLinear(n int) {
  function spaceLinearRecur (line 70) | func spaceLinearRecur(n int) {
  function spaceQuadratic (line 79) | func spaceQuadratic(n int) {
  function spaceQuadraticRecur (line 88) | func spaceQuadraticRecur(n int) int {
  function buildTree (line 98) | func buildTree(n int) *TreeNode {

FILE: codes/go/chapter_computational_complexity/space_complexity_test.go
  function TestSpaceComplexity (line 13) | func TestSpaceComplexity(t *testing.T) {

FILE: codes/go/chapter_computational_complexity/time_complexity.go
  function constant (line 8) | func constant(n int) int {
  function linear (line 18) | func linear(n int) int {
  function arrayTraversal (line 27) | func arrayTraversal(nums []int) int {
  function quadratic (line 37) | func quadratic(n int) int {
  function bubbleSort (line 49) | func bubbleSort(nums []int) int {
  function exponential (line 68) | func exponential(n int) int {
  function expRecur (line 82) | func expRecur(n int) int {
  function logarithmic (line 90) | func logarithmic(n int) int {
  function logRecur (line 100) | func logRecur(n int) int {
  function linearLogRecur (line 108) | func linearLogRecur(n int) int {
  function factorialRecur (line 120) | func factorialRecur(n int) int {

FILE: codes/go/chapter_computational_complexity/time_complexity_test.go
  function TestTimeComplexity (line 12) | func TestTimeComplexity(t *testing.T) {

FILE: codes/go/chapter_computational_complexity/worst_best_time_complexity.go
  function randomNumbers (line 12) | func randomNumbers(n int) []int {
  function findOne (line 26) | func findOne(nums []int) int {

FILE: codes/go/chapter_computational_complexity/worst_best_time_complexity_test.go
  function TestWorstBestTimeComplexity (line 12) | func TestWorstBestTimeComplexity(t *testing.T) {

FILE: codes/go/chapter_divide_and_conquer/binary_search_recur.go
  function dfs (line 8) | func dfs(nums []int, target, i, j int) int {
  function binarySearch (line 31) | func binarySearch(nums []int, target int) int {

FILE: codes/go/chapter_divide_and_conquer/binary_search_recur_test.go
  function TestBinarySearch (line 12) | func TestBinarySearch(t *testing.T) {

FILE: codes/go/chapter_divide_and_conquer/build_tree.go
  function dfsBuildTree (line 10) | func dfsBuildTree(preorder []int, inorderMap map[int]int, i, l, r int) *...
  function buildTree (line 28) | func buildTree(preorder, inorder []int) *TreeNode {

FILE: codes/go/chapter_divide_and_conquer/build_tree_test.go
  function TestBuildTree (line 14) | func TestBuildTree(t *testing.T) {

FILE: codes/go/chapter_divide_and_conquer/hanota.go
  function move (line 10) | func move(src, tar *list.List) {
  function dfsHanota (line 20) | func dfsHanota(i int, src, buf, tar *list.List) {
  function solveHanota (line 35) | func solveHanota(A, B, C *list.List) {

FILE: codes/go/chapter_divide_and_conquer/hanota_test.go
  function TestHanota (line 15) | func TestHanota(t *testing.T) {

FILE: codes/go/chapter_dynamic_programming/climbing_stairs_backtrack.go
  function backtrack (line 8) | func backtrack(choices []int, state, n int, res []int) {
  function climbingStairsBacktrack (line 26) | func climbingStairsBacktrack(n int) int {

FILE: codes/go/chapter_dynamic_programming/climbing_stairs_constraint_dp.go
  function climbingStairsConstraintDP (line 8) | func climbingStairsConstraintDP(n int) int {

FILE: codes/go/chapter_dynamic_programming/climbing_stairs_dfs.go
  function dfs (line 8) | func dfs(i int) int {
  function climbingStairsDFS (line 19) | func climbingStairsDFS(n int) int {

FILE: codes/go/chapter_dynamic_programming/climbing_stairs_dfs_mem.go
  function dfsMem (line 8) | func dfsMem(i int, mem []int) int {
  function climbingStairsDFSMem (line 25) | func climbingStairsDFSMem(n int) int {

FILE: codes/go/chapter_dynamic_programming/climbing_stairs_dp.go
  function climbingStairsDP (line 8) | func climbingStairsDP(n int) int {
  function climbingStairsDPComp (line 25) | func climbingStairsDPComp(n int) int {

FILE: codes/go/chapter_dynamic_programming/climbing_stairs_test.go
  function TestClimbingStairsBacktrack (line 12) | func TestClimbingStairsBacktrack(t *testing.T) {
  function TestClimbingStairsDFS (line 18) | func TestClimbingStairsDFS(t *testing.T) {
  function TestClimbingStairsDFSMem (line 24) | func TestClimbingStairsDFSMem(t *testing.T) {
  function TestClimbingStairsDP (line 30) | func TestClimbingStairsDP(t *testing.T) {
  function TestClimbingStairsDPComp (line 36) | func TestClimbingStairsDPComp(t *testing.T) {
  function TestClimbingStairsConstraintDP (line 42) | func TestClimbingStairsConstraintDP(t *testing.T) {
  function TestMinCostClimbingStairsDPComp (line 48) | func TestMinCostClimbingStairsDPComp(t *testing.T) {

FILE: codes/go/chapter_dynamic_programming/coin_change.go
  function coinChangeDP (line 10) | func coinChangeDP(coins []int, amt int) int {
  function coinChangeDPComp (line 41) | func coinChangeDPComp(coins []int, amt int) int {

FILE: codes/go/chapter_dynamic_programming/coin_change_ii.go
  function coinChangeIIDP (line 8) | func coinChangeIIDP(coins []int, amt int) int {
  function coinChangeIIDPComp (line 35) | func coinChangeIIDPComp(coins []int, amt int) int {

FILE: codes/go/chapter_dynamic_programming/coin_change_test.go
  function TestCoinChange (line 12) | func TestCoinChange(t *testing.T) {

FILE: codes/go/chapter_dynamic_programming/edit_distance.go
  function editDistanceDFS (line 8) | func editDistanceDFS(s string, t string, i int, j int) int {
  function editDistanceDFSMem (line 34) | func editDistanceDFSMem(s string, t string, mem [][]int, i int, j int) i...
  function editDistanceDP (line 65) | func editDistanceDP(s string, t string) int {
  function editDistanceDPComp (line 95) | func editDistanceDPComp(s string, t string) int {
  function MinInt (line 124) | func MinInt(a, b int) int {

FILE: codes/go/chapter_dynamic_programming/edit_distance_test.go
  function TestEditDistanceDFS (line 12) | func TestEditDistanceDFS(test *testing.T) {

FILE: codes/go/chapter_dynamic_programming/knapsack.go
  function knapsackDFS (line 10) | func knapsackDFS(wgt, val []int, i, c int) int {
  function knapsackDFSMem (line 27) | func knapsackDFSMem(wgt, val []int, mem [][]int, i, c int) int {
  function knapsackDP (line 49) | func knapsackDP(wgt, val []int, cap int) int {
  function knapsackDPComp (line 72) | func knapsackDPComp(wgt, val []int, cap int) int {

FILE: codes/go/chapter_dynamic_programming/knapsack_test.go
  function TestKnapsack (line 12) | func TestKnapsack(t *testing.T) {
  function TestUnboundedKnapsack (line 42) | func TestUnboundedKnapsack(t *testing.T) {

FILE: codes/go/chapter_dynamic_programming/min_cost_climbing_stairs_dp.go
  function minCostClimbingStairsDP (line 8) | func minCostClimbingStairsDP(cost []int) int {
  function minCostClimbingStairsDPComp (line 32) | func minCostClimbingStairsDPComp(cost []int) int {

FILE: codes/go/chapter_dynamic_programming/min_path_sum.go
  function minPathSumDFS (line 10) | func minPathSumDFS(grid [][]int, i, j int) int {
  function minPathSumDFSMem (line 27) | func minPathSumDFSMem(grid, mem [][]int, i, j int) int {
  function minPathSumDP (line 49) | func minPathSumDP(grid [][]int) int {
  function minPathSumDPComp (line 75) | func minPathSumDPComp(grid [][]int) int {

FILE: codes/go/chapter_dynamic_programming/min_path_sum_test.go
  function TestMinPathSum (line 12) | func TestMinPathSum(t *testing.T) {

FILE: codes/go/chapter_dynamic_programming/unbounded_knapsack.go
  function unboundedKnapsackDP (line 10) | func unboundedKnapsackDP(wgt, val []int, cap int) int {
  function unboundedKnapsackDPComp (line 33) | func unboundedKnapsackDPComp(wgt, val []int, cap int) int {

FILE: codes/go/chapter_graph/graph_adjacency_list.go
  type graphAdjList (line 16) | type graphAdjList struct
    method size (line 36) | func (g *graphAdjList) size() int {
    method addEdge (line 41) | func (g *graphAdjList) addEdge(vet1 Vertex, vet2 Vertex) {
    method removeEdge (line 53) | func (g *graphAdjList) removeEdge(vet1 Vertex, vet2 Vertex) {
    method addVertex (line 65) | func (g *graphAdjList) addVertex(vet Vertex) {
    method removeVertex (line 75) | func (g *graphAdjList) removeVertex(vet Vertex) {
    method print (line 89) | func (g *graphAdjList) print() {
  function newGraphAdjList (line 22) | func newGraphAdjList(edges [][]Vertex) *graphAdjList {

FILE: codes/go/chapter_graph/graph_adjacency_list_test.go
  function TestGraphAdjList (line 14) | func TestGraphAdjList(t *testing.T) {

FILE: codes/go/chapter_graph/graph_adjacency_matrix.go
  type graphAdjMat (line 10) | type graphAdjMat struct
    method size (line 39) | func (g *graphAdjMat) size() int {
    method addVertex (line 44) | func (g *graphAdjMat) addVertex(val int) {
    method removeVertex (line 58) | func (g *graphAdjMat) removeVertex(index int) {
    method addEdge (line 74) | func (g *graphAdjMat) addEdge(i, j int) {
    method removeEdge (line 86) | func (g *graphAdjMat) removeEdge(i, j int) {
    method print (line 96) | func (g *graphAdjMat) print() {
  function newGraphAdjMat (line 18) | func newGraphAdjMat(vertices []int, edges [][]int) *graphAdjMat {

FILE: codes/go/chapter_graph/graph_adjacency_matrix_test.go
  function TestGraphAdjMat (line 12) | func TestGraphAdjMat(t *testing.T) {

FILE: codes/go/chapter_graph/graph_bfs.go
  function graphBFS (line 13) | func graphBFS(g *graphAdjList, startVet Vertex) []Vertex {

FILE: codes/go/chapter_graph/graph_bfs_test.go
  function TestGraphBFS (line 14) | func TestGraphBFS(t *testing.T) {

FILE: codes/go/chapter_graph/graph_dfs.go
  function dfs (line 12) | func dfs(g *graphAdjList, visited map[Vertex]struct{}, res *[]Vertex, ve...
  function graphDFS (line 28) | func graphDFS(g *graphAdjList, startVet Vertex) []Vertex {

FILE: codes/go/chapter_graph/graph_dfs_test.go
  function TestGraphDFS (line 14) | func TestGraphDFS(t *testing.T) {

FILE: codes/go/chapter_greedy/coin_change_greedy.go
  function coinChangeGreedy (line 8) | func coinChangeGreedy(coins []int, amt int) int {

FILE: codes/go/chapter_greedy/coin_change_greedy_test.go
  function TestCoinChangeGreedy (line 12) | func TestCoinChangeGreedy(t *testing.T) {

FILE: codes/go/chapter_greedy/fractional_knapsack.go
  type Item (line 10) | type Item struct
  function fractionalKnapsack (line 16) | func fractionalKnapsack(wgt []int, val []int, cap int) float64 {

FILE: codes/go/chapter_greedy/fractional_knapsack_test.go
  function TestFractionalKnapsack (line 12) | func TestFractionalKnapsack(t *testing.T) {

FILE: codes/go/chapter_greedy/max_capacity.go
  function maxCapacity (line 10) | func maxCapacity(ht []int) int {

FILE: codes/go/chapter_greedy/max_capacity_test.go
  function TestMaxCapacity (line 12) | func TestMaxCapacity(t *testing.T) {

FILE: codes/go/chapter_greedy/max_product_cutting.go
  function maxProductCutting (line 10) | func maxProductCutting(n int) int {

FILE: codes/go/chapter_greedy/max_product_cutting_test.go
  function TestMaxProductCutting (line 12) | func TestMaxProductCutting(t *testing.T) {

FILE: codes/go/chapter_hashing/array_hash_map.go
  type pair (line 10) | type pair struct
  type arrayHashMap (line 16) | type arrayHashMap struct
    method hashFunc (line 28) | func (a *arrayHashMap) hashFunc(key int) int {
    method get (line 34) | func (a *arrayHashMap) get(key int) string {
    method put (line 44) | func (a *arrayHashMap) put(key int, val string) {
    method remove (line 51) | func (a *arrayHashMap) remove(key int) {
    method pairSet (line 58) | func (a *arrayHashMap) pairSet() []*pair {
    method keySet (line 69) | func (a *arrayHashMap) keySet() []int {
    method valueSet (line 80) | func (a *arrayHashMap) valueSet() []string {
    method print (line 91) | func (a *arrayHashMap) print() {
  function newArrayHashMap (line 21) | func newArrayHashMap() *arrayHashMap {

FILE: codes/go/chapter_hashing/array_hash_map_test.go
  function TestArrayHashMap (line 12) | func TestArrayHashMap(t *testing.T) {

FILE: codes/go/chapter_hashing/hash_collision_test.go
  function TestHashMapChaining (line 12) | func TestHashMapChaining(t *testing.T) {
  function TestHashMapOpenAddressing (line 38) | func TestHashMapOpenAddressing(t *testing.T) {

FILE: codes/go/chapter_hashing/hash_map_chaining.go
  type hashMapChaining (line 14) | type hashMapChaining struct
    method hashFunc (line 38) | func (m *hashMapChaining) hashFunc(key int) int {
    method loadFactor (line 43) | func (m *hashMapChaining) loadFactor() float64 {
    method get (line 48) | func (m *hashMapChaining) get(key int) string {
    method put (line 62) | func (m *hashMapChaining) put(key int, val string) {
    method remove (line 85) | func (m *hashMapChaining) remove(key int) {
    method extend (line 99) | func (m *hashMapChaining) extend() {
    method print (line 122) | func (m *hashMapChaining) print() {
  function newHashMapChaining (line 23) | func newHashMapChaining() *hashMapChaining {

FILE: codes/go/chapter_hashing/hash_map_open_addressing.go
  type hashMapOpenAddressing (line 12) | type hashMapOpenAddressing struct
    method hashFunc (line 34) | func (h *hashMapOpenAddressing) hashFunc(key int) int {
    method loadFactor (line 39) | func (h *hashMapOpenAddressing) loadFactor() float64 {
    method findBucket (line 44) | func (h *hashMapOpenAddressing) findBucket(key int) int {
    method get (line 70) | func (h *hashMapOpenAddressing) get(key int) string {
    method put (line 79) | func (h *hashMapOpenAddressing) put(key int, val string) {
    method remove (line 93) | func (h *hashMapOpenAddressing) remove(key int) {
    method extend (line 102) | func (h *hashMapOpenAddressing) extend() {
    method print (line 116) | func (h *hashMapOpenAddressing) print() {
  function newHashMapOpenAddressing (line 22) | func newHashMapOpenAddressing() *hashMapOpenAddressing {

FILE: codes/go/chapter_hashing/hash_map_test.go
  function TestHashMap (line 15) | func TestHashMap(t *testing.T) {
  function TestSimpleHash (line 58) | func TestSimpleHash(t *testing.T) {

FILE: codes/go/chapter_hashing/simple_hash.go
  function addHash (line 10) | func addHash(key string) int {
  function mulHash (line 22) | func mulHash(key string) int {
  function xorHash (line 34) | func xorHash(key string) int {
  function rotHash (line 46) | func rotHash(key string) int {

FILE: codes/go/chapter_heap/heap.go
  type intHeap (line 9) | type intHeap
    method Push (line 12) | func (h *intHeap) Push(x any) {
    method Pop (line 19) | func (h *intHeap) Pop() any {
    method Len (line 27) | func (h *intHeap) Len() int {
    method Less (line 32) | func (h *intHeap) Less(i, j int) bool {
    method Swap (line 38) | func (h *intHeap) Swap(i, j int) {
    method Top (line 43) | func (h *intHeap) Top() any {

FILE: codes/go/chapter_heap/heap_test.go
  function testPush (line 16) | func testPush(h *intHeap, val int) {
  function testPop (line 23) | func testPop(h *intHeap) {
  function TestHeap (line 30) | func TestHeap(t *testing.T) {
  function TestMyHeap (line 62) | func TestMyHeap(t *testing.T) {
  function TestTopKHeap (line 93) | func TestTopKHeap(t *testing.T) {

FILE: codes/go/chapter_heap/my_heap.go
  type maxHeap (line 13) | type maxHeap struct
    method left (line 37) | func (h *maxHeap) left(i int) int {
    method right (line 42) | func (h *maxHeap) right(i int) int {
    method parent (line 47) | func (h *maxHeap) parent(i int) int {
    method swap (line 53) | func (h *maxHeap) swap(i, j int) {
    method size (line 58) | func (h *maxHeap) size() int {
    method isEmpty (line 63) | func (h *maxHeap) isEmpty() bool {
    method peek (line 68) | func (h *maxHeap) peek() any {
    method push (line 73) | func (h *maxHeap) push(val any) {
    method siftUp (line 81) | func (h *maxHeap) siftUp(i int) {
    method pop (line 97) | func (h *maxHeap) pop() any {
    method siftDown (line 116) | func (h *maxHeap) siftDown(i int) {
    method print (line 138) | func (h *maxHeap) print() {
  function newHeap (line 19) | func newHeap() *maxHeap {
  function newMaxHeap (line 26) | func newMaxHeap(nums []any) *maxHeap {

FILE: codes/go/chapter_heap/top_k.go
  type minHeap (line 9) | type minHeap
    method Len (line 11) | func (h *minHeap) Len() int           { return len(*h) }
    method Less (line 12) | func (h *minHeap) Less(i, j int) bool { return (*h)[i].(int) < (*h)[j]...
    method Swap (line 13) | func (h *minHeap) Swap(i, j int)      { (*h)[i], (*h)[j] = (*h)[j], (*...
    method Push (line 16) | func (h *minHeap) Push(x any) {
    method Pop (line 21) | func (h *minHeap) Pop() any {
    method Top (line 29) | func (h *minHeap) Top() any {
  function topKHeap (line 34) | func topKHeap(nums []int, k int) *minHeap {

FILE: codes/go/chapter_searching/binary_search.go
  function binarySearch (line 8) | func binarySearch(nums []int, target int) int {
  function binarySearchLCRO (line 27) | func binarySearchLCRO(nums []int, target int) int {

FILE: codes/go/chapter_searching/binary_search_edge.go
  function binarySearchLeftEdge (line 8) | func binarySearchLeftEdge(nums []int, target int) int {
  function binarySearchRightEdge (line 20) | func binarySearchRightEdge(nums []int, target int) int {

FILE: codes/go/chapter_searching/binary_search_insertion.go
  function binarySearchInsertionSimple (line 8) | func binarySearchInsertionSimple(nums []int, target int) int {
  function binarySearchInsertion (line 30) | func binarySearchInsertion(nums []int, target int) int {

FILE: codes/go/chapter_searching/binary_search_test.go
  function TestBinarySearch (line 12) | func TestBinarySearch(t *testing.T) {
  function TestBinarySearchEdge (line 26) | func TestBinarySearchEdge(t *testing.T) {
  function TestBinarySearchInsertion (line 41) | func TestBinarySearchInsertion(t *testing.T) {

FILE: codes/go/chapter_searching/hashing_search.go
  function hashingSearchArray (line 10) | func hashingSearchArray(m map[int]int, target int) int {
  function hashingSearchLinkedList (line 21) | func hashingSearchLinkedList(m map[int]*ListNode, target int) *ListNode {

FILE: codes/go/chapter_searching/hashing_search_test.go
  function TestHashingSearch (line 14) | func TestHashingSearch(t *testing.T) {

FILE: codes/go/chapter_searching/linear_search.go
  function linearSearchArray (line 12) | func linearSearchArray(nums []int, target int) int {
  function linearSearchLinkedList (line 25) | func linearSearchLinkedList(node *ListNode, target int) *ListNode {

FILE: codes/go/chapter_searching/linear_search_test.go
  function TestLinearSearch (line 14) | func TestLinearSearch(t *testing.T) {

FILE: codes/go/chapter_searching/two_sum.go
  function twoSumBruteForce (line 8) | func twoSumBruteForce(nums []int, target int) []int {
  function twoSumHashTable (line 22) | func twoSumHashTable(nums []int, target int) []int {

FILE: codes/go/chapter_searching/two_sum_test.go
  function TestTwoSum (line 12) | func TestTwoSum(t *testing.T) {

FILE: codes/go/chapter_sorting/bubble_sort.go
  function bubbleSort (line 8) | func bubbleSort(nums []int) {
  function bubbleSortWithFlag (line 22) | func bubbleSortWithFlag(nums []int) {

FILE: codes/go/chapter_sorting/bubble_sort_test.go
  function TestBubbleSort (line 12) | func TestBubbleSort(t *testing.T) {

FILE: codes/go/chapter_sorting/bucket_sort.go
  function bucketSort (line 10) | func bucketSort(nums []float64) {

FILE: codes/go/chapter_sorting/bucket_sort_test.go
  function TestBucketSort (line 12) | func TestBucketSort(t *testing.T) {

FILE: codes/go/chapter_sorting/counting_sort.go
  type CountingSort (line 7) | type CountingSort struct
  function countingSortNaive (line 11) | func countingSortNaive(nums []int) {
  function countingSort (line 36) | func countingSort(nums []int) {

FILE: codes/go/chapter_sorting/counting_sort_test.go
  function TestCountingSort (line 12) | func TestCountingSort(t *testing.T) {

FILE: codes/go/chapter_sorting/heap_sort.go
  function siftDown (line 8) | func siftDown(nums *[]int, n, i int) {
  function heapSort (line 32) | func heapSort(nums *[]int) {

FILE: codes/go/chapter_sorting/heap_sort_test.go
  function TestHeapSort (line 12) | func TestHeapSort(t *testing.T) {

FILE: codes/go/chapter_sorting/insertion_sort.go
  function insertionSort (line 8) | func insertionSort(nums []int) {

FILE: codes/go/chapter_sorting/insertion_sort_test.go
  function TestInsertionSort (line 12) | func TestInsertionSort(t *testing.T) {

FILE: codes/go/chapter_sorting/merge_sort.go
  function merge (line 8) | func merge(nums []int, left, mid, right int) {
  function mergeSort (line 43) | func mergeSort(nums []int, left, right int) {

FILE: codes/go/chapter_sorting/merge_sort_test.go
  function TestMergeSort (line 12) | func TestMergeSort(t *testing.T) {

FILE: codes/go/chapter_sorting/quick_sort.go
  type quickSort (line 8) | type quickSort struct
    method partition (line 17) | func (q *quickSort) partition(nums []int, left, right int) int {
    method quickSort (line 36) | func (q *quickSort) quickSort(nums []int, left, right int) {
  type quickSortMedian (line 11) | type quickSortMedian struct
    method medianThree (line 49) | func (q *quickSortMedian) medianThree(nums []int, left, mid, right int...
    method partition (line 61) | func (q *quickSortMedian) partition(nums []int, left, right int) int {
    method quickSort (line 84) | func (q *quickSortMedian) quickSort(nums []int, left, right int) {
  type quickSortTailCall (line 14) | type quickSortTailCall struct
    method partition (line 97) | func (q *quickSortTailCall) partition(nums []int, left, right int) int {
    method quickSort (line 116) | func (q *quickSortTailCall) quickSort(nums []int, left, right int) {

FILE: codes/go/chapter_sorting/quick_sort_test.go
  function TestQuickSort (line 13) | func TestQuickSort(t *testing.T) {
  function TestQuickSortMedian (line 21) | func TestQuickSortMedian(t *testing.T) {
  function TestQuickSortTailCall (line 29) | func TestQuickSortTailCall(t *testing.T) {

FILE: codes/go/chapter_sorting/radix_sort.go
  function digit (line 10) | func digit(num, exp int) int {
  function countingSortDigit (line 16) | func countingSortDigit(nums []int, exp int) {
  function radixSort (line 44) | func radixSort(nums []int) {

FILE: codes/go/chapter_sorting/radix_sort_test.go
  function TestRadixSort (line 12) | func TestRadixSort(t *testing.T) {

FILE: codes/go/chapter_sorting/selection_sort.go
  function selectionSort (line 8) | func selectionSort(nums []int) {

FILE: codes/go/chapter_sorting/selection_sort_test.go
  function TestSelectionSort (line 12) | func TestSelectionSort(t *testing.T) {

FILE: codes/go/chapter_stack_and_queue/array_deque.go
  type arrayDeque (line 10) | type arrayDeque struct
    method size (line 28) | func (q *arrayDeque) size() int {
    method isEmpty (line 33) | func (q *arrayDeque) isEmpty() bool {
    method index (line 38) | func (q *arrayDeque) index(i int) int {
    method pushFirst (line 46) | func (q *arrayDeque) pushFirst(num int) {
    method pushLast (line 60) | func (q *arrayDeque) pushLast(num int) {
    method popFirst (line 73) | func (q *arrayDeque) popFirst() any {
    method popLast (line 85) | func (q *arrayDeque) popLast() any {
    method peekFirst (line 95) | func (q *arrayDeque) peekFirst() any {
    method peekLast (line 103) | func (q *arrayDeque) peekLast() any {
    method toSlice (line 113) | func (q *arrayDeque) toSlice() []int {
  function newArrayDeque (line 18) | func newArrayDeque(queCapacity int) *arrayDeque {

FILE: codes/go/chapter_stack_and_queue/array_queue.go
  type arrayQueue (line 8) | type arrayQueue struct
    method size (line 26) | func (q *arrayQueue) size() int {
    method isEmpty (line 31) | func (q *arrayQueue) isEmpty() bool {
    method push (line 36) | func (q *arrayQueue) push(num int) {
    method pop (line 50) | func (q *arrayQueue) pop() any {
    method peek (line 63) | func (q *arrayQueue) peek() any {
    method toSlice (line 71) | func (q *arrayQueue) toSlice() []int {
  function newArrayQueue (line 16) | func newArrayQueue(queCapacity int) *arrayQueue {

FILE: codes/go/chapter_stack_and_queue/array_stack.go
  type arrayStack (line 8) | type arrayStack struct
    method size (line 21) | func (s *arrayStack) size() int {
    method isEmpty (line 26) | func (s *arrayStack) isEmpty() bool {
    method push (line 31) | func (s *arrayStack) push(v int) {
    method pop (line 37) | func (s *arrayStack) pop() any {
    method peek (line 44) | func (s *arrayStack) peek() any {
    method toSlice (line 53) | func (s *arrayStack) toSlice() []int {
  function newArrayStack (line 13) | func newArrayStack() *arrayStack {

FILE: codes/go/chapter_stack_and_queue/deque_test.go
  function TestDeque (line 15) | func TestDeque(t *testing.T) {
  function TestArrayDeque (line 52) | func TestArrayDeque(t *testing.T) {
  function TestLinkedListDeque (line 95) | func TestLinkedListDeque(t *testing.T) {
  function BenchmarkLinkedListDeque (line 132) | func BenchmarkLinkedListDeque(b *testing.B) {

FILE: codes/go/chapter_stack_and_queue/linkedlist_deque.go
  type linkedListDeque (line 12) | type linkedListDeque struct
    method pushFirst (line 25) | func (s *linkedListDeque) pushFirst(value any) {
    method pushLast (line 30) | func (s *linkedListDeque) pushLast(value any) {
    method popFirst (line 35) | func (s *linkedListDeque) popFirst() any {
    method popLast (line 45) | func (s *linkedListDeque) popLast() any {
    method peekFirst (line 55) | func (s *linkedListDeque) peekFirst() any {
    method peekLast (line 64) | func (s *linkedListDeque) peekLast() any {
    method size (line 73) | func (s *linkedListDeque) size() int {
    method isEmpty (line 78) | func (s *linkedListDeque) isEmpty() bool {
    method toList (line 83) | func (s *linkedListDeque) toList() *list.List {
  function newLinkedListDeque (line 18) | func newLinkedListDeque() *linkedListDeque {

FILE: codes/go/chapter_stack_and_queue/linkedlist_queue.go
  type linkedListQueue (line 12) | type linkedListQueue struct
    method push (line 25) | func (s *linkedListQueue) push(value any) {
    method pop (line 30) | func (s *linkedListQueue) pop() any {
    method peek (line 40) | func (s *linkedListQueue) peek() any {
    method size (line 49) | func (s *linkedListQueue) size() int {
    method isEmpty (line 54) | func (s *linkedListQueue) isEmpty() bool {
    method toList (line 59) | func (s *linkedListQueue) toList() *list.List {
  function newLinkedListQueue (line 18) | func newLinkedListQueue() *linkedListQueue {

FILE: codes/go/chapter_stack_and_queue/linkedlist_stack.go
  type linkedListStack (line 12) | type linkedListStack struct
    method push (line 25) | func (s *linkedListStack) push(value int) {
    method pop (line 30) | func (s *linkedListStack) pop() any {
    method peek (line 40) | func (s *linkedListStack) peek() any {
    method size (line 49) | func (s *linkedListStack) size() int {
    method isEmpty (line 54) | func (s *linkedListStack) isEmpty() bool {
    method toList (line 59) | func (s *linkedListStack) toList() *list.List {
  function newLinkedListStack (line 18) | func newLinkedListStack() *linkedListStack {

FILE: codes/go/chapter_stack_and_queue/queue_test.go
  function TestQueue (line 15) | func TestQueue(t *testing.T) {
  function TestArrayQueue (line 48) | func TestArrayQueue(t *testing.T) {
  function TestLinkedListQueue (line 92) | func TestLinkedListQueue(t *testing.T) {
  function BenchmarkArrayQueue (line 124) | func BenchmarkArrayQueue(b *testing.B) {
  function BenchmarkLinkedQueue (line 137) | func BenchmarkLinkedQueue(b *testing.B) {

FILE: codes/go/chapter_stack_and_queue/stack_test.go
  function TestStack (line 14) | func TestStack(t *testing.T) {
  function TestArrayStack (line 47) | func TestArrayStack(t *testing.T) {
  function TestLinkedListStack (line 78) | func TestLinkedListStack(t *testing.T) {
  function BenchmarkArrayStack (line 109) | func BenchmarkArrayStack(b *testing.B) {
  function BenchmarkLinkedListStack (line 121) | func BenchmarkLinkedListStack(b *testing.B) {

FILE: codes/go/chapter_tree/array_binary_tree.go
  type arrayBinaryTree (line 8) | type arrayBinaryTree struct
    method size (line 20) | func (abt *arrayBinaryTree) size() int {
    method val (line 25) | func (abt *arrayBinaryTree) val(i int) any {
    method left (line 34) | func (abt *arrayBinaryTree) left(i int) int {
    method right (line 39) | func (abt *arrayBinaryTree) right(i int) int {
    method parent (line 44) | func (abt *arrayBinaryTree) parent(i int) int {
    method levelOrder (line 49) | func (abt *arrayBinaryTree) levelOrder() []any {
    method dfs (line 61) | func (abt *arrayBinaryTree) dfs(i int, order string, res *[]any) {
    method preOrder (line 83) | func (abt *arrayBinaryTree) preOrder() []any {
    method inOrder (line 90) | func (abt *arrayBinaryTree) inOrder() []any {
    method postOrder (line 97) | func (abt *arrayBinaryTree) postOrder() []any {
  function newArrayBinaryTree (line 13) | func newArrayBinaryTree(arr []any) *arrayBinaryTree {

FILE: codes/go/chapter_tree/array_binary_tree_test.go
  function TestArrayBinaryTree (line 14) | func TestArrayBinaryTree(t *testing.T) {

FILE: codes/go/chapter_tree/avl_tree.go
  type aVLTree (line 10) | type aVLTree struct
    method height (line 20) | func (t *aVLTree) height(node *TreeNode) int {
    method updateHeight (line 29) | func (t *aVLTree) updateHeight(node *TreeNode) {
    method balanceFactor (line 41) | func (t *aVLTree) balanceFactor(node *TreeNode) int {
    method rightRotate (line 51) | func (t *aVLTree) rightRotate(node *TreeNode) *TreeNode {
    method leftRotate (line 65) | func (t *aVLTree) leftRotate(node *TreeNode) *TreeNode {
    method rotate (line 79) | func (t *aVLTree) rotate(node *TreeNode) *TreeNode {
    method insert (line 110) | func (t *aVLTree) insert(val int) {
    method insertHelper (line 115) | func (t *aVLTree) insertHelper(node *TreeNode, val int) *TreeNode {
    method remove (line 137) | func (t *aVLTree) remove(val int) {
    method removeHelper (line 142) | func (t *aVLTree) removeHelper(node *TreeNode, val int) *TreeNode {
    method search (line 183) | func (t *aVLTree) search(val int) *TreeNode {
  function newAVLTree (line 15) | func newAVLTree() *aVLTree {

FILE: codes/go/chapter_tree/avl_tree_test.go
  function TestAVLTree (line 14) | func TestAVLTree(t *testing.T) {
  function testInsert (line 44) | func testInsert(tree *aVLTree, val int) {
  function testRemove (line 50) | func testRemove(tree *aVLTree, val int) {

FILE: codes/go/chapter_tree/binary_search_tree.go
  type binarySearchTree (line 11) | type binarySearchTree struct
    method getRoot (line 23) | func (bst *binarySearchTree) getRoot() *TreeNode {
    method search (line 28) | func (bst *binarySearchTree) search(num int) *TreeNode {
    method insert (line 48) | func (bst *binarySearchTree) insert(num int) {
    method remove (line 79) | func (bst *binarySearchTree) remove(num int) {
    method print (line 140) | func (bst *binarySearchTree) print() {
  function newBinarySearchTree (line 15) | func newBinarySearchTree() *binarySearchTree {

FILE: codes/go/chapter_tree/binary_search_tree_test.go
  function TestBinarySearchTree (line 12) | func TestBinarySearchTree(t *testing.T) {

FILE: codes/go/chapter_tree/binary_tree_bfs.go
  function levelOrder (line 14) | func levelOrder(root *TreeNode) []any {

FILE: codes/go/chapter_tree/binary_tree_bfs_test.go
  function TestLevelOrder (line 14) | func TestLevelOrder(t *testing.T) {

FILE: codes/go/chapter_tree/binary_tree_dfs.go
  function preOrder (line 14) | func preOrder(node *TreeNode) {
  function inOrder (line 25) | func inOrder(node *TreeNode) {
  function postOrder (line 36) | func postOrder(node *TreeNode) {

FILE: codes/go/chapter_tree/binary_tree_dfs_test.go
  function TestPreInPostOrderTraversal (line 14) | func TestPreInPostOrderTraversal(t *testing.T) {

FILE: codes/go/chapter_tree/binary_tree_test.go
  function TestBinaryTree (line 14) | func TestBinaryTree(t *testing.T) {

FILE: codes/go/pkg/list_node.go
  type ListNode (line 8) | type ListNode struct
  function NewListNode (line 14) | func NewListNode(v int) *ListNode {
  function ArrayToLinkedList (line 22) | func ArrayToLinkedList(arr []int) *ListNode {

FILE: codes/go/pkg/list_node_test.go
  function TestListNode (line 11) | func TestListNode(t *testing.T) {

FILE: codes/go/pkg/print_utils.go
  function PrintSlice (line 15) | func PrintSlice[T any](nums []T) {
  function PrintList (line 21) | func PrintList(list *list.List) {
  function PrintMap (line 37) | func PrintMap[K comparable, V any](m map[K]V) {
  function PrintHeap (line 44) | func PrintHeap(h []any) {
  function PrintLinkedList (line 53) | func PrintLinkedList(node *ListNode) {
  function PrintTree (line 67) | func PrintTree(root *TreeNode) {
  function printTreeHelper (line 74) | func printTreeHelper(root *TreeNode, prev *trunk, isRight bool) {
  type trunk (line 99) | type trunk struct
  function newTrunk (line 104) | func newTrunk(prev *trunk, str string) *trunk {
  function showTrunk (line 111) | func showTrunk(t *trunk) {

FILE: codes/go/pkg/tree_node.go
  type TreeNode (line 8) | type TreeNode struct
  function NewTreeNode (line 16) | func NewTreeNode(v any) *TreeNode {
  function SliceToTreeDFS (line 45) | func SliceToTreeDFS(arr []any, i int) *TreeNode {
  function SliceToTree (line 56) | func SliceToTree(arr []any) *TreeNode {
  function TreeToSliceDFS (line 61) | func TreeToSliceDFS(root *TreeNode, i int, res *[]any) {
  function TreeToSlice (line 74) | func TreeToSlice(root *TreeNode) []any {

FILE: codes/go/pkg/tree_node_test.go
  function TestTreeNode (line 12) | func TestTreeNode(t *testing.T) {

FILE: codes/go/pkg/vertex.go
  type Vertex (line 8) | type Vertex struct
  function NewVertex (line 13) | func NewVertex(val int) Vertex {
  function ValsToVets (line 20) | func ValsToVets(vals []int) []Vertex {
  function VetsToVals (line 29) | func VetsToVals(vets []Vertex) []int {
  function DeleteSliceElms (line 38) | func DeleteSliceElms[T any](a []T, elms ...T) []T {

FILE: codes/java/chapter_array_and_linkedlist/array.java
  class array (line 12) | public class array {
    method randomAccess (line 14) | static int randomAccess(int[] nums) {
    method extend (line 23) | static int[] extend(int[] nums, int enlarge) {
    method insert (line 35) | static void insert(int[] nums, int num, int index) {
    method remove (line 45) | static void remove(int[] nums, int index) {
    method traverse (line 53) | static void traverse(int[] nums) {
    method find (line 66) | static int find(int[] nums, int target) {
    method main (line 75) | public static void main(String[] args) {

FILE: codes/java/chapter_array_and_linkedlist/linked_list.java
  class linked_list (line 11) | public class linked_list {
    method insert (line 13) | static void insert(ListNode n0, ListNode P) {
    method remove (line 20) | static void remove(ListNode n0) {
    method access (line 30) | static ListNode access(ListNode head, int index) {
    method find (line 40) | static int find(ListNode head, int target) {
    method main (line 52) | public static void main(String[] args) {

FILE: codes/java/chapter_array_and_linkedlist/list.java
  class list (line 11) | public class list {
    method main (line 12) | public static void main(String[] args) {

FILE: codes/java/chapter_array_and_linkedlist/my_list.java
  class MyList (line 12) | class MyList {
    method MyList (line 19) | public MyList() {
    method size (line 24) | public int size() {
    method capacity (line 29) | public int capacity() {
    method get (line 34) | public int get(int index) {
    method set (line 42) | public void set(int index, int num) {
    method add (line 49) | public void add(int num) {
    method insert (line 59) | public void insert(int index, int num) {
    method remove (line 75) | public int remove(int index) {
    method extendCapacity (line 90) | public void extendCapacity() {
    method toArray (line 98) | public int[] toArray() {
  class my_list (line 109) | public class my_list {
    method main (line 111) | public static void main(String[] args) {

FILE: codes/java/chapter_backtracking/n_queens.java
  class n_queens (line 11) | public class n_queens {
    method backtrack (line 13) | public static void backtrack(int row, int n, List<List<String>> state,...
    method nQueens (line 44) | public static List<List<List<String>>> nQueens(int n) {
    method main (line 64) | public static void main(String[] args) {

FILE: codes/java/chapter_backtracking/permutations_i.java
  class permutations_i (line 11) | public class permutations_i {
    method backtrack (line 13) | public static void backtrack(List<Integer> state, int[] choices, boole...
    method permutationsI (line 37) | static List<List<Integer>> permutationsI(int[] nums) {
    method main (line 43) | public static void main(String[] args) {

FILE: codes/java/chapter_backtracking/permutations_ii.java
  class permutations_ii (line 11) | public class permutations_ii {
    method backtrack (line 13) | static void backtrack(List<Integer> state, int[] choices, boolean[] se...
    method permutationsII (line 39) | static List<List<Integer>> permutationsII(int[] nums) {
    method main (line 45) | public static void main(String[] args) {

FILE: codes/java/chapter_backtracking/preorder_traversal_i_compact.java
  class preorder_traversal_i_compact (line 12) | public class preorder_traversal_i_compact {
    method preOrder (line 16) | static void preOrder(TreeNode root) {
    method main (line 28) | public static void main(String[] args) {

FILE: codes/java/chapter_backtracking/preorder_traversal_ii_compact.java
  class preorder_traversal_ii_compact (line 12) | public class preorder_traversal_ii_compact {
    method preOrder (line 17) | static void preOrder(TreeNode root) {
    method main (line 33) | public static void main(String[] args) {

FILE: codes/java/chapter_backtracking/preorder_traversal_iii_compact.java
  class preorder_traversal_iii_compact (line 12) | public class preorder_traversal_iii_compact {
    method preOrder (line 17) | static void preOrder(TreeNode root) {
    method main (line 34) | public static void main(String[] args) {

FILE: codes/java/chapter_backtracking/preorder_traversal_iii_template.java
  class preorder_traversal_iii_template (line 12) | public class preorder_traversal_iii_template {
    method isSolution (line 14) | static boolean isSolution(List<TreeNode> state) {
    method recordSolution (line 19) | static void recordSolution(List<TreeNode> state, List<List<TreeNode>> ...
    method isValid (line 24) | static boolean isValid(List<TreeNode> state, TreeNode choice) {
    method makeChoice (line 29) | static void makeChoice(List<TreeNode> state, TreeNode choice) {
    method undoChoice (line 34) | static void undoChoice(List<TreeNode> state, TreeNode choice) {
    method backtrack (line 39) | static void backtrack(List<TreeNode> state, List<TreeNode> choices, Li...
    method main (line 59) | public static void main(String[] args) {

FILE: codes/java/chapter_backtracking/subset_sum_i.java
  class subset_sum_i (line 11) | public class subset_sum_i {
    method backtrack (line 13) | static void backtrack(List<Integer> state, int target, int[] choices, ...
    method subsetSumI (line 37) | static List<List<Integer>> subsetSumI(int[] nums, int target) {
    method main (line 46) | public static void main(String[] args) {

FILE: codes/java/chapter_backtracking/subset_sum_i_naive.java
  class subset_sum_i_naive (line 11) | public class subset_sum_i_naive {
    method backtrack (line 13) | static void backtrack(List<Integer> state, int target, int total, int[...
    method subsetSumINaive (line 35) | static List<List<Integer>> subsetSumINaive(int[] nums, int target) {
    method main (line 43) | public static void main(String[] args) {

FILE: codes/java/chapter_backtracking/subset_sum_ii.java
  class subset_sum_ii (line 11) | public class subset_sum_ii {
    method backtrack (line 13) | static void backtrack(List<Integer> state, int target, int[] choices, ...
    method subsetSumII (line 42) | static List<List<Integer>> subsetSumII(int[] nums, int target) {
    method main (line 51) | public static void main(String[] args) {

FILE: codes/java/chapter_computational_complexity/iteration.java
  class iteration (line 9) | public class iteration {
    method forLoop (line 11) | static int forLoop(int n) {
    method whileLoop (line 21) | static int whileLoop(int n) {
    method whileLoopII (line 33) | static int whileLoopII(int n) {
    method nestedForLoop (line 47) | static String nestedForLoop(int n) {
    method main (line 60) | public static void main(String[] args) {

FILE: codes/java/chapter_computational_complexity/recursion.java
  class recursion (line 11) | public class recursion {
    method recur (line 13) | static int recur(int n) {
    method forLoopRecur (line 24) | static int forLoopRecur(int n) {
    method tailRecur (line 43) | static int tailRecur(int n, int res) {
    method fib (line 52) | static int fib(int n) {
    method main (line 63) | public static void main(String[] args) {

FILE: codes/java/chapter_computational_complexity/space_complexity.java
  class space_complexity (line 12) | public class space_complexity {
    method function (line 14) | static int function() {
    method constant (line 20) | static void constant(int n) {
    method linear (line 37) | static void linear(int n) {
    method linearRecur (line 53) | static void linearRecur(int n) {
    method quadratic (line 61) | static void quadratic(int n) {
    method quadraticRecur (line 76) | static int quadraticRecur(int n) {
    method buildTree (line 86) | static TreeNode buildTree(int n) {
    method main (line 96) | public static void main(String[] args) {

FILE: codes/java/chapter_computational_complexity/time_complexity.java
  class time_complexity (line 9) | public class time_complexity {
    method constant (line 11) | static int constant(int n) {
    method linear (line 20) | static int linear(int n) {
    method arrayTraversal (line 28) | static int arrayTraversal(int[] nums) {
    method quadratic (line 38) | static int quadratic(int n) {
    method bubbleSort (line 50) | static int bubbleSort(int[] nums) {
    method exponential (line 69) | static int exponential(int n) {
    method expRecur (line 83) | static int expRecur(int n) {
    method logarithmic (line 90) | static int logarithmic(int n) {
    method logRecur (line 100) | static int logRecur(int n) {
    method linearLogRecur (line 107) | static int linearLogRecur(int n) {
    method factorialRecur (line 118) | static int factorialRecur(int n) {
    method main (line 130) | public static void main(String[] args) {

FILE: codes/java/chapter_computational_complexity/worst_best_time_complexity.java
  class worst_best_time_complexity (line 11) | public class worst_best_time_complexity {
    method randomNumbers (line 13) | static int[] randomNumbers(int n) {
    method findOne (line 30) | static int findOne(int[] nums) {
    method main (line 41) | public static void main(String[] args) {

FILE: codes/java/chapter_divide_and_conquer/binary_search_recur.java
  class binary_search_recur (line 9) | public class binary_search_recur {
    method dfs (line 11) | static int dfs(int[] nums, int target, int i, int j) {
    method binarySearch (line 31) | static int binarySearch(int[] nums, int target) {
    method main (line 37) | public static void main(String[] args) {

FILE: codes/java/chapter_divide_and_conquer/build_tree.java
  class build_tree (line 12) | public class build_tree {
    method dfs (line 14) | static TreeNode dfs(int[] preorder, Map<Integer, Integer> inorderMap, ...
    method buildTree (line 31) | static TreeNode buildTree(int[] preorder, int[] inorder) {
    method main (line 41) | public static void main(String[] args) {

FILE: codes/java/chapter_divide_and_conquer/hanota.java
  class hanota (line 11) | public class hanota {
    method move (line 13) | static void move(List<Integer> src, List<Integer> tar) {
    method dfs (line 21) | static void dfs(int i, List<Integer> src, List<Integer> buf, List<Inte...
    method solveHanota (line 36) | static void solveHanota(List<Integer> A, List<Integer> B, List<Integer...
    method main (line 42) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/climbing_stairs_backtrack.java
  class climbing_stairs_backtrack (line 11) | public class climbing_stairs_backtrack {
    method backtrack (line 13) | public static void backtrack(List<Integer> choices, int state, int n, ...
    method climbingStairsBacktrack (line 29) | public static int climbingStairsBacktrack(int n) {
    method main (line 38) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/climbing_stairs_constraint_dp.java
  class climbing_stairs_constraint_dp (line 9) | public class climbing_stairs_constraint_dp {
    method climbingStairsConstraintDP (line 11) | static int climbingStairsConstraintDP(int n) {
    method main (line 30) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/climbing_stairs_dfs.java
  class climbing_stairs_dfs (line 9) | public class climbing_stairs_dfs {
    method dfs (line 11) | public static int dfs(int i) {
    method climbingStairsDFS (line 21) | public static int climbingStairsDFS(int n) {
    method main (line 25) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/climbing_stairs_dfs_mem.java
  class climbing_stairs_dfs_mem (line 11) | public class climbing_stairs_dfs_mem {
    method dfs (line 13) | public static int dfs(int i, int[] mem) {
    method climbingStairsDFSMem (line 28) | public static int climbingStairsDFSMem(int n) {
    method main (line 35) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/climbing_stairs_dp.java
  class climbing_stairs_dp (line 9) | public class climbing_stairs_dp {
    method climbingStairsDP (line 11) | public static int climbingStairsDP(int n) {
    method climbingStairsDPComp (line 27) | public static int climbingStairsDPComp(int n) {
    method main (line 39) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/coin_change.java
  class coin_change (line 11) | public class coin_change {
    method coinChangeDP (line 13) | static int coinChangeDP(int[] coins, int amt) {
    method coinChangeDPComp (line 38) | static int coinChangeDPComp(int[] coins, int amt) {
    method main (line 60) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/coin_change_ii.java
  class coin_change_ii (line 9) | public class coin_change_ii {
    method coinChangeIIDP (line 11) | static int coinChangeIIDP(int[] coins, int amt) {
    method coinChangeIIDPComp (line 35) | static int coinChangeIIDPComp(int[] coins, int amt) {
    method main (line 55) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/edit_distance.java
  class edit_distance (line 11) | public class edit_distance {
    method editDistanceDFS (line 13) | static int editDistanceDFS(String s, String t, int i, int j) {
    method editDistanceDFSMem (line 35) | static int editDistanceDFSMem(String s, String t, int[][] mem, int i, ...
    method editDistanceDP (line 61) | static int editDistanceDP(String s, String t) {
    method editDistanceDPComp (line 87) | static int editDistanceDPComp(String s, String t) {
    method main (line 115) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/knapsack.java
  class knapsack (line 11) | public class knapsack {
    method knapsackDFS (line 14) | static int knapsackDFS(int[] wgt, int[] val, int i, int c) {
    method knapsackDFSMem (line 31) | static int knapsackDFSMem(int[] wgt, int[] val, int[][] mem, int i, in...
    method knapsackDP (line 53) | static int knapsackDP(int[] wgt, int[] val, int cap) {
    method knapsackDPComp (line 73) | static int knapsackDPComp(int[] wgt, int[] val, int cap) {
    method main (line 90) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/min_cost_climbing_stairs_dp.java
  class min_cost_climbing_stairs_dp (line 11) | public class min_cost_climbing_stairs_dp {
    method minCostClimbingStairsDP (line 13) | public static int minCostClimbingStairsDP(int[] cost) {
    method minCostClimbingStairsDPComp (line 30) | public static int minCostClimbingStairsDPComp(int[] cost) {
    method main (line 43) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/min_path_sum.java
  class min_path_sum (line 11) | public class min_path_sum {
    method minPathSumDFS (line 13) | static int minPathSumDFS(int[][] grid, int i, int j) {
    method minPathSumDFSMem (line 30) | static int minPathSumDFSMem(int[][] grid, int[][] mem, int i, int j) {
    method minPathSumDP (line 52) | static int minPathSumDP(int[][] grid) {
    method minPathSumDPComp (line 75) | static int minPathSumDPComp(int[][] grid) {
    method main (line 96) | public static void main(String[] args) {

FILE: codes/java/chapter_dynamic_programming/unbounded_knapsack.java
  class unbounded_knapsack (line 9) | public class unbounded_knapsack {
    method unboundedKnapsackDP (line 11) | static int unboundedKnapsackDP(int[] wgt, int[] val, int cap) {
    method unboundedKnapsackDPComp (line 31) | static int unboundedKnapsackDPComp(int[] wgt, int[] val, int cap) {
    method main (line 50) | public static void main(String[] args) {

FILE: codes/java/chapter_graph/graph_adjacency_list.java
  class GraphAdjList (line 13) | class GraphAdjList {
    method GraphAdjList (line 18) | public GraphAdjList(Vertex[][] edges) {
    method size (line 29) | public int size() {
    method addEdge (line 34) | public void addEdge(Vertex vet1, Vertex vet2) {
    method removeEdge (line 43) | public void removeEdge(Vertex vet1, Vertex vet2) {
    method addVertex (line 52) | public void addVertex(Vertex vet) {
    method removeVertex (line 60) | public void removeVertex(Vertex vet) {
    method print (line 72) | public void print() {
  class graph_adjacency_list (line 83) | public class graph_adjacency_list {
    method main (line 84) | public static void main(String[] args) {

FILE: codes/java/chapter_graph/graph_adjacency_matrix.java
  class GraphAdjMat (line 13) | class GraphAdjMat {
    method GraphAdjMat (line 18) | public GraphAdjMat(int[] vertices, int[][] edges) {
    method size (line 33) | public int size() {
    method addVertex (line 38) | public void addVertex(int val) {
    method removeVertex (line 55) | public void removeVertex(int index) {
    method addEdge (line 70) | public void addEdge(int i, int j) {
    method removeEdge (line 81) | public void removeEdge(int i, int j) {
    method print (line 90) | public void print() {
  class graph_adjacency_matrix (line 98) | public class graph_adjacency_matrix {
    method main (line 99) | public static void main(String[] args) {

FILE: codes/java/chapter_graph/graph_bfs.java
  class graph_bfs (line 12) | public class graph_bfs {
    method graphBFS (line 15) | static List<Vertex> graphBFS(GraphAdjList graph, Vertex startVet) {
    method main (line 40) | public static void main(String[] args) {

FILE: codes/java/chapter_graph/graph_dfs.java
  class graph_dfs (line 12) | public class graph_dfs {
    method dfs (line 14) | static void dfs(GraphAdjList graph, Set<Vertex> visited, List<Vertex> ...
    method graphDFS (line 28) | static List<Vertex> graphDFS(GraphAdjList graph, Vertex startVet) {
    method main (line 37) | public static void main(String[] args) {

FILE: codes/java/chapter_greedy/coin_change_greedy.java
  class coin_change_greedy (line 11) | public class coin_change_greedy {
    method coinChangeGreedy (line 13) | static int coinChangeGreedy(int[] coins, int amt) {
    method main (line 31) | public static void main(String[] args) {

FILE: codes/java/chapter_greedy/fractional_knapsack.java
  class Item (line 13) | class Item {
    method Item (line 17) | public Item(int w, int v) {
  class fractional_knapsack (line 23) | public class fractional_knapsack {
    method fractionalKnapsack (line 25) | static double fractionalKnapsack(int[] wgt, int[] val, int cap) {
    method main (line 50) | public static void main(String[] args) {

FILE: codes/java/chapter_greedy/max_capacity.java
  class max_capacity (line 9) | public class max_capacity {
    method maxCapacity (line 11) | static int maxCapacity(int[] ht) {
    method main (line 31) | public static void main(String[] args) {

FILE: codes/java/chapter_greedy/max_product_cutting.java
  class max_product_cutting (line 11) | public class max_product_cutting {
    method maxProductCutting (line 13) | public static int maxProductCutting(int n) {
    method main (line 33) | public static void main(String[] args) {

FILE: codes/java/chapter_hashing/array_hash_map.java
  class Pair (line 12) | class Pair {
    method Pair (line 16) | public Pair(int key, String val) {
  class ArrayHashMap (line 23) | class ArrayHashMap {
    method ArrayHashMap (line 26) | public ArrayHashMap() {
    method hashFunc (line 35) | private int hashFunc(int key) {
    method get (line 41) | public String get(int key) {
    method put (line 50) | public void put(int key, String val) {
    method remove (line 57) | public void remove(int key) {
    method pairSet (line 64) | public List<Pair> pairSet() {
    method keySet (line 74) | public List<Integer> keySet() {
    method valueSet (line 84) | public List<String> valueSet() {
    method print (line 94) | public void print() {
  class array_hash_map (line 101) | public class array_hash_map {
    method main (line 102) | public static void main(String[] args) {

FILE: codes/java/chapter_hashing/built_in_hash.java
  class built_in_hash (line 12) | public class built_in_hash {
    method main (line 13) | public static void main(String[] args) {

FILE: codes/java/chapter_hashing/hash_map.java
  class hash_map (line 12) | public class hash_map {
    method main (line 13) | public static void main(String[] args) {

FILE: codes/java/chapter_hashing/hash_map_chaining.java
  class HashMapChaining (line 13) | class HashMapChaining {
    method HashMapChaining (line 21) | public HashMapChaining() {
    method hashFunc (line 33) | int hashFunc(int key) {
    method loadFactor (line 38) | double loadFactor() {
    method get (line 43) | String get(int key) {
    method put (line 57) | void put(int key, String val) {
    method remove (line 78) | void remove(int key) {
    method extend (line 92) | void extend() {
    method print (line 111) | void print() {
  class hash_map_chaining (line 122) | public class hash_map_chaining {
    method main (line 123) | public static void main(String[] args) {

FILE: codes/java/chapter_hashing/hash_map_open_addressing.java
  class HashMapOpenAddressing (line 10) | class HashMapOpenAddressing {
    method HashMapOpenAddressing (line 19) | public HashMapOpenAddressing() {
    method hashFunc (line 25) | private int hashFunc(int key) {
    method loadFactor (line 30) | private double loadFactor() {
    method findBucket (line 35) | private int findBucket(int key) {
    method get (line 62) | public String get(int key) {
    method put (line 74) | public void put(int key, String val) {
    method remove (line 92) | public void remove(int key) {
    method extend (line 103) | private void extend() {
    method print (line 119) | public void print() {
  class hash_map_open_addressing (line 132) | public class hash_map_open_addressing {
    method main (line 133) | public static void main(String[] args) {

FILE: codes/java/chapter_hashing/simple_hash.java
  class simple_hash (line 9) | public class simple_hash {
    method addHash (line 11) | static int addHash(String key) {
    method mulHash (line 21) | static int mulHash(String key) {
    method xorHash (line 31) | static int xorHash(String key) {
    method rotHash (line 41) | static int rotHash(String key) {
    method main (line 50) | public static void main(String[] args) {

FILE: codes/java/chapter_heap/heap.java
  class heap (line 12) | public class heap {
    method testPush (line 13) | public static void testPush(Queue<Integer> heap, int val) {
    method testPop (line 19) | public static void testPop(Queue<Integer> heap) {
    method main (line 25) | public static void main(String[] args) {

FILE: codes/java/chapter_heap/my_heap.java
  class MaxHeap (line 13) | class MaxHeap {
    method MaxHeap (line 18) | public MaxHeap(List<Integer> nums) {
    method left (line 28) | private int left(int i) {
    method right (line 33) | private int right(int i) {
    method parent (line 38) | private int parent(int i) {
    method swap (line 43) | private void swap(int i, int j) {
    method size (line 50) | public int size() {
    method isEmpty (line 55) | public boolean isEmpty() {
    method peek (line 60) | public int peek() {
    method push (line 65) | public void push(int val) {
    method siftUp (line 73) | private void siftUp(int i) {
    method pop (line 88) | public int pop() {
    method siftDown (line 103) | private void siftDown(int i) {
    method print (line 122) | public void print() {
  class my_heap (line 129) | public class my_heap {
    method main (line 130) | public static void main(String[] args) {

FILE: codes/java/chapter_heap/top_k.java
  class top_k (line 12) | public class top_k {
    method topKHeap (line 14) | static Queue<Integer> topKHeap(int[] nums, int k) {
    method main (line 32) | public static void main(String[] args) {

FILE: codes/java/chapter_searching/binary_search.java
  class binary_search (line 9) | public class binary_search {
    method binarySearch (line 11) | static int binarySearch(int[] nums, int target) {
    method binarySearchLCRO (line 29) | static int binarySearchLCRO(int[] nums, int target) {
    method main (line 46) | public static void main(String[] args) {

FILE: codes/java/chapter_searching/binary_search_edge.java
  class binary_search_edge (line 9) | public class binary_search_edge {
    method binarySearchLeftEdge (line 11) | static int binarySearchLeftEdge(int[] nums, int target) {
    method binarySearchRightEdge (line 23) | static int binarySearchRightEdge(int[] nums, int target) {
    method main (line 36) | public static void main(String[] args) {

FILE: codes/java/chapter_searching/binary_search_insertion.java
  class binary_search_insertion (line 9) | class binary_search_insertion {
    method binarySearchInsertionSimple (line 11) | static int binarySearchInsertionSimple(int[] nums, 

[
  {
    "path": ".gitattributes",
    "chars": 508,
    "preview": "*.py linguist-language=Python\n*.cpp linguist-language=C++\n*.hpp linguist-language=C++\n*.java linguist-language=Java\n*.go"
  },
  {
    "path": ".github/pull_request_template.md",
    "chars": 978,
    "preview": "If this pull request (PR) pertains to **Chinese-to-English translation**, please confirm that you have read the contribu"
  },
  {
    "path": ".github/workflows/c.yml",
    "chars": 3369,
    "preview": "# This starter workflow is for a CMake project running on multiple platforms. There is a different starter workflow if y"
  },
  {
    "path": ".github/workflows/cpp.yml",
    "chars": 3407,
    "preview": "# This starter workflow is for a CMake project running on multiple platforms. There is a different starter workflow if y"
  },
  {
    "path": ".github/workflows/dart.yml",
    "chars": 1044,
    "preview": "# This workflow will install Dart SDK, run format, analyze and build with Dart\n\nname: Dart\n\non:\n  push:\n    branches: [\""
  },
  {
    "path": ".github/workflows/dotnet.yml",
    "chars": 1261,
    "preview": "# This workflow will build a .NET project\r\n# For more information see: https://docs.github.com/en/actions/automating-bui"
  },
  {
    "path": ".github/workflows/go.yml",
    "chars": 974,
    "preview": "name: Go\n\non:\n  push:\n    branches: [\"main\"]\n    paths:\n      - \"codes/go/**/*.go\"\n      - \"en/codes/go/**/*.go\"\n  pull_"
  },
  {
    "path": ".github/workflows/java.yml",
    "chars": 861,
    "preview": "# # This workflow will install OpenJDK and build the Java project\n# For more information see: https://github.com/actions"
  },
  {
    "path": ".github/workflows/javascript.yml",
    "chars": 773,
    "preview": "name: JavaScript\n\non:\n  push:\n    branches: [\"main\"]\n    paths:\n      - \"codes/javascript/**/*.js\"\n      - \"en/codes/jav"
  },
  {
    "path": ".github/workflows/kotlin.yml",
    "chars": 653,
    "preview": "name: Kotlin\n\non:\n  push:\n    branches: [\"main\"]\n    paths:\n      - \"codes/kotlin/**/*.kt\"\n      - \"en/codes/kotlin/**/*"
  },
  {
    "path": ".github/workflows/python.yml",
    "chars": 1299,
    "preview": "# This workflow will install Python dependencies, run tests and lint with Python\n# For more information see: https://doc"
  },
  {
    "path": ".github/workflows/ruby.yml",
    "chars": 1194,
    "preview": "# This workflow uses actions that are not certified by GitHub.\n# They are provided by a third-party and are governed by "
  },
  {
    "path": ".github/workflows/rust.yml",
    "chars": 856,
    "preview": "name: Rust\n\non:\n  push:\n    branches: [\"main\"]\n    paths:\n      - \"codes/rust/**/*.rs\"\n      - \"codes/rust/Cargo.toml\"\n "
  },
  {
    "path": ".github/workflows/swift.yml",
    "chars": 761,
    "preview": "# This workflow will build a Swift project\n# For more information see: https://docs.github.com/en/actions/automating-bui"
  },
  {
    "path": ".github/workflows/typescript.yml",
    "chars": 780,
    "preview": "name: TypeScript\n\non:\n  push:\n    branches: [\"main\"]\n    paths:\n      - \"codes/typescript/**/*.ts\"\n      - \"en/codes/typ"
  },
  {
    "path": ".gitignore",
    "chars": 63,
    "preview": ".DS_Store\n\n.vscode/\n/node_modules\n\n# build\n/build\n/site\n/utils\n"
  },
  {
    "path": "Dockerfile",
    "chars": 963,
    "preview": "FROM python:3.10.0-alpine\n\n# Official PyPI is preferred when reachable.\nENV PIP_INDEX_URL=https://pypi.org/simple\n\n# Use"
  },
  {
    "path": "LICENSE",
    "chars": 20845,
    "preview": "Attribution-NonCommercial-ShareAlike 4.0 International\n\n================================================================"
  },
  {
    "path": "README.md",
    "chars": 4142,
    "preview": "<p align=\"center\">\n  <a href=\"https://www.hello-algo.com/\">\n    <img src=\"https://www.hello-algo.com/index.assets/hello_"
  },
  {
    "path": "codes/Dockerfile",
    "chars": 1242,
    "preview": "FROM ubuntu:latest\n\n# Use Ubuntu image from Aliyun\nRUN sed -i 's/archive.ubuntu.com/mirrors.aliyun.com/g' /etc/apt/sourc"
  },
  {
    "path": "codes/c/.gitignore",
    "chars": 91,
    "preview": "# Ignore all\n*\n# Unignore all with extensions\n!*.*\n# Unignore all dirs\n!*/\n*.dSYM/\n\nbuild/\n"
  },
  {
    "path": "codes/c/CMakeLists.txt",
    "chars": 619,
    "preview": "cmake_minimum_required(VERSION 3.10)\nproject(hello_algo C)\n\nset(CMAKE_C_STANDARD 11)\n\ninclude_directories(./include)\n\nad"
  },
  {
    "path": "codes/c/chapter_array_and_linkedlist/CMakeLists.txt",
    "chars": 105,
    "preview": "add_executable(array array.c)\nadd_executable(linked_list linked_list.c)\nadd_executable(my_list my_list.c)"
  },
  {
    "path": "codes/c/chapter_array_and_linkedlist/array.c",
    "chars": 2508,
    "preview": "/**\r\n * File: array.c\r\n * Created Time: 2022-12-20\r\n * Author: MolDuM (moldum@163.com)\r\n */\r\n\r\n#include \"../utils/common"
  },
  {
    "path": "codes/c/chapter_array_and_linkedlist/linked_list.c",
    "chars": 1775,
    "preview": "/**\n * File: linked_list.c\n * Created Time: 2023-01-12\n * Author: Zero (glj0@outlook.com)\n */\n\n#include \"../utils/common"
  },
  {
    "path": "codes/c/chapter_array_and_linkedlist/my_list.c",
    "chars": 3431,
    "preview": "/**\n * File: my_list.c\n * Created Time: 2023-01-12\n * Author: Zero (glj0@outlook.com)\n */\n\n#include \"../utils/common.h\"\n"
  },
  {
    "path": "codes/c/chapter_backtracking/CMakeLists.txt",
    "chars": 595,
    "preview": "add_executable(permutations_i permutations_i.c)\nadd_executable(permutations_ii permutations_ii.c)\nadd_executable(preorde"
  },
  {
    "path": "codes/c/chapter_backtracking/n_queens.c",
    "chars": 2705,
    "preview": "/**\n * File : n_queens.c\n * Created Time: 2023-09-25\n * Author : lucas (superrat6@gmail.com)\n */\n\n#include \"../utils/com"
  },
  {
    "path": "codes/c/chapter_backtracking/permutations_i.c",
    "chars": 2003,
    "preview": "/**\n * File: permutations_i.c\n * Created Time: 2023-06-04\n * Author: Gonglja (glj0@outlook.com), krahets (krahets@163.co"
  },
  {
    "path": "codes/c/chapter_backtracking/permutations_ii.c",
    "chars": 2121,
    "preview": "/**\n * File: permutations_ii.c\n * Created Time: 2023-10-17\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/c/chapter_backtracking/preorder_traversal_i_compact.c",
    "chars": 932,
    "preview": "/**\n * File: preorder_traversal_i_compact.c\n * Created Time: 2023-05-10\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#incl"
  },
  {
    "path": "codes/c/chapter_backtracking/preorder_traversal_ii_compact.c",
    "chars": 1270,
    "preview": "/**\n * File: preorder_traversal_ii_compact.c\n * Created Time: 2023-05-28\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#inc"
  },
  {
    "path": "codes/c/chapter_backtracking/preorder_traversal_iii_compact.c",
    "chars": 1316,
    "preview": "/**\n * File: preorder_traversal_iii_compact.c\n * Created Time: 2023-06-04\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#in"
  },
  {
    "path": "codes/c/chapter_backtracking/preorder_traversal_iii_template.c",
    "chars": 1986,
    "preview": "/**\n * File: preorder_traversal_iii_template.c\n * Created Time: 2023-06-04\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#i"
  },
  {
    "path": "codes/c/chapter_backtracking/subset_sum_i.c",
    "chars": 1847,
    "preview": "/**\n * File: subset_sum_i.c\n * Created Time: 2023-07-29\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../utils/co"
  },
  {
    "path": "codes/c/chapter_backtracking/subset_sum_i_naive.c",
    "chars": 1602,
    "preview": "/**\n * File: subset_sum_i_naive.c\n * Created Time: 2023-07-28\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../ut"
  },
  {
    "path": "codes/c/chapter_backtracking/subset_sum_ii.c",
    "chars": 1939,
    "preview": "/**\n * File: subset_sum_ii.c\n * Created Time: 2023-07-29\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../utils/c"
  },
  {
    "path": "codes/c/chapter_computational_complexity/CMakeLists.txt",
    "chars": 250,
    "preview": "add_executable(iteration iteration.c)\nadd_executable(recursion recursion.c)\nadd_executable(time_complexity time_complexi"
  },
  {
    "path": "codes/c/chapter_computational_complexity/iteration.c",
    "chars": 1642,
    "preview": "/**\n * File: iteration.c\n * Created Time: 2023-09-09\n * Author: Gonglja (glj0@outlook.com), MwumLi (mwumli@hotmail.com)\n"
  },
  {
    "path": "codes/c/chapter_computational_complexity/recursion.c",
    "chars": 1368,
    "preview": "/**\n * File: recursion.c\n * Created Time: 2023-09-09\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../utils/commo"
  },
  {
    "path": "codes/c/chapter_computational_complexity/space_complexity.c",
    "chars": 2627,
    "preview": "/**\n * File: space_complexity.c\n * Created Time: 2023-04-15\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../util"
  },
  {
    "path": "codes/c/chapter_computational_complexity/time_complexity.c",
    "chars": 3673,
    "preview": "/**\n * File: time_complexity.c\n * Created Time: 2023-01-03\n * Author: codingonion (coderonion@gmail.com)\n */\n\n#include \""
  },
  {
    "path": "codes/c/chapter_computational_complexity/worst_best_time_complexity.c",
    "chars": 1340,
    "preview": "/**\n * File: worst_best_time_complexity.c\n * Created Time: 2023-01-03\n * Author: codingonion (coderonion@gmail.com)\n */\n"
  },
  {
    "path": "codes/c/chapter_divide_and_conquer/CMakeLists.txt",
    "chars": 130,
    "preview": "add_executable(binary_search_recur binary_search_recur.c)\nadd_executable(build_tree build_tree.c)\nadd_executable(hanota "
  },
  {
    "path": "codes/c/chapter_divide_and_conquer/binary_search_recur.c",
    "chars": 1027,
    "preview": "/**\n * File: binary_search_recur.c\n * Created Time: 2023-10-01\n * Author: Zuoxun (845242523@qq.com)\n */\n\n#include \"../ut"
  },
  {
    "path": "codes/c/chapter_divide_and_conquer/build_tree.c",
    "chars": 1667,
    "preview": "/**\n * File : build_tree.c\n * Created Time: 2023-10-16\n * Author : lucas (superrat6@gmail.com)\n */\n\n#include \"../utils/c"
  },
  {
    "path": "codes/c/chapter_divide_and_conquer/hanota.c",
    "chars": 1729,
    "preview": "/**\n * File: hanota.c\n * Created Time: 2023-10-01\n * Author: Zuoxun (845242523@qq.com), lucas(superrat6@gmail.com)\n */\n\n"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/CMakeLists.txt",
    "chars": 424,
    "preview": "add_executable(climbing_stairs_constraint_dp climbing_stairs_constraint_dp.c)\nadd_executable(min_cost_climbing_stairs_dp"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/climbing_stairs_backtrack.c",
    "chars": 1115,
    "preview": "/**\r\n * File: climbing_stairs_backtrack.c\r\n * Created Time: 2023-09-22\r\n * Author: huawuque404 (huawuque404@163.com)\r\n *"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/climbing_stairs_constraint_dp.c",
    "chars": 948,
    "preview": "/**\n * File: climbing_stairs_constraint_dp.c\n * Created Time: 2023-10-02\n * Author: Zuoxun (845242523@qq.com)\n */\n\n#incl"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/climbing_stairs_dfs.c",
    "chars": 576,
    "preview": "/**\r\n * File: climbing_stairs_dfs.c\r\n * Created Time: 2023-09-19\r\n * Author: huawuque404 (huawuque404@163.com)\r\n */\r\n\r\n#"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/climbing_stairs_dfs_mem.c",
    "chars": 930,
    "preview": "/**\r\n * File: climbing_stairs_dfs_mem.c\r\n * Created Time: 2023-09-19\r\n * Author: huawuque404 (huawuque404@163.com)\r\n */\r"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/climbing_stairs_dp.c",
    "chars": 1035,
    "preview": "/**\r\n * File: climbing_stairs_dp.c\r\n * Created Time: 2023-09-19\r\n * Author: huawuque404 (huawuque404@163.com)\r\n */\r\n\r\n#i"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/coin_change.c",
    "chars": 2147,
    "preview": "/**\n * File: coin_change.c\n * Created Time: 2023-10-02\n * Author: Zuoxun (845242523@qq.com)\n */\n\n#include \"../utils/comm"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/coin_change_ii.c",
    "chars": 1894,
    "preview": "/**\n * File: coin_change_ii.c\n * Created Time: 2023-10-02\n * Author: Zuoxun (845242523@qq.com)\n */\n\n#include \"../utils/c"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/edit_distance.c",
    "chars": 4180,
    "preview": "/**\n * File: edit_distance.c\n * Created Time: 2023-10-02\n * Author: Zuoxun (845242523@qq.com)\n */\n\n#include \"../utils/co"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/knapsack.c",
    "chars": 3472,
    "preview": "/**\n * File: knapsack.c\n * Created Time: 2023-10-02\n * Author: Zuoxun (845242523@qq.com)\n */\n\n#include \"../utils/common."
  },
  {
    "path": "codes/c/chapter_dynamic_programming/min_cost_climbing_stairs_dp.c",
    "chars": 1407,
    "preview": "/**\n * File: min_cost_climbing_stairs_dp.c\n * Created Time: 2023-10-02\n * Author: Zuoxun (845242523@qq.com)\n */\n\n#includ"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/min_path_sum.c",
    "chars": 3344,
    "preview": "/**\n * File: min_path_sum.c\n * Created Time: 2023-10-02\n * Author: Zuoxun (845242523@qq.com)\n */\n\n#include \"../utils/com"
  },
  {
    "path": "codes/c/chapter_dynamic_programming/unbounded_knapsack.c",
    "chars": 1942,
    "preview": "/**\n * File: unbounded_knapsack.c\n * Created Time: 2023-10-02\n * Author: Zuoxun (845242523@qq.com)\n */\n\n#include \"../uti"
  },
  {
    "path": "codes/c/chapter_graph/CMakeLists.txt",
    "chars": 210,
    "preview": "add_executable(graph_adjacency_matrix graph_adjacency_matrix.c)\nadd_executable(graph_adjacency_list_test graph_adjacency"
  },
  {
    "path": "codes/c/chapter_graph/graph_adjacency_list.c",
    "chars": 4251,
    "preview": "/**\n * File: graph_adjacency_list.c\n * Created Time: 2023-07-07\n * Author: NI-SW (947743645@qq.com)\n */\n\n#include \"../ut"
  },
  {
    "path": "codes/c/chapter_graph/graph_adjacency_list_test.c",
    "chars": 1326,
    "preview": "/**\n * File: graph_adjacency_list_test.c\n * Created Time: 2023-07-11\n * Author: NI-SW (947743645@qq.com)\n */\n\n#include \""
  },
  {
    "path": "codes/c/chapter_graph/graph_adjacency_matrix.c",
    "chars": 3555,
    "preview": "/**\n * File: graph_adjacency_matrix.c\n * Created Time: 2023-07-06\n * Author: NI-SW (947743645@qq.com)\n */\n\n#include \"../"
  },
  {
    "path": "codes/c/chapter_graph/graph_bfs.c",
    "chars": 2960,
    "preview": "/**\n * File: graph_bfs.c\n * Created Time: 2023-07-11\n * Author: NI-SW (947743645@qq.com)\n */\n\n#include \"graph_adjacency_"
  },
  {
    "path": "codes/c/chapter_graph/graph_dfs.c",
    "chars": 1858,
    "preview": "/**\n * File: graph_dfs.c\n * Created Time: 2023-07-13\n * Author: NI-SW (947743645@qq.com)\n */\n\n#include \"graph_adjacency_"
  },
  {
    "path": "codes/c/chapter_greedy/CMakeLists.txt",
    "chars": 319,
    "preview": "add_executable(coin_change_greedy coin_change_greedy.c)\nadd_executable(fractional_knapsack fractional_knapsack.c)\nadd_ex"
  },
  {
    "path": "codes/c/chapter_greedy/coin_change_greedy.c",
    "chars": 1431,
    "preview": "/**\n * File: coin_change_greedy.c\n * Created Time: 2023-09-07\n * Author: lwbaptx (lwbaptx@gmail.com)\n */\n\n#include \"../u"
  },
  {
    "path": "codes/c/chapter_greedy/fractional_knapsack.c",
    "chars": 1483,
    "preview": "/**\n * File: fractional_knapsack.c\n * Created Time: 2023-09-14\n * Author: xianii (xianyi.xia@outlook.com)\n */\n\n#include "
  },
  {
    "path": "codes/c/chapter_greedy/max_capacity.c",
    "chars": 897,
    "preview": "/**\n * File: max_capacity.c\n * Created Time: 2023-09-15\n * Author: xianii (xianyi.xia@outlook.com)\n */\n\n#include \"../uti"
  },
  {
    "path": "codes/c/chapter_greedy/max_product_cutting.c",
    "chars": 715,
    "preview": "/**\n * File: max_product_cutting.c\n * Created Time: 2023-09-15\n * Author: xianii (xianyi.xia@outlook.com)\n */\n\n#include "
  },
  {
    "path": "codes/c/chapter_hashing/CMakeLists.txt",
    "chars": 212,
    "preview": "add_executable(array_hash_map array_hash_map.c)\nadd_executable(hash_map_chaining hash_map_chaining.c)\nadd_executable(has"
  },
  {
    "path": "codes/c/chapter_hashing/array_hash_map.c",
    "chars": 4671,
    "preview": "/**\n * File: array_hash_map.c\n * Created Time: 2023-03-18\n * Author: Guanngxu (446678850@qq.com)\n */\n\n#include \"../utils"
  },
  {
    "path": "codes/c/chapter_hashing/hash_map_chaining.c",
    "chars": 5210,
    "preview": "/**\n * File: hash_map_chaining.c\n * Created Time: 2023-10-13\n * Author: SenMing (1206575349@qq.com), krahets (krahets@16"
  },
  {
    "path": "codes/c/chapter_hashing/hash_map_open_addressing.c",
    "chars": 5932,
    "preview": "/**\n * File: hash_map_open_addressing.c\n * Created Time: 2023-10-6\n * Author: lclc6 (w1929522410@163.com)\n */\n\n#include "
  },
  {
    "path": "codes/c/chapter_hashing/simple_hash.c",
    "chars": 1366,
    "preview": "/**\n * File: simple_hash.c\n * Created Time: 2023-09-09\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../utils/com"
  },
  {
    "path": "codes/c/chapter_heap/CMakeLists.txt",
    "chars": 74,
    "preview": "add_executable(my_heap_test my_heap_test.c)\nadd_executable(top_k top_k.c)\n"
  },
  {
    "path": "codes/c/chapter_heap/my_heap.c",
    "chars": 3088,
    "preview": "/**\n * File: my_heap.c\n * Created Time: 2023-01-15\n * Author: Reanon (793584285@qq.com)\n */\n\n#include \"../utils/common.h"
  },
  {
    "path": "codes/c/chapter_heap/my_heap_test.c",
    "chars": 855,
    "preview": "/**\n * File: my_heap_test.c\n * Created Time: 2023-01-15\n * Author: Reanon (793584285@qq.com)\n */\n\n#include \"my_heap.c\"\n\n"
  },
  {
    "path": "codes/c/chapter_heap/top_k.c",
    "chars": 1535,
    "preview": "/**\n * File: top_k.c\n * Created Time: 2023-10-26\n * Author: krahets (krahets163.com)\n */\n\n#include \"my_heap.c\"\n\n/* 元素入堆 "
  },
  {
    "path": "codes/c/chapter_searching/CMakeLists.txt",
    "chars": 202,
    "preview": "add_executable(binary_search binary_search.c)\nadd_executable(two_sum two_sum.c)\nadd_executable(binary_search_edge binary"
  },
  {
    "path": "codes/c/chapter_searching/binary_search.c",
    "chars": 1503,
    "preview": "/**\n * File: binary_search.c\n * Created Time: 2023-03-18\n * Author: Guanngxu (446678850@qq.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/c/chapter_searching/binary_search_edge.c",
    "chars": 1834,
    "preview": "/**\n * File: binary_search_edge.c\n * Created Time: 2023-09-09\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../ut"
  },
  {
    "path": "codes/c/chapter_searching/binary_search_insertion.c",
    "chars": 2046,
    "preview": "/**\n * File: binary_search_insertion.c\n * Created Time: 2023-09-09\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \""
  },
  {
    "path": "codes/c/chapter_searching/two_sum.c",
    "chars": 2085,
    "preview": "/**\n * File: two_sum.c\n * Created Time: 2023-01-19\n * Author: Reanon (793584285@qq.com)\n */\n\n#include \"../utils/common.h"
  },
  {
    "path": "codes/c/chapter_sorting/CMakeLists.txt",
    "chars": 384,
    "preview": "add_executable(bubble_sort bubble_sort.c)\nadd_executable(insertion_sort insertion_sort.c)\nadd_executable(quick_sort quic"
  },
  {
    "path": "codes/c/chapter_sorting/bubble_sort.c",
    "chars": 1418,
    "preview": "/**\n * File: bubble_sort.c\n * Created Time: 2022-12-26\n * Author: Listening (https://github.com/L-Super)\n */\n\n#include \""
  },
  {
    "path": "codes/c/chapter_sorting/bucket_sort.c",
    "chars": 1445,
    "preview": "/**\n * File: bucket_sort.c\n * Created Time: 2023-05-30\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../utils/com"
  },
  {
    "path": "codes/c/chapter_sorting/counting_sort.c",
    "chars": 2180,
    "preview": "/**\n * File: counting_sort.c\n * Created Time: 2023-03-20\n * Author: Reanon (793584285@qq.com), Guanngxu (446678850@qq.co"
  },
  {
    "path": "codes/c/chapter_sorting/heap_sort.c",
    "chars": 1285,
    "preview": "/**\n * File: heap_sort.c\n * Created Time: 2023-05-30\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../utils/commo"
  },
  {
    "path": "codes/c/chapter_sorting/insertion_sort.c",
    "chars": 781,
    "preview": "/**\n * File: insertion_sort.c\n * Created Time: 2022-12-29\n * Author: Listening (https://github.com/L-Super)\n */\n\n#includ"
  },
  {
    "path": "codes/c/chapter_sorting/merge_sort.c",
    "chars": 1522,
    "preview": "/**\n * File: merge_sort.c\n * Created Time: 2022-03-21\n * Author: Guanngxu (446678850@qq.com)\n */\n\n#include \"../utils/com"
  },
  {
    "path": "codes/c/chapter_sorting/quick_sort.c",
    "chars": 3431,
    "preview": "/**\n * File: quick_sort.c\n * Created Time: 2023-01-18\n * Author: Reanon (793584285@qq.com)\n */\n\n#include \"../utils/commo"
  },
  {
    "path": "codes/c/chapter_sorting/radix_sort.c",
    "chars": 1990,
    "preview": "/**\n * File: radix_sort.c\n * Created Time: 2023-01-18\n * Author: Reanon (793584285@qq.com)\n */\n\n#include \"../utils/commo"
  },
  {
    "path": "codes/c/chapter_sorting/selection_sort.c",
    "chars": 752,
    "preview": "/**\n * File: selection_sort.c\n * Created Time: 2023-05-31\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/c/chapter_stack_and_queue/CMakeLists.txt",
    "chars": 282,
    "preview": "add_executable(array_stack array_stack.c)\nadd_executable(linkedlist_stack linkedlist_stack.c)\nadd_executable(array_queue"
  },
  {
    "path": "codes/c/chapter_stack_and_queue/array_deque.c",
    "chars": 4049,
    "preview": "/**\n * File: array_deque.c\n * Created Time: 2023-03-13\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../utils/com"
  },
  {
    "path": "codes/c/chapter_stack_and_queue/array_queue.c",
    "chars": 2943,
    "preview": "/**\n * File: array_queue.c\n * Created Time: 2023-01-28\n * Author: Zero (glj0@outlook.com)\n */\n\n#include \"../utils/common"
  },
  {
    "path": "codes/c/chapter_stack_and_queue/array_stack.c",
    "chars": 1861,
    "preview": "/**\n * File: array_stack.c\n * Created Time: 2023-01-12\n * Author: Zero (glj0@outlook.com)\n */\n\n#include \"../utils/common"
  },
  {
    "path": "codes/c/chapter_stack_and_queue/linkedlist_deque.c",
    "chars": 4977,
    "preview": "/**\n * File: linkedlist_deque.c\n * Created Time: 2023-03-13\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../util"
  },
  {
    "path": "codes/c/chapter_stack_and_queue/linkedlist_queue.c",
    "chars": 2675,
    "preview": "/**\n * File: linkedlist_queue.c\n * Created Time: 2023-03-13\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../util"
  },
  {
    "path": "codes/c/chapter_stack_and_queue/linkedlist_stack.c",
    "chars": 2012,
    "preview": "/**\n * File: linkedlist_stack.c\n * Created Time: 2023-01-12\n * Author: Zero (glj0@outlook.com)\n */\n\n#include \"../utils/c"
  },
  {
    "path": "codes/c/chapter_tree/CMakeLists.txt",
    "chars": 288,
    "preview": "add_executable(avl_tree avl_tree.c)\nadd_executable(binary_tree binary_tree.c)\nadd_executable(binary_tree_bfs binary_tree"
  },
  {
    "path": "codes/c/chapter_tree/array_binary_tree.c",
    "chars": 3909,
    "preview": "/**\n * File: array_binary_tree.c\n * Created Time: 2023-07-29\n * Author: Gonglja (glj0@outlook.com)\n */\n\n#include \"../uti"
  },
  {
    "path": "codes/c/chapter_tree/avl_tree.c",
    "chars": 5820,
    "preview": "/**\n * File: avl_tree.c\n * Created Time: 2023-01-15\n * Author: Reanon (793584285@qq.com)\n */\n\n#include \"../utils/common."
  },
  {
    "path": "codes/c/chapter_tree/binary_search_tree.c",
    "chars": 3884,
    "preview": "/**\n * File: binary_search_tree.c\n * Created Time: 2023-01-11\n * Author: Reanon (793584285@qq.com)\n */\n\n#include \"../uti"
  },
  {
    "path": "codes/c/chapter_tree/binary_tree.c",
    "chars": 811,
    "preview": "/**\n * File: binary_tree.c\n * Created Time: 2023-01-11\n * Author: Reanon (793584285@qq.com)\n */\n\n#include \"../utils/comm"
  },
  {
    "path": "codes/c/chapter_tree/binary_tree_bfs.c",
    "chars": 1509,
    "preview": "/**\n * File: binary_tree_bfs.c\n * Created Time: 2023-01-11\n * Author: Reanon (793584285@qq.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/c/chapter_tree/binary_tree_dfs.c",
    "chars": 1509,
    "preview": "/**\n * File: binary_tree_dfs.c\n * Created Time: 2023-01-11\n * Author: Reanon (793584285@qq.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/c/utils/CMakeLists.txt",
    "chars": 122,
    "preview": "add_executable(utils\n        common_test.c\n        common.h print_util.h\n        list_node.h tree_node.h\n        uthash."
  },
  {
    "path": "codes/c/utils/common.h",
    "chars": 527,
    "preview": "/**\n * File: common.h\n * Created Time: 2022-12-20\n * Author: MolDuM (moldum@163.com)、Reanon (793584285@qq.com)\n */\n\n#ifn"
  },
  {
    "path": "codes/c/utils/common_test.c",
    "chars": 751,
    "preview": "/**\n * File: include_test.c\n * Created Time: 2023-01-10\n * Author: Reanon (793584285@qq.com)\n */\n\n#include \"common.h\"\n\nv"
  },
  {
    "path": "codes/c/utils/list_node.h",
    "chars": 1059,
    "preview": "/**\n * File: list_node.h\n * Created Time: 2023-01-09\n * Author: Reanon (793584285@qq.com)\n */\n\n#ifndef LIST_NODE_H\n#defi"
  },
  {
    "path": "codes/c/utils/print_util.h",
    "chars": 2628,
    "preview": "/**\n * File: print_util.h\n * Created Time: 2022-12-21\n * Author: MolDum (moldum@163.com), Reanon (793584285@qq.com)\n */\n"
  },
  {
    "path": "codes/c/utils/tree_node.h",
    "chars": 2271,
    "preview": "/**\n * File: tree_node.h\n * Created Time: 2023-01-09\n * Author: Reanon (793584285@qq.com)\n */\n\n#ifndef TREE_NODE_H\n#defi"
  },
  {
    "path": "codes/c/utils/uthash.h",
    "chars": 73912,
    "preview": "/*\nCopyright (c) 2003-2022, Troy D. Hanson  https://troydhanson.github.io/uthash/\nAll rights reserved.\n\nRedistribution a"
  },
  {
    "path": "codes/c/utils/vector.h",
    "chars": 5868,
    "preview": "/**\n * File: vector.h\n * Created Time: 2023-07-13\n * Author: Zuoxun (845242523@qq.com)、Gonglja (glj0@outlook.com)\n */\n\n#"
  },
  {
    "path": "codes/c/utils/vertex.h",
    "chars": 870,
    "preview": "/**\n * File: vertex.h\n * Created Time: 2023-10-28\n * Author: krahets (krahets@163.com)\n */\n\n#ifndef VERTEX_H\n#define VER"
  },
  {
    "path": "codes/cpp/.gitignore",
    "chars": 92,
    "preview": "# Ignore all\n*\n# Unignore all with extensions\n!*.*\n# Unignore all dirs\n!*/\n\n*.dSYM/\n\nbuild/\n"
  },
  {
    "path": "codes/cpp/CMakeLists.txt",
    "chars": 623,
    "preview": "cmake_minimum_required(VERSION 3.10)\nproject(hello_algo CXX)\n\nset(CMAKE_CXX_STANDARD 11)\n\ninclude_directories(./include)"
  },
  {
    "path": "codes/cpp/chapter_array_and_linkedlist/CMakeLists.txt",
    "chars": 142,
    "preview": "add_executable(array array.cpp)\nadd_executable(linked_list linked_list.cpp)\nadd_executable(list list.cpp)\nadd_executable"
  },
  {
    "path": "codes/cpp/chapter_array_and_linkedlist/array.cpp",
    "chars": 2343,
    "preview": "/**\n * File: array.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/common.h"
  },
  {
    "path": "codes/cpp/chapter_array_and_linkedlist/linked_list.cpp",
    "chars": 1799,
    "preview": "/**\n * File: linked_list.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/co"
  },
  {
    "path": "codes/cpp/chapter_array_and_linkedlist/list.cpp",
    "chars": 1463,
    "preview": "/**\n * File: list.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/common.hp"
  },
  {
    "path": "codes/cpp/chapter_array_and_linkedlist/my_list.cpp",
    "chars": 3741,
    "preview": "/**\n * File: my_list.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/common"
  },
  {
    "path": "codes/cpp/chapter_backtracking/CMakeLists.txt",
    "chars": 616,
    "preview": "add_executable(preorder_traversal_i_compact preorder_traversal_i_compact.cpp)\nadd_executable(preorder_traversal_ii_compa"
  },
  {
    "path": "codes/cpp/chapter_backtracking/n_queens.cpp",
    "chars": 1890,
    "preview": "/**\n * File: n_queens.cpp\n * Created Time: 2023-05-04\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/commo"
  },
  {
    "path": "codes/cpp/chapter_backtracking/permutations_i.cpp",
    "chars": 1286,
    "preview": "/**\n * File: permutations_i.cpp\n * Created Time: 2023-04-24\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils"
  },
  {
    "path": "codes/cpp/chapter_backtracking/permutations_ii.cpp",
    "chars": 1440,
    "preview": "/**\n * File: permutations_ii.cpp\n * Created Time: 2023-04-24\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../util"
  },
  {
    "path": "codes/cpp/chapter_backtracking/preorder_traversal_i_compact.cpp",
    "chars": 747,
    "preview": "/**\n * File: preorder_traversal_i_compact.cpp\n * Created Time: 2023-04-16\n * Author: krahets (krahets@163.com)\n */\n\n#inc"
  },
  {
    "path": "codes/cpp/chapter_backtracking/preorder_traversal_ii_compact.cpp",
    "chars": 922,
    "preview": "/**\n * File: preorder_traversal_ii_compact.cpp\n * Created Time: 2023-04-16\n * Author: krahets (krahets@163.com)\n */\n\n#in"
  },
  {
    "path": "codes/cpp/chapter_backtracking/preorder_traversal_iii_compact.cpp",
    "chars": 968,
    "preview": "/**\n * File: preorder_traversal_iii_compact.cpp\n * Created Time: 2023-04-16\n * Author: krahets (krahets@163.com)\n */\n\n#i"
  },
  {
    "path": "codes/cpp/chapter_backtracking/preorder_traversal_iii_template.cpp",
    "chars": 1927,
    "preview": "/**\n * File: preorder_traversal_iii_template.cpp\n * Created Time: 2023-04-16\n * Author: krahets (krahets@163.com)\n */\n\n#"
  },
  {
    "path": "codes/cpp/chapter_backtracking/subset_sum_i.cpp",
    "chars": 1500,
    "preview": "/**\n * File: subset_sum_i.cpp\n * Created Time: 2023-06-21\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/c"
  },
  {
    "path": "codes/cpp/chapter_backtracking/subset_sum_i_naive.cpp",
    "chars": 1381,
    "preview": "/**\n * File: subset_sum_i_naive.cpp\n * Created Time: 2023-06-21\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../u"
  },
  {
    "path": "codes/cpp/chapter_backtracking/subset_sum_ii.cpp",
    "chars": 1676,
    "preview": "/**\n * File: subset_sum_ii.cpp\n * Created Time: 2023-06-21\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/cpp/chapter_computational_complexity/CMakeLists.txt",
    "chars": 259,
    "preview": "add_executable(iteration iteration.cpp)\nadd_executable(recursion recursion.cpp)\nadd_executable(space_complexity space_co"
  },
  {
    "path": "codes/cpp/chapter_computational_complexity/iteration.cpp",
    "chars": 1418,
    "preview": "/**\n * File: iteration.cpp\n * Created Time: 2023-08-24\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/comm"
  },
  {
    "path": "codes/cpp/chapter_computational_complexity/recursion.cpp",
    "chars": 1401,
    "preview": "/**\n * File: recursion.cpp\n * Created Time: 2023-08-24\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/comm"
  },
  {
    "path": "codes/cpp/chapter_computational_complexity/space_complexity.cpp",
    "chars": 1987,
    "preview": "/**\n * File: space_complexity.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../uti"
  },
  {
    "path": "codes/cpp/chapter_computational_complexity/time_complexity.cpp",
    "chars": 3544,
    "preview": "/**\n * File: time_complexity.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../util"
  },
  {
    "path": "codes/cpp/chapter_computational_complexity/worst_best_time_complexity.cpp",
    "chars": 1118,
    "preview": "/**\n * File: worst_best_time_complexity.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#inclu"
  },
  {
    "path": "codes/cpp/chapter_divide_and_conquer/CMakeLists.txt",
    "chars": 135,
    "preview": "add_executable(binary_search_recur binary_search_recur.cpp)\nadd_executable(build_tree build_tree.cpp)\nadd_executable(han"
  },
  {
    "path": "codes/cpp/chapter_divide_and_conquer/binary_search_recur.cpp",
    "chars": 984,
    "preview": "/**\n * File: binary_search_recur.cpp\n * Created Time: 2023-07-17\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../"
  },
  {
    "path": "codes/cpp/chapter_divide_and_conquer/build_tree.cpp",
    "chars": 1287,
    "preview": "/**\n * File: build_tree.cpp\n * Created Time: 2023-07-17\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/com"
  },
  {
    "path": "codes/cpp/chapter_divide_and_conquer/hanota.cpp",
    "chars": 1328,
    "preview": "/**\n * File: hanota.cpp\n * Created Time: 2023-07-17\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/common."
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/CMakeLists.txt",
    "chars": 579,
    "preview": "add_executable(climbing_stairs_backtrack climbing_stairs_backtrack.cpp)\nadd_executable(climbing_stairs_dfs climbing_stai"
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/climbing_stairs_backtrack.cpp",
    "chars": 952,
    "preview": "\n/**\n * File: climbing_stairs_backtrack.cpp\n * Created Time: 2023-06-30\n * Author: krahets (krahets@163.com)\n */\n\n#inclu"
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/climbing_stairs_constraint_dp.cpp",
    "chars": 788,
    "preview": "/**\n * File: climbing_stairs_constraint_dp.cpp\n * Created Time: 2023-07-01\n * Author: krahets (krahets@163.com)\n */\n\n#in"
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/climbing_stairs_dfs.cpp",
    "chars": 560,
    "preview": "/**\n * File: climbing_stairs_dfs.cpp\n * Created Time: 2023-06-30\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../"
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/climbing_stairs_dfs_mem.cpp",
    "chars": 787,
    "preview": "/**\n * File: climbing_stairs_dfs_mem.cpp\n * Created Time: 2023-06-30\n * Author: krahets (krahets@163.com)\n */\n\n#include "
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/climbing_stairs_dp.cpp",
    "chars": 954,
    "preview": "/**\n * File: climbing_stairs_dp.cpp\n * Created Time: 2023-06-30\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../u"
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/coin_change.cpp",
    "chars": 1707,
    "preview": "/**\n * File: coin_change.cpp\n * Created Time: 2023-07-11\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/co"
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/coin_change_ii.cpp",
    "chars": 1591,
    "preview": "/**\n * File: coin_change_ii.cpp\n * Created Time: 2023-07-11\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils"
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/edit_distance.cpp",
    "chars": 3737,
    "preview": "/**\n * File: edit_distance.cpp\n * Created Time: 2023-07-13\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/knapsack.cpp",
    "chars": 2891,
    "preview": "#include <algorithm>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\n/* 0-1 背包：暴力搜索 */\nint knapsackDFS(vect"
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/min_cost_climbing_stairs_dp.cpp",
    "chars": 1211,
    "preview": "/**\n * File: min_cost_climbing_stairs_dp.cpp\n * Created Time: 2023-06-30\n * Author: krahets (krahets@163.com)\n */\n\n#incl"
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/min_path_sum.cpp",
    "chars": 3023,
    "preview": "/**\n * File: min_path_sum.cpp\n * Created Time: 2023-07-10\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/c"
  },
  {
    "path": "codes/cpp/chapter_dynamic_programming/unbounded_knapsack.cpp",
    "chars": 1617,
    "preview": "/**\n * File: unbounded_knapsack.cpp\n * Created Time: 2023-07-11\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../u"
  },
  {
    "path": "codes/cpp/chapter_graph/CMakeLists.txt",
    "chars": 282,
    "preview": "add_executable(graph_bfs graph_bfs.cpp)\nadd_executable(graph_dfs graph_dfs.cpp)\n# add_executable(graph_adjacency_list gr"
  },
  {
    "path": "codes/cpp/chapter_graph/graph_adjacency_list.cpp",
    "chars": 2311,
    "preview": "/**\n * File: graph_adjacency_list.cpp\n * Created Time: 2023-02-09\n * Author: what-is-me (whatisme@outlook.jp), krahets ("
  },
  {
    "path": "codes/cpp/chapter_graph/graph_adjacency_list_test.cpp",
    "chars": 1142,
    "preview": "/**\n * File: graph_adjacency_list_test.cpp\n * Created Time: 2023-02-09\n * Author: what-is-me (whatisme@outlook.jp), krah"
  },
  {
    "path": "codes/cpp/chapter_graph/graph_adjacency_matrix.cpp",
    "chars": 3057,
    "preview": "/**\n * File: graph_adjacency_matrix.cpp\n * Created Time: 2023-02-09\n * Author: what-is-me (whatisme@outlook.jp)\n */\n\n#in"
  },
  {
    "path": "codes/cpp/chapter_graph/graph_bfs.cpp",
    "chars": 1646,
    "preview": "/**\n * File: graph_bfs.cpp\n * Created Time: 2023-03-02\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/comm"
  },
  {
    "path": "codes/cpp/chapter_graph/graph_dfs.cpp",
    "chars": 1431,
    "preview": "/**\n * File: graph_dfs.cpp\n * Created Time: 2023-03-02\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/comm"
  },
  {
    "path": "codes/cpp/chapter_greedy/CMakeLists.txt",
    "chars": 163,
    "preview": "add_executable(coin_change_greedy coin_change_greedy.cpp)\nadd_executable(fractional_knapsack fractional_knapsack.cpp)\nad"
  },
  {
    "path": "codes/cpp/chapter_greedy/coin_change_greedy.cpp",
    "chars": 1472,
    "preview": "/**\n * File: coin_change_greedy.cpp\n * Created Time: 2023-07-20\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../u"
  },
  {
    "path": "codes/cpp/chapter_greedy/fractional_knapsack.cpp",
    "chars": 1283,
    "preview": "/**\n * File: fractional_knapsack.cpp\n * Created Time: 2023-07-20\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../"
  },
  {
    "path": "codes/cpp/chapter_greedy/max_capacity.cpp",
    "chars": 718,
    "preview": "/**\n * File: max_capacity.cpp\n * Created Time: 2023-07-21\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/c"
  },
  {
    "path": "codes/cpp/chapter_greedy/max_product_cutting.cpp",
    "chars": 730,
    "preview": "/**\n * File: max_product_cutting.cpp\n * Created Time: 2023-07-21\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../"
  },
  {
    "path": "codes/cpp/chapter_hashing/CMakeLists.txt",
    "chars": 315,
    "preview": "add_executable(hash_map hash_map.cpp)\nadd_executable(array_hash_map_test array_hash_map_test.cpp)\nadd_executable(hash_ma"
  },
  {
    "path": "codes/cpp/chapter_hashing/array_hash_map.cpp",
    "chars": 2201,
    "preview": "/**\n * File: array_hash_map.cpp\n * Created Time: 2022-12-14\n * Author: msk397 (machangxinq@gmail.com)\n */\n\n#include \"../"
  },
  {
    "path": "codes/cpp/chapter_hashing/array_hash_map_test.cpp",
    "chars": 1141,
    "preview": "/**\n * File: array_hash_map_test.cpp\n * Created Time: 2022-12-14\n * Author: msk397 (machangxinq@gmail.com)\n */\n\n#include"
  },
  {
    "path": "codes/cpp/chapter_hashing/built_in_hash.cpp",
    "chars": 730,
    "preview": "/**\n * File: built_in_hash.cpp\n * Created Time: 2023-06-21\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/cpp/chapter_hashing/hash_map.cpp",
    "chars": 1067,
    "preview": "/**\n * File: hash_map.cpp\n * Created Time: 2022-12-14\n * Author: msk397 (machangxinq@gmail.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/cpp/chapter_hashing/hash_map_chaining.cpp",
    "chars": 3583,
    "preview": "/**\n * File: hash_map_chaining.cpp\n * Created Time: 2023-06-13\n * Author: krahets (krahets@163.com)\n */\n\n#include \"./arr"
  },
  {
    "path": "codes/cpp/chapter_hashing/hash_map_open_addressing.cpp",
    "chars": 4486,
    "preview": "/**\n * File: hash_map_open_addressing.cpp\n * Created Time: 2023-06-13\n * Author: krahets (krahets@163.com)\n */\n\n#include"
  },
  {
    "path": "codes/cpp/chapter_hashing/simple_hash.cpp",
    "chars": 1296,
    "preview": "/**\n * File: simple_hash.cpp\n * Created Time: 2023-06-21\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/co"
  },
  {
    "path": "codes/cpp/chapter_heap/CMakeLists.txt",
    "chars": 98,
    "preview": "add_executable(heap heap.cpp)\nadd_executable(my_heap my_heap.cpp)\nadd_executable(top_k top_k.cpp)\n"
  },
  {
    "path": "codes/cpp/chapter_heap/heap.cpp",
    "chars": 1466,
    "preview": "/**\n * File: heap.cpp\n * Created Time: 2023-01-19\n * Author: LoneRanger(836253168@qq.com)\n */\n\n#include \"../utils/common"
  },
  {
    "path": "codes/cpp/chapter_heap/my_heap.cpp",
    "chars": 3248,
    "preview": "/**\n * File: my_heap.cpp\n * Created Time: 2023-02-04\n * Author: LoneRanger (836253168@qq.com), what-is-me (whatisme@outl"
  },
  {
    "path": "codes/cpp/chapter_heap/top_k.cpp",
    "chars": 869,
    "preview": "/**\n * File: top_k.cpp\n * Created Time: 2023-06-12\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/common.h"
  },
  {
    "path": "codes/cpp/chapter_searching/CMakeLists.txt",
    "chars": 210,
    "preview": "add_executable(binary_search binary_search.cpp)\nadd_executable(binary_search_insertion binary_search_insertion.cpp)\nadd_"
  },
  {
    "path": "codes/cpp/chapter_searching/binary_search.cpp",
    "chars": 1527,
    "preview": "/**\n * File: binary_search.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/cpp/chapter_searching/binary_search_edge.cpp",
    "chars": 1673,
    "preview": "/**\n * File: binary_search_edge.cpp\n * Created Time: 2023-08-04\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../u"
  },
  {
    "path": "codes/cpp/chapter_searching/binary_search_insertion.cpp",
    "chars": 1783,
    "preview": "/**\n * File: binary_search_insertion.cpp\n * Created Time: 2023-08-04\n * Author: krahets (krahets@163.com)\n */\n\n#include "
  },
  {
    "path": "codes/cpp/chapter_searching/hashing_search.cpp",
    "chars": 1341,
    "preview": "/**\n * File: hashing_search.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils"
  },
  {
    "path": "codes/cpp/chapter_searching/linear_search.cpp",
    "chars": 1078,
    "preview": "/**\n * File: linear_search.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/cpp/chapter_searching/two_sum.cpp",
    "chars": 1235,
    "preview": "/**\n * File: two_sum.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/common"
  },
  {
    "path": "codes/cpp/chapter_sorting/CMakeLists.txt",
    "chars": 267,
    "preview": "add_executable(selection_sort selection_sort.cpp)\nadd_executable(bubble_sort bubble_sort.cpp)\nadd_executable(insertion_s"
  },
  {
    "path": "codes/cpp/chapter_sorting/bubble_sort.cpp",
    "chars": 1393,
    "preview": "/**\n * File: bubble_sort.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/co"
  },
  {
    "path": "codes/cpp/chapter_sorting/bucket_sort.cpp",
    "chars": 1043,
    "preview": "/**\n * File: bucket_sort.cpp\n * Created Time: 2023-03-30\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/co"
  },
  {
    "path": "codes/cpp/chapter_sorting/counting_sort.cpp",
    "chars": 1800,
    "preview": "/**\n * File: counting_sort.cpp\n * Created Time: 2023-03-17\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/"
  },
  {
    "path": "codes/cpp/chapter_sorting/heap_sort.cpp",
    "chars": 1192,
    "preview": "/**\n * File: heap_sort.cpp\n * Created Time: 2023-05-26\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/comm"
  },
  {
    "path": "codes/cpp/chapter_sorting/insertion_sort.cpp",
    "chars": 692,
    "preview": "/**\n * File: insertion_sort.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils"
  },
  {
    "path": "codes/cpp/chapter_sorting/merge_sort.cpp",
    "chars": 1415,
    "preview": "/**\n * File: merge_sort.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/com"
  },
  {
    "path": "codes/cpp/chapter_sorting/quick_sort.cpp",
    "chars": 4417,
    "preview": "/**\n * File: quick_sort.cpp\n * Created Time: 2022-11-25\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/com"
  },
  {
    "path": "codes/cpp/chapter_sorting/radix_sort.cpp",
    "chars": 1725,
    "preview": "/**\n * File: radix_sort.cpp\n * Created Time: 2023-03-26\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils/com"
  },
  {
    "path": "codes/cpp/chapter_sorting/selection_sort.cpp",
    "chars": 689,
    "preview": "/**\n * File: selection_sort.cpp\n * Created Time: 2023-05-23\n * Author: krahets (krahets@163.com)\n */\n\n#include \"../utils"
  },
  {
    "path": "codes/cpp/chapter_stack_and_queue/CMakeLists.txt",
    "chars": 390,
    "preview": "add_executable(array_deque array_deque.cpp)\nadd_executable(array_queue array_queue.cpp)\nadd_executable(array_stack array"
  }
]

// ... and 6925 more files (download for full content)