Download leetcode-in-kotlin JAR 1.5 with all dependencies
Kotlin-based LeetCode algorithm problem solutions, regularly updated
Files of the artifact leetcode-in-kotlin version 1.5 from the group com.github.javadev.
Artifact leetcode-in-kotlin
Group com.github.javadev
Version 1.5
Last update 02. October 2022
Tags: updating solution kotlin leetcode continually algorithm problems
Organization not specified
URL https://github.com/javadev/LeetCode-in-Kotlin
License The MIT License
Dependencies amount 1
Dependencies kotlin-stdlib,
There are maybe transitive dependencies!
Group com.github.javadev
Version 1.5
Last update 02. October 2022
Tags: updating solution kotlin leetcode continually algorithm problems
Organization not specified
URL https://github.com/javadev/LeetCode-in-Kotlin
License The MIT License
Dependencies amount 1
Dependencies kotlin-stdlib,
There are maybe transitive dependencies!
There is a newer version: 1.30
Show newest versionShow all versions of leetcode-in-kotlin Show documentation
Please rate this JAR file. Is it a good library?
0 downloads
Source code of leetcode-in-kotlin version 1.5
META-INF
META-INF.maven.com.github.javadev.leetcode-in-kotlin
com_github_leetcode
g0001_0100.s0001_two_sum
g0001_0100.s0002_add_two_numbers
g0001_0100.s0003_longest_substring_without_repeating_characters
g0001_0100.s0004_median_of_two_sorted_arrays
g0001_0100.s0005_longest_palindromic_substring
g0001_0100.s0006_zigzag_conversion
g0001_0100.s0007_reverse_integer
g0001_0100.s0008_string_to_integer_atoi
g0001_0100.s0009_palindrome_number
g0001_0100.s0010_regular_expression_matching
g0001_0100.s0011_container_with_most_water
g0001_0100.s0012_integer_to_roman
g0001_0100.s0013_roman_to_integer
g0001_0100.s0014_longest_common_prefix
g0001_0100.s0015_3sum
g0001_0100.s0016_3sum_closest
g0001_0100.s0017_letter_combinations_of_a_phone_number
g0001_0100.s0018_4sum
g0001_0100.s0019_remove_nth_node_from_end_of_list
g0001_0100.s0020_valid_parentheses
g0001_0100.s0021_merge_two_sorted_lists
g0001_0100.s0022_generate_parentheses
g0001_0100.s0023_merge_k_sorted_lists
g0001_0100.s0024_swap_nodes_in_pairs
g0001_0100.s0025_reverse_nodes_in_k_group
g0001_0100.s0026_remove_duplicates_from_sorted_array
g0001_0100.s0027_remove_element
g0001_0100.s0028_implement_strstr
g0001_0100.s0029_divide_two_integers
g0001_0100.s0030_substring_with_concatenation_of_all_words
g0001_0100.s0031_next_permutation
g0001_0100.s0032_longest_valid_parentheses
g0001_0100.s0033_search_in_rotated_sorted_array
g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array
g0001_0100.s0035_search_insert_position
g0001_0100.s0036_valid_sudoku
g0001_0100.s0037_sudoku_solver
g0001_0100.s0038_count_and_say
g0001_0100.s0039_combination_sum
g0001_0100.s0040_combination_sum_ii
g0001_0100.s0041_first_missing_positive
g0001_0100.s0042_trapping_rain_water
g0001_0100.s0043_multiply_strings
g0001_0100.s0044_wildcard_matching
g0001_0100.s0045_jump_game_ii
g0001_0100.s0046_permutations
g0001_0100.s0047_permutations_ii
g0001_0100.s0048_rotate_image
g0001_0100.s0049_group_anagrams
g0001_0100.s0050_powx_n
g0001_0100.s0051_n_queens
g0001_0100.s0052_n_queens_ii
g0001_0100.s0053_maximum_subarray
g0001_0100.s0054_spiral_matrix
g0001_0100.s0055_jump_game
g0001_0100.s0056_merge_intervals
g0001_0100.s0057_insert_interval
g0001_0100.s0058_length_of_last_word
g0001_0100.s0059_spiral_matrix_ii
g0001_0100.s0060_permutation_sequence
g0001_0100.s0061_rotate_list
g0001_0100.s0062_unique_paths
g0001_0100.s0063_unique_paths_ii
g0001_0100.s0064_minimum_path_sum
g0001_0100.s0065_valid_number
g0001_0100.s0066_plus_one
g0001_0100.s0067_add_binary
g0001_0100.s0068_text_justification
g0001_0100.s0069_sqrtx
g0001_0100.s0070_climbing_stairs
g0001_0100.s0071_simplify_path
g0001_0100.s0072_edit_distance
g0001_0100.s0073_set_matrix_zeroes
g0001_0100.s0074_search_a_2d_matrix
g0001_0100.s0075_sort_colors
g0001_0100.s0076_minimum_window_substring
g0001_0100.s0077_combinations
g0001_0100.s0078_subsets
g0001_0100.s0079_word_search
g0001_0100.s0080_remove_duplicates_from_sorted_array_ii
g0001_0100.s0081_search_in_rotated_sorted_array_ii
g0001_0100.s0082_remove_duplicates_from_sorted_list_ii
g0001_0100.s0083_remove_duplicates_from_sorted_list
g0001_0100.s0084_largest_rectangle_in_histogram
g0001_0100.s0085_maximal_rectangle
g0001_0100.s0086_partition_list
g0001_0100.s0087_scramble_string
g0001_0100.s0088_merge_sorted_array
g0001_0100.s0089_gray_code
g0001_0100.s0090_subsets_ii
g0001_0100.s0091_decode_ways
g0001_0100.s0092_reverse_linked_list_ii
g0001_0100.s0093_restore_ip_addresses
g0001_0100.s0094_binary_tree_inorder_traversal
g0001_0100.s0095_unique_binary_search_trees_ii
g0001_0100.s0096_unique_binary_search_trees
g0001_0100.s0097_interleaving_string
g0001_0100.s0098_validate_binary_search_tree
g0001_0100.s0099_recover_binary_search_tree
g0001_0100.s0100_same_tree
g0101_0200.s0101_symmetric_tree
g0101_0200.s0102_binary_tree_level_order_traversal
g0101_0200.s0103_binary_tree_zigzag_level_order_traversal
g0101_0200.s0104_maximum_depth_of_binary_tree
g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal
g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal
g0101_0200.s0107_binary_tree_level_order_traversal_ii
g0101_0200.s0108_convert_sorted_array_to_binary_search_tree
g0101_0200.s0109_convert_sorted_list_to_binary_search_tree
g0101_0200.s0110_balanced_binary_tree
g0101_0200.s0111_minimum_depth_of_binary_tree
g0101_0200.s0112_path_sum
g0101_0200.s0113_path_sum_ii
g0101_0200.s0114_flatten_binary_tree_to_linked_list
g0101_0200.s0115_distinct_subsequences
g0101_0200.s0121_best_time_to_buy_and_sell_stock
g0101_0200.s0124_binary_tree_maximum_path_sum
g0101_0200.s0128_longest_consecutive_sequence
g0101_0200.s0131_palindrome_partitioning
g0101_0200.s0136_single_number
g0101_0200.s0138_copy_list_with_random_pointer
g0101_0200.s0139_word_break
g0101_0200.s0141_linked_list_cycle
g0101_0200.s0142_linked_list_cycle_ii
g0101_0200.s0146_lru_cache
g0101_0200.s0148_sort_list
g0101_0200.s0152_maximum_product_subarray
g0101_0200.s0153_find_minimum_in_rotated_sorted_array
g0101_0200.s0155_min_stack
g0101_0200.s0160_intersection_of_two_linked_lists
g0101_0200.s0169_majority_element
g0101_0200.s0189_rotate_array
g0101_0200.s0198_house_robber
g0101_0200.s0199_binary_tree_right_side_view
g0101_0200.s0200_number_of_islands
g0201_0300.s0206_reverse_linked_list
g0201_0300.s0207_course_schedule
g0201_0300.s0208_implement_trie_prefix_tree
g0201_0300.s0215_kth_largest_element_in_an_array
g0201_0300.s0221_maximal_square
g0201_0300.s0226_invert_binary_tree
g0201_0300.s0230_kth_smallest_element_in_a_bst
g0201_0300.s0234_palindrome_linked_list
g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree
g0201_0300.s0238_product_of_array_except_self
g0201_0300.s0239_sliding_window_maximum
g0201_0300.s0240_search_a_2d_matrix_ii
g0201_0300.s0283_move_zeroes
g0201_0300.s0287_find_the_duplicate_number
g0201_0300.s0295_find_median_from_data_stream
g0201_0300.s0300_longest_increasing_subsequence
g0301_0400.s0322_coin_change
g0301_0400.s0338_counting_bits
g0301_0400.s0347_top_k_frequent_elements
g0301_0400.s0378_kth_smallest_element_in_a_sorted_matrix
g0301_0400.s0394_decode_string
g0401_0500.s0416_partition_equal_subset_sum
g0401_0500.s0437_path_sum_iii
g0401_0500.s0438_find_all_anagrams_in_a_string
g0401_0500.s0494_target_sum
g0501_0600.s0543_diameter_of_binary_tree
g0501_0600.s0560_subarray_sum_equals_k
g0601_0700.s0647_palindromic_substrings
g0701_0800.s0739_daily_temperatures
g0701_0800.s0763_partition_labels
g0801_0900.s0864_shortest_path_to_get_all_keys
g0901_1000.s0994_rotting_oranges
g1101_1200.s1143_longest_common_subsequence
© 2015 - 2024 Weber Informatics LLC | Privacy Policy