GitHub - luisfrodriguezr/leetcode: This repository contains my solutions to various LeetCode problems. LeetCode is a popular online platform that offers a vast collection of algorithmic and coding challenges to improve programming skills and problem-solving techniques.

Welcome to My LeetCode Repository!

About

This repository contains my solutions to various LeetCode problems. LeetCode is a popular online platform that offers a vast collection of algorithmic and coding challenges to improve programming skills and problem-solving techniques.

Introduction

LeetCode is an excellent platform for practising coding and algorithm challenges. The problems cover a wide range of topics, including arrays, linked lists, trees, dynamic programming, and more. In this repository, I'll share my solutions to these problems, providing explanations and code in various programming languages.

Installation

To use the solutions in this repository, you can simply clone the repository using the following command:

git clone https://github.com/pmentor/leetcode.git

Alternatively, you can download the repository as a ZIP file and extract it to your local machine.

Usage

Each problem solution is organized into its own directory, named after the problem's title or ID. Within each directory, you'll find the code files and any additional resources related to the problem. The code is provided in multiple programming languages for reference and learning purposes.

Feel free to explore the solutions, read the explanations, and experiment with the code on your machine. You can run the code with the compiler or interpreter associated with the respective language.

Problem Structure

Each problem directory follows a standard structure:

|-- problem-title-or-id
    |-- problem.md        # Description of the problem and constraints
    |-- solution.py       # Python solution
    |-- solution.java     # Java solution
    |-- solution.cpp      # C++ solution
    |-- ...               # Other language solutions (if applicable)

The problem.md file contains a detailed description of the problem, input-output examples, and any constraints that you need to consider while solving the problem.

Contributing

Contributions to this repository are welcome! If you have an efficient solution to a problem or want to add solutions in other programming languages, you can fork this repository, make your changes, and create a pull request.

Please ensure that your solutions pass all test cases and provide clear explanations for your code.

License

This repository is licensed under the MIT License. You are free to use the code and solutions for personal and educational purposes.

Thank you for visiting my LeetCode repository. I hope you find the solutions helpful and that they contribute to your growth as a programmer and problem solver. Happy coding! 🚀

