Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.
Awesome Lists | Featured Topics | Projects
https://github.com/withaarzoo/leetcode-solutions

Welcome to the LeetCode Solutions repository! Here, you'll find daily solutions to LeetCode problems, complete with detailed explanations and code in multiple languages.
https://github.com/withaarzoo/leetcode-solutions
leetcode leetcode-daily-challenge leetcode-daily-solutions leetcode-practice leetcode-problems-solutions leetcode-questions leetcode-solutions
Last synced: 29 minutes ago
JSON representation
Welcome to the LeetCode Solutions repository! Here, you'll find daily solutions to LeetCode problems, complete with detailed explanations and code in multiple languages.
Host: GitHub
URL: https://github.com/withaarzoo/leetcode-solutions
Owner: withaarzoo
Created: 2024-07-01T16:05:49.000Z (6 months ago)
Default Branch: main
Last Pushed: 2024-11-17T02:44:32.000Z (about 1 month ago)
Last Synced: 2024-12-18T06:07:08.007Z (7 days ago)
Topics: leetcode, leetcode-daily-challenge, leetcode-daily-solutions, leetcode-practice, leetcode-problems-solutions, leetcode-questions, leetcode-solutions
Language: C++
Homepage:
Size: 348 KB
Stars: 66
Watchers: 6
Forks: 13
Open Issues: 0
Metadata Files:
- Readme: README.md
Awesome Lists containing this project

README

        # LeetCode Solutions

Welcome to the LeetCode Solutions repository! Here, you'll find daily solutions to LeetCode problems, complete with detailed explanations and code in multiple languages.

## Table of Contents

| Problem Number | Problem Name                   | Jump into Code                                  | Explanation                                    | Difficulty Level |

|----------------|--------------------------------|--------------------------------------------------|------------------------------------------------|------------------|

| 40            | Combination Sum II  | [C++](./Algorithms/src/40.%20Combination%20Sum%20II/Code/solution.cpp), [Java](./Algorithms/src/40.%20Combination%20Sum%20II/Code/solution.java), [JavaScript](./Algorithms/src/40.%20Combination%20Sum%20II/Code/solution.js), [Python](./Algorithms/src/40.%20Combination%20Sum%20II/Code/solution.py), [Go](./Algorithms/src/40.%20Combination%20Sum%20II/Code/solution.go) | [Explanation](./Algorithms/src/40.%20Combination%20Sum%20II/Explanation/explanation.md)   | Medium             |

| 273            | Integer to English Words  | [C++](./Algorithms/src/273.%20Integer%20to%20English%20Words/Code/solution.cpp), [Java](./Algorithms/src/273.%20Integer%20to%20English%20Words/Code/solution.java), [JavaScript](./Algorithms/src/273.%20Integer%20to%20English%20Words/Code/solution.js), [Python](./Algorithms/src/273.%20Integer%20to%20English%20Words/Code/solution.py), [Go](./Algorithms/src/273.%20Integer%20to%20English%20Words/Code/solution.go) | [Explanation](./Algorithms/src/273.%20Integer%20to%20English%20Words/Explanation/explanation.md)   | Hard             |

| 350            | Intersection of Two Arrays II  | [C++](./Algorithms/src/350.%20Intersection%20of%20Two%20Arrays%20II/Code/solution.cpp), [Java](./Algorithms/src/350.%20Intersection%20of%20Two%20Arrays%20II/Code/solution.java), [JavaScript](./Algorithms/src/350.%20Intersection%20of%20Two%20Arrays%20II/Code/solution.js), [Python](./Algorithms/src/350.%20Intersection%20of%20Two%20Arrays%20II/Code/solution.py), [Go](./Algorithms/src/350.%20Intersection%20of%20Two%20Arrays%20II/Code/solution.go) | [Explanation](./Algorithms/src/350.%20Intersection%20of%20Two%20Arrays%20II/Explanation/explanation.md)   | Easy             |

| 386            | Lexicographical Numbers  | [C++](./Algorithms/src/386.%20Lexicographical%20Numbers/Code/solution.cpp), [Java](./Algorithms/src/386.%20Lexicographical%20Numbers/Code/solution.java), [JavaScript](./Algorithms/src/386.%20Lexicographical%20Numbers/Code/solution.js), [Python](./Algorithms/src/386.%20Lexicographical%20Numbers/Code/solution.py), [Go](./Algorithms/src/386.%20Lexicographical%20Numbers/Code/solution.go) | [Explanation](./Algorithms/src/386.%20Lexicographical%20Numbers/Explanation/explanation.md)   | Medium             |

