Skip to content

iabcshsh/leetcode

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

39 Commits
Arrays
Arrays
 
 
.gitignore
.gitignore
 
 
1160_find_words_that_can_be_formed_by_characters.py
1160_find_words_that_can_be_formed_by_characters.py
 
 
1266_minimum_time_visiting_all_points.py
1266_minimum_time_visiting_all_points.py
 
 
1287_element_appearing_more_than_25per_in_sorted_array.py
1287_element_appearing_more_than_25per_in_sorted_array.py
 
 
1424_Diagonal_traverse_2.js
1424_Diagonal_traverse_2.js
 
 
1464_maximum_product_of_two_elements_in_an_array.py
1464_maximum_product_of_two_elements_in_an_array.py
 
 
1561_maximum_number_of_coins.py
1561_maximum_number_of_coins.py
 
 
1611_minimum_one_bit_operations_to_make_integers_zero.py
1611_minimum_one_bit_operations_to_make_integers_zero.py
 
 
1630_arthmetic_subarrays.js
1630_arthmetic_subarrays.js
 
 
1662_check_if_two_string_arrays_are_equivalent.py
1662_check_if_two_string_arrays_are_equivalent.py
 
 
1685_sum_of_absolute_differences_in_a_sorted_array.py
1685_sum_of_absolute_differences_in_a_sorted_array.py
 
 
1685_sum_of_absolute_differences_in_a_sorted_array_2.py
1685_sum_of_absolute_differences_in_a_sorted_array_2.py
 
 
1688_count_of_matches_in_tournament.py
1688_count_of_matches_in_tournament.py
 
 
1743-Restore-the-Array-From-Adjacent-Pairs.js
1743-Restore-the-Array-From-Adjacent-Pairs.js
 
 
1814_count_nice_pairs_in_an_array.js
1814_count_nice_pairs_in_an_array.js
 
 
1814_count_nice_pairs_in_an_array.py
1814_count_nice_pairs_in_an_array.py
 
 
1887_reduction_to_make_the_array_elements_equal.js
1887_reduction_to_make_the_array_elements_equal.js
 
 
1903_largest_odd_number_in_string.py
1903_largest_odd_number_in_string.py
 
 
191_number_of_1_bits.py
191_number_of_1_bits.py
 
 
2147_number_of_ways_to_divide_a_long_corridor.py
2147_number_of_ways_to_divide_a_long_corridor.py
 
 
2147_number_of_ways_to_divide_a_long_corridor_2.py
2147_number_of_ways_to_divide_a_long_corridor_2.py
 
 
2264_largest_3_same_digit_number_in_string.py
2264_largest_3_same_digit_number_in_string.py
 
 
2391_minimum_amount_of_time_to_collect_garbage.js
2391_minimum_amount_of_time_to_collect_garbage.js
 
 
2482_difference_between_ones_and_zeros_in_row_and_column.py
2482_difference_between_ones_and_zeros_in_row_and_column.py
 
 
2729_numberIsFascinating.js
2729_numberIsFascinating.js
 
 
2733_NeitherMinimumNorMaximum.py
2733_NeitherMinimumNorMaximum.py
 
 
3_longest_substring_without_repeating_characters.py
3_longest_substring_without_repeating_characters.py
 
 
3_longest_substring_without_repeating_characters_2.py
3_longest_substring_without_repeating_characters_2.py
 
 
3_longest_substring_without_repeating_characters_3.py
3_longest_substring_without_repeating_characters_3.py
 
 
606_construct_string_from_binaary_tree.py
606_construct_string_from_binaary_tree.py
 
 
867_transpose_matrix.py
867_transpose_matrix.py
 
 
935_knight_dialer.py
935_knight_dialer.py
 
 
94_binary_tree_inorder_traversal.py
94_binary_tree_inorder_traversal.py
 
 
CompactObject.js
CompactObject.js
 
 
LRc1.js
LRc1.js
 
 
README.md
README.md
 
 
add-two-numbers-ii.js
add-two-numbers-ii.js
 
 
add_two_numbers.js
add_two_numbers.js
 
 
asteroid_collision.js
asteroid_collision.js
 
 
chunks.js
chunks.js
 
 
desktop.ini
desktop.ini
 
 
fibonciGenerator.js
fibonciGenerator.js
 
 
flatten.js
flatten.js
 
 
flattenRecursive.js
flattenRecursive.js
 
 
jsonDifference.js
jsonDifference.js
 
 
jsonToMatrix.js
jsonToMatrix.js
 
 
jsonstringify.js
jsonstringify.js
 
 
lexi.py
lexi.py
 
 
longest_increasing_subsequence.js
longest_increasing_subsequence.js
 
 
non_overlapping_intervals.js
non_overlapping_intervals.js
 
 
promisepool.js
promisepool.js
 
 
snailTraversal.js
snailTraversal.js
 
 
totalDistanceTravelled.js
totalDistanceTravelled.js
 
 

Repository files navigation

leetcode solutions

Welcome to the LeetCode Solutions repository! This repository contains my solutions to various LeetCode problems. Each solution is written in a specific programming language and includes explanations, time and space complexity analysis, and test cases.

Table of Contents

Contribution

Feel free to contribute to this repository by adding your own solutions to LeetCode problems. Please follow these guidelines for contributions:

  • Create a new folder for the problem (e.g., ./problem-name).
  • Include a well-documented solution in your preferred programming language.
  • Provide explanations for your solutions in a README file.
  • Include time and space complexity analysis.

License

This repository is open-source and available under the MIT License. Feel free to use and distribute the code as needed.

Happy coding and keep practicing your problem-solving skills with LeetCode!

Note: Please make sure to include proper attribution and respect LeetCode's guidelines and policies when using their content and problems.

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •  

Languages