https://github.com/programmer-rd-ai/competitive-programming-solutions
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.
https://github.com/programmer-rd-ai/competitive-programming-solutions
algorithm algorithms algorithms-and-data-structures data datastructures dsa javascript pandas python structures
Last synced: 9 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/programmer-rd-ai/competitive-programming-solutions
- Owner: Programmer-RD-AI
- License: gpl-3.0
- Created: 2023-12-29T09:07:47.000Z (almost 2 years ago)
- Default Branch: main
- Last Pushed: 2025-02-04T09:29:23.000Z (10 months ago)
- Last Synced: 2025-03-01T23:52:04.181Z (9 months ago)
- Topics: algorithm, algorithms, algorithms-and-data-structures, data, datastructures, dsa, javascript, pandas, python, structures
- Language: Python
- Homepage: https://leetcode.com/Programmer-RD-AI/
- Size: 47.9 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# 🏆 Competitive Programming Solutions
My solutions to various competitive programming problems from different platforms. This repository serves as a personal archive of my problem-solving journey.
## 🔍 Solutions
### LeetCode
| # | Title | Solution | Difficulty |
| ---- | ------------------------------------------------------------------ | ---------------------------------------------------------------------------------------------------------------------------- | ---------- |
| 1 | Two Sum | [Python](./Leetcode/1.%20Two%20Sum.py) | Easy |
| 7 | Reverse Integer | [Python](./Leetcode/7.%20Reverse%20Integer.py) | Medium |
| 9 | Palindrome Number | [Python](./Leetcode/9.%20Palindrome%20Number.py) | Easy |
| 27 | Remove Element | [Python](./Leetcode/27.%20Remove%20Element.py) | Easy |
| 136 | Single Number | [Python](./Leetcode/136.%20Single%20Number.py) | Easy |
| 206 | Reverse Linked List | [Python](./Leetcode/206.%20Reverse%20Linked%20List.py) | Easy |
| 217 | Contains Duplicate | [Python](./Leetcode/217.%20Contains%20Duplicate.py) | Easy |
| 226 | Invert Binary Tree | [Python](./Leetcode/226.%20Invert%20Binary%20Tree.py) | Easy |
| 232 | Implement Queue using Stacks | [Python](./Leetcode/232.%20Implement%20Queue%20using%20Stacks.py) | Easy |
| 349 | Intersection of Two Arrays | [Python](./Leetcode/349.%20Intersection%20of%20Two%20Arrays.py) | Easy |
| 442 | Find All Duplicates in an Array | [Python](./Leetcode/442.%20Find%20All%20Duplicates%20in%20an%20Array.py) | Medium |
| 557 | Reverse Words in a String III | [Python](./Leetcode/557.%20Reverse%20Words%20in%20a%20String%20III.py) | Easy |
| 700 | Search in a Binary Search Tree | [Python](./Leetcode/700.%20Search%20in%20a%20Binary%20Search%20Tree.py) | Easy |
| 771 | Jewels and Stones | [Python](./Leetcode/771.%20Jewels%20and%20Stones.py) | Easy |
| 804 | Unique Morse Code Words | [Python](./Leetcode/804.%20Unique%20Morse%20Code%20Words.py) | Easy |
| 876 | Middle of the Linked List | [Python](./Leetcode/876.%20Middle%20of%20the%20Linked%20List.py) | Easy |
| 938 | Range Sum of BST | [Python](./Leetcode/938.%20Range%20Sum%20of%20BST.py) | Easy |
| 961 | N-Repeated Element in Size 2N Array | [Python](./Leetcode/961.%20N-Repeated%20Element%20in%20Size%202N%20Array.py) | Easy |
| 1108 | Defanging an IP Address | [Python](./Leetcode/1108.%20Defanging%20an%20IP%20Address.py) | Easy |
| 1290 | Convert Binary Number in a Linked List to Integer | [Python](./Leetcode/1290.%20Convert%20Binary%20Number%20in%20a%20Linked%20List%20to%20Integer.py) | Easy |
| 1295 | Find Numbers with Even Number of Digits | [Python](./Leetcode/1295.%20Find%20Numbers%20with%20Even%20Number%20of%20Digits.py) | Easy |
| 1342 | Number of Steps to Reduce a Number to Zero | [Python](./Leetcode/1342.%20Number%20of%20Steps%20to%20Reduce%20a%20Number%20to%20Zero.py) | Easy |
| 1351 | Count Negative Numbers in a Sorted Matrix | [Python](./Leetcode/1351.%20Count%20Negative%20Numbers%20in%20a%20Sorted%20Matrix.py) | Easy |
| 1365 | How Many Numbers Are Smaller Than the Current Number | [Python](./Leetcode/1365.%20How%20Many%20Numbers%20Are%20Smaller%20Than%20the%20Current%20Number.py) | Easy |
| 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 |
| 1431 | Kids With the Greatest Number of Candies | [Python](./Leetcode/1431.%20Kids%20With%20the%20Greatest%20Number%20of%20Candies.py) | Easy |
| 1460 | Make Two Arrays Equal by Reversing Subarrays | [Python](./Leetcode/1460.%20Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays.py) | Easy |
| 1470 | Shuffle the Array | [Python](./Leetcode/1470.%20Shuffle%20the%20Array.py) | Easy |
| 1480 | Running Sum of 1d Array | [Python](./Leetcode/1480.%20Running%20Sum%20of%201d%20Array.py) | Easy |
| 1486 | XOR Operation in an Array | [Python](./Leetcode/1486.%20XOR%20Operation%20in%20an%20Array.py) | Easy |
| 1502 | Can Make Arithmetic Progression From Sequence | [Python](./Leetcode/1502.%20Can%20Make%20Arithmetic%20Progression%20From%20Sequence.py) | Easy |
| 1528 | Shuffle String | [Python](./Leetcode/1528.%20Shuffle%20String.py) | Easy |
| 1662 | Check If Two String Arrays are Equivalent | [Python](./Leetcode/1662.%20Check%20If%20Two%20String%20Arrays%20are%20Equivalent.py) | Easy |
| 1672 | Richest Customer Wealth | [Python](./Leetcode/1672.%20Richest%20Customer%20Wealth.py) | Easy |
| 1678 | Goal Parser Interpretation | [Python](./Leetcode/1678.%20Goal%20Parser%20Interpretation.py) | Easy |
| 1684 | Count the Number of Consistent Strings | [Python](./Leetcode/1684.%20Count%20the%20Number%20of%20Consistent%20Strings.py) | Easy |
| 1704 | Determine if String Halves Are Alike | [Python](./Leetcode/1704.%20Determine%20if%20String%20Halves%20Are%20Alike.py) | Easy |
| 1757 | Recyclable and Low Fat Products | [SQL](./Leetcode/1757.%20Recyclable%20and%20Low%20Fat%20Products.sql) | Easy |
| 1773 | Count Items Matching a Rule | [Python](./Leetcode/1773.%20Count%20Items%20Matching%20a%20Rule.py) | Easy |
| 1859 | Sorting the Sentence | [Python](./Leetcode/1859.%20Sorting%20the%20Sentence.py) | Easy |
| 1920 | Build Array from Permutation | [Python](./Leetcode/1920.%20Build%20Array%20from%20Permutation.py) | Easy |
| 1929 | Concatenation of Array | [Python](./Leetcode/1929.%20Concatenation%20of%20Array.py) | Easy |
| 2011 | Final Value of Variable After Performing Operations | [Python](./Leetcode/2011.%20Final%20Value%20of%20Variable%20After%20Performing%20Operations.py) | Easy |
| 2089 | Find Target Indices After Sorting Array | [Python](./Leetcode/2089.%20Find%20Target%20Indices%20After%20Sorting%20Array.py) | Easy |
| 2108 | Find First Palindromic String in the Array | [Python](./Leetcode/2108.%20Find%20First%20Palindromic%20String%20in%20the%20Array.py) | Easy |
| 2114 | Maximum Number of Words Found in Sentences | [Python](./Leetcode/2114.%20Maximum%20Number%20of%20Words%20Found%20in%20Sentences.py) | Easy |
| 2149 | Rearrange Array Elements by Sign | [Python](./Leetcode/2149.%20Rearrange%20Array%20Elements%20by%20Sign.py) | Medium |
| 2235 | Add Two Integers | [Python](./Leetcode/2235.%20Add%20Two%20Integers.py) | Easy |
| 2236 | Root Equals Sum of Children | [Python](./Leetcode/2236.%20Root%20Equals%20Sum%20of%20Children.py) | Easy |
| 2351 | First Letter to Appear Twice | [Python](./Leetcode/2351.%20First%20Letter%20to%20Appear%20Twice.py) | Easy |
| 2413 | Smallest Even Multiple | [Python](./Leetcode/2413.%20Smallest%20Even%20Multiple.py) | Easy |
| 2418 | Sort the People | [Python](./Leetcode/2418.%20Sort%20the%20People.py) | Easy |
| 2469 | Convert the Temperature | [Python](./Leetcode/2469.%20Convert%20the%20Temperature.py) | Easy |
| 2496 | Maximum Value of a String in an Array | [Python](./Leetcode/2496.%20Maximum%20Value%20of%20a%20String%20in%20an%20Array.py) | Easy |
| 2651 | Calculate Delayed Arrival Time | [Python](./Leetcode/2651.%20Calculate%20Delayed%20Arrival%20Time.py) | Easy |
| 2652 | Sum Multiples | [Python](./Leetcode/2652.%20Sum%20Multiples.py) | Easy |
| 2667 | Create Hello World Function | [JavaScript](./Leetcode/2667.%20Create%20Hello%20World%20Function.js) | Easy |
| 2678 | Number of Senior Citizens | [Python](./Leetcode/2678.%20Number%20of%20Senior%20Citizens.py) | Easy |
| 2703 | Return Length of Arguments Passed | [JavaScript](./Leetcode/2703.%20Return%20Length%20of%20Arguments%20Passed.js) | Easy |
| 2733 | Neither Minimum nor Maximum | [Python](./Leetcode/2733.%20Neither%20Minimum%20nor%20Maximum.py) | Easy |
| 2788 | Split Strings by Separator | [Python](./Leetcode/2788.%20Split%20Strings%20by%20Separator.py) | Easy |
| 2798 | Number of Employees Who Met the Target | [Python](./Leetcode/2798.%20Number%20of%20Employees%20Who%20Met%20the%20Target.py) | Easy |
| 2877 | Create a DataFrame from List | [Python](./Leetcode/2877.%20Create%20a%20DataFrame%20from%20List.py) | Easy |
| 2878 | Get the Size of a DataFrame | [Python](./Leetcode/2878.%20Get%20the%20Size%20of%20a%20DataFrame.py) | Easy |
| 2879 | Display the First Three Rows | [Python](./Leetcode/2879.%20Display%20the%20First%20Three%20Rows.py) | Easy |
| 2881 | Create a New Column | [Python](./Leetcode/2881.%20Create%20a%20New%20Column.py) | Easy |
| 2884 | Modify Columns | [Python](./Leetcode/2884.%20Modify%20Columns.py) | Easy |
| 2885 | Rename Columns | [Python](./Leetcode/2885.%20Rename%20Columns.py) | Easy |
| 2886 | Change Data Type | [Python](./Leetcode/2886.%20Change%20Data%20Type.py) | Easy |
| 2887 | Fill Missing Data | [Python](./Leetcode/2887.%20Fill%20Missing%20Data.py) | Easy |
| 2888 | Reshape Data: Concatenate | [Python](./Leetcode/2888.%20Reshape%20Data%3A%20Concatenate.py) | Easy |
| 2891 | Method Chaining | [Python](./Leetcode/2891.%20Method%20Chaining.py) | Easy |
| 2894 | Divisible and Non-divisible Sums Difference | [Python](./Leetcode/2894.%20Divisible%20and%20Non-divisible%20Sums%20Difference.py) | Easy |
| 2942 | Find Words Containing Character | [Python](./Leetcode/2942.%20Find%20Words%20Containing%20Character.py) | Easy |
| 2965 | Find Missing and Repeated Values | [Python](./Leetcode/2965.%20Find%20Missing%20and%20Repeated%20Values.py) | Easy |
## 🛠 Setup
1. Clone the repository
```bash
git clone https://github.com/Programmer-RD-AI/competitive-programming.git
```
2. Navigate to the problem directory
```bash
cd competitive-programming/Leetcode
```
3. Run any solution
```bash
python3 "1. Two Sum.py"
```
## 📝 License
This project is licensed under the GNU General Public License v3.0 - see the LICENSE file for details.