Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/dpetrosy/leetcode
In this repository, I store my LeetCode solved problems.
https://github.com/dpetrosy/leetcode
algorithm algorithms algorithms-and-data-structures cpp cpp11 data-structure interview interview-preparation interview-questions leetcode leetcode-company-questions leetcode-cpp leetcode-solutions modern-cpp
Last synced: about 14 hours ago
JSON representation
In this repository, I store my LeetCode solved problems.
- Host: GitHub
- URL: https://github.com/dpetrosy/leetcode
- Owner: dpetrosy
- License: mit
- Created: 2024-01-15T11:10:56.000Z (8 months ago)
- Default Branch: master
- Last Pushed: 2024-07-04T20:58:07.000Z (3 months ago)
- Last Synced: 2024-09-24T20:57:15.744Z (about 19 hours ago)
- Topics: algorithm, algorithms, algorithms-and-data-structures, cpp, cpp11, data-structure, interview, interview-preparation, interview-questions, leetcode, leetcode-company-questions, leetcode-cpp, leetcode-solutions, modern-cpp
- Language: C++
- Homepage: https://leetcode.com
- Size: 456 KB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
---
## 📜 About Repository
In this repository, I store my solved LeetCode problems.
* [Link to LeetCode](https://leetcode.com/)
* [Link to My Profile](https://leetcode.com/u/dpetrosy/)
## 📑 Problem List
|# |TITLE |DESCRIPTION |SOLUTION |
|:-----:|:--------------------------------------:|:--------------------------------------------------------------------------------------------------------------------------:|:--------------------------------------:|
|01 |Two Sum | [`EN Description`](https://leetcode.com/problems/two-sum/description/) |[`Solution`](problem01/solution.cpp) |
|03 |Longest Substring Without Repeats | [`EN Description`](https://leetcode.com/problems/longest-substring-without-repeating-characters/description/) |[`Solution`](problem03/solution.cpp) |
|08 |String to Integer (atoi) | [`EN Description`](https://leetcode.com/problems/string-to-integer-atoi/description/) |[`Solution`](problem08/solution.cpp) |
|09 |Palindrome Number | [`EN Description`](https://leetcode.com/problems/palindrome-number/description/) |[`Solution`](problem09/solution.cpp) |
|12 |Integer to Roman | [`EN Description`](https://leetcode.com/problems/integer-to-roman/description/) |[`Solution`](problem12/solution.cpp) |
|13 |Roman to Integer | [`EN Description`](https://leetcode.com/problems/roman-to-integer/description/) |[`Solution`](problem13/solution.cpp) |
|14 |Longest Common Prefix | [`EN Description`](https://leetcode.com/problems/longest-common-prefix/description/) |[`Solution`](problem14/solution.cpp) |
|19 |Remove Nth Node From End of List | [`EN Description`](https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/) |[`Solution`](problem19/solution.cpp) |
|20 |Valid Parentheses | [`EN Description`](https://leetcode.com/problems/valid-parentheses/description/) |[`Solution`](problem20/solution.cpp) |
|26 |Remove Duplicates from Sorted Array | [`EN Description`](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/) |[`Solution`](problem26/solution.cpp) |
|27 |Remove Element | [`EN Description`](https://leetcode.com/problems/remove-element/description/) |[`Solution`](problem27/solution.cpp) |
|28 |Find the Index of the First Occurrence | [`EN Description`](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/description/) |[`Solution`](problem28/solution.cpp) |
|35 |Search Insert Position | [`EN Description`](https://leetcode.com/problems/search-insert-position/description/) |[`Solution`](problem35/solution.cpp) |
|50 |Pow(x, n) | [`EN Description`](https://leetcode.com/problems/powx-n/description/) |[`Solution`](problem50/solution.cpp) |
|56 |Merge Intervals | [`EN Description`](https://leetcode.com/problems/merge-intervals/description/) |[`Solution`](problem56/solution.cpp) |
|58 |Length of Last Word | [`EN Description`](https://leetcode.com/problems/length-of-last-word/description/) |[`Solution`](problem58/solution.cpp) |
|66 |Plus One | [`EN Description`](https://leetcode.com/problems/plus-one/description/) |[`Solution`](problem66/solution.cpp) |
|69 |Sqrt(x) | [`EN Description`](https://leetcode.com/problems/sqrtx/description/) |[`Solution`](problem69/solution.cpp) |
|70 |Climbing Stairs | [`EN Description`](https://leetcode.com/problems/climbing-stairs/description/) |[`Solution`](problem70/solution.cpp) |
|75 |Sort Colors | [`EN Description`](https://leetcode.com/problems/sort-colors/description/) |[`Solution`](problem75/solution.cpp) |
|83 |Remove Duplicates from Sorted List | [`EN Description`](https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/) |[`Solution`](problem83/solution.cpp) |
|88 |Merge Sorted Array | [`EN Description`](https://leetcode.com/problems/merge-sorted-array/description/) |[`Solution`](problem88/solution.cpp) |
|94 |Binary Tree Inorder Traversal | [`EN Description`](https://leetcode.com/problems/binary-tree-inorder-traversal/description/) |[`Solution`](problem94/solution.cpp) |
|100 |Same Tree | [`EN Description`](https://leetcode.com/problems/same-tree/description/) |[`Solution`](problem100/solution.cpp) |
|102 |Binary Tree Level Order Traversal | [`EN Description`](https://leetcode.com/problems/binary-tree-level-order-traversal/description/) |[`Solution`](problem102/solution.cpp) |
|104 |Maximum Depth of Binary Tree | [`EN Description`](https://leetcode.com/problems/maximum-depth-of-binary-tree/description/) |[`Solution`](problem104/solution.cpp) |
|108 |Convert Sorted Array to Binary Tree | [`EN Description`](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/) |[`Solution`](problem108/solution.cpp) |
|110 |Balanced Binary Tree | [`EN Description`](https://leetcode.com/problems/balanced-binary-tree/description/) |[`Solution`](problem110/solution.cpp) |
|111 |Minimum Depth of Binary Tree | [`EN Description`](https://leetcode.com/problems/minimum-depth-of-binary-tree/description/) |[`Solution`](problem111/solution.cpp) |
|112 |Path Sum | [`EN Description`](https://leetcode.com/problems/path-sum/description/) |[`Solution`](problem112/solution.cpp) |
|118 |Pascal's Triangle | [`EN Description`](https://leetcode.com/problems/pascals-triangle/description/) |[`Solution`](problem118/solution.cpp) |
|125 |Valid Palindrome | [`EN Description`](https://leetcode.com/problems/valid-palindrome/description/) |[`Solution`](problem125/solution.cpp) |
|136 |Single Number | [`EN Description`](https://leetcode.com/problems/single-number/description/) |[`Solution`](problem136/solution.cpp) |
|141 |Linked List Cycle | [`EN Description`](https://leetcode.com/problems/linked-list-cycle/description/) |[`Solution`](problem141/solution.cpp) |
|144 |Binary Tree Preorder Traversal | [`EN Description`](https://leetcode.com/problems/binary-tree-preorder-traversal/description/) |[`Solution`](problem144/solution.cpp) |
|145 |Binary Tree Postorder Traversal | [`EN Description`](https://leetcode.com/problems/binary-tree-postorder-traversal/description/) |[`Solution`](problem145/solution.cpp) |
|155 |Min Stack | [`EN Description`](https://leetcode.com/problems/min-stack/description/) |[`Solution`](problem155/solution.cpp) |
|168 |Excel Sheet Column Title | [`EN Description`](https://leetcode.com/problems/excel-sheet-column-title/description/) |[`Solution`](problem168/solution.cpp) |
|169 |Majority Element | [`EN Description`](https://leetcode.com/problems/majority-element/description/) |[`Solution`](problem169/solution.cpp) |
|171 |Excel Sheet Column Number | [`EN Description`](https://leetcode.com/problems/excel-sheet-column-number/description/) |[`Solution`](problem171/solution.cpp) |
|189 |Rotate Array | [`EN Description`](https://leetcode.com/problems/rotate-array/description/) |[`Solution`](problem189/solution.cpp) |
|190 |Reverse Bits | [`EN Description`](https://leetcode.com/problems/reverse-bits/description/) |[`Solution`](problem190/solution.cpp) |
|191 |Number of 1 Bits | [`EN Description`](https://leetcode.com/problems/number-of-1-bits/description/) |[`Solution`](problem191/solution.cpp) |
|198 |House Robber | [`EN Description`](https://leetcode.com/problems/house-robber/description/) |[`Solution`](problem198/solution.cpp) |
|202 |Happy Number | [`EN Description`](https://leetcode.com/problems/happy-number/description/) |[`Solution`](problem202/solution.cpp) |
|203 |Remove Linked List Elements | [`EN Description`](https://leetcode.com/problems/remove-linked-list-elements/description/) |[`Solution`](problem203/solution.cpp) |
|206 |Reverse Linked List | [`EN Description`](https://leetcode.com/problems/reverse-linked-list/description/) |[`Solution`](problem206/solution.cpp) |
|217 |Contains Duplicate | [`EN Description`](https://leetcode.com/problems/contains-duplicate/description/) |[`Solution`](problem217/solution.cpp) |
|226 |Invert Binary Tree | [`EN Description`](https://leetcode.com/problems/invert-binary-tree/description/) |[`Solution`](problem226/solution.cpp) |
|231 |Power of Two | [`EN Description`](https://leetcode.com/problems/power-of-two/description/) |[`Solution`](problem231/solution.cpp) |
|237 |Delete Node in a Linked List | [`EN Description`](https://leetcode.com/problems/delete-node-in-a-linked-list/description/) |[`Solution`](problem237/solution.cpp) |
|242 |Valid Anagram | [`EN Description`](https://leetcode.com/problems/valid-anagram/description/) |[`Solution`](problem242/solution.cpp) |
|257 |Binary Tree Paths | [`EN Description`](https://leetcode.com/problems/binary-tree-paths/description/) |[`Solution`](problem257/solution.cpp) |
|258 |Add Digits | [`EN Description`](https://leetcode.com/problems/add-digits/description/) |[`Solution`](problem258/solution.cpp) |
|263 |Ugly Number | [`EN Description`](https://leetcode.com/problems/ugly-number/description/) |[`Solution`](problem263/solution.cpp) |
|268 |Missing Number | [`EN Description`](https://leetcode.com/problems/missing-number/description/) |[`Solution`](problem268/solution.cpp) |
|278 |First Bad Version | [`EN Description`](https://leetcode.com/problems/first-bad-version/description/) |[`Solution`](problem278/solution.cpp) |
|283 |Move Zeroes | [`EN Description`](https://leetcode.com/problems/move-zeroes/description/) |[`Solution`](problem283/solution.cpp) |
|292 |Nim Game | [`EN Description`](https://leetcode.com/problems/nim-game/description/) |[`Solution`](problem292/solution.cpp) |
|322 |Coin Change | [`EN Description`](https://leetcode.com/problems/coin-change/description/) |[`Solution`](problem322/solution.cpp) |
|326 |Power of Three | [`EN Description`](https://leetcode.com/problems/power-of-three/description/) |[`Solution`](problem326/solution.cpp) |
|338 |Counting Bits | [`EN Description`](https://leetcode.com/problems/counting-bits/description/) |[`Solution`](problem338/solution.cpp) |
|342 |Power of Four | [`EN Description`](https://leetcode.com/problems/power-of-four/description/) |[`Solution`](problem342/solution.cpp) |
|344 |Reverse String | [`EN Description`](https://leetcode.com/problems/reverse-string/description/) |[`Solution`](problem344/solution.cpp) |
|345 |Reverse Vowels of a String | [`EN Description`](https://leetcode.com/problems/reverse-vowels-of-a-string/description/) |[`Solution`](problem345/solution.cpp) |
|349 |Intersection of Two Arrays | [`EN Description`](https://leetcode.com/problems/intersection-of-two-arrays/description/) |[`Solution`](problem349/solution.cpp) |
|350 |Intersection of Two Arrays II | [`EN Description`](https://leetcode.com/problems/intersection-of-two-arrays-ii/description/) |[`Solution`](problem350/solution.cpp) |
|367 |Valid Perfect Square | [`EN Description`](https://leetcode.com/problems/valid-perfect-square/description/) |[`Solution`](problem367/solution.cpp) |
|374 |Guess Number Higher or Lower | [`EN Description`](https://leetcode.com/problems/guess-number-higher-or-lower/description/) |[`Solution`](problem374/solution.cpp) |
|383 |Ransom Note | [`EN Description`](https://leetcode.com/problems/ransom-note/description/) |[`Solution`](problem383/solution.cpp) |
|402 |Remove K Digits | [`EN Description`](https://leetcode.com/problems/remove-k-digits/description/) |[`Solution`](problem402/solution.cpp) |
|404 |Sum of Left Leaves | [`EN Description`](https://leetcode.com/problems/sum-of-left-leaves/description/) |[`Solution`](problem404/solution.cpp) |
|409 |Longest Palindrome | [`EN Description`](https://leetcode.com/problems/longest-palindrome/description/) |[`Solution`](problem409/solution.cpp) |
|412 |Fizz Buzz | [`EN Description`](https://leetcode.com/problems/fizz-buzz/description/) |[`Solution`](problem412/solution.cpp) |
|495 |Teemo Attacking | [`EN Description`](https://leetcode.com/problems/teemo-attacking/description/) |[`Solution`](problem495/solution.cpp) |
|509 |Fibonacci Number | [`EN Description`](https://leetcode.com/problems/fibonacci-number/description/) |[`Solution`](problem509/solution.cpp) |
|520 |Detect Capital | [`EN Description`](https://leetcode.com/problems/detect-capital/description/) |[`Solution`](problem520/solution.cpp) |
|541 |Reverse String II | [`EN Description`](https://leetcode.com/problems/reverse-string-ii/description/) |[`Solution`](problem541/solution.cpp) |
|543 |Diameter of Binary Tree | [`EN Description`](https://leetcode.com/problems/diameter-of-binary-tree/description/) |[`Solution`](problem543/solution.cpp) |
|557 |Reverse Words in a String III | [`EN Description`](https://leetcode.com/problems/reverse-words-in-a-string-iii/description/) |[`Solution`](problem557/solution.cpp) |
|572 |Subtree of Another Tree | [`EN Description`](https://leetcode.com/problems/subtree-of-another-tree/description/) |[`Solution`](problem572/solution.cpp) |
|605 |Can Place Flowers | [`EN Description`](https://leetcode.com/problems/can-place-flowers/description/) |[`Solution`](problem605/solution.cpp) |
|654 |Maximum Binary Tree | [`EN Description`](https://leetcode.com/problems/maximum-binary-tree/description/) |[`Solution`](problem654/solution.cpp) |
|701 |Insert into a Binary Search Tree | [`EN Description`](https://leetcode.com/problems/insert-into-a-binary-search-tree/description/) |[`Solution`](problem701/solution.cpp) |
|704 |Binary Search | [`EN Description`](https://leetcode.com/problems/binary-search/description/) |[`Solution`](problem704/solution.cpp) |
|709 |To Lower Case | [`EN Description`](https://leetcode.com/problems/to-lower-case/description/) |[`Solution`](problem709/solution.cpp) |
|746 |Min Cost Climbing Stairs | [`EN Description`](https://leetcode.com/problems/min-cost-climbing-stairs/description/) |[`Solution`](problem746/solution.cpp) |
|771 |Jewels and Stones | [`EN Description`](https://leetcode.com/problems/jewels-and-stones/description/) |[`Solution`](problem771/solution.cpp) |
|876 |Middle of the Linked List | [`EN Description`](https://leetcode.com/problems/middle-of-the-linked-list/description/) |[`Solution`](problem876/solution.cpp) |
|917 |Reverse Only Letters | [`EN Description`](https://leetcode.com/problems/reverse-only-letters/description/) |[`Solution`](problem917/solution.cpp) |
|945 |Minimum Increment Make Array Unique | [`EN Description`](https://leetcode.com/problems/minimum-increment-to-make-array-unique/description/) |[`Solution`](problem945/solution.cpp) |
|977 |Squares of a Sorted Array | [`EN Description`](https://leetcode.com/problems/squares-of-a-sorted-array/description/) |[`Solution`](problem977/solution.cpp) |
|1002 |Find Common Characters | [`EN Description`](https://leetcode.com/problems/find-common-characters/description/) |[`Solution`](problem1002/solution.cpp) |
|1025 |Divisor Game | [`EN Description`](https://leetcode.com/problems/divisor-game/description/) |[`Solution`](problem1025/solution.cpp) |
|1051 |Height Checker | [`EN Description`](https://leetcode.com/problems/height-checker/description/) |[`Solution`](problem1051/solution.cpp) |
|1114 |Print in Order | [`EN Description`](https://leetcode.com/problems/print-in-order/description/) |[`Solution`](problem1114/solution.cpp) |
|1115 |Print FooBar Alternately | [`EN Description`](https://leetcode.com/problems/print-foobar-alternately/description/) |[`Solution`](problem1115/solution.cpp) |
|1116 |Print Zero Even Odd | [`EN Description`](https://leetcode.com/problems/print-zero-even-odd/description/) |[`Solution`](problem1116/solution.cpp) |
|1117 |Building H2O | [`EN Description`](https://leetcode.com/problems/building-h2o/description/) |[`Solution`](problem1117/solution.cpp) |
|1122 |Relative Sort Array | [`EN Description`](https://leetcode.com/problems/relative-sort-array/description/) |[`Solution`](problem1122/solution.cpp) |
|1275 |Find Winner on a Tic Tac Toe Game | [`EN Description`](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/description/) |[`Solution`](problem1275/solution.cpp) |
|1448 |Count Good Nodes in Binary Tree | [`EN Description`](https://leetcode.com/problems/count-good-nodes-in-binary-tree/description/) |[`Solution`](problem1448/solution.cpp) |
|1470 |Shuffle the Array | [`EN Description`](https://leetcode.com/problems/shuffle-the-array/description/) |[`Solution`](problem1470/solution.cpp) |
|1689 |Partitioning Into Deci-Binary Numbers | [`EN Description`](https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/description/) |[`Solution`](problem1689/solution.cpp) |
|1929 |Concatenation of Array | [`EN Description`](https://leetcode.com/problems/concatenation-of-array/description/) |[`Solution`](problem1929/solution.cpp) |
|1979 |Find Greatest Common Divisor of Array | [`EN Description`](https://leetcode.com/problems/find-greatest-common-divisor-of-array/description/) |[`Solution`](problem1979/solution.cpp) |
|2037 |Minimum Moves to Seat Everyone | [`EN Description`](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/description/) |[`Solution`](problem2037/solution.cpp) |
|2095 |Delete the Middle Node of a Linked List | [`EN Description`](https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/description/) |[`Solution`](problem2095/solution.cpp) |
|2129 |Capitalize the Title | [`EN Description`](https://leetcode.com/problems/capitalize-the-title/description/) |[`Solution`](problem2129/solution.cpp) |
|2194 |Cells in a Range on an Excel Sheet | [`EN Description`](https://leetcode.com/problems/cells-in-a-range-on-an-excel-sheet/description/) |[`Solution`](problem2194/solution.cpp) |
|2224 |Minimum Number to Convert Time | [`EN Description`](https://leetcode.com/problems/minimum-number-of-operations-to-convert-time/description/) |[`Solution`](problem2224/solution.cpp) |
|2248 |Intersection of Multiple Arrays | [`EN Description`](https://leetcode.com/problems/intersection-of-multiple-arrays/description/) |[`Solution`](problem2248/solution.cpp) |
|2315 |Count Asterisks | [`EN Description`](https://leetcode.com/problems/count-asterisks/description/) |[`Solution`](problem2315/solution.cpp) |
|2347 |Best Poker Hand | [`EN Description`](https://leetcode.com/problems/best-poker-hand/description/) |[`Solution`](problem2347/solution.cpp) |
|2404 |Most Frequent Even Element | [`EN Description`](https://leetcode.com/problems/most-frequent-even-element/description/) |[`Solution`](problem2404/solution.cpp) |
|2413 |Smallest Even Multiple | [`EN Description`](https://leetcode.com/problems/smallest-even-multiple/description/) |[`Solution`](problem2413/solution.cpp) |
|2427 |Number of Common Factors | [`EN Description`](https://leetcode.com/problems/number-of-common-factors/description/) |[`Solution`](problem2427/solution.cpp) |
|2446 |Determine if Two Events Have Conflict | [`EN Description`](https://leetcode.com/problems/determine-if-two-events-have-conflict/description/) |[`Solution`](problem2446/solution.cpp) |
|2469 |Convert the Temperature | [`EN Description`](https://leetcode.com/problems/convert-the-temperature/description/) |[`Solution`](problem2469/solution.cpp) |
|2481 |Minimum Cuts to Divide a Circle | [`EN Description`](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/description/) |[`Solution`](problem2481/solution.cpp) |
|2520 |Count the Digits That Divide a Number | [`EN Description`](https://leetcode.com/problems/count-the-digits-that-divide-a-number/description/) |[`Solution`](problem2520/solution.cpp) |
|2525 |Categorize Box According to Criteria | [`EN Description`](https://leetcode.com/problems/categorize-box-according-to-criteria/description/) |[`Solution`](problem2525/solution.cpp) |
|2540 |Minimum Common Value | [`EN Description`](https://leetcode.com/problems/minimum-common-value/description/) |[`Solution`](problem2540/solution.cpp) |
|2579 |Count Total Number of Colored Cells | [`EN Description`](https://leetcode.com/problems/count-total-number-of-colored-cells/description/) |[`Solution`](problem2579/solution.cpp) |
|2807 |Insert GCD in Linked List | [`EN Description`](https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list/description/) |[`Solution`](problem2807/solution.cpp) |
|2810 |Faulty Keyboard | [`EN Description`](https://leetcode.com/problems/faulty-keyboard/description/) |[`Solution`](problem2810/solution.cpp) |
|2848 |Points That Intersect With Cars | [`EN Description`](https://leetcode.com/problems/points-that-intersect-with-cars/description/) |[`Solution`](problem2848/solution.cpp) |
|3024 |Type of Triangle | [`EN Description`](https://leetcode.com/problems/type-of-triangle/description/) |[`Solution`](problem3024/solution.cpp) |
|3065 |Minimum Operations Threshold Value I | [`EN Description`](https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-i/description/) |[`Solution`](problem3065/solution.cpp) |
|3110 |Score of a String | [`EN Description`](https://leetcode.com/problems/score-of-a-string/description/) |[`Solution`](problem3110/solution.cpp) |
