{"id":15047407,"url":"https://github.com/dpetrosy/leetcode","last_synced_at":"2026-02-28T15:01:05.045Z","repository":{"id":217294071,"uuid":"743496127","full_name":"dpetrosy/LeetCode","owner":"dpetrosy","description":"In this repository, I store my LeetCode solved problems.","archived":false,"fork":false,"pushed_at":"2024-07-04T20:58:07.000Z","size":467,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-04T08:57:30.417Z","etag":null,"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"],"latest_commit_sha":null,"homepage":"https://leetcode.com","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/dpetrosy.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-01-15T11:10:56.000Z","updated_at":"2024-07-04T20:58:10.000Z","dependencies_parsed_at":"2025-03-02T11:26:38.487Z","dependency_job_id":"71ae43fe-96bc-4f99-a891-0343bd474a29","html_url":"https://github.com/dpetrosy/LeetCode","commit_stats":null,"previous_names":["dpetrosy/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/dpetrosy/LeetCode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dpetrosy","download_url":"https://codeload.github.com/dpetrosy/LeetCode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FLeetCode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29938962,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-28T13:49:17.081Z","status":"ssl_error","status_checked_at":"2026-02-28T13:48:50.396Z","response_time":90,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["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"],"created_at":"2024-09-24T20:57:53.748Z","updated_at":"2026-02-28T15:01:05.020Z","avatar_url":"https://github.com/dpetrosy.png","language":"C++","readme":"\u003ca name=\"readme-top\"\u003e\u003c/a\u003e\n\u003cdiv align=\"center\"\u003e\n  \u003c!-- Logo --\u003e\n  \u003ca href=\"https://github.com/dpetrosy/LeetCode\"\u003e\n  \u003cimg src=\"logo.png\" alt=\"Logo\" width=\"80\" height=\"95\"\u003e\n  \u003c/a\u003e\n\n  \u003c!-- Project Name --\u003e\n  \u003ch1\u003eLeetCode Problems\u003c/h1\u003e\n\n  \u003c!-- Badges --\u003e\n  \u003cp\u003e\n    \u003cimg src=\"https://img.shields.io/github/repo-size/dpetrosy/LeetCode?style=for-the-badge\u0026logo=github\"\u003e\n    \u003cimg src=\"https://img.shields.io/github/languages/count/dpetrosy/LeetCode?style=for-the-badge\u0026logo=\" /\u003e\n    \u003cimg src=\"https://img.shields.io/github/languages/top/dpetrosy/LeetCode?style=for-the-badge\" /\u003e\n    \u003cimg src=\"https://img.shields.io/github/last-commit/dpetrosy/LeetCode?style=for-the-badge\" /\u003e\n  \u003c/p\u003e\n\n  \u003ch3\u003e\n      \u003ca href=\"#-about-repository\"\u003e📜 About Repository\u003c/a\u003e\n    \u003cspan\u003e · \u003c/span\u003e\n      \u003ca href=\"#-problem-list\"\u003e📑 Problem List\u003c/a\u003e\n  \u003c/h3\u003e\n\u003c/div\u003e\n\n---\n\n## 📜 About Repository\n\nIn this repository, I store my solved LeetCode problems.\n* [Link to LeetCode](https://leetcode.com/)\n* [Link to My Profile](https://leetcode.com/u/dpetrosy/)\n\n## 📑 Problem List\n\n|#      |TITLE                                   |DESCRIPTION                                                                                                                 |SOLUTION                                |\n|:-----:|:--------------------------------------:|:--------------------------------------------------------------------------------------------------------------------------:|:--------------------------------------:|\n|01\t    |Two Sum                                 | [`EN Description`](https://leetcode.com/problems/two-sum/description/)\t                                                    |[`Solution`](problem01/solution.cpp)    |\n|03\t    |Longest Substring Without Repeats       | [`EN Description`](https://leetcode.com/problems/longest-substring-without-repeating-characters/description/)\t            |[`Solution`](problem03/solution.cpp)    |\n|08\t    |String to Integer (atoi)                | [`EN Description`](https://leetcode.com/problems/string-to-integer-atoi/description/)\t                                    |[`Solution`](problem08/solution.cpp)    |\n|09\t    |Palindrome Number                       | [`EN Description`](https://leetcode.com/problems/palindrome-number/description/)\t                                          |[`Solution`](problem09/solution.cpp)    |\n|12\t    |Integer to Roman                        | [`EN Description`](https://leetcode.com/problems/integer-to-roman/description/)\t                                          |[`Solution`](problem12/solution.cpp)    |\n|13\t    |Roman to Integer                        | [`EN Description`](https://leetcode.com/problems/roman-to-integer/description/)\t                                          |[`Solution`](problem13/solution.cpp)    |\n|14\t    |Longest Common Prefix                   | [`EN Description`](https://leetcode.com/problems/longest-common-prefix/description/)\t                                      |[`Solution`](problem14/solution.cpp)    |\n|19\t    |Remove Nth Node From End of List        | [`EN Description`](https://leetcode.com/problems/remove-nth-node-from-end-of-list/description/)\t                          |[`Solution`](problem19/solution.cpp)    |\n|20\t    |Valid Parentheses                       | [`EN Description`](https://leetcode.com/problems/valid-parentheses/description/)\t                                          |[`Solution`](problem20/solution.cpp)    |\n|26\t    |Remove Duplicates from Sorted Array     | [`EN Description`](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/)\t                        |[`Solution`](problem26/solution.cpp)    |\n|27\t    |Remove Element                          | [`EN Description`](https://leetcode.com/problems/remove-element/description/)\t                                            |[`Solution`](problem27/solution.cpp)    |\n|28\t    |Find the Index of the First Occurrence  | [`EN Description`](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/description/)\t        |[`Solution`](problem28/solution.cpp)    |\n|35\t    |Search Insert Position                  | [`EN Description`](https://leetcode.com/problems/search-insert-position/description/)\t                                    |[`Solution`](problem35/solution.cpp)    |\n|50\t    |Pow(x, n)                               | [`EN Description`](https://leetcode.com/problems/powx-n/description/)\t                                                    |[`Solution`](problem50/solution.cpp)    |\n|56\t    |Merge Intervals                         | [`EN Description`](https://leetcode.com/problems/merge-intervals/description/)\t                                            |[`Solution`](problem56/solution.cpp)    |\n|58\t    |Length of Last Word                     | [`EN Description`](https://leetcode.com/problems/length-of-last-word/description/)\t                                        |[`Solution`](problem58/solution.cpp)    |\n|66\t    |Plus One                                | [`EN Description`](https://leetcode.com/problems/plus-one/description/)        \t                                          |[`Solution`](problem66/solution.cpp)    |\n|69\t    |Sqrt(x)                                 | [`EN Description`](https://leetcode.com/problems/sqrtx/description/)        \t                                              |[`Solution`](problem69/solution.cpp)    |\n|70\t    |Climbing Stairs                         | [`EN Description`](https://leetcode.com/problems/climbing-stairs/description/)        \t                                    |[`Solution`](problem70/solution.cpp)    |\n|75\t    |Sort Colors                             | [`EN Description`](https://leetcode.com/problems/sort-colors/description/)        \t                                        |[`Solution`](problem75/solution.cpp)    |\n|83\t    |Remove Duplicates from Sorted List      | [`EN Description`](https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/)        \t                |[`Solution`](problem83/solution.cpp)    |\n|88\t    |Merge Sorted Array                      | [`EN Description`](https://leetcode.com/problems/merge-sorted-array/description/)        \t                                |[`Solution`](problem88/solution.cpp)    |\n|94\t    |Binary Tree Inorder Traversal           | [`EN Description`](https://leetcode.com/problems/binary-tree-inorder-traversal/description/)        \t                      |[`Solution`](problem94/solution.cpp)    |\n|100\t  |Same Tree                               | [`EN Description`](https://leetcode.com/problems/same-tree/description/)        \t                                          |[`Solution`](problem100/solution.cpp)   |\n|102\t  |Binary Tree Level Order Traversal       | [`EN Description`](https://leetcode.com/problems/binary-tree-level-order-traversal/description/)                           |[`Solution`](problem102/solution.cpp)   |\n|104\t  |Maximum Depth of Binary Tree            | [`EN Description`](https://leetcode.com/problems/maximum-depth-of-binary-tree/description/)                                |[`Solution`](problem104/solution.cpp)   |\n|108\t  |Convert Sorted Array to Binary Tree     | [`EN Description`](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/)                  |[`Solution`](problem108/solution.cpp)   |\n|110\t  |Balanced Binary Tree                    | [`EN Description`](https://leetcode.com/problems/balanced-binary-tree/description/)                                        |[`Solution`](problem110/solution.cpp)   |\n|111\t  |Minimum Depth of Binary Tree            | [`EN Description`](https://leetcode.com/problems/minimum-depth-of-binary-tree/description/)                                |[`Solution`](problem111/solution.cpp)   |\n|112\t  |Path Sum                                | [`EN Description`](https://leetcode.com/problems/path-sum/description/)                                                    |[`Solution`](problem112/solution.cpp)   |\n|118\t  |Pascal's Triangle                       | [`EN Description`](https://leetcode.com/problems/pascals-triangle/description/)                                            |[`Solution`](problem118/solution.cpp)   |\n|125\t  |Valid Palindrome                        | [`EN Description`](https://leetcode.com/problems/valid-palindrome/description/)        \t                                  |[`Solution`](problem125/solution.cpp)   |\n|136    |Single Number                           | [`EN Description`](https://leetcode.com/problems/single-number/description/)     \t                                        |[`Solution`](problem136/solution.cpp)   |\n|141    |Linked List Cycle                       | [`EN Description`](https://leetcode.com/problems/linked-list-cycle/description/)     \t                                    |[`Solution`](problem141/solution.cpp)   |\n|144    |Binary Tree Preorder Traversal          | [`EN Description`](https://leetcode.com/problems/binary-tree-preorder-traversal/description/)     \t                        |[`Solution`](problem144/solution.cpp)   |\n|145    |Binary Tree Postorder Traversal         | [`EN Description`](https://leetcode.com/problems/binary-tree-postorder-traversal/description/)     \t                      |[`Solution`](problem145/solution.cpp)   |\n|155    |Min Stack                               | [`EN Description`](https://leetcode.com/problems/min-stack/description/)     \t                                            |[`Solution`](problem155/solution.cpp)   |\n|168    |Excel Sheet Column Title                | [`EN Description`](https://leetcode.com/problems/excel-sheet-column-title/description/)                                    |[`Solution`](problem168/solution.cpp)   |\n|169    |Majority Element                        | [`EN Description`](https://leetcode.com/problems/majority-element/description/)                                            |[`Solution`](problem169/solution.cpp)   |\n|171    |Excel Sheet Column Number               | [`EN Description`](https://leetcode.com/problems/excel-sheet-column-number/description/)                                   |[`Solution`](problem171/solution.cpp)   |\n|189    |Rotate Array                            | [`EN Description`](https://leetcode.com/problems/rotate-array/description/)                                                |[`Solution`](problem189/solution.cpp)   |\n|190    |Reverse Bits                            | [`EN Description`](https://leetcode.com/problems/reverse-bits/description/)                                                |[`Solution`](problem190/solution.cpp)   |\n|191    |Number of 1 Bits                        | [`EN Description`](https://leetcode.com/problems/number-of-1-bits/description/)                                            |[`Solution`](problem191/solution.cpp)   |\n|198    |House Robber                            | [`EN Description`](https://leetcode.com/problems/house-robber/description/)                                                |[`Solution`](problem198/solution.cpp)   |\n|202    |Happy Number                            | [`EN Description`](https://leetcode.com/problems/happy-number/description/)                                                |[`Solution`](problem202/solution.cpp)   |\n|203    |Remove Linked List Elements             | [`EN Description`](https://leetcode.com/problems/remove-linked-list-elements/description/)                                 |[`Solution`](problem203/solution.cpp)   |\n|206    |Reverse Linked List                     | [`EN Description`](https://leetcode.com/problems/reverse-linked-list/description/)                                         |[`Solution`](problem206/solution.cpp)   |\n|217    |Contains Duplicate                      | [`EN Description`](https://leetcode.com/problems/contains-duplicate/description/)                                          |[`Solution`](problem217/solution.cpp)   |\n|226    |Invert Binary Tree                      | [`EN Description`](https://leetcode.com/problems/invert-binary-tree/description/)                                          |[`Solution`](problem226/solution.cpp)   |\n|231    |Power of Two                            | [`EN Description`](https://leetcode.com/problems/power-of-two/description/)                                                |[`Solution`](problem231/solution.cpp)   |\n|237    |Delete Node in a Linked List            | [`EN Description`](https://leetcode.com/problems/delete-node-in-a-linked-list/description/)                                |[`Solution`](problem237/solution.cpp)   |\n|242    |Valid Anagram                           | [`EN Description`](https://leetcode.com/problems/valid-anagram/description/)                                               |[`Solution`](problem242/solution.cpp)   |\n|257    |Binary Tree Paths                       | [`EN Description`](https://leetcode.com/problems/binary-tree-paths/description/)                                           |[`Solution`](problem257/solution.cpp)   |\n|258    |Add Digits                              | [`EN Description`](https://leetcode.com/problems/add-digits/description/)                                                  |[`Solution`](problem258/solution.cpp)   |\n|263    |Ugly Number                             | [`EN Description`](https://leetcode.com/problems/ugly-number/description/)                                                 |[`Solution`](problem263/solution.cpp)   |\n|268    |Missing Number                          | [`EN Description`](https://leetcode.com/problems/missing-number/description/)                                              |[`Solution`](problem268/solution.cpp)   |\n|278    |First Bad Version                       | [`EN Description`](https://leetcode.com/problems/first-bad-version/description/)                                           |[`Solution`](problem278/solution.cpp)   |\n|283    |Move Zeroes                             | [`EN Description`](https://leetcode.com/problems/move-zeroes/description/)                                                 |[`Solution`](problem283/solution.cpp)   |\n|292    |Nim Game                                | [`EN Description`](https://leetcode.com/problems/nim-game/description/)                                                    |[`Solution`](problem292/solution.cpp)   |\n|322    |Coin Change                             | [`EN Description`](https://leetcode.com/problems/coin-change/description/)                                                 |[`Solution`](problem322/solution.cpp)   |\n|326    |Power of Three                          | [`EN Description`](https://leetcode.com/problems/power-of-three/description/)                                              |[`Solution`](problem326/solution.cpp)   |\n|338    |Counting Bits                           | [`EN Description`](https://leetcode.com/problems/counting-bits/description/)                                               |[`Solution`](problem338/solution.cpp)   |\n|342    |Power of Four                           | [`EN Description`](https://leetcode.com/problems/power-of-four/description/)                                               |[`Solution`](problem342/solution.cpp)   |\n|344    |Reverse String                          | [`EN Description`](https://leetcode.com/problems/reverse-string/description/)                                              |[`Solution`](problem344/solution.cpp)   |\n|345    |Reverse Vowels of a String              | [`EN Description`](https://leetcode.com/problems/reverse-vowels-of-a-string/description/)                                  |[`Solution`](problem345/solution.cpp)   |\n|349    |Intersection of Two Arrays              | [`EN Description`](https://leetcode.com/problems/intersection-of-two-arrays/description/)                                  |[`Solution`](problem349/solution.cpp)   |\n|350    |Intersection of Two Arrays II           | [`EN Description`](https://leetcode.com/problems/intersection-of-two-arrays-ii/description/)                               |[`Solution`](problem350/solution.cpp)   |\n|367    |Valid Perfect Square                    | [`EN Description`](https://leetcode.com/problems/valid-perfect-square/description/)                                        |[`Solution`](problem367/solution.cpp)   |\n|374    |Guess Number Higher or Lower            | [`EN Description`](https://leetcode.com/problems/guess-number-higher-or-lower/description/)                                |[`Solution`](problem374/solution.cpp)   |\n|383    |Ransom Note                             | [`EN Description`](https://leetcode.com/problems/ransom-note/description/)                                                 |[`Solution`](problem383/solution.cpp)   |\n|402    |Remove K Digits                         | [`EN Description`](https://leetcode.com/problems/remove-k-digits/description/)                                             |[`Solution`](problem402/solution.cpp)   |\n|404    |Sum of Left Leaves                      | [`EN Description`](https://leetcode.com/problems/sum-of-left-leaves/description/)                                          |[`Solution`](problem404/solution.cpp)   |\n|409    |Longest Palindrome                      | [`EN Description`](https://leetcode.com/problems/longest-palindrome/description/)                                          |[`Solution`](problem409/solution.cpp)   |\n|412    |Fizz Buzz                               | [`EN Description`](https://leetcode.com/problems/fizz-buzz/description/)                                                   |[`Solution`](problem412/solution.cpp)   |\n|495    |Teemo Attacking                         | [`EN Description`](https://leetcode.com/problems/teemo-attacking/description/)                                             |[`Solution`](problem495/solution.cpp)   |\n|509    |Fibonacci Number                        | [`EN Description`](https://leetcode.com/problems/fibonacci-number/description/)                                            |[`Solution`](problem509/solution.cpp)   |\n|520    |Detect Capital                          | [`EN Description`](https://leetcode.com/problems/detect-capital/description/)                                              |[`Solution`](problem520/solution.cpp)   |\n|541    |Reverse String II                       | [`EN Description`](https://leetcode.com/problems/reverse-string-ii/description/)                                           |[`Solution`](problem541/solution.cpp)   |\n|543    |Diameter of Binary Tree                 | [`EN Description`](https://leetcode.com/problems/diameter-of-binary-tree/description/)                                     |[`Solution`](problem543/solution.cpp)   |\n|557    |Reverse Words in a String III           | [`EN Description`](https://leetcode.com/problems/reverse-words-in-a-string-iii/description/)                               |[`Solution`](problem557/solution.cpp)   |\n|572    |Subtree of Another Tree                 | [`EN Description`](https://leetcode.com/problems/subtree-of-another-tree/description/)                                     |[`Solution`](problem572/solution.cpp)   |\n|605    |Can Place Flowers                       | [`EN Description`](https://leetcode.com/problems/can-place-flowers/description/)                                           |[`Solution`](problem605/solution.cpp)   |\n|654    |Maximum Binary Tree                     | [`EN Description`](https://leetcode.com/problems/maximum-binary-tree/description/)                                         |[`Solution`](problem654/solution.cpp)   |\n|701    |Insert into a Binary Search Tree        | [`EN Description`](https://leetcode.com/problems/insert-into-a-binary-search-tree/description/)                            |[`Solution`](problem701/solution.cpp)   |\n|704    |Binary Search                           | [`EN Description`](https://leetcode.com/problems/binary-search/description/)                                               |[`Solution`](problem704/solution.cpp)   |\n|709    |To Lower Case                           | [`EN Description`](https://leetcode.com/problems/to-lower-case/description/)                                               |[`Solution`](problem709/solution.cpp)   |\n|746    |Min Cost Climbing Stairs                | [`EN Description`](https://leetcode.com/problems/min-cost-climbing-stairs/description/)                                    |[`Solution`](problem746/solution.cpp)   |\n|771    |Jewels and Stones                       | [`EN Description`](https://leetcode.com/problems/jewels-and-stones/description/)                                           |[`Solution`](problem771/solution.cpp)   |\n|876    |Middle of the Linked List               | [`EN Description`](https://leetcode.com/problems/middle-of-the-linked-list/description/)                                   |[`Solution`](problem876/solution.cpp)   |\n|917    |Reverse Only Letters                    | [`EN Description`](https://leetcode.com/problems/reverse-only-letters/description/)                                        |[`Solution`](problem917/solution.cpp)   |\n|945    |Minimum Increment Make Array Unique     | [`EN Description`](https://leetcode.com/problems/minimum-increment-to-make-array-unique/description/)                      |[`Solution`](problem945/solution.cpp)   |\n|977    |Squares of a Sorted Array               | [`EN Description`](https://leetcode.com/problems/squares-of-a-sorted-array/description/)                                   |[`Solution`](problem977/solution.cpp)   |\n|1002   |Find Common Characters                  | [`EN Description`](https://leetcode.com/problems/find-common-characters/description/)                                      |[`Solution`](problem1002/solution.cpp)  |\n|1025   |Divisor Game                            | [`EN Description`](https://leetcode.com/problems/divisor-game/description/)                                                |[`Solution`](problem1025/solution.cpp)  |\n|1051   |Height Checker                          | [`EN Description`](https://leetcode.com/problems/height-checker/description/)                                              |[`Solution`](problem1051/solution.cpp)  |\n|1114   |Print in Order                          | [`EN Description`](https://leetcode.com/problems/print-in-order/description/)                                              |[`Solution`](problem1114/solution.cpp)  |\n|1115   |Print FooBar Alternately                | [`EN Description`](https://leetcode.com/problems/print-foobar-alternately/description/)                                    |[`Solution`](problem1115/solution.cpp)  |\n|1116   |Print Zero Even Odd                     | [`EN Description`](https://leetcode.com/problems/print-zero-even-odd/description/)                                         |[`Solution`](problem1116/solution.cpp)  |\n|1117   |Building H2O                            | [`EN Description`](https://leetcode.com/problems/building-h2o/description/)                                                |[`Solution`](problem1117/solution.cpp)  |\n|1122   |Relative Sort Array                     | [`EN Description`](https://leetcode.com/problems/relative-sort-array/description/)                                         |[`Solution`](problem1122/solution.cpp)  |\n|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)  |\n|1448   |Count Good Nodes in Binary Tree         | [`EN Description`](https://leetcode.com/problems/count-good-nodes-in-binary-tree/description/)                             |[`Solution`](problem1448/solution.cpp)  |\n|1470   |Shuffle the Array                       | [`EN Description`](https://leetcode.com/problems/shuffle-the-array/description/)                                           |[`Solution`](problem1470/solution.cpp)  |\n|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)  |\n|1929   |Concatenation of Array                  | [`EN Description`](https://leetcode.com/problems/concatenation-of-array/description/)                                      |[`Solution`](problem1929/solution.cpp)  |\n|1979   |Find Greatest Common Divisor of Array   | [`EN Description`](https://leetcode.com/problems/find-greatest-common-divisor-of-array/description/)                       |[`Solution`](problem1979/solution.cpp)  |\n|2037   |Minimum Moves to Seat Everyone          | [`EN Description`](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone/description/)                    |[`Solution`](problem2037/solution.cpp)  |\n|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)  |\n|2129   |Capitalize the Title                    | [`EN Description`](https://leetcode.com/problems/capitalize-the-title/description/)                                        |[`Solution`](problem2129/solution.cpp)  |\n|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)  |\n|2224   |Minimum Number to Convert Time          | [`EN Description`](https://leetcode.com/problems/minimum-number-of-operations-to-convert-time/description/)                |[`Solution`](problem2224/solution.cpp)  |\n|2248   |Intersection of Multiple Arrays         | [`EN Description`](https://leetcode.com/problems/intersection-of-multiple-arrays/description/)                             |[`Solution`](problem2248/solution.cpp)  |\n|2315   |Count Asterisks                         | [`EN Description`](https://leetcode.com/problems/count-asterisks/description/)                                             |[`Solution`](problem2315/solution.cpp)  |\n|2347   |Best Poker Hand                         | [`EN Description`](https://leetcode.com/problems/best-poker-hand/description/)                                             |[`Solution`](problem2347/solution.cpp)  |\n|2404   |Most Frequent Even Element              | [`EN Description`](https://leetcode.com/problems/most-frequent-even-element/description/)                                  |[`Solution`](problem2404/solution.cpp)  |\n|2413   |Smallest Even Multiple                  | [`EN Description`](https://leetcode.com/problems/smallest-even-multiple/description/)                                      |[`Solution`](problem2413/solution.cpp)  |\n|2427   |Number of Common Factors                | [`EN Description`](https://leetcode.com/problems/number-of-common-factors/description/)                                    |[`Solution`](problem2427/solution.cpp)  |\n|2446   |Determine if Two Events Have Conflict   | [`EN Description`](https://leetcode.com/problems/determine-if-two-events-have-conflict/description/)                       |[`Solution`](problem2446/solution.cpp)  |\n|2469   |Convert the Temperature                 | [`EN Description`](https://leetcode.com/problems/convert-the-temperature/description/)                                     |[`Solution`](problem2469/solution.cpp)  |\n|2481   |Minimum Cuts to Divide a Circle         | [`EN Description`](https://leetcode.com/problems/minimum-cuts-to-divide-a-circle/description/)                             |[`Solution`](problem2481/solution.cpp)  |\n|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)  |\n|2525   |Categorize Box According to Criteria    | [`EN Description`](https://leetcode.com/problems/categorize-box-according-to-criteria/description/)                        |[`Solution`](problem2525/solution.cpp)  |\n|2540   |Minimum Common Value                    | [`EN Description`](https://leetcode.com/problems/minimum-common-value/description/)                                        |[`Solution`](problem2540/solution.cpp)  |\n|2579   |Count Total Number of Colored Cells     | [`EN Description`](https://leetcode.com/problems/count-total-number-of-colored-cells/description/)                         |[`Solution`](problem2579/solution.cpp)  |\n|2807   |Insert GCD in Linked List               | [`EN Description`](https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list/description/)              |[`Solution`](problem2807/solution.cpp)  |\n|2810   |Faulty Keyboard                         | [`EN Description`](https://leetcode.com/problems/faulty-keyboard/description/)                                             |[`Solution`](problem2810/solution.cpp)  |\n|2848   |Points That Intersect With Cars         | [`EN Description`](https://leetcode.com/problems/points-that-intersect-with-cars/description/)                             |[`Solution`](problem2848/solution.cpp)  |\n|3024   |Type of Triangle                        | [`EN Description`](https://leetcode.com/problems/type-of-triangle/description/)                                            |[`Solution`](problem3024/solution.cpp)  |\n|3065   |Minimum Operations Threshold Value I    | [`EN Description`](https://leetcode.com/problems/minimum-operations-to-exceed-threshold-value-i/description/)              |[`Solution`](problem3065/solution.cpp)  |\n|3110   |Score of a String                       | [`EN Description`](https://leetcode.com/problems/score-of-a-string/description/)                                           |[`Solution`](problem3110/solution.cpp)  |\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdpetrosy%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdpetrosy%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdpetrosy%2Fleetcode/lists"}