{"id":25862228,"url":"https://github.com/programmer-rd-ai/competitive-programming-solutions","last_synced_at":"2025-03-01T23:52:14.882Z","repository":{"id":214612745,"uuid":"736921753","full_name":"Programmer-RD-AI/Competitive-Programming-Solutions","owner":"Programmer-RD-AI","description":"A collection of my solutions to various competitive programming problems from platforms like LeetCode. This repository serves as a personal archive of my problem-solving journey, covering a range of algorithms, data structures, and problem-solving techniques.","archived":false,"fork":false,"pushed_at":"2025-02-04T09:29:23.000Z","size":49,"stargazers_count":0,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-01T23:52:04.181Z","etag":null,"topics":["algorithm","algorithms","algorithms-and-data-structures","data","datastructures","dsa","javascript","pandas","python","structures"],"latest_commit_sha":null,"homepage":"https://leetcode.com/Programmer-RD-AI/","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Programmer-RD-AI.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":"2023-12-29T09:07:47.000Z","updated_at":"2025-02-04T09:29:27.000Z","dependencies_parsed_at":null,"dependency_job_id":"c092f840-ed5d-4edb-abc3-c3463e0e07c3","html_url":"https://github.com/Programmer-RD-AI/Competitive-Programming-Solutions","commit_stats":null,"previous_names":["programmer-rd-ai/leetcode","programmer-rd-ai/competitive-programming-solutions"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Programmer-RD-AI%2FCompetitive-Programming-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Programmer-RD-AI%2FCompetitive-Programming-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Programmer-RD-AI%2FCompetitive-Programming-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Programmer-RD-AI%2FCompetitive-Programming-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Programmer-RD-AI","download_url":"https://codeload.github.com/Programmer-RD-AI/Competitive-Programming-Solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241439488,"owners_count":19963098,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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","data","datastructures","dsa","javascript","pandas","python","structures"],"created_at":"2025-03-01T23:52:14.127Z","updated_at":"2025-03-01T23:52:14.868Z","avatar_url":"https://github.com/Programmer-RD-AI.png","language":"Python","readme":"# 🏆 Competitive Programming Solutions\n\n![LeetCode](https://img.shields.io/badge/LeetCode-000000?style=for-the-badge\u0026logo=LeetCode\u0026logoColor=#d16c06)\n\nMy solutions to various competitive programming problems from different platforms. This repository serves as a personal archive of my problem-solving journey.\n\n## 🔍 Solutions\n\n### LeetCode\n\n| #    | Title                                                              | Solution                                                                                                                     | Difficulty |\n| ---- | ------------------------------------------------------------------ | ---------------------------------------------------------------------------------------------------------------------------- | ---------- |\n| 1    | Two Sum                                                            | [Python](./Leetcode/1.%20Two%20Sum.py)                                                                                       | Easy       |\n| 7    | Reverse Integer                                                    | [Python](./Leetcode/7.%20Reverse%20Integer.py)                                                                               | Medium     |\n| 9    | Palindrome Number                                                  | [Python](./Leetcode/9.%20Palindrome%20Number.py)                                                                             | Easy       |\n| 27   | Remove Element                                                     | [Python](./Leetcode/27.%20Remove%20Element.py)                                                                               | Easy       |\n| 136  | Single Number                                                      | [Python](./Leetcode/136.%20Single%20Number.py)                                                                               | Easy       |\n| 206  | Reverse Linked List                                                | [Python](./Leetcode/206.%20Reverse%20Linked%20List.py)                                                                       | Easy       |\n| 217  | Contains Duplicate                                                 | [Python](./Leetcode/217.%20Contains%20Duplicate.py)                                                                          | Easy       |\n| 226  | Invert Binary Tree                                                 | [Python](./Leetcode/226.%20Invert%20Binary%20Tree.py)                                                                        | Easy       |\n| 232  | Implement Queue using Stacks                                       | [Python](./Leetcode/232.%20Implement%20Queue%20using%20Stacks.py)                                                            | Easy       |\n| 349  | Intersection of Two Arrays                                         | [Python](./Leetcode/349.%20Intersection%20of%20Two%20Arrays.py)                                                              | Easy       |\n| 442  | Find All Duplicates in an Array                                    | [Python](./Leetcode/442.%20Find%20All%20Duplicates%20in%20an%20Array.py)                                                     | Medium     |\n| 557  | Reverse Words in a String III                                      | [Python](./Leetcode/557.%20Reverse%20Words%20in%20a%20String%20III.py)                                                       | Easy       |\n| 700  | Search in a Binary Search Tree                                     | [Python](./Leetcode/700.%20Search%20in%20a%20Binary%20Search%20Tree.py)                                                      | Easy       |\n| 771  | Jewels and Stones                                                  | [Python](./Leetcode/771.%20Jewels%20and%20Stones.py)                                                                         | Easy       |\n| 804  | Unique Morse Code Words                                            | [Python](./Leetcode/804.%20Unique%20Morse%20Code%20Words.py)                                                                 | Easy       |\n| 876  | Middle of the Linked List                                          | [Python](./Leetcode/876.%20Middle%20of%20the%20Linked%20List.py)                                                             | Easy       |\n| 938  | Range Sum of BST                                                   | [Python](./Leetcode/938.%20Range%20Sum%20of%20BST.py)                                                                        | Easy       |\n| 961  | N-Repeated Element in Size 2N Array                                | [Python](./Leetcode/961.%20N-Repeated%20Element%20in%20Size%202N%20Array.py)                                                 | Easy       |\n| 1108 | Defanging an IP Address                                            | [Python](./Leetcode/1108.%20Defanging%20an%20IP%20Address.py)                                                                | Easy       |\n| 1290 | Convert Binary Number in a Linked List to Integer                  | [Python](./Leetcode/1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer.py)                            | Easy       |\n| 1295 | Find Numbers with Even Number of Digits                            | [Python](./Leetcode/1295.%20Find%20Numbers%20with%20Even%20Number%20of%20Digits.py)                                          | Easy       |\n| 1342 | Number of Steps to Reduce a Number to Zero                         | [Python](./Leetcode/1342.%20Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero.py)                                   | Easy       |\n| 1351 | Count Negative Numbers in a Sorted Matrix                          | [Python](./Leetcode/1351.%20Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix.py)                                        | Easy       |\n| 1365 | How Many Numbers Are Smaller Than the Current Number               | [Python](./Leetcode/1365.%20How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number.py)                         | Easy       |\n| 1379 | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | [Python](./Leetcode/1379.%20Find%20a%20Corresponding%20Node%20of%20a%20Binary%20Tree%20in%20a%20Clone%20of%20That%20Tree.py) | Easy       |\n| 1431 | Kids With the Greatest Number of Candies                           | [Python](./Leetcode/1431.%20Kids%20With%20the%20Greatest%20Number%20of%20Candies.py)                                         | Easy       |\n| 1460 | Make Two Arrays Equal by Reversing Subarrays                       | [Python](./Leetcode/1460.%20Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays.py)                                     | Easy       |\n| 1470 | Shuffle the Array                                                  | [Python](./Leetcode/1470.%20Shuffle%20the%20Array.py)                                                                        | Easy       |\n| 1480 | Running Sum of 1d Array                                            | [Python](./Leetcode/1480.%20Running%20Sum%20of%201d%20Array.py)                                                              | Easy       |\n| 1486 | XOR Operation in an Array                                          | [Python](./Leetcode/1486.%20XOR%20Operation%20in%20an%20Array.py)                                                            | Easy       |\n| 1502 | Can Make Arithmetic Progression From Sequence                      | [Python](./Leetcode/1502.%20Can%20Make%20Arithmetic%20Progression%20From%20Sequence.py)                                      | Easy       |\n| 1528 | Shuffle String                                                     | [Python](./Leetcode/1528.%20Shuffle%20String.py)                                                                             | Easy       |\n| 1662 | Check If Two String Arrays are Equivalent                          | [Python](./Leetcode/1662.%20Check%20If%20Two%20String%20Arrays%20are%20Equivalent.py)                                        | Easy       |\n| 1672 | Richest Customer Wealth                                            | [Python](./Leetcode/1672.%20Richest%20Customer%20Wealth.py)                                                                  | Easy       |\n| 1678 | Goal Parser Interpretation                                         | [Python](./Leetcode/1678.%20Goal%20Parser%20Interpretation.py)                                                               | Easy       |\n| 1684 | Count the Number of Consistent Strings                             | [Python](./Leetcode/1684.%20Count%20the%20Number%20of%20Consistent%20Strings.py)                                             | Easy       |\n| 1704 | Determine if String Halves Are Alike                               | [Python](./Leetcode/1704.%20Determine%20if%20String%20Halves%20Are%20Alike.py)                                               | Easy       |\n| 1757 | Recyclable and Low Fat Products                                    | [SQL](./Leetcode/1757.%20Recyclable%20and%20Low%20Fat%20Products.sql)                                                        | Easy       |\n| 1773 | Count Items Matching a Rule                                        | [Python](./Leetcode/1773.%20Count%20Items%20Matching%20a%20Rule.py)                                                          | Easy       |\n| 1859 | Sorting the Sentence                                               | [Python](./Leetcode/1859.%20Sorting%20the%20Sentence.py)                                                                     | Easy       |\n| 1920 | Build Array from Permutation                                       | [Python](./Leetcode/1920.%20Build%20Array%20from%20Permutation.py)                                                           | Easy       |\n| 1929 | Concatenation of Array                                             | [Python](./Leetcode/1929.%20Concatenation%20of%20Array.py)                                                                   | Easy       |\n| 2011 | Final Value of Variable After Performing Operations                | [Python](./Leetcode/2011.%20Final%20Value%20of%20Variable%20After%20Performing%20Operations.py)                              | Easy       |\n| 2089 | Find Target Indices After Sorting Array                            | [Python](./Leetcode/2089.%20Find%20Target%20Indices%20After%20Sorting%20Array.py)                                            | Easy       |\n| 2108 | Find First Palindromic String in the Array                         | [Python](./Leetcode/2108.%20Find%20First%20Palindromic%20String%20in%20the%20Array.py)                                       | Easy       |\n| 2114 | Maximum Number of Words Found in Sentences                         | [Python](./Leetcode/2114.%20Maximum%20Number%20of%20Words%20Found%20in%20Sentences.py)                                       | Easy       |\n| 2149 | Rearrange Array Elements by Sign                                   | [Python](./Leetcode/2149.%20Rearrange%20Array%20Elements%20by%20Sign.py)                                                     | Medium     |\n| 2235 | Add Two Integers                                                   | [Python](./Leetcode/2235.%20Add%20Two%20Integers.py)                                                                         | Easy       |\n| 2236 | Root Equals Sum of Children                                        | [Python](./Leetcode/2236.%20Root%20Equals%20Sum%20of%20Children.py)                                                          | Easy       |\n| 2351 | First Letter to Appear Twice                                       | [Python](./Leetcode/2351.%20First%20Letter%20to%20Appear%20Twice.py)                                                         | Easy       |\n| 2413 | Smallest Even Multiple                                             | [Python](./Leetcode/2413.%20Smallest%20Even%20Multiple.py)                                                                   | Easy       |\n| 2418 | Sort the People                                                    | [Python](./Leetcode/2418.%20Sort%20the%20People.py)                                                                          | Easy       |\n| 2469 | Convert the Temperature                                            | [Python](./Leetcode/2469.%20Convert%20the%20Temperature.py)                                                                  | Easy       |\n| 2496 | Maximum Value of a String in an Array                              | [Python](./Leetcode/2496.%20Maximum%20Value%20of%20a%20String%20in%20an%20Array.py)                                          | Easy       |\n| 2651 | Calculate Delayed Arrival Time                                     | [Python](./Leetcode/2651.%20Calculate%20Delayed%20Arrival%20Time.py)                                                         | Easy       |\n| 2652 | Sum Multiples                                                      | [Python](./Leetcode/2652.%20Sum%20Multiples.py)                                                                              | Easy       |\n| 2667 | Create Hello World Function                                        | [JavaScript](./Leetcode/2667.%20Create%20Hello%20World%20Function.js)                                                        | Easy       |\n| 2678 | Number of Senior Citizens                                          | [Python](./Leetcode/2678.%20Number%20of%20Senior%20Citizens.py)                                                              | Easy       |\n| 2703 | Return Length of Arguments Passed                                  | [JavaScript](./Leetcode/2703.%20Return%20Length%20of%20Arguments%20Passed.js)                                                | Easy       |\n| 2733 | Neither Minimum nor Maximum                                        | [Python](./Leetcode/2733.%20Neither%20Minimum%20nor%20Maximum.py)                                                            | Easy       |\n| 2788 | Split Strings by Separator                                         | [Python](./Leetcode/2788.%20Split%20Strings%20by%20Separator.py)                                                             | Easy       |\n| 2798 | Number of Employees Who Met the Target                             | [Python](./Leetcode/2798.%20Number%20of%20Employees%20Who%20Met%20the%20Target.py)                                           | Easy       |\n| 2877 | Create a DataFrame from List                                       | [Python](./Leetcode/2877.%20Create%20a%20DataFrame%20from%20List.py)                                                         | Easy       |\n| 2878 | Get the Size of a DataFrame                                        | [Python](./Leetcode/2878.%20Get%20the%20Size%20of%20a%20DataFrame.py)                                                        | Easy       |\n| 2879 | Display the First Three Rows                                       | [Python](./Leetcode/2879.%20Display%20the%20First%20Three%20Rows.py)                                                         | Easy       |\n| 2881 | Create a New Column                                                | [Python](./Leetcode/2881.%20Create%20a%20New%20Column.py)                                                                    | Easy       |\n| 2884 | Modify Columns                                                     | [Python](./Leetcode/2884.%20Modify%20Columns.py)                                                                             | Easy       |\n| 2885 | Rename Columns                                                     | [Python](./Leetcode/2885.%20Rename%20Columns.py)                                                                             | Easy       |\n| 2886 | Change Data Type                                                   | [Python](./Leetcode/2886.%20Change%20Data%20Type.py)                                                                         | Easy       |\n| 2887 | Fill Missing Data                                                  | [Python](./Leetcode/2887.%20Fill%20Missing%20Data.py)                                                                        | Easy       |\n| 2888 | Reshape Data: Concatenate                                          | [Python](./Leetcode/2888.%20Reshape%20Data%3A%20Concatenate.py)                                                              | Easy       |\n| 2891 | Method Chaining                                                    | [Python](./Leetcode/2891.%20Method%20Chaining.py)                                                                            | Easy       |\n| 2894 | Divisible and Non-divisible Sums Difference                        | [Python](./Leetcode/2894.%20Divisible%20and%20Non-divisible%20Sums%20Difference.py)                                          | Easy       |\n| 2942 | Find Words Containing Character                                    | [Python](./Leetcode/2942.%20Find%20Words%20Containing%20Character.py)                                                        | Easy       |\n| 2965 | Find Missing and Repeated Values                                   | [Python](./Leetcode/2965.%20Find%20Missing%20and%20Repeated%20Values.py)                                                     | Easy       |\n\n## 🛠 Setup\n\n1. Clone the repository\n\n```bash\ngit clone https://github.com/Programmer-RD-AI/competitive-programming.git\n```\n\n2. Navigate to the problem directory\n\n```bash\ncd competitive-programming/Leetcode\n```\n\n3. Run any solution\n\n```bash\npython3 \"1. Two Sum.py\"\n```\n\n## 📝 License\n\nThis project is licensed under the GNU General Public License v3.0 - see the LICENSE file for details.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fprogrammer-rd-ai%2Fcompetitive-programming-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fprogrammer-rd-ai%2Fcompetitive-programming-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fprogrammer-rd-ai%2Fcompetitive-programming-solutions/lists"}