| react-profiling | 0 |
| react-import-map | react,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322 |
| route-pattern | /:user_id/:repository/tree/*name(/*path) |
| route-controller | files |
| route-action | disambiguate |
| fetch-nonce | v2:fa380441-c14e-9908-679a-f87b885db9b5 |
| current-catalog-service-hash | f3abb0cc802f3d7b95fc8762b94bdcb13bf39634c40c357301c4aa1d67a256fb |
| request-id | B25E:17DA8A:102B0E:170232:6AFC4768 |
| html-safe-nonce | 121fa14105e682e45f3cf8f09802c43f53ec6cc1af792ed552eafd22d09c3dec |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJCMjVFOjE3REE4QToxMDJCMEU6MTcwMjMyOjZBRkM0NzY4IiwidmlzaXRvcl9pZCI6IjUwODEwNDYwNTA2OTM0NjU5NjAiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | 8895394e94613ae32720a2b53042811dfb6c29b4caef9899d38208a04bee50e2 |
| hovercard-subject-tag | repository:508171962 |
| github-keyboard-shortcuts | repository,source-code,file-tree,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | ///files/disambiguate |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/github-interview/LeetCode-Book/tree/main/java |
| twitter:image | https://opengraph.githubassets.com/4687606654c7575a72f7e47e4c5a521a7eab230d6ea40455b9e5c073c1e1d750/github-interview/LeetCode-Book |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/4687606654c7575a72f7e47e4c5a521a7eab230d6ea40455b9e5c073c1e1d750/github-interview/LeetCode-Book |
| og:image:alt | 《剑指 Offer》 Python, Java, C++ 解题代码,LeetBook《图解算法数据结构》配套代码仓。 - github-interview/LeetCode-Book |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| hostname | github.com |
| expected-hostname | github.com |
| None | 20dfdada12bc00bbf8065dc10dfe3ff3711b85db5cc117f83296f8074e861960 |
| turbo-cache-control | no-cache |
| go-import | github.com/github-interview/LeetCode-Book git https://github.com/github-interview/LeetCode-Book.git |
| octolytics-dimension-user_id | 46712575 |
| octolytics-dimension-user_login | github-interview |
| octolytics-dimension-repository_id | 508171962 |
| octolytics-dimension-repository_nwo | github-interview/LeetCode-Book |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | true |
| octolytics-dimension-repository_parent_id | 439355916 |
| octolytics-dimension-repository_parent_nwo | krahets/LeetCode-Book |
| octolytics-dimension-repository_network_root_id | 439355916 |
| octolytics-dimension-repository_network_root_nwo | krahets/LeetCode-Book |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 041909865f220ab51714e7efdc276dd349a99ade |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
| Skip to content | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java#start-of-content |
| https://redirect.github.com/ |
| Sign in | https://redirect.github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fgithub-interview%2FLeetCode-Book%2Ftree%2Fmain%2Fjava |
| GitHubRepository hosting, code review, and collaboration | https://github.com/platform |
| CopilotAI coding agent for tasks, projects, and automated work | https://github.com/features/copilot |
| ActionsCI/CD and automation | https://github.com/features/actions |
| Code QualityQuality analysis, fixes, and enforcement | https://github.com/features/code-quality |
| CodespacesCloud development environments | https://github.com/features/codespaces |
| Code SecurityVulnerability detection and remediation | https://github.com/security/advanced-security/code-security |
| Secret ProtectionSecret scanning and leak prevention | https://github.com/security/advanced-security/secret-protection |
| All Features | https://github.com/features |
| Documentation | https://docs.github.com/en |
| Training | https://learn.github.com/skills |
| Certifications | https://learn.github.com/credentials |
| Build with Copilot | https://github.com/features/ai |
| Customize Copilot | https://docs.github.com/en/copilot/how-tos/copilot-on-github/customize-copilot/customize-copilot-overview |
| Integrations | https://github.com/marketplace |
| Trending repos | https://github.com/trending |
| GitHub Sponsors | https://github.com/open-source/sponsors |
| Developer articles | https://github.com/resources/articles |
| ChangelogYour source for the latest features, improvements, and fixes across GitHub products, all in one place. | https://github.blog/changelog/ |
| Enterprises | https://github.com/enterprise |
| Team | https://github.com/team |
| Startups | https://github.com/enterprise/startups |
| Nonprofits | https://github.com/solutions/industry/nonprofits |
| Healthcare | https://github.com/solutions/industry/healthcare |
| Financial services | https://github.com/solutions/industry/financial-services |
| Manufacturing | https://github.com/solutions/industry/manufacturing |
| Government | https://github.com/solutions/industry/government |
| See all industries | https://github.com/solutions/industry |
| Why GitHub | https://github.com/why-github |
| Customer Stories | https://github.com/customer-stories |
| Business insights | https://github.com/solutions/executive-insights |
| Trust Center | https://github.com/trust-center |
| GitHub Advanced SecurityEnterprise-grade code security | https://github.com/security/advanced-security |
| Copilot for businessEnterprise-grade AI features | https://github.com/features/copilot/copilot-business |
| Premium SupportEnterprise-grade 24/7 support | https://github.com/enterprise/premium-support |
| Documentation | https://docs.github.com/en |
| Resource center | https://github.com/resources |
| Blog | https://github.blog/ |
| Events & webinars | https://github.com/resources/events |
| Community Forum | https://github.com/orgs/community/discussions |
| Customer Stories | https://github.com/customer-stories |
| Integrations | https://github.com/marketplace |
| Customer support | https://help.github.com/ |
| Training | https://learn.github.com/skills |
| GitHub Status | https://www.githubstatus.com/ |
| About | https://github.com/about |
| Partners | https://github.com/partners |
| Changelog | https://github.blog/changelog/ |
| GitHub UniverseThe event for developers, by developers — talks, workshops, and what’s next for GitHub. | https://githubuniverse.com/ |
| Pricing | https://github.com/pricing |
| Sign in | https://redirect.github.com/login?return_to=https%3A%2F%2Fgithub.com%2Fgithub-interview%2FLeetCode-Book%2Ftree%2Fmain%2Fjava |
| Sign up | https://redirect.github.com/signup?ref_cta=Sign+up&ref_loc=header+logged+out&ref_page=%2F%3Cuser-name%3E%2F%3Crepo-name%3E%2Ffiles%2Fdisambiguate&source=header-repo&source_repo=github-interview%2FLeetCode-Book |
| Reload | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java |
| Reload | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java |
| Reload | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java |
| github-interview | https://redirect.github.com/github-interview |
| LeetCode-Book | https://redirect.github.com/github-interview/LeetCode-Book |
| Code | https://redirect.github.com/github-interview/LeetCode-Book |
| Pull requests | https://redirect.github.com/github-interview/LeetCode-Book/pulls |
| Actions | https://redirect.github.com/github-interview/LeetCode-Book/actions |
| Projects | https://redirect.github.com/github-interview/LeetCode-Book/projects |
| Security and quality | https://redirect.github.com/github-interview/LeetCode-Book/security |
| Insights | https://redirect.github.com/github-interview/LeetCode-Book/pulse |
| https://redirect.github.com/github-interview/LeetCode-Book |
| LeetCode-Book | https://redirect.github.com/github-interview/LeetCode-Book/tree/main |
| History | https://redirect.github.com/github-interview/LeetCode-Book/commits/main/java |
| https://redirect.github.com/github-interview/LeetCode-Book/commits/main/java |
| LeetCode-Book | https://redirect.github.com/github-interview/LeetCode-Book/tree/main |
| .. | https://redirect.github.com/github-interview/LeetCode-Book/tree/main |
| include | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/include |
| include | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/include |
| sfo_03_find_duplicate_numbers_in_an_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_03_find_duplicate_numbers_in_an_array_s1 |
| sfo_03_find_duplicate_numbers_in_an_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_03_find_duplicate_numbers_in_an_array_s1 |
| sfo_03_find_duplicate_numbers_in_an_array_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_03_find_duplicate_numbers_in_an_array_s2 |
| sfo_03_find_duplicate_numbers_in_an_array_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_03_find_duplicate_numbers_in_an_array_s2 |
| sfo_04_find_a_number_in_2d_matrix_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_04_find_a_number_in_2d_matrix_s1 |
| sfo_04_find_a_number_in_2d_matrix_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_04_find_a_number_in_2d_matrix_s1 |
| sfo_05_replace_spaces_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_05_replace_spaces_s1 |
| sfo_05_replace_spaces_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_05_replace_spaces_s1 |
| sfo_06_print_a_linked_list_in_reverse_order_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_06_print_a_linked_list_in_reverse_order_s1 |
| sfo_06_print_a_linked_list_in_reverse_order_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_06_print_a_linked_list_in_reverse_order_s1 |
| sfo_06_print_a_linked_list_in_reverse_order_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_06_print_a_linked_list_in_reverse_order_s2 |
| sfo_06_print_a_linked_list_in_reverse_order_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_06_print_a_linked_list_in_reverse_order_s2 |
| sfo_07_reconstruct_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_07_reconstruct_binary_tree_s1 |
| sfo_07_reconstruct_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_07_reconstruct_binary_tree_s1 |
| sfo_09_implement_a_queue_using_two_stacks_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_09_implement_a_queue_using_two_stacks_s1 |
| sfo_09_implement_a_queue_using_two_stacks_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_09_implement_a_queue_using_two_stacks_s1 |
| sfo_10i_fibonacci_numbers_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_10i_fibonacci_numbers_s1 |
| sfo_10i_fibonacci_numbers_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_10i_fibonacci_numbers_s1 |
| sfo_10ii_frog_jump_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_10ii_frog_jump_s1 |
| sfo_10ii_frog_jump_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_10ii_frog_jump_s1 |
| sfo_11_find_minimum_in_rotated_sorted_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_11_find_minimum_in_rotated_sorted_array_s1 |
| sfo_11_find_minimum_in_rotated_sorted_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_11_find_minimum_in_rotated_sorted_array_s1 |
| sfo_11_find_minimum_in_rotated_sorted_array_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_11_find_minimum_in_rotated_sorted_array_s2 |
| sfo_11_find_minimum_in_rotated_sorted_array_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_11_find_minimum_in_rotated_sorted_array_s2 |
| sfo_12_word_search_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_12_word_search_s1 |
| sfo_12_word_search_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_12_word_search_s1 |
| sfo_13_range_of_motion_of_a_robot_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_13_range_of_motion_of_a_robot_s1 |
| sfo_13_range_of_motion_of_a_robot_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_13_range_of_motion_of_a_robot_s1 |
| sfo_13_range_of_motion_of_a_robot_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_13_range_of_motion_of_a_robot_s2 |
| sfo_13_range_of_motion_of_a_robot_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_13_range_of_motion_of_a_robot_s2 |
| sfo_14i_cut_the_rope_i_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_14i_cut_the_rope_i_s1 |
| sfo_14i_cut_the_rope_i_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_14i_cut_the_rope_i_s1 |
| sfo_14ii_cut_the_rope_ii_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_14ii_cut_the_rope_ii_s1 |
| sfo_14ii_cut_the_rope_ii_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_14ii_cut_the_rope_ii_s1 |
| sfo_15_number_of_1_bits_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_15_number_of_1_bits_s1 |
| sfo_15_number_of_1_bits_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_15_number_of_1_bits_s1 |
| sfo_15_number_of_1_bits_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_15_number_of_1_bits_s2 |
| sfo_15_number_of_1_bits_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_15_number_of_1_bits_s2 |
| sfo_16_powers_of_integers_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_16_powers_of_integers_s1 |
| sfo_16_powers_of_integers_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_16_powers_of_integers_s1 |
| sfo_17_print_from_1_to_the_largest_n_digits_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_17_print_from_1_to_the_largest_n_digits_s1 |
| sfo_17_print_from_1_to_the_largest_n_digits_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_17_print_from_1_to_the_largest_n_digits_s1 |
| sfo_17_print_from_1_to_the_largest_n_digits_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_17_print_from_1_to_the_largest_n_digits_s2 |
| sfo_17_print_from_1_to_the_largest_n_digits_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_17_print_from_1_to_the_largest_n_digits_s2 |
| sfo_17_print_from_1_to_the_largest_n_digits_s3 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_17_print_from_1_to_the_largest_n_digits_s3 |
| sfo_17_print_from_1_to_the_largest_n_digits_s3 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_17_print_from_1_to_the_largest_n_digits_s3 |
| sfo_17_print_from_1_to_the_largest_n_digits_s4 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_17_print_from_1_to_the_largest_n_digits_s4 |
| sfo_17_print_from_1_to_the_largest_n_digits_s4 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_17_print_from_1_to_the_largest_n_digits_s4 |
| sfo_18_delete_a_node_from_a_linked_list_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_18_delete_a_node_from_a_linked_list_s1 |
| sfo_18_delete_a_node_from_a_linked_list_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_18_delete_a_node_from_a_linked_list_s1 |
| sfo_19_regular_expression_matching_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_19_regular_expression_matching_s1 |
| sfo_19_regular_expression_matching_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_19_regular_expression_matching_s1 |
| sfo_19_regular_expression_matching_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_19_regular_expression_matching_s2 |
| sfo_19_regular_expression_matching_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_19_regular_expression_matching_s2 |
| sfo_20_a_string_representing_a_numeric_value_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_20_a_string_representing_a_numeric_value_s1 |
| sfo_20_a_string_representing_a_numeric_value_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_20_a_string_representing_a_numeric_value_s1 |
| sfo_21_adjust_the_order_of_numbers_in_an_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_21_adjust_the_order_of_numbers_in_an_array_s1 |
| sfo_21_adjust_the_order_of_numbers_in_an_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_21_adjust_the_order_of_numbers_in_an_array_s1 |
| sfo_22_the_kth_node_from_the_end_of_a_linked_list_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_22_the_kth_node_from_the_end_of_a_linked_list_s1 |
| sfo_22_the_kth_node_from_the_end_of_a_linked_list_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_22_the_kth_node_from_the_end_of_a_linked_list_s1 |
| sfo_22_the_kth_node_from_the_end_of_a_linked_list_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_22_the_kth_node_from_the_end_of_a_linked_list_s2 |
| sfo_22_the_kth_node_from_the_end_of_a_linked_list_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_22_the_kth_node_from_the_end_of_a_linked_list_s2 |
| sfo_24_reverse_a_linked_list_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_24_reverse_a_linked_list_s1 |
| sfo_24_reverse_a_linked_list_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_24_reverse_a_linked_list_s1 |
| sfo_24_reverse_a_linked_list_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_24_reverse_a_linked_list_s2 |
| sfo_24_reverse_a_linked_list_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_24_reverse_a_linked_list_s2 |
| sfo_25_combine_two_sorted_linked_lists_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_25_combine_two_sorted_linked_lists_s1 |
| sfo_25_combine_two_sorted_linked_lists_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_25_combine_two_sorted_linked_lists_s1 |
| sfo_26_substructure_of_a_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_26_substructure_of_a_binary_tree_s1 |
| sfo_26_substructure_of_a_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_26_substructure_of_a_binary_tree_s1 |
| sfo_27_mirror_of_a_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_27_mirror_of_a_binary_tree_s1 |
| sfo_27_mirror_of_a_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_27_mirror_of_a_binary_tree_s1 |
| sfo_27_mirror_of_a_binary_tree_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_27_mirror_of_a_binary_tree_s2 |
| sfo_27_mirror_of_a_binary_tree_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_27_mirror_of_a_binary_tree_s2 |
| sfo_28_symmetric_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_28_symmetric_binary_tree_s1 |
| sfo_28_symmetric_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_28_symmetric_binary_tree_s1 |
| sfo_29_print_a_given_matrix_in_spiral_form_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_29_print_a_given_matrix_in_spiral_form_s1 |
| sfo_29_print_a_given_matrix_in_spiral_form_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_29_print_a_given_matrix_in_spiral_form_s1 |
| sfo_30_min_stack_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_30_min_stack_s1 |
| sfo_30_min_stack_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_30_min_stack_s1 |
| sfo_31_validate_stack_sequences_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_31_validate_stack_sequences_s1 |
| sfo_31_validate_stack_sequences_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_31_validate_stack_sequences_s1 |
| sfo_32i_print_a_binary_tree_topbottom_i_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_32i_print_a_binary_tree_topbottom_i_s1 |
| sfo_32i_print_a_binary_tree_topbottom_i_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_32i_print_a_binary_tree_topbottom_i_s1 |
| sfo_32ii_print_a_binary_tree_topbottom_ii_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_32ii_print_a_binary_tree_topbottom_ii_s1 |
| sfo_32ii_print_a_binary_tree_topbottom_ii_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_32ii_print_a_binary_tree_topbottom_ii_s1 |
| sfo_32iii_print_a_binary_tree_topbottom_iii_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_32iii_print_a_binary_tree_topbottom_iii_s1 |
| sfo_32iii_print_a_binary_tree_topbottom_iii_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_32iii_print_a_binary_tree_topbottom_iii_s1 |
| sfo_32iii_print_a_binary_tree_topbottom_iii_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_32iii_print_a_binary_tree_topbottom_iii_s2 |
| sfo_32iii_print_a_binary_tree_topbottom_iii_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_32iii_print_a_binary_tree_topbottom_iii_s2 |
| sfo_32iii_print_a_binary_tree_topbottom_iii_s3 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_32iii_print_a_binary_tree_topbottom_iii_s3 |
| sfo_32iii_print_a_binary_tree_topbottom_iii_s3 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_32iii_print_a_binary_tree_topbottom_iii_s3 |
| sfo_33_postorder_traversal_of_a_binary_search_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_33_postorder_traversal_of_a_binary_search_tree_s1 |
| sfo_33_postorder_traversal_of_a_binary_search_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_33_postorder_traversal_of_a_binary_search_tree_s1 |
| sfo_33_postorder_traversal_of_a_binary_search_tree_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_33_postorder_traversal_of_a_binary_search_tree_s2 |
| sfo_33_postorder_traversal_of_a_binary_search_tree_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_33_postorder_traversal_of_a_binary_search_tree_s2 |
| sfo_34_all_xsum_paths_in_a_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_34_all_xsum_paths_in_a_binary_tree_s1 |
| sfo_34_all_xsum_paths_in_a_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_34_all_xsum_paths_in_a_binary_tree_s1 |
| sfo_35_clone_a_linked_list_with_next_and_random_pointer_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_35_clone_a_linked_list_with_next_and_random_pointer_s1 |
| sfo_35_clone_a_linked_list_with_next_and_random_pointer_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_35_clone_a_linked_list_with_next_and_random_pointer_s1 |
| sfo_35_clone_a_linked_list_with_next_and_random_pointer_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_35_clone_a_linked_list_with_next_and_random_pointer_s2 |
| sfo_35_clone_a_linked_list_with_next_and_random_pointer_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_35_clone_a_linked_list_with_next_and_random_pointer_s2 |
| sfo_36_binary_search_tree_and_doubly_linked_list_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_36_binary_search_tree_and_doubly_linked_list_s1 |
| sfo_36_binary_search_tree_and_doubly_linked_list_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_36_binary_search_tree_and_doubly_linked_list_s1 |
| sfo_37_serialize_and_deserialize_a_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_37_serialize_and_deserialize_a_binary_tree_s1 |
| sfo_37_serialize_and_deserialize_a_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_37_serialize_and_deserialize_a_binary_tree_s1 |
| sfo_38_all_permutations_of_a_string_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_38_all_permutations_of_a_string_s1 |
| sfo_38_all_permutations_of_a_string_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_38_all_permutations_of_a_string_s1 |
| sfo_39_the_majority_element_in_an_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_39_the_majority_element_in_an_array_s1 |
| sfo_39_the_majority_element_in_an_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_39_the_majority_element_in_an_array_s1 |
| sfo_39_the_majority_element_in_an_array_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_39_the_majority_element_in_an_array_s2 |
| sfo_39_the_majority_element_in_an_array_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_39_the_majority_element_in_an_array_s2 |
| sfo_40_the_smallest_k_numbers_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_40_the_smallest_k_numbers_s1 |
| sfo_40_the_smallest_k_numbers_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_40_the_smallest_k_numbers_s1 |
| sfo_40_the_smallest_k_numbers_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_40_the_smallest_k_numbers_s2 |
| sfo_40_the_smallest_k_numbers_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_40_the_smallest_k_numbers_s2 |
| sfo_41_find_median_from_data_stream_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_41_find_median_from_data_stream_s1 |
| sfo_41_find_median_from_data_stream_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_41_find_median_from_data_stream_s1 |
| sfo_42_largest_sum_contiguous_subarray_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_42_largest_sum_contiguous_subarray_s1 |
| sfo_42_largest_sum_contiguous_subarray_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_42_largest_sum_contiguous_subarray_s1 |
| sfo_43_total_number_of_1_in_integers_from_1_to_n_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_43_total_number_of_1_in_integers_from_1_to_n_s1 |
| sfo_43_total_number_of_1_in_integers_from_1_to_n_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_43_total_number_of_1_in_integers_from_1_to_n_s1 |
| sfo_44_nth_digit_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_44_nth_digit_s1 |
| sfo_44_nth_digit_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_44_nth_digit_s1 |
| sfo_45_arrange_an_array_into_the_smallest_number_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_45_arrange_an_array_into_the_smallest_number_s1 |
| sfo_45_arrange_an_array_into_the_smallest_number_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_45_arrange_an_array_into_the_smallest_number_s1 |
| sfo_45_arrange_an_array_into_the_smallest_number_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_45_arrange_an_array_into_the_smallest_number_s2 |
| sfo_45_arrange_an_array_into_the_smallest_number_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_45_arrange_an_array_into_the_smallest_number_s2 |
| sfo_46_translate_numbers_into_strings_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_46_translate_numbers_into_strings_s1 |
| sfo_46_translate_numbers_into_strings_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_46_translate_numbers_into_strings_s1 |
| sfo_46_translate_numbers_into_strings_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_46_translate_numbers_into_strings_s2 |
| sfo_46_translate_numbers_into_strings_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_46_translate_numbers_into_strings_s2 |
| sfo_46_translate_numbers_into_strings_s3 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_46_translate_numbers_into_strings_s3 |
| sfo_46_translate_numbers_into_strings_s3 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_46_translate_numbers_into_strings_s3 |
| sfo_47_the_maximum_value_of_gifts_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_47_the_maximum_value_of_gifts_s1 |
| sfo_47_the_maximum_value_of_gifts_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_47_the_maximum_value_of_gifts_s1 |
| sfo_47_the_maximum_value_of_gifts_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_47_the_maximum_value_of_gifts_s2 |
| sfo_47_the_maximum_value_of_gifts_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_47_the_maximum_value_of_gifts_s2 |
| sfo_48_the_longest_substring_without_repeated_characters_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_48_the_longest_substring_without_repeated_characters_s1 |
| sfo_48_the_longest_substring_without_repeated_characters_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_48_the_longest_substring_without_repeated_characters_s1 |
| sfo_48_the_longest_substring_without_repeated_characters_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_48_the_longest_substring_without_repeated_characters_s2 |
| sfo_48_the_longest_substring_without_repeated_characters_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_48_the_longest_substring_without_repeated_characters_s2 |
| sfo_48_the_longest_substring_without_repeated_characters_s3 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_48_the_longest_substring_without_repeated_characters_s3 |
| sfo_48_the_longest_substring_without_repeated_characters_s3 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_48_the_longest_substring_without_repeated_characters_s3 |
| sfo_49_ugly_numbers_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_49_ugly_numbers_s1 |
| sfo_49_ugly_numbers_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_49_ugly_numbers_s1 |
| sfo_50_find_the_first_nonrepeating_character_in_a_string_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_50_find_the_first_nonrepeating_character_in_a_string_s1 |
| sfo_50_find_the_first_nonrepeating_character_in_a_string_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_50_find_the_first_nonrepeating_character_in_a_string_s1 |
| sfo_50_find_the_first_nonrepeating_character_in_a_string_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_50_find_the_first_nonrepeating_character_in_a_string_s2 |
| sfo_50_find_the_first_nonrepeating_character_in_a_string_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_50_find_the_first_nonrepeating_character_in_a_string_s2 |
| sfo_51_reversed_pairs_in_an_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_51_reversed_pairs_in_an_array_s1 |
| sfo_51_reversed_pairs_in_an_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_51_reversed_pairs_in_an_array_s1 |
| sfo_52_the_first_common_node_in_two_linked_lists_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_52_the_first_common_node_in_two_linked_lists_s1 |
| sfo_52_the_first_common_node_in_two_linked_lists_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_52_the_first_common_node_in_two_linked_lists_s1 |
| sfo_53i_find_a_number_in_a_sorted_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_53i_find_a_number_in_a_sorted_array_s1 |
| sfo_53i_find_a_number_in_a_sorted_array_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_53i_find_a_number_in_a_sorted_array_s1 |
| sfo_53i_find_a_number_in_a_sorted_array_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_53i_find_a_number_in_a_sorted_array_s2 |
| sfo_53i_find_a_number_in_a_sorted_array_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_53i_find_a_number_in_a_sorted_array_s2 |
| sfo_53ii_the_missing_number_from_0_to_n1_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_53ii_the_missing_number_from_0_to_n1_s1 |
| sfo_53ii_the_missing_number_from_0_to_n1_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_53ii_the_missing_number_from_0_to_n1_s1 |
| sfo_54_the_kth_largest_node_of_a_binary_search_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_54_the_kth_largest_node_of_a_binary_search_tree_s1 |
| sfo_54_the_kth_largest_node_of_a_binary_search_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_54_the_kth_largest_node_of_a_binary_search_tree_s1 |
| sfo_55i_depth_of_a_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_55i_depth_of_a_binary_tree_s1 |
| sfo_55i_depth_of_a_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_55i_depth_of_a_binary_tree_s1 |
| sfo_55i_depth_of_a_binary_tree_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_55i_depth_of_a_binary_tree_s2 |
| sfo_55i_depth_of_a_binary_tree_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_55i_depth_of_a_binary_tree_s2 |
| sfo_55ii_balanced_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_55ii_balanced_binary_tree_s1 |
| sfo_55ii_balanced_binary_tree_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_55ii_balanced_binary_tree_s1 |
| sfo_55ii_balanced_binary_tree_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_55ii_balanced_binary_tree_s2 |
| sfo_55ii_balanced_binary_tree_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_55ii_balanced_binary_tree_s2 |
| sfo_56i_single_number_i_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_56i_single_number_i_s1 |
| sfo_56i_single_number_i_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_56i_single_number_i_s1 |
| sfo_56ii_single_number_ii_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_56ii_single_number_ii_s1 |
| sfo_56ii_single_number_ii_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_56ii_single_number_ii_s1 |
| sfo_56ii_single_number_ii_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_56ii_single_number_ii_s2 |
| sfo_56ii_single_number_ii_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_56ii_single_number_ii_s2 |
| sfo_57_two_numbers_with_sum_s_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_57_two_numbers_with_sum_s_s1 |
| sfo_57_two_numbers_with_sum_s_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_57_two_numbers_with_sum_s_s1 |
| sfo_57ii_consecutive_numbers_with_sum_s_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_57ii_consecutive_numbers_with_sum_s_s1 |
| sfo_57ii_consecutive_numbers_with_sum_s_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_57ii_consecutive_numbers_with_sum_s_s1 |
| sfo_57ii_consecutive_numbers_with_sum_s_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_57ii_consecutive_numbers_with_sum_s_s2 |
| sfo_57ii_consecutive_numbers_with_sum_s_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_57ii_consecutive_numbers_with_sum_s_s2 |
| sfo_58i_reverse_order_of_words_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58i_reverse_order_of_words_s1 |
| sfo_58i_reverse_order_of_words_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58i_reverse_order_of_words_s1 |
| sfo_58i_reverse_order_of_words_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58i_reverse_order_of_words_s2 |
| sfo_58i_reverse_order_of_words_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58i_reverse_order_of_words_s2 |
| sfo_58ii_left_rotation_of_a_string_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58ii_left_rotation_of_a_string_s1 |
| sfo_58ii_left_rotation_of_a_string_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58ii_left_rotation_of_a_string_s1 |
| sfo_58ii_left_rotation_of_a_string_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58ii_left_rotation_of_a_string_s2 |
| sfo_58ii_left_rotation_of_a_string_s2 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58ii_left_rotation_of_a_string_s2 |
| sfo_58ii_left_rotation_of_a_string_s3 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58ii_left_rotation_of_a_string_s3 |
| sfo_58ii_left_rotation_of_a_string_s3 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58ii_left_rotation_of_a_string_s3 |
| sfo_58ii_left_rotation_of_a_string_s4 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58ii_left_rotation_of_a_string_s4 |
| sfo_58ii_left_rotation_of_a_string_s4 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58ii_left_rotation_of_a_string_s4 |
| sfo_58ii_left_rotation_of_a_string_s5 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58ii_left_rotation_of_a_string_s5 |
| sfo_58ii_left_rotation_of_a_string_s5 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_58ii_left_rotation_of_a_string_s5 |
| sfo_59i_sliding_window_maximum_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_59i_sliding_window_maximum_s1 |
| sfo_59i_sliding_window_maximum_s1 | https://redirect.github.com/github-interview/LeetCode-Book/tree/main/java/sfo_59i_sliding_window_maximum_s1 |
|
| https://github.com |
| Terms | https://docs.github.com/site-policy/github-terms/github-terms-of-service |
| Privacy | https://docs.github.com/site-policy/privacy-policies/github-privacy-statement |
| Security | https://github.com/security |
| Status | https://www.githubstatus.com/ |
| Community | https://github.community/ |
| Docs | https://docs.github.com/ |
| Contact | https://support.github.com?tags=dotcom-footer |