https://github.com/thatbeautifuldream/leetcode-sync

Leetcode Sync
https://github.com/thatbeautifuldream/leetcode-sync

leetcode leetcode-problems leetcode-solutions

Last synced: 3 months ago
JSON representation

Leetcode Sync

• Host: GitHub
• URL: https://github.com/thatbeautifuldream/leetcode-sync
• Owner: thatbeautifuldream
• License: mit
• Created: 2022-09-15T03:01:32.000Z (almost 3 years ago)
• Default Branch: main
• Last Pushed: 2022-09-15T03:41:24.000Z (almost 3 years ago)
• Last Synced: 2025-01-26T10:41:37.069Z (5 months ago)
• Topics: leetcode, leetcode-problems, leetcode-solutions
• Language: Java
• Homepage: https://milind.live/leetcode-sync
• Size: 46.9 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# leetcode-sync

```text

.

├── LICENSE

├── README.md

└── practice

    └── problems

        ├── 132_pattern

        │   └── solution.java

        ├── 3sum_with_multiplicity

        │   └── solution.java

        ├── add_binary

        │   └── solution.java

        ├── add_to_array-form_of_integer

        │   └── solution.java

        ├── arranging_coins

        │   └── solution.java

        ├── backspace_string_compare

        │   └── solution.java

        ├── binary_search

        │   └── solution.java

        ├── binary_tree_preorder_traversal

        │   └── solution.java

        ├── binary_tree_tilt

        │   └── solution.java

        ├── build_array_from_permutation

        │   └── solution.java

        ├── capacity_to_ship_packages_within_d_days

        │   └── solution.java

        ├── cells_with_odd_values_in_a_matrix

        │   └── solution.java

        ├── check_if_n_and_its_double_exist

        │   └── solution.java

        ├── check_if_the_sentence_is_pangram

        │   └── solution.java

        ├── combination_sum_iii

        │   └── solution.java

        ├── concatenation_of_array

        │   └── solution.java

        ├── container_with_most_water

        │   └── solution.java

        ├── count_negative_numbers_in_a_sorted_matrix

        │   └── solution.java

        ├── count_sorted_vowel_strings

        │   └── solution.java

        ├── create_target_array_in_the_given_order

        │   └── solution.java

        ├── diameter_of_binary_tree

        │   └── solution.java

        ├── find_first_and_last_position_of_element_in_sorted_array

        │   └── solution.java

        ├── find_numbers_with_even_number_of_digits

        │   └── solution.java

        ├── find_smallest_letter_greater_than_target

        │   └── solution.java

        ├── find_the_duplicate_number

        │   ├── solution.cpp

        │   └── solution.java

        ├── find_the_highest_altitude

        │   └── solution.java

        ├── first_bad_version

        │   └── solution.java

        ├── flatten_nested_list_iterator

        │   └── solution.java

        ├── flipping_an_image

        │   └── solution.java

        ├── guess_number_higher_or_lower

        │   └── solution.java

        ├── how_many_numbers_are_smaller_than_the_current_number

        │   └── solution.java

        ├── implement_stack_using_queues

        │   └── solution.java

        ├── kids_with_the_greatest_number_of_candies

        │   └── solution.java

        ├── kth_missing_positive_number

        │   └── solution.java

        ├── last_stone_weight

        │   └── solution.java

        ├── letter_combinations_of_a_phone_number

        │   └── solution.java

        ├── long_pressed_name

        │   └── solution.java

        ├── matrix_diagonal_sum

        │   └── solution.java

        ├── max_number_of_k-sum_pairs

        │   └── solution.java

        ├── maximum_depth_of_binary_tree

        │   └── solution.java

        ├── maximum_units_on_a_truck

        │   └── solution.java

        ├── minimum_operations_to_make_the_array_increasing

        │   └── solution.java

        ├── missing_number

        │   └── solution.java

        ├── number_of_good_pairs

        │   └── solution.java

        ├── peak_index_in_a_mountain_array

        │   └── solution.java

        ├── pow(x,_n)

        │   └── solution.java

        ├── power_of_two

        │   └── solution.java

        ├── remove_all_adjacent_duplicates_in_string_ii

        │   └── solution.java

        ├── reverse_linked_list

        │   └── solution.java

        ├── richest_customer_wealth

        │   └── solution.java

        ├── running_sum_of_1d_array

        │   └── solution.java

        ├── search_insert_position

        │   └── solution.java

        ├── shortest_unsorted_continuous_subarray

        │   └── solution.java

        ├── shuffle_the_array

        │   └── solution.java

        ├── single_number

        │   └── solution.java

        ├── sort_array_by_parity

        │   └── solution.java

        ├── sort_colors

        │   └── solution.cpp

        ├── sqrt(x)

        │   └── solution.java

        ├── swapping_nodes_in_a_linked_list

        │   └── solution.java

        ├── transpose_matrix

        │   └── solution.java

        ├── two_sum

        │   └── solution.js

        ├── two_sum_ii_-_input_array_is_sorted

        │   └── solution.java

        ├── valid_parentheses

        │   └── solution.java

        └── valid_perfect_square

            └── solution.java

```