| 432            | All O`one Data Structure  | [C++](./Algorithms/src/432.%20All%20O`one%20Data%20Structure/Code/solution.cpp), [Java](./Algorithms/src/432.%20All%20O`one%20Data%20Structure/Code/solution.java), [JavaScript](./Algorithms/src/432.%20All%20O`one%20Data%20Structure/Code/solution.js), [Python](./Algorithms/src/432.%20All%20O`one%20Data%20Structure/Code/solution.py), [Go](./Algorithms/src/432.%20All%20O`one%20Data%20Structure/Code/solution.go) | [Explanation](./Algorithms/src/432.%20All%20O`one%20Data%20Structure/Explanation/explanation.md)   | Hard             |

| 440            | K-th Smallest in Lexicographical Order  | [C++](./Algorithms/src/440.%20K-th%20Smallest%20in%20Lexicographical%20Order/Code/solution.cpp), [Java](./Algorithms/src/440.%20K-th%20Smallest%20in%20Lexicographical%20Order/Code/solution.java), [JavaScript](./Algorithms/src/440.%20K-th%20Smallest%20in%20Lexicographical%20Order/Code/solution.js), [Python](./Algorithms/src/440.%20K-th%20Smallest%20in%20Lexicographical%20Order/Code/solution.py), [Go](./Algorithms/src/440.%20K-th%20Smallest%20in%20Lexicographical%20Order/Code/solution.go) | [Explanation](./Algorithms/src/440.%20K-th%20Smallest%20in%20Lexicographical%20Order/Explanation/explanation.md)   | Hard             |

| 476            | Number Complement  | [C++](./Algorithms/src/476.%20Number%20Complement/Code/solution.cpp), [Java](./Algorithms/src/476.%20Number%20Complement/Code/solution.java), [JavaScript](./Algorithms/src/476.%20Number%20Complement/Code/solution.js), [Python](./Algorithms/src/476.%20Number%20Complement/Code/solution.py), [Go](./Algorithms/src/476.%20Number%20Complement/Code/solution.go) | [Explanation](./Algorithms/src/476.%20Number%20Complement/Explanation/explanation.md)   | Easy             |

| 567            | Permutation in String  | [C++](./Algorithms/src/567.%20Permutation%20in%20String/Code/solution.cpp), [Java](./Algorithms/src/567.%20Permutation%20in%20String/Code/solution.java), [JavaScript](./Algorithms/src/567.%20Permutation%20in%20String/Code/solution.js), [Python](./Algorithms/src/567.%20Permutation%20in%20String/Code/solution.py), [Go](./Algorithms/src/567.%20Permutation%20in%20String/Code/solution.go) | [Explanation](./Algorithms/src/567.%20Permutation%20in%20String/Explanation/explanation.md)   | Medium             |

| 632            | Smallest Range Covering Elements from K Lists  | [C++](./Algorithms/src/632.%20Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/Code/solution.cpp), [Java](./Algorithms/src/632.%20Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/Code/solution.java), [JavaScript](./Algorithms/src/632.%20Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/Code/solution.js), [Python](./Algorithms/src/632.%20Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/Code/solution.py), [Go](./Algorithms/src/632.%20Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/Code/solution.go) | [Explanation](./Algorithms/src/632.%20Smallest%20Range%20Covering%20Elements%20from%20K%20Lists/Explanation/explanation.md)   | Hard             |

| 641            | Design Circular Deque  | [C++](./Algorithms/src/641.%20Design%20Circular%20Deque/Code/solution.cpp), [Java](./Algorithms/src/641.%20Design%20Circular%20Deque/Code/solution.java), [JavaScript](./Algorithms/src/641.%20Design%20Circular%20Deque/Code/solution.js), [Python](./Algorithms/src/641.%20Design%20Circular%20Deque/Code/solution.py), [Go](./Algorithms/src/641.%20Design%20Circular%20Deque/Code/solution.go) | [Explanation](./Algorithms/src/641.%20Design%20Circular%20Deque/Explanation/explanation.md)   | Medium             |

| 650            | 2 Keys Keyboard  | [C++](./Algorithms/src/650.%202%20Keys%20Keyboard/Code/solution.cpp), [Java](./Algorithms/src/650.%202%20Keys%20Keyboard/Code/solution.java), [JavaScript](./Algorithms/src/650.%202%20Keys%20Keyboard/Code/solution.js), [Python](./Algorithms/src/650.%202%20Keys%20Keyboard/Code/solution.py), [Go](./Algorithms/src/650.%202%20Keys%20Keyboard/Code/solution.go) | [Explanation](./Algorithms/src/650.%202%20Keys%20Keyboard/Explanation/explanation.md)   | Medium             |

| 664            | Strange Printer  | [C++](./Algorithms/src/664.%20Strange%20Printer/Code/solution.cpp), [Java](./Algorithms/src/664.%20Strange%20Printer/Code/solution.java), [JavaScript](./Algorithms/src/664.%20Strange%20Printer/Code/solution.js), [Python](./Algorithms/src/664.%20Strange%20Printer/Code/solution.py), [Go](./Algorithms/src/664.%20Strange%20Printer/Code/solution.go) | [Explanation](./Algorithms/src/664.%20Strange%20Printer/Explanation/explanation.md)   | Hard             |

| 670            | Maximum Swap  | [C++](./Algorithms/src/670.%20Maximum%20Swap/Code/solution.cpp), [Java](./Algorithms/src/670.%20Maximum%20Swap/Code/solution.java), [JavaScript](./Algorithms/src/670.%20Maximum%20Swap/Code/solution.js), [Python](./Algorithms/src/670.%20Maximum%20Swap/Code/solution.py), [Go](./Algorithms/src/670.%20Maximum%20Swap/Code/solution.go) | [Explanation](./Algorithms/src/670.%20Maximum%20Swap/Explanation/explanation.md)   | Medium             |

| 703            | Kth Largest Element in a Stream  | [C++](./Algorithms/src/703.%20Kth%20Largest%20Element%20in%20a%20Stream/Code/solution.cpp), [Java](./Algorithms/src/703.%20Kth%20Largest%20Element%20in%20a%20Stream/Code/solution.java), [JavaScript](./Algorithms/src/703.%20Kth%20Largest%20Element%20in%20a%20Stream/Code/solution.js), [Python](./Algorithms/src/703.%20Kth%20Largest%20Element%20in%20a%20Stream/Code/solution.py), [Go](./Algorithms/src/703.%20Kth%20Largest%20Element%20in%20a%20Stream/Code/solution.go) | [Explanation](./Algorithms/src/703.%20Kth%20Largest%20Element%20in%20a%20Stream/Explanation/explanation.md)   | Easy             |

| 719            | Find K-th Smallest Pair Distance  | [C++](./Algorithms/src/719.%20Find%20K-th%20Smallest%20Pair%20Distance/Code/solution.cpp), [Java](./Algorithms/src/719.%20Find%20K-th%20Smallest%20Pair%20Distance/Code/solution.java), [JavaScript](./Algorithms/src/719.%20Find%20K-th%20Smallest%20Pair%20Distance/Code/solution.js), [Python](./Algorithms/src/719.%20Find%20K-th%20Smallest%20Pair%20Distance/Code/solution.py), [Go](./Algorithms/src/719.%20Find%20K-th%20Smallest%20Pair%20Distance/Code/solution.go) | [Explanation](./Algorithms/src/719.%20Find%20K-th%20Smallest%20Pair%20Distance/Explanation/explanation.md)   | Hard             |

| 729            | My Calendar I  | [C++](./Algorithms/src/729.%20My%20Calendar%20I/Code/solution.cpp), [Java](./Algorithms/src/729.%20My%20Calendar%20I/Code/solution.java), [JavaScript](./Algorithms/src/729.%20My%20Calendar%20I/Code/solution.js), [Python](./Algorithms/src/729.%20My%20Calendar%20I/Code/solution.py), [Go](./Algorithms/src/729.%20My%20Calendar%20I/Code/solution.go) | [Explanation](./Algorithms/src/729.%20My%20Calendar%20I/Explanation/explanation.md)   | Medium             |

| 731            | My Calendar II  | [C++](./Algorithms/src/731.%20My%20Calendar%20II/Code/solution.cpp), [Java](./Algorithms/src/731.%20My%20Calendar%20II/Code/solution.java), [JavaScript](./Algorithms/src/731.%20My%20Calendar%20II/Code/solution.js), [Python](./Algorithms/src/731.%20My%20Calendar%20II/Code/solution.py), [Go](./Algorithms/src/731.%20My%20Calendar%20II/Code/solution.go) | [Explanation](./Algorithms/src/731.%20My%20Calendar%20II/Explanation/explanation.md)   | Medium             |

| 796            | Rotate String  | [C++](./Algorithms/src/796.%20Rotate%20String/Code/solution.cpp), [Java](./Algorithms/src/796.%20Rotate%20String/Code/solution.java), [JavaScript](./Algorithms/src/796.%20Rotate%20String/Code/solution.js), [Python](./Algorithms/src/796.%20Rotate%20String/Code/solution.py), [Go](./Algorithms/src/796.%20Rotate%20String/Code/solution.go) | [Explanation](./Algorithms/src/796.%20Rotate%20String/Explanation/explanation.md)   | Easy             |

| 840            | Magic Squares In Grid  | [C++](./Algorithms/src/840.%20Magic%20Squares%20In%20Grid/Code/solution.cpp), [Java](./Algorithms/src/840.%20Magic%20Squares%20In%20Grid/Code/solution.java), [JavaScript](./Algorithms/src/840.%20Magic%20Squares%20In%20Grid/Code/solution.js), [Python](./Algorithms/src/840.%20Magic%20Squares%20In%20Grid/Code/solution.py), [Go](./Algorithms/src/840.%20Magic%20Squares%20In%20Grid/Code/solution.go) | [Explanation](./Algorithms/src/840.%20Magic%20Squares%20In%20Grid/Explanation/explanation.md)   | Medium             |

| 862            | Shortest Subarray with Sum at Least K  | [C++](./Algorithms/src/862.%20Shortest%20Subarray%20with%20Sum%20at%20Least%20K/Code/solution.cpp), [Java](./Algorithms/src/862.%20Shortest%20Subarray%20with%20Sum%20at%20Least%20K/Code/solution.java), [JavaScript](./Algorithms/src/862.%20Shortest%20Subarray%20with%20Sum%20at%20Least%20K/Code/solution.js), [Python](./Algorithms/src/862.%20Shortest%20Subarray%20with%20Sum%20at%20Least%20K/Code/solution.py), [Go](./Algorithms/src/862.%20Shortest%20Subarray%20with%20Sum%20at%20Least%20K/Code/solution.go) | [Explanation](./Algorithms/src/862.%20Shortest%20Subarray%20with%20Sum%20at%20Least%20K/Explanation/explanation.md)   | Hard             |

| 885            | Spiral Matrix III  | [C++](./Algorithms/src/885.%20Spiral%20Matrix%20III/Code/solution.cpp), [Java](./Algorithms/src/885.%20Spiral%20Matrix%20III/Code/solution.java), [JavaScript](./Algorithms/src/885.%20Spiral%20Matrix%20III/Code/solution.js), [Python](./Algorithms/src/885.%20Spiral%20Matrix%20III/Code/solution.py), [Go](./Algorithms/src/885.%20Spiral%20Matrix%20III/Code/solution.go) | [Explanation](./Algorithms/src/885.%20Spiral%20Matrix%20III/Explanation/explanation.md)   | Medium             |

| 947            | Most Stones Removed with Same Row or Column  | [C++](./Algorithms/src/947.%20Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/Code/solution.cpp), [Java](./Algorithms/src/947.%20Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/Code/solution.java), [JavaScript](./Algorithms/src/947.%20Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/Code/solution.js), [Python](./Algorithms/src/947.%20Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/Code/solution.py), [Go](./Algorithms/src/947.%20Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/Code/solution.go) | [Explanation](./Algorithms/src/947.%20Most%20Stones%20Removed%20with%20Same%20Row%20or%20Column/Explanation/explanation.md)   | Medium             |

| 959            | Regions Cut By Slashes  | [C++](./Algorithms/src/959.%20Regions%20Cut%20By%20Slashes/Code/solution.cpp), [Java](./Algorithms/src/959.%20Regions%20Cut%20By%20Slashes/Code/solution.java), [JavaScript](./Algorithms/src/959.%20Regions%20Cut%20By%20Slashes/Code/solution.js), [Python](./Algorithms/src/959.%20Regions%20Cut%20By%20Slashes/Code/solution.py), [Go](./Algorithms/src/959.%20Regions%20Cut%20By%20Slashes/Code/solution.go) | [Explanation](./Algorithms/src/959.%20Regions%20Cut%20By%20Slashes/Explanation/explanation.md)   | Medium             |

| 962            | Maximum Width Ramp  | [C++](./Algorithms/src/962.%20Maximum%20Width%20Ramp/Code/solution.cpp), [Java](./Algorithms/src/962.%20Maximum%20Width%20Ramp/Code/solution.java), [JavaScript](./Algorithms/src/962.%20Maximum%20Width%20Ramp/Code/solution.js), [Python](./Algorithms/src/962.%20Maximum%20Width%20Ramp/Code/solution.py), [Go](./Algorithms/src/962.%20Maximum%20Width%20Ramp/Code/solution.go) | [Explanation](./Algorithms/src/962.%20Maximum%20Width%20Ramp/Explanation/explanation.md)   | Medium             |

| 1105            | Filling Bookcase Shelves  | [C++](./Algorithms/src/1105.%20Filling%20Bookcase%20Shelves/Code/solution.cpp), [Java](./Algorithms/src/1105.%20Filling%20Bookcase%20Shelves/Code/solution.java), [JavaScript](./Algorithms/src/1105.%20Filling%20Bookcase%20Shelves/Code/solution.js), [Python](./Algorithms/src/1105.%20Filling%20Bookcase%20Shelves/Code/solution.py), [Go](./Algorithms/src/1105.%20Filling%20Bookcase%20Shelves/Code/solution.go) | [Explanation](./Algorithms/src/1105.%20Filling%20Bookcase%20Shelves/Explanation/explanation.md)   | Medium             |

| 1106            | Parsing A Boolean Expression  | [C++](./Algorithms/src/1106.%20Parsing%20A%20Boolean%20Expression/Code/solution.cpp), [Java](./Algorithms/src/1106.%20Parsing%20A%20Boolean%20Expression/Code/solution.java), [JavaScript](./Algorithms/src/1106.%20Parsing%20A%20Boolean%20Expression/Code/solution.js), [Python](./Algorithms/src/1106.%20Parsing%20A%20Boolean%20Expression/Code/solution.py), [Go](./Algorithms/src/1106.%20Parsing%20A%20Boolean%20Expression/Code/solution.go) | [Explanation](./Algorithms/src/1106.%20Parsing%20A%20Boolean%20Expression/Explanation/explanation.md)   | Hard             |

| 1140            | Stone Game II  | [C++](./Algorithms/src/1140.%20Stone%20Game%20II/Code/solution.cpp), [Java](./Algorithms/src/1140.%20Stone%20Game%20II/Code/solution.java), [JavaScript](./Algorithms/src/1140.%20Stone%20Game%20II/Code/solution.js), [Python](./Algorithms/src/1140.%20Stone%20Game%20II/Code/solution.py), [Go](./Algorithms/src/1140.%20Stone%20Game%20II/Code/solution.go) | [Explanation](./Algorithms/src/1140.%20Stone%20Game%20II/Explanation/explanation.md)   | Medium             |

| 1277            | Count Square Submatrices with All Ones  | [C++](./Algorithms/src/1277.%20Count%20Square%20Submatrices%20with%20All%20Ones/Code/solution.cpp), [Java](./Algorithms/src/1277.%20Count%20Square%20Submatrices%20with%20All%20Ones/Code/solution.java), [JavaScript](./Algorithms/src/1277.%20Count%20Square%20Submatrices%20with%20All%20Ones/Code/solution.js), [Python](./Algorithms/src/1277.%20Count%20Square%20Submatrices%20with%20All%20Ones/Code/solution.py), [Go](./Algorithms/src/1277.%20Count%20Square%20Submatrices%20with%20All%20Ones/Code/solution.go) | [Explanation](./Algorithms/src/1277.%20Count%20Square%20Submatrices%20with%20All%20Ones/Explanation/explanation.md)   | Medium             |

| 1331            | Rank Transform of an Array  | [C++](./Algorithms/src/1331.%20Rank%20Transform%20of%20an%20Array/Code/solution.cpp), [Java](./Algorithms/src/1331.%20Rank%20Transform%20of%20an%20Array/Code/solution.java), [JavaScript](./Algorithms/src/1331.%20Rank%20Transform%20of%20an%20Array/Code/solution.js), [Python](./Algorithms/src/1331.%20Rank%20Transform%20of%20an%20Array/Code/solution.py), [Go](./Algorithms/src/1331.%20Rank%20Transform%20of%20an%20Array/Code/solution.go) | [Explanation](./Algorithms/src/1331.%20Rank%20Transform%20of%20an%20Array/Explanation/explanation.md)   | Easy             |

| 1381            | Design a Stack With Increment Operation  | [C++](./Algorithms/src/1381.%20Design%20a%20Stack%20With%20Increment%20Operation/Code/solution.cpp), [Java](./Algorithms/src/1381.%20Design%20a%20Stack%20With%20Increment%20Operation/Code/solution.java), [JavaScript](./Algorithms/src/1381.%20Design%20a%20Stack%20With%20Increment%20Operation/Code/solution.js), [Python](./Algorithms/src/1381.%20Design%20a%20Stack%20With%20Increment%20Operation/Code/solution.py), [Go](./Algorithms/src/1381.%20Design%20a%20Stack%20With%20Increment%20Operation/Code/solution.go) | [Explanation](./Algorithms/src/1381.%20Design%20a%20Stack%20With%20Increment%20Operation/Explanation/explanation.md)   | Medium             |

| 1405            | Longest Happy String  | [C++](./Algorithms/src/1405.%20Longest%20Happy%20String/Code/solution.cpp), [Java](./Algorithms/src/1405.%20Longest%20Happy%20String/Code/solution.java), [JavaScript](./Algorithms/src/1405.%20Longest%20Happy%20String/Code/solution.js), [Python](./Algorithms/src/1405.%20Longest%20Happy%20String/Code/solution.py), [Go](./Algorithms/src/1405.%20Longest%20Happy%20String/Code/solution.go) | [Explanation](./Algorithms/src/1405.%20Longest%20Happy%20String/Explanation/explanation.md)   | Medium             |

| 1460            | Make Two Arrays Equal by Reversing Subarrays  | [C++](./Algorithms/src/1460.%20Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/Code/solution.cpp), [Java](./Algorithms/src/1460.%20Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/Code/solution.java), [JavaScript](./Algorithms/src/1460.%20Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/Code/solution.js), [Python](./Algorithms/src/1460.%20Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/Code/solution.py), [Go](./Algorithms/src/1598.1460.%20Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/solution.go) | [Explanation](./Algorithms/src/1460.%20Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/Explanation/explanation.md)   | Easy             |

| 1497            | Check If Array Pairs Are Divisible by k  | [C++](./Algorithms/src/1497.%20Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/Code/solution.cpp), [Java](./Algorithms/src/1497.%20Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/Code/solution.java), [JavaScript](./Algorithms/src/1497.%20Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/Code/solution.js), [Python](./Algorithms/src/1497.%20Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/Code/solution.py), [Go](./Algorithms/src/1598.1497.%20Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/solution.go) | [Explanation](./Algorithms/src/1497.%20Check%20If%20Array%20Pairs%20Are%20Divisible%20by%20k/Explanation/explanation.md)   | Medium             |

| 1509            | Minimum Difference Between Largest and Smallest Value in Three Moves  | [C++](./Algorithms/src/1509.%20Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/Code/solution.cpp), [Java](./Algorithms/src/1509.%20Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/Code/solution.java), [JavaScript](./Algorithms/src/1509.%20Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/Code/solution.js), [Python](./Algorithms/src/1509.%20Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/Code/solution.py), [Go](./Algorithms/src/1509.%20Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/Code/solution.go) | [Explanation](./Algorithms/src/1509.%20Minimum%20Difference%20Between%20Largest%20and%20Smallest%20Value%20in%20Three%20Moves/Explanation/explanation.md)   | Medium             |

| 1545            | Find Kth Bit in Nth Binary String  | [C++](./Algorithms/src/1545.%20Find%20Kth%20Bit%20in%20Nth%20Binary%20String/Code/solution.cpp), [Java](./Algorithms/src/1545.%20Find%20Kth%20Bit%20in%20Nth%20Binary%20String/Code/solution.java), [JavaScript](./Algorithms/src/1545.%20Find%20Kth%20Bit%20in%20Nth%20Binary%20String/Code/solution.js), [Python](./Algorithms/src/1545.%20Find%20Kth%20Bit%20in%20Nth%20Binary%20String/Code/solution.py), [Go](./Algorithms/src/1545.%20Find%20Kth%20Bit%20in%20Nth%20Binary%20String/Code/solution.go) | [Explanation](./Algorithms/src/1545.%20Find%20Kth%20Bit%20in%20Nth%20Binary%20String/Explanation/explanation.md)   | Medium             |

| 1568            | Minimum Number of Days to Disconnect Island  | [C++](./Algorithms/src/1568.%20Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/Code/solution.cpp), [Java](./Algorithms/src/1568.%20Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/Code/solution.java), [JavaScript](./Algorithms/src/1568.%20Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/Code/solution.js), [Python](./Algorithms/src/1568.%20Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/Code/solution.py), [Go](./Algorithms/src/1568.%20Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/Code/solution.go) | [Explanation](./Algorithms/src/1568.%20Minimum%20Number%20of%20Days%20to%20Disconnect%20Island/Explanation/explanation.md)   | Hard             |

| 1574            | Shortest Subarray to be Removed to Make Array Sorted  | [C++](./Algorithms/src/1574.%20Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/Code/solution.cpp), [Java](./Algorithms/src/1574.%20Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/Code/solution.java), [JavaScript](./Algorithms/src/1574.%20Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/Code/solution.js), [Python](./Algorithms/src/1574.%20Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/Code/solution.py), [Go](./Algorithms/src/1574.%20Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/Code/solution.go) | [Explanation](./Algorithms/src/1574.%20Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/Explanation/explanation.md)   | Medium             |

| 1590            | Make Sum Divisible by P  | [C++](./Algorithms/src/1590.%20Make%20Sum%20Divisible%20by%20P/Code/solution.cpp), [Java](./Algorithms/src/1590.%20Make%20Sum%20Divisible%20by%20P/Code/solution.java), [JavaScript](./Algorithms/src/1590.%20Make%20Sum%20Divisible%20by%20P/Code/solution.js), [Python](./Algorithms/src/1590.%20Make%20Sum%20Divisible%20by%20P/Code/solution.py), [Go](./Algorithms/src/1590.%20Make%20Sum%20Divisible%20by%20P/Code/solution.go) | [Explanation](./Algorithms/src/1590.%20Make%20Sum%20Divisible%20by%20P/Explanation/explanation.md)   | Medium             |

| 1598            | Crawler Log Folder  | [C++](./Algorithms/src/1598.%20Crawler%20Log%20Folder/Code/solution.cpp), [Java](./Algorithms/src/1598.%20Crawler%20Log%20Folder/Code/solution.java), [JavaScript](./Algorithms/src/1598.%20Crawler%20Log%20Folder/Code/solution.js), [Python](./Algorithms/src/1598.%20Crawler%20Log%20Folder/Code/solution.py), [Go](./Algorithms/src/1598.%20Crawler%20Log%20Folder/Code/solution.go) | [Explanation](./Algorithms/src/1598.%20Crawler%20Log%20Folder/Explanation/explanation.md)   | Easy             |

| 1671            | Minimum Number of Removals to Make Mountain Array  | [C++](./Algorithms/src/1671.%20Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/Code/solution.cpp), [Java](./Algorithms/src/1671.%20Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/Code/solution.java), [JavaScript](./Algorithms/src/1671.%20Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/Code/solution.js), [Python](./Algorithms/src/1671.%20Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/Code/solution.py), [Go](./Algorithms/src/1598.%20Crawler%20Log%20Folder/Code/solution.go) | [Explanation](./Algorithms/src/1671.%20Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/Explanation/explanation.md)   | Hard             |

| 1701            | Average Waiting Time  | [C++](./Algorithms/src/1701.%20Average%20Waiting%20Time/Code/solution.cpp), [Java](./Algorithms/src/1701.%20Average%20Waiting%20Time/Code/solution.java), [JavaScript](./Algorithms/src/1701.%20Average%20Waiting%20Time/Code/solution.js), [Python](./Algorithms/src/1701.%20Average%20Waiting%20Time/Code/solution.py), [Go](./Algorithms/src/1701.%20Average%20Waiting%20Time/Code/solution.go) | [Explanation](./Algorithms/src/1701.%20Average%20Waiting%20Time/Explanation/explanation.md)   | Medium             |

| 1813            | Sentence Similarity III  | [C++](./Algorithms/src/1813.%20Sentence%20Similarity%20III/Code/solution.cpp), [Java](./Algorithms/src/1813.%20Sentence%20Similarity%20III/Code/solution.java), [JavaScript](./Algorithms/src/1813.%20Sentence%20Similarity%20III/Code/solution.js), [Python](./Algorithms/src/1813.%20Sentence%20Similarity%20III/Code/solution.py), [Go](./Algorithms/src/1813.%20Sentence%20Similarity%20III/Code/solution.go) | [Explanation](./Algorithms/src/1813.%20Sentence%20Similarity%20III/Explanation/explanation.md)   | Medium             |

| 1823            | Find the Winner of the Circular Game  | [C++](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Code/solution.cpp), [Java](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Code/solution.java), [JavaScript](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Code/solution.js), [Python](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Code/solution.py), [Go](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Code/solution.go) | [Explanation](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Explanation/explanation.md)   | Medium             |

| 1829            | Maximum XOR for Each Query  | [C++](./Algorithms/src/1829.%20Maximum%20XOR%20for%20Each%20Query/Code/solution.cpp), [Java](./Algorithms/src/1829.%20Maximum%20XOR%20for%20Each%20Query/Code/solution.java), [JavaScript](./Algorithms/src/1829.%20Maximum%20XOR%20for%20Each%20Query/Code/solution.js), [Python](./Algorithms/src/1829.%20Maximum%20XOR%20for%20Each%20Query/Code/solution.py), [Go](./Algorithms/src/1829.%20Maximum%20XOR%20for%20Each%20Query/Code/solution.go) | [Explanation](./Algorithms/src/1829.%20Maximum%20XOR%20for%20Each%20Query/Explanation/explanation.md)   | Medium             |

| 1894            | Find the Winner of the Circular Game  | [C++](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Code/solution.cpp), [Java](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Code/solution.java), [JavaScript](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Code/solution.js), [Python](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Code/solution.py), [Go](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Code/solution.go) | [Explanation](./Algorithms/src/1823.%20Find%20the%20Winner%20of%20the%20Circular%20Game/Explanation/explanation.md)   | Medium             |

| 1937            | Maximum Number of Points with Cost  | [C++](./Algorithms/src/1937.%20Maximum%20Number%20of%20Points%20with%20Cost/Code/solution.cpp), [Java](./Algorithms/src/1937.%20Maximum%20Number%20of%20Points%20with%20Cost/Code/solution.java), [JavaScript](./Algorithms/src/1937.%20Maximum%20Number%20of%20Points%20with%20Cost/Code/solution.js), [Python](./Algorithms/src/1937.%20Maximum%20Number%20of%20Points%20with%20Cost/Code/solution.py), [Go](./Algorithms/src/1937.%20Maximum%20Number%20of%20Points%20with%20Cost/Code/solution.go) | [Explanation](./Algorithms/src/1937.%20Maximum%20Number%20of%20Points%20with%20Cost/Explanation/explanation.md)   | Medium             |

| 1942            | The Number of the Smallest Unoccupied Chair  | [C++](./Algorithms/src/1942.%20The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/Code/solution.cpp), [Java](./Algorithms/src/1942.%20The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/Code/solution.java), [JavaScript](./Algorithms/src/1942.%20The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/Code/solution.js), [Python](./Algorithms/src/1942.%20The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/Code/solution.py), [Go](./Algorithms/src/1942.%20The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/Code/solution.go) | [Explanation](./Algorithms/src/1942.%20The%20Number%20of%20the%20Smallest%20Unoccupied%20Chair/Explanation/explanation.md)   | Medium             |

| 1957            | Delete Characters to Make Fancy String  | [C++](./Algorithms/src/1957.%20Delete%20Characters%20to%20Make%20Fancy%20String/Code/solution.cpp), [Java](./Algorithms/src/1957.%20Delete%20Characters%20to%20Make%20Fancy%20String/Code/solution.java), [JavaScript](./Algorithms/src/1957.%20Delete%20Characters%20to%20Make%20Fancy%20String/Code/solution.js), [Python](./Algorithms/src/1957.%20Delete%20Characters%20to%20Make%20Fancy%20String/Code/solution.py), [Go](./Algorithms/src/1957.%20Delete%20Characters%20to%20Make%20Fancy%20String/Code/solution.go) | [Explanation](./Algorithms/src/1957.%20Delete%20Characters%20to%20Make%20Fancy%20String/Explanation/explanation.md)   | Easy             |

| 2022            | Convert 1D Array Into 2D Array  | [C++](./Algorithms/src/2022.%20Convert%201D%20Array%20Into%202D%20Array/Code/solution.cpp), [Java](./Algorithms/src/2022.%20Convert%201D%20Array%20Into%202D%20Array/Code/solution.java), [JavaScript](./Algorithms/src/2022.%20Convert%201D%20Array%20Into%202D%20Array/Code/solution.js), [Python](./Algorithms/src/2022.%20Convert%201D%20Array%20Into%202D%20Array/Code/solution.py), [Go](./Algorithms/src/2022.%20Convert%201D%20Array%20Into%202D%20Array/Code/solution.go) | [Explanation](./Algorithms/src/2022.%20Convert%201D%20Array%20Into%202D%20Array/Explanation/explanation.md)   | Easy             |

| 2044            | Count Number of Maximum Bitwise-OR Subsets  | [C++](./Algorithms/src/2044.%20Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/Code/solution.cpp), [Java](./Algorithms/src/2044.%20Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/Code/solution.java), [JavaScript](./Algorithms/src/2044.%20Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/Code/solution.js), [Python](./Algorithms/src/2044.%20Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/Code/solution.py), [Go](./Algorithms/src/2044.%20Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/Code/solution.go) | [Explanation](./Algorithms/src/2044.%20Count%20Number%20of%20Maximum%20Bitwise-OR%20Subsets/Explanation/explanation.md)   | Medium             |

| 2053            | Kth Distinct String in an Array  | [C++](./Algorithms/src/2053.%20Kth%20Distinct%20String%20in%20an%20Array/Code/solution.cpp), [Java](./Algorithms/src/2053.%20Kth%20Distinct%20String%20in%20an%20Array/Code/solution.java), [JavaScript](./Algorithms/src/2053.%20Kth%20Distinct%20String%20in%20an%20Array/Code/solution.js), [Python](./Algorithms/src/2053.%20Kth%20Distinct%20String%20in%20an%20Array/Code/solution.py), [Go](./Algorithms/src/2053.%20Kth%20Distinct%20String%20in%20an%20Array/Code/solution.go) | [Explanation](./Algorithms/src/2053.%20Kth%20Distinct%20String%20in%20an%20Array/Explanation/explanation.md)   | Easy             |

| 2064            | Minimized Maximum of Products Distributed to Any Store  | [C++](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.cpp), [Java](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.java), [JavaScript](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.js), [Python](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.py), [Go](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Code/solution.go) | [Explanation](./Algorithms/src/2064.%20Minimized%20Maximum%20of%20Products%20Distributed%20to%20Any%20Store/Explanation/explanation.md)   | Medium             |

| 2070            | Most Beautiful Item for Each Query  | [C++](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.cpp), [Java](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.java), [JavaScript](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.js), [Python](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.py), [Go](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Code/solution.go) | [Explanation](./Algorithms/src/2070.%20Most%20Beautiful%20Item%20for%20Each%20Query/Explanation/explanation.md)   | Medium             |

| 2134            | Minimum Swaps to Group All 1's Together II  | [C++](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.cpp), [Java](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.java), [JavaScript](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.js), [Python](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.py), [Go](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Code/solution.go) | [Explanation](./Algorithms/src/2134.%20Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II/Explanation/explanation.md)   | Medium             |

| 2275            | Largest Combination With Bitwise AND Greater Than Zero  | [C++](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.cpp), [Java](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.java), [JavaScript](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.js), [Python](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.py), [Go](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Code/solution.go) | [Explanation](./Algorithms/src/2275.%20Largest%20Combination%20With%20Bitwise%20AND%20Greater%20Than%20Zero/Explanation/explanation.md)   | Medium             |

| 2406            | Divide Intervals Into Minimum Number of Groups  | [C++](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.cpp), [Java](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.java), [JavaScript](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.js), [Python](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.py), [Go](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Code/solution.go) | [Explanation](./Algorithms/src/2406.%20Divide%20Intervals%20Into%20Minimum%20Number%20of%20Groups/Explanation/explanation.md)   | Medium             |

| 2416            | Sum of Prefix Scores of Strings  | [C++](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.cpp), [Java](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.java), [JavaScript](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.js), [Python](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.py), [Go](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Code/solution.go) | [Explanation](./Algorithms/src/2416.%20Sum%20of%20Prefix%20Scores%20of%20Strings/Explanation/explanation.md)   | Hard             |

| 2490            | Circular Sentence  | [C++](./Algorithms/src/2490.%20Circular%20Sentence/Code/solution.cpp), [Java](./Algorithms/src/2490.%20Circular%20Sentence/Code/solution.java), [JavaScript](./Algorithms/src/2490.%20Circular%20Sentence/Code/solution.js), [Python](./Algorithms/src/2490.%20Circular%20Sentence/Code/solution.py), [Go](./Algorithms/src/2490.%20Circular%20Sentence/Code/solution.go) | [Explanation](./Algorithms/src/2490.%20Circular%20Sentence/Explanation/explanation.md)   | Easy             |

| 2491            | Divide Players Into Teams of Equal Skill  | [C++](./Algorithms/src/2491.%20Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/Code/solution.cpp), [Java](./Algorithms/src/2491.%20Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/Code/solution.java), [JavaScript](./Algorithms/src/2491.%20Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/Code/solution.js), [Python](./Algorithms/src/2491.%20Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/Code/solution.py), [Go](./Algorithms/src/2491.%20Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/Code/solution.go) | [Explanation](./Algorithms/src/2491.%20Divide%20Players%20Into%20Teams%20of%20Equal%20Skill/Explanation/explanation.md)   | Medium             |

| 2501            | Longest Square Streak in an Array  | [C++](./Algorithms/src/2501.%20Longest%20Square%20Streak%20in%20an%20Array/Code/solution.cpp), [Java](./Algorithms/src/2501.%20Longest%20Square%20Streak%20in%20an%20Array/Code/solution.java), [JavaScript](./Algorithms/src/2501.%20Longest%20Square%20Streak%20in%20an%20Array/Code/solution.js), [Python](./Algorithms/src/2501.%20Longest%20Square%20Streak%20in%20an%20Array/Code/solution.py), [Go](./Algorithms/src/1598.2501.%20Longest%20Square%20Streak%20in%20an%20Array/solution.go) | [Explanation](./Algorithms/src/2501.%20Longest%20Square%20Streak%20in%20an%20Array/Explanation/explanation.md)   | Medium             |

| 2530            | Maximal Score After Applying K Operations  | [C++](./Algorithms/src/2530.%20Maximal%20Score%20After%20Applying%20K%20Operations/Code/solution.cpp), [Java](./Algorithms/src/2530.%20Maximal%20Score%20After%20Applying%20K%20Operations/Code/solution.java), [JavaScript](./Algorithms/src/2530.%20Maximal%20Score%20After%20Applying%20K%20Operations/Code/solution.js), [Python](./Algorithms/src/2530.%20Maximal%20Score%20After%20Applying%20K%20Operations/Code/solution.py), [Go](./Algorithms/src/2530.%20Maximal%20Score%20After%20Applying%20K%20Operations/Code/solution.go) | [Explanation](./Algorithms/src/2530.%20Maximal%20Score%20After%20Applying%20K%20Operations/Explanation/explanation.md)   | Medium             |

| 2563            | Count the Number of Fair Pairs  | [C++](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.cpp), [Java](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.java), [JavaScript](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.js), [Python](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.py), [Go](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Code/solution.go) | [Explanation](./Algorithms/src/2563.%20Count%20the%20Number%20of%20Fair%20Pairs/Explanation/explanation.md)   | Medium             |

| 2601            | Prime Subtraction Operation  | [C++](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.cpp), [Java](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.java), [JavaScript](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.js), [Python](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.py), [Go](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Code/solution.go) | [Explanation](./Algorithms/src/2601.%20Prime%20Subtraction%20Operation/Explanation/explanation.md)   | Medium             |

| 2678            | Number of Senior Citizens  | [C++](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.cpp), [Java](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.java), [JavaScript](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.js), [Python](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.py), [Go](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Code/solution.go) | [Explanation](./Algorithms/src/2678.%20Number%20of%20Senior%20Citizens/Explanation/explanation.md)   | Easy             |

| 2684            | Maximum Number of Moves in a Grid  | [C++](./Algorithms/src/2684.%20Maximum%20Number%20of%20Moves%20in%20a%20Grid/Code/solution.cpp), [Java](./Algorithms/src/2684.%20Maximum%20Number%20of%20Moves%20in%20a%20Grid/Code/solution.java), [JavaScript](./Algorithms/src/2684.%20Maximum%20Number%20of%20Moves%20in%20a%20Grid/Code/solution.js), [Python](./Algorithms/src/2684.%20Maximum%20Number%20of%20Moves%20in%20a%20Grid/Code/solution.py), [Go](./Algorithms/src/2684.%20Maximum%20Number%20of%20Moves%20in%20a%20Grid/Code/solution.go) | [Explanation](./Algorithms/src/2684.%20Maximum%20Number%20of%20Moves%20in%20a%20Grid/Explanation/explanation.md)   | Medium             |

| 2696            | Minimum String Length After Removing Substrings  | [C++](./Algorithms/src/2696.%20Minimum%20String%20Length%20After%20Removing%20Substrings/Code/solution.cpp), [Java](./Algorithms/src/2696.%20Minimum%20String%20Length%20After%20Removing%20Substrings/Code/solution.java), [JavaScript](./Algorithms/src/2696.%20Minimum%20String%20Length%20After%20Removing%20Substrings/Code/solution.js), [Python](./Algorithms/src/2696.%20Minimum%20String%20Length%20After%20Removing%20Substrings/Code/solution.py), [Go](./Algorithms/src/2696.%20Minimum%20String%20Length%20After%20Removing%20Substrings/Code/solution.go) | [Explanation](./Algorithms/src/2696.%20Minimum%20String%20Length%20After%20Removing%20Substrings/Explanation/explanation.md)   | Easy             |

| 2707            | Extra Characters in a String  | [C++](./Algorithms/src/2707.%20Extra%20Characters%20in%20a%20String/Code/solution.cpp), [Java](./Algorithms/src/2707.%20Extra%20Characters%20in%20a%20String/Code/solution.java), [JavaScript](./Algorithms/src/2707.%20Extra%20Characters%20in%20a%20String/Code/solution.js), [Python](./Algorithms/src/2707.%20Extra%20Characters%20in%20a%20String/Code/solution.py), [Go](./Algorithms/src/2707.%20Extra%20Characters%20in%20a%20String/Code/solution.go) | [Explanation](./Algorithms/src/2707.%20Extra%20Characters%20in%20a%20String/Explanation/explanation.md)   | Medium             |

| 2751            | Robot Collisions  | [C++](./Algorithms/src/2751.%20Robot%20Collisions/Code/solution.cpp), [Java](./Algorithms/src/2751.%20Robot%20Collisions/Code/solution.java), [JavaScript](./Algorithms/src/2751.%20Robot%20Collisions/Code/solution.js), [Python](./Algorithms/src/2751.%20Robot%20Collisions/Code/solution.py), [Go](./Algorithms/src/2751.%20Robot%20Collisions/Code/solution.go) | [Explanation](./Algorithms/src/2751.%20Robot%20Collisions/Explanation/explanation.md)   | Hard             |

| 2938            | Separate Black and White Balls  | [C++](./Algorithms/src/2938.%20Separate%20Black%20and%20White%20Balls/Code/solution.cpp), [Java](./Algorithms/src/2938.%20Separate%20Black%20and%20White%20Balls/Code/solution.java), [JavaScript](./Algorithms/src/2938.%20Separate%20Black%20and%20White%20Balls/Code/solution.js), [Python](./Algorithms/src/2938.%20Separate%20Black%20and%20White%20Balls/Code/solution.py), [Go](./Algorithms/src/2938.%20Separate%20Black%20and%20White%20Balls/Code/solution.go) | [Explanation](./Algorithms/src/2938.%20Separate%20Black%20and%20White%20Balls/Explanation/explanation.md)   | Medium             |

| 3043            | Find the Length of the Longest Common Prefix  | [C++](./Algorithms/src/3043.%20Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/Code/solution.cpp), [Java](./Algorithms/src/3043.%20Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/Code/solution.java), [JavaScript](./Algorithms/src/3043.%20Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/Code/solution.js), [Python](./Algorithms/src/3043.%20Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/Code/solution.py), [Go](./Algorithms/src/3043.%20Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/Code/solution.go) | [Explanation](./Algorithms/src/3043.%20Find%20the%20Length%20of%20the%20Longest%20Common%20Prefix/Explanation/explanation.md)   | Medium             |

| 3163            | String Compression III  | [C++](./Algorithms/src/3163.%20String%20Compression%20III/Code/solution.cpp), [Java](./Algorithms/src/3163.%20String%20Compression%20III/Code/solution.java), [JavaScript](./Algorithms/src/3163.%20String%20Compression%20III/Code/solution.js), [Python](./Algorithms/src/3163.%20String%20Compression%20III/Code/solution.py), [Go](./Algorithms/src/3163.%20String%20Compression%20III/Code/solution.go) | [Explanation](./Algorithms/src/3163.%20String%20Compression%20III/Explanation/explanation.md)   | Medium             |

| 3254            | Find the Power of K-Size Subarrays I  | [C++](./Algorithms/src/3254.%20Find%20the%20Power%20of%20K-Size%20Subarrays%20I/Code/solution.cpp), [Java](./Algorithms/src/3254.%20Find%20the%20Power%20of%20K-Size%20Subarrays%20I/Code/solution.java), [JavaScript](./Algorithms/src/3254.%20Find%20the%20Power%20of%20K-Size%20Subarrays%20I/Code/solution.js), [Python](./Algorithms/src/3254.%20Find%20the%20Power%20of%20K-Size%20Subarrays%20I/Code/solution.py), [Go](./Algorithms/src/3254.%20Find%20the%20Power%20of%20K-Size%20Subarrays%20I/Code/solution.go) | [Explanation](./Algorithms/src/3254.%20Find%20the%20Power%20of%20K-Size%20Subarrays%20I/Explanation/explanation.md)   | Medium             |

## Contributors

Certainly! Here's the professional rewrite for the "How to Contribute" section:

## How to Contribute

We welcome contributions to improve and expand our repository of LeetCode solutions. To contribute, follow these steps:

1. **Fork** the repository on GitHub.

2. **Create a new branch** from `main` (`git checkout -b feature/add-new-solution`).

3. **Add** your solution for a new or existing problem in the designated format.

4. **Commit** your changes (`git commit -am 'Add new solution for Problem X'`).

5. **Push** your branch to your fork (`git push origin feature/add-new-solution`).

6. **Submit** a Pull Request, providing a brief description of your changes.

Thank you for helping us make these solutions accessible and valuable to the community!