Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/vicen-te/leetcode
Leetcode solutions
https://github.com/vicen-te/leetcode
algorithm-challenges algorithms algorithms-solutions leetcode leetcode-solutions
Last synced: 3 days ago
JSON representation
Leetcode solutions
- Host: GitHub
- URL: https://github.com/vicen-te/leetcode
- Owner: Vicen-te
- License: mit
- Created: 2022-10-03T19:39:00.000Z (over 2 years ago)
- Default Branch: main
- Last Pushed: 2023-09-23T20:58:41.000Z (over 1 year ago)
- Last Synced: 2023-09-24T01:47:10.689Z (over 1 year ago)
- Topics: algorithm-challenges, algorithms, algorithms-solutions, leetcode, leetcode-solutions
- Language: C++
- Homepage:
- Size: 29.3 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
LeetCode
========
### LeetCode Algorithm
| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
|001|[Two Sum](https://leetcode.com/problems/two-sum/)| [C++](./algorithms/cpp/1-Two-Sum.cpp) |Easy|
|002|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [C++](./algorithms/cpp/2-Add-Two-Numbers.cpp) |Medium|
|003|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [C++](./algorithms/cpp/3-Longest-Substring-Without-Repeating-Characters.cpp) |Medium|
|012|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| [C++](./algorithms/cpp/12-Integer-to-Roman.cpp) |Medium|
|019|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [C++](./algorithms/cpp/19-Remove-Nth-Node-From-End-of-List.cpp) |Medium|
|034|[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)| [C++](./algorithms/cpp/34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.cpp) |Medium|
|035|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)| [C++](./algorithms/cpp/35-Search-Insert-Position.cpp) |Easy|
|118|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)| [C++](./algorithms/cpp/118-Pascal's-Triangle.cpp) |Easy|
|119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/)| [C++](./algorithms/cpp/119-Pascal's-Triangle-II.cpp) |Easy|
|167|[Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)| [C++](./algorithms/cpp/167-Two-Sum-II-Input-Array-Is-Sorted.cpp) |
|169|[Majority Element](https://leetcode.com/problems/majority-element/)| [C++](./algorithms/cpp/169-Majority-Element.cpp) |Easy|
|189|[Rotate Array](https://leetcode.com/problems/rotate-array/)| [C++](./algorithms/cpp/189-Rotate-Array.cpp) |Medium|
|229|[Majority Element II](https://leetcode.com/problems/majority-element-ii/)| [C++](./algorithms/cpp/229-Majority-Element-II.cpp) |Medium|
|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)| [C++](./algorithms/cpp/237-Delete-Node-in-a-Linked-List.cpp) |Medium|
|278|[First Bad Version](https://leetcode.com/problems/first-bad-version/)| [C++](./algorithms/cpp/278-First-Bad-Version.cpp) |Easy|
|283|[Move Zeroes](https://leetcode.com/problems/move-zeroes/)| [C++](./algorithms/cpp/283-Move-Zeroes.cpp) |Easy|
|341|[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/)| [C++]( ./algorithms/cpp/341-Flatten-Nested-List-Iterator.cpp) |Medium|
|342|[Power of Four](https://leetcode.com/problems/power-of-four/)| [C++]( ./algorithms/cpp/342-Power-of-Four.cpp) |Easy|
|344|[Reverse String](https://leetcode.com/problems/reverse-string/)| [C++]( ./algorithms/cpp/344-Reverse-String.cpp) |Easy|
|377|[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)| [C++]( ./algorithms/cpp/377-Combination-Sum-IV.cpp) |Medium|
|389|[Find the Difference](https://leetcode.com/problems/find-the-difference/)| [C++]( ./algorithms/cpp/389-Find-the-Difference.cpp) |Easy|
|392|[Is Subsequence](https://leetcode.com/problems/is-subsequence/)| [C++]( ./algorithms/cpp/392-Is-Subsequence.cpp) |Easy|
|515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)| [C++]( ./algorithms/cpp/515-Find-Largest-Value-in-Each-Tree-Row.cpp) |Medium|
|557|[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/)| [C++]( ./algorithms/cpp/557-Reverse-Words-in-a-String-III.cpp) |Easy|
|704|[Binary Search](https://leetcode.com/problems/binary-search/)| [C++]( ./algorithms/cpp/704-Binary-Search.cpp) |Easy|
|779|[K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar/)| [C++]( ./algorithms/cpp/779-K-th-Symbol-in-Grammar.cpp) |Medium|
|823|[Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/)| [C++]( ./algorithms/cpp/823-Binary-Trees-With-Factors.cpp) |Medium|
|844|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)| [C++]( ./algorithms/cpp/844-Backspace-String-Compare.cpp) |Easy|
|876|[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)| [C++]( ./algorithms/cpp/876-Middle-of-the-Linked-List.cpp) |Easy|
|880|[Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/)| [C++]( ./algorithms/cpp/880-Decoded-String-at-Index.cpp) |Medium|
|896|[Monotonic Array](https://leetcode.com/problems/monotonic-array/)| [C++]( ./algorithms/cpp/896-Monotonic-Array.cpp) |Easy|
|905|[Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/)| [C++]( ./algorithms/cpp/905-Sort-Array-By-Parity.cpp) |Easy|
|977|[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)| [C++](./algorithms/cpp/977-Squares-of-a-Sorted-Array.cpp) |Easy|
|1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)| [C++](./algorithms/cpp/1071-Greatest-Common-Divisor-of-Strings.cpp) |Easy|
|1095|[Find in Mountain Array](https://leetcode.com/problems/find-in-mountain-array/)| [C++](./algorithms/cpp/1095-Find-in-Mountain-Array.cpp) |Hard|
|1356|[Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/)| [C++](./algorithms/cpp/1356-Sort-Integers-by-The-Number-of-1-Bits.cpp) |Easy|
|1431|[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/)| [C++](./algorithms/cpp/1431-Kids-With-the-Greatest-Number-of-Candies.cpp) |Easy|
|1768|[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/)| [C++](./algorithms/cpp/1768-Merge-Strings-Alternately.cpp) |Easy|
|2265|[Count Nodes Equal to Average of Subtree](https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/)| [C++](./algorithms/cpp/2265-Count-Nodes-Equal-to-Average-of-Subtree.cpp) |Medium|
========
### LeetCode DataBase
| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
========
### LeetCode Shell
| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |
========
### LeetCode Concurrency
| # | Title | Solution | Difficulty |
|---| ----- | -------- | ---------- |