Name		Name	Last commit message	Last commit date
Latest commit History 1,056 Commits
0001-two-sum		0001-two-sum
0002-add-two-numbers		0002-add-two-numbers
0003-longest-substring-without-repeating-characters		0003-longest-substring-without-repeating-characters
0007-reverse-integer		0007-reverse-integer
0009-palindrome-number		0009-palindrome-number
000k-radius-subarray-averages		000k-radius-subarray-averages
0014-longest-common-prefix		0014-longest-common-prefix
0019-remove-nth-node-from-end-of-list		0019-remove-nth-node-from-end-of-list
0049-group-anagrams		0049-group-anagrams
0070-climbing-stairs		0070-climbing-stairs
0076-minimum-window-substring		0076-minimum-window-substring
0100-same-tree		0100-same-tree
0130-surrounded-regions		0130-surrounded-regions
0141-linked-list-cycle		0141-linked-list-cycle
0150-evaluate-reverse-polish-notation		0150-evaluate-reverse-polish-notation
0169-majority-element		0169-majority-element
0191-number-of-1-bits		0191-number-of-1-bits
0198-house-robber		0198-house-robber
0201-bitwise-and-of-numbers-range		0201-bitwise-and-of-numbers-range
0209-minimum-size-subarray-sum		0209-minimum-size-subarray-sum
0217-contains-duplicate		0217-contains-duplicate
0231-power-of-two		0231-power-of-two
0232-implement-queue-using-stacks		0232-implement-queue-using-stacks
0237-delete-node-in-a-linked-list		0237-delete-node-in-a-linked-list
0268-missing-number		0268-missing-number
0279-perfect-squares		0279-perfect-squares
0283-move-zeroes		0283-move-zeroes
0293-flip-game		0293-flip-game
0300-longest-increasing-subsequence		0300-longest-increasing-subsequence
0368-largest-divisible-subset		0368-largest-divisible-subset
0380-insert-delete-getrandom-o1		0380-insert-delete-getrandom-o1
0383-ransom-note		0383-ransom-note
0387-first-unique-character-in-a-string		0387-first-unique-character-in-a-string
0392-is-subsequence		0392-is-subsequence
0446-arithmetic-slices-ii-subsequence		0446-arithmetic-slices-ii-subsequence
0451-sort-characters-by-frequency		0451-sort-characters-by-frequency
0455-assign-cookies		0455-assign-cookies
0492-construct-the-rectangle		0492-construct-the-rectangle
0513-find-bottom-left-tree-value		0513-find-bottom-left-tree-value
0525-contiguous-array		0525-contiguous-array
0557-reverse-words-in-a-string-iii		0557-reverse-words-in-a-string-iii
0560-subarray-sum-equals-k		0560-subarray-sum-equals-k
0576-out-of-boundary-paths		0576-out-of-boundary-paths
0629-k-inverse-pairs-array		0629-k-inverse-pairs-array
0645-set-mismatch		0645-set-mismatch
0647-palindromic-substrings		0647-palindromic-substrings
0713-subarray-product-less-than-k		0713-subarray-product-less-than-k
0724-find-pivot-index		0724-find-pivot-index
0739-daily-temperatures		0739-daily-temperatures
0762-prime-number-of-set-bits-in-binary-representation		0762-prime-number-of-set-bits-in-binary-representation
0771-jewels-and-stones		0771-jewels-and-stones
0787-cheapest-flights-within-k-stops		0787-cheapest-flights-within-k-stops
0830-positions-of-large-groups		0830-positions-of-large-groups
0872-leaf-similar-trees		0872-leaf-similar-trees
0907-sum-of-subarray-minimums		0907-sum-of-subarray-minimums
0917-reverse-only-letters		0917-reverse-only-letters
0931-minimum-falling-path-sum		0931-minimum-falling-path-sum
0938-range-sum-of-bst		0938-range-sum-of-bst
0948-bag-of-tokens		0948-bag-of-tokens
0977-squares-of-a-sorted-array		0977-squares-of-a-sorted-array
0997-find-the-town-judge		0997-find-the-town-judge
0999-available-captures-for-rook		0999-available-captures-for-rook
0max-consecutive-ones-iii		0max-consecutive-ones-iii
10033-count-subarrays-where-max-element-appears-at-least-k-times		10033-count-subarrays-where-max-element-appears-at-least-k-times
1018-binary-prefix-divisible-by-5		1018-binary-prefix-divisible-by-5
1026-maximum-difference-between-node-and-ancestor		1026-maximum-difference-between-node-and-ancestor
1030-matrix-cells-in-distance-order		1030-matrix-cells-in-distance-order
1034-subarrays-with-k-different-integers		1034-subarrays-with-k-different-integers
1037-valid-boomerang		1037-valid-boomerang
1043-partition-array-for-maximum-sum		1043-partition-array-for-maximum-sum
1078-occurrences-after-bigram		1078-occurrences-after-bigram
1085-sum-of-digits-in-the-minimum-number		1085-sum-of-digits-in-the-minimum-number
1108-defanging-an-ip-address		1108-defanging-an-ip-address
1118-number-of-days-in-a-month		1118-number-of-days-in-a-month
1133-largest-unique-number		1133-largest-unique-number
1143-longest-common-subsequence		1143-longest-common-subsequence
1148-article-views-i		1148-article-views-i
1154-day-of-the-year		1154-day-of-the-year
1160-find-words-that-can-be-formed-by-characters		1160-find-words-that-can-be-formed-by-characters
1176-diet-plan-performance		1176-diet-plan-performance
1189-maximum-number-of-balloons		1189-maximum-number-of-balloons
1207-unique-number-of-occurrences		1207-unique-number-of-occurrences
1208-get-equal-substrings-within-budget		1208-get-equal-substrings-within-budget
1210-mean-of-array-after-removing-some-elements		1210-mean-of-array-after-removing-some-elements
1235-maximum-profit-in-job-scheduling		1235-maximum-profit-in-job-scheduling
1239-maximum-length-of-a-concatenated-string-with-unique-characters		1239-maximum-length-of-a-concatenated-string-with-unique-characters
1248-count-number-of-nice-subarrays		1248-count-number-of-nice-subarrays
1267-remove-zero-sum-consecutive-nodes-from-linked-list		1267-remove-zero-sum-consecutive-nodes-from-linked-list
1281-subtract-the-product-and-sum-of-digits-of-an-integer		1281-subtract-the-product-and-sum-of-digits-of-an-integer
1291-sequential-digits		1291-sequential-digits
1309-decrypt-string-from-alphabet-to-integer-mapping		1309-decrypt-string-from-alphabet-to-integer-mapping
1310-xor-queries-of-a-subarray		1310-xor-queries-of-a-subarray
1365-how-many-numbers-are-smaller-than-the-current-number		1365-how-many-numbers-are-smaller-than-the-current-number
1370-increasing-decreasing-string		1370-increasing-decreasing-string
1381-maximum-score-words-formed-by-letters		1381-maximum-score-words-formed-by-letters
140-word-break-ii		140-word-break-ii
1417-reformat-the-string		1417-reformat-the-string
1426-counting-elements		1426-counting-elements
143-reorder-list		143-reorder-list
1436-destination-city		1436-destination-city

License

luisfrodriguezr/leetcode

Folders and files

Latest commit

History