{"id":21838903,"url":"https://github.com/thatbeautifuldream/leetcode-sync","last_synced_at":"2025-03-21T15:19:57.705Z","repository":{"id":107833486,"uuid":"536843327","full_name":"thatbeautifuldream/leetcode-sync","owner":"thatbeautifuldream","description":"Leetcode Sync","archived":false,"fork":false,"pushed_at":"2022-09-15T03:41:24.000Z","size":48,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-26T10:41:37.069Z","etag":null,"topics":["leetcode","leetcode-problems","leetcode-solutions"],"latest_commit_sha":null,"homepage":"https://milind.live/leetcode-sync","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/thatbeautifuldream.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-09-15T03:01:32.000Z","updated_at":"2023-03-17T13:15:43.000Z","dependencies_parsed_at":null,"dependency_job_id":"3afb0cf7-ff48-468e-8cfb-8304b1151f88","html_url":"https://github.com/thatbeautifuldream/leetcode-sync","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thatbeautifuldream%2Fleetcode-sync","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thatbeautifuldream%2Fleetcode-sync/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thatbeautifuldream%2Fleetcode-sync/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thatbeautifuldream%2Fleetcode-sync/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/thatbeautifuldream","download_url":"https://codeload.github.com/thatbeautifuldream/leetcode-sync/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244819801,"owners_count":20515646,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["leetcode","leetcode-problems","leetcode-solutions"],"created_at":"2024-11-27T21:15:03.607Z","updated_at":"2025-03-21T15:19:57.674Z","avatar_url":"https://github.com/thatbeautifuldream.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# leetcode-sync\n\n```text\n.\n├── LICENSE\n├── README.md\n└── practice\n    └── problems\n        ├── 132_pattern\n        │   └── solution.java\n        ├── 3sum_with_multiplicity\n        │   └── solution.java\n        ├── add_binary\n        │   └── solution.java\n        ├── add_to_array-form_of_integer\n        │   └── solution.java\n        ├── arranging_coins\n        │   └── solution.java\n        ├── backspace_string_compare\n        │   └── solution.java\n        ├── binary_search\n        │   └── solution.java\n        ├── binary_tree_preorder_traversal\n        │   └── solution.java\n        ├── binary_tree_tilt\n        │   └── solution.java\n        ├── build_array_from_permutation\n        │   └── solution.java\n        ├── capacity_to_ship_packages_within_d_days\n        │   └── solution.java\n        ├── cells_with_odd_values_in_a_matrix\n        │   └── solution.java\n        ├── check_if_n_and_its_double_exist\n        │   └── solution.java\n        ├── check_if_the_sentence_is_pangram\n        │   └── solution.java\n        ├── combination_sum_iii\n        │   └── solution.java\n        ├── concatenation_of_array\n        │   └── solution.java\n        ├── container_with_most_water\n        │   └── solution.java\n        ├── count_negative_numbers_in_a_sorted_matrix\n        │   └── solution.java\n        ├── count_sorted_vowel_strings\n        │   └── solution.java\n        ├── create_target_array_in_the_given_order\n        │   └── solution.java\n        ├── diameter_of_binary_tree\n        │   └── solution.java\n        ├── find_first_and_last_position_of_element_in_sorted_array\n        │   └── solution.java\n        ├── find_numbers_with_even_number_of_digits\n        │   └── solution.java\n        ├── find_smallest_letter_greater_than_target\n        │   └── solution.java\n        ├── find_the_duplicate_number\n        │   ├── solution.cpp\n        │   └── solution.java\n        ├── find_the_highest_altitude\n        │   └── solution.java\n        ├── first_bad_version\n        │   └── solution.java\n        ├── flatten_nested_list_iterator\n        │   └── solution.java\n        ├── flipping_an_image\n        │   └── solution.java\n        ├── guess_number_higher_or_lower\n        │   └── solution.java\n        ├── how_many_numbers_are_smaller_than_the_current_number\n        │   └── solution.java\n        ├── implement_stack_using_queues\n        │   └── solution.java\n        ├── kids_with_the_greatest_number_of_candies\n        │   └── solution.java\n        ├── kth_missing_positive_number\n        │   └── solution.java\n        ├── last_stone_weight\n        │   └── solution.java\n        ├── letter_combinations_of_a_phone_number\n        │   └── solution.java\n        ├── long_pressed_name\n        │   └── solution.java\n        ├── matrix_diagonal_sum\n        │   └── solution.java\n        ├── max_number_of_k-sum_pairs\n        │   └── solution.java\n        ├── maximum_depth_of_binary_tree\n        │   └── solution.java\n        ├── maximum_units_on_a_truck\n        │   └── solution.java\n        ├── minimum_operations_to_make_the_array_increasing\n        │   └── solution.java\n        ├── missing_number\n        │   └── solution.java\n        ├── number_of_good_pairs\n        │   └── solution.java\n        ├── peak_index_in_a_mountain_array\n        │   └── solution.java\n        ├── pow(x,_n)\n        │   └── solution.java\n        ├── power_of_two\n        │   └── solution.java\n        ├── remove_all_adjacent_duplicates_in_string_ii\n        │   └── solution.java\n        ├── reverse_linked_list\n        │   └── solution.java\n        ├── richest_customer_wealth\n        │   └── solution.java\n        ├── running_sum_of_1d_array\n        │   └── solution.java\n        ├── search_insert_position\n        │   └── solution.java\n        ├── shortest_unsorted_continuous_subarray\n        │   └── solution.java\n        ├── shuffle_the_array\n        │   └── solution.java\n        ├── single_number\n        │   └── solution.java\n        ├── sort_array_by_parity\n        │   └── solution.java\n        ├── sort_colors\n        │   └── solution.cpp\n        ├── sqrt(x)\n        │   └── solution.java\n        ├── swapping_nodes_in_a_linked_list\n        │   └── solution.java\n        ├── transpose_matrix\n        │   └── solution.java\n        ├── two_sum\n        │   └── solution.js\n        ├── two_sum_ii_-_input_array_is_sorted\n        │   └── solution.java\n        ├── valid_parentheses\n        │   └── solution.java\n        └── valid_perfect_square\n            └── solution.java\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthatbeautifuldream%2Fleetcode-sync","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthatbeautifuldream%2Fleetcode-sync","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthatbeautifuldream%2Fleetcode-sync/lists"}