{"id":20503518,"url":"https://github.com/withaarzoo/leetcode-solutions","last_synced_at":"2025-04-09T16:12:53.965Z","repository":{"id":247561687,"uuid":"822689940","full_name":"withaarzoo/LeetCode-Solutions","owner":"withaarzoo","description":"Welcome to the LeetCode Solutions repository! Here, you'll find daily solutions to LeetCode problems, complete with detailed explanations and code in multiple languages.","archived":false,"fork":false,"pushed_at":"2025-01-29T01:12:13.000Z","size":437,"stargazers_count":72,"open_issues_count":0,"forks_count":15,"subscribers_count":6,"default_branch":"main","last_synced_at":"2025-04-09T16:12:35.293Z","etag":null,"topics":["leetcode","leetcode-daily-challenge","leetcode-daily-solutions","leetcode-practice","leetcode-problems-solutions","leetcode-questions","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/withaarzoo.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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-07-01T16:05:49.000Z","updated_at":"2025-04-05T17:47:40.000Z","dependencies_parsed_at":"2024-07-13T06:34:08.809Z","dependency_job_id":"45b6066d-0348-4c33-8b75-7813723a5db9","html_url":"https://github.com/withaarzoo/LeetCode-Solutions","commit_stats":{"total_commits":116,"total_committers":1,"mean_commits":116.0,"dds":0.0,"last_synced_commit":"727b0657a288d202a8f616ccce222cc8106a9beb"},"previous_names":["withaarzoo/leetcode-solutions"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/withaarzoo%2FLeetCode-Solutions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/withaarzoo%2FLeetCode-Solutions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/withaarzoo%2FLeetCode-Solutions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/withaarzoo%2FLeetCode-Solutions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/withaarzoo","download_url":"https://codeload.github.com/withaarzoo/LeetCode-Solutions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248065282,"owners_count":21041872,"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":["leetcode","leetcode-daily-challenge","leetcode-daily-solutions","leetcode-practice","leetcode-problems-solutions","leetcode-questions","leetcode-solutions"],"created_at":"2024-11-15T19:31:57.923Z","updated_at":"2025-04-09T16:12:53.933Z","avatar_url":"https://github.com/withaarzoo.png","language":"C++","readme":"# LeetCode Solutions\n\nWelcome to the LeetCode Solutions repository! Here, you'll find daily solutions to LeetCode problems, complete with detailed explanations and code in multiple languages.\n\n## Table of Contents\n\n| Problem Number | Problem Name                   | Jump into Code                                  | Explanation                                    | Difficulty Level |\n|----------------|--------------------------------|--------------------------------------------------|------------------------------------------------|------------------|\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 407            | Trapping Rain Water II  | [C++](./Algorithms/src/407.%20Trapping%20Rain%20Water%20II/Code/solution.cpp), [Java](./Algorithms/src/407.%20Trapping%20Rain%20Water%20II/Code/solution.java), [JavaScript](./Algorithms/src/407.%20Trapping%20Rain%20Water%20II/Code/solution.js), [Python](./Algorithms/src/407.%20Trapping%20Rain%20Water%20II/Code/solution.py), [Go](./Algorithms/src/407.%20Trapping%20Rain%20Water%20II/Code/solution.go) | [Explanation](./Algorithms/src/407.%20Trapping%20Rain%20Water%20II/Explanation/explanation.md)   | Hard             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 684            | Redundant Connection  | [C++](./Algorithms/src/684.%20Redundant%20Connection/Code/solution.cpp), [Java](./Algorithms/src/684.%20Redundant%20Connection/Code/solution.java), [JavaScript](./Algorithms/src/684.%20Redundant%20Connection/Code/solution.js), [Python](./Algorithms/src/684.%20Redundant%20Connection/Code/solution.py), [Go](./Algorithms/src/684.%20Redundant%20Connection/Code/solution.go) | [Explanation](./Algorithms/src/684.%20Redundant%20Connection/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 802            | Find Eventual Safe States  | [C++](./Algorithms/src/802.%20Find%20Eventual%20Safe%20States/Code/solution.cpp), [Java](./Algorithms/src/802.%20Find%20Eventual%20Safe%20States/Code/solution.java), [JavaScript](./Algorithms/src/802.%20Find%20Eventual%20Safe%20States/Code/solution.js), [Python](./Algorithms/src/802.%20Find%20Eventual%20Safe%20States/Code/solution.py), [Go](./Algorithms/src/802.%20Find%20Eventual%20Safe%20States/Code/solution.go) | [Explanation](./Algorithms/src/802.%20Find%20Eventual%20Safe%20States/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 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             |\n| 916            | Word Subsets  | [C++](./Algorithms/src/916.%20Word%20Subsets/Code/solution.cpp), [Java](./Algorithms/src/916.%20Word%20Subsets/Code/solution.java), [JavaScript](./Algorithms/src/916.%20Word%20Subsets/Code/solution.js), [Python](./Algorithms/src/916.%20Word%20Subsets/Code/solution.py), [Go](./Algorithms/src/916.%20Word%20Subsets/Code/solution.go) | [Explanation](./Algorithms/src/916.%20Word%20Subsets/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 1267            | Count Servers that Communicate  | [C++](./Algorithms/src/1267.%20Count%20Servers%20that%20Communicate/Code/solution.cpp), [Java](./Algorithms/src/1267.%20Count%20Servers%20that%20Communicate/Code/solution.java), [JavaScript](./Algorithms/src/1267.%20Count%20Servers%20that%20Communicate/Code/solution.js), [Python](./Algorithms/src/1267.%20Count%20Servers%20that%20Communicate/Code/solution.py), [Go](./Algorithms/src/1267.%20Count%20Servers%20that%20Communicate/Code/solution.go) | [Explanation](./Algorithms/src/1267.%20Count%20Servers%20that%20Communicate/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 1368            | Minimum Cost to Make at Least One Valid Path in a Grid  | [C++](./Algorithms/src/1368.%20Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/Code/solution.cpp), [Java](./Algorithms/src/1368.%20Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/Code/solution.java), [JavaScript](./Algorithms/src/1368.%20Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/Code/solution.js), [Python](./Algorithms/src/1368.%20Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/Code/solution.py), [Go](./Algorithms/src/1368.%20Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/Code/solution.go) | [Explanation](./Algorithms/src/1368.%20Minimum%20Cost%20to%20Make%20at%20Least%20One%20Valid%20Path%20in%20a%20Grid/Explanation/explanation.md)   | Hard             |\n| 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             |\n| 1400            | Construct K Palindrome Strings  | [C++](./Algorithms/src/1400.%20Construct%20K%20Palindrome%20Strings/Code/solution.cpp), [Java](./Algorithms/src/1400.%20Construct%20K%20Palindrome%20Strings/Code/solution.java), [JavaScript](./Algorithms/src/1400.%20Construct%20K%20Palindrome%20Strings/Code/solution.js), [Python](./Algorithms/src/1400.%20Construct%20K%20Palindrome%20Strings/Code/solution.py), [Go](./Algorithms/src/1400.%20Construct%20K%20Palindrome%20Strings/Code/solution.go) | [Explanation](./Algorithms/src/1400.%20Construct%20K%20Palindrome%20Strings/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 1408            | String Matching in an Array  | [C++](./Algorithms/src/1408.%20String%20Matching%20in%20an%20Array/Code/solution.cpp), [Java](./Algorithms/src/1408.%20String%20Matching%20in%20an%20Array/Code/solution.java), [JavaScript](./Algorithms/src/1408.%20String%20Matching%20in%20an%20Array/Code/solution.js), [Python](./Algorithms/src/1408.%20String%20Matching%20in%20an%20Array/Code/solution.py), [Go](./Algorithms/src/1408.%20String%20Matching%20in%20an%20Array/Code/solution.go) | [Explanation](./Algorithms/src/1408.%20String%20Matching%20in%20an%20Array/Explanation/explanation.md)   | Easy             |\n| 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/Code/solution.go) | [Explanation](./Algorithms/src/1460.%20Make%20Two%20Arrays%20Equal%20by%20Reversing%20Subarrays/Explanation/explanation.md)   | Easy             |\n| 1462            | Course Schedule IV  | [C++](./Algorithms/src/1462.%20Course%20Schedule%20IV/Code/solution.cpp), [Java](./Algorithms/src/1462.%20Course%20Schedule%20IV/Code/solution.java), [JavaScript](./Algorithms/src/1462.%20Course%20Schedule%20IV/Code/solution.js), [Python](./Algorithms/src/1462.%20Course%20Schedule%20IV/Code/solution.py), [Go](./Algorithms/src/1598.1462.%20Course%20Schedule%20IV/Code/solution.go) | [Explanation](./Algorithms/src/1462.%20Course%20Schedule%20IV/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 1765            | Map of Highest Peak  | [C++](./Algorithms/src/1765.%20Map%20of%20Highest%20Peak/Code/solution.cpp), [Java](./Algorithms/src/1765.%20Map%20of%20Highest%20Peak/Code/solution.java), [JavaScript](./Algorithms/src/1765.%20Map%20of%20Highest%20Peak/Code/solution.js), [Python](./Algorithms/src/1765.%20Map%20of%20Highest%20Peak/Code/solution.py), [Go](./Algorithms/src/1765.%20Map%20of%20Highest%20Peak/Code/solution.go) | [Explanation](./Algorithms/src/1765.%20Map%20of%20Highest%20Peak/Explanation/explanation.md)   | Medium             |\n| 1769            | Minimum Number of Operations to Move All Balls to Each Box  | [C++](./Algorithms/src/1769.%20Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/Code/solution.cpp), [Java](./Algorithms/src/1769.%20Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/Code/solution.java), [JavaScript](./Algorithms/src/1769.%20Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/Code/solution.js), [Python](./Algorithms/src/1769.%20Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/Code/solution.py), [Go](./Algorithms/src/1769.%20Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/Code/solution.go) | [Explanation](./Algorithms/src/1769.%20Minimum%20Number%20of%20Operations%20to%20Move%20All%20Balls%20to%20Each%20Box/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 1930            | Unique Length-3 Palindromic Subsequences  | [C++](./Algorithms/src/1930.%20Unique%20Length-3%20Palindromic%20Subsequences/Code/solution.cpp), [Java](./Algorithms/src/1930.%20Unique%20Length-3%20Palindromic%20Subsequences/Code/solution.java), [JavaScript](./Algorithms/src/1930.%20Unique%20Length-3%20Palindromic%20Subsequences/Code/solution.js), [Python](./Algorithms/src/1930.%20Unique%20Length-3%20Palindromic%20Subsequences/Code/solution.py), [Go](./Algorithms/src/1930.%20Unique%20Length-3%20Palindromic%20Subsequences/Code/solution.go) | [Explanation](./Algorithms/src/1930.%20Unique%20Length-3%20Palindromic%20Subsequences/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 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             |\n| 2017            | Grid Game  | [C++](./Algorithms/src/2017.%20Grid%20Game/Code/solution.cpp), [Java](./Algorithms/src/2017.%20Grid%20Game/Code/solution.java), [JavaScript](./Algorithms/src/2017.%20Grid%20Game/Code/solution.js), [Python](./Algorithms/src/2017.%20Grid%20Game/Code/solution.py), [Go](./Algorithms/src/2017.%20Grid%20Game/Code/solution.go) | [Explanation](./Algorithms/src/2017.%20Grid%20Game/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 2116            | Check if a Parentheses String Can Be Valid  | [C++](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Code/solution.cpp), [Java](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Code/solution.java), [JavaScript](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Code/solution.js), [Python](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Code/solution.py), [Go](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Code/solution.go) | [Explanation](./Algorithms/src/2116.%20Check%20if%20a%20Parentheses%20String%20Can%20Be%20Valid/Explanation/explanation.md)   | Medium             |\n| 2127            | Maximum Employees to Be Invited to a Meeting  | [C++](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Code/solution.cpp), [Java](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Code/solution.java), [JavaScript](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Code/solution.js), [Python](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Code/solution.py), [Go](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Code/solution.go) | [Explanation](./Algorithms/src/2127.%20Maximum%20Employees%20to%20Be%20Invited%20to%20a%20Meeting/Explanation/explanation.md)   | Hard             |\n| 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             |\n| 2185            | Counting Words With a Given Prefix  | [C++](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Code/solution.cpp), [Java](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Code/solution.java), [JavaScript](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Code/solution.js), [Python](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Code/solution.py), [Go](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Code/solution.go) | [Explanation](./Algorithms/src/2185.%20Counting%20Words%20With%20a%20Given%20Prefix/Explanation/explanation.md)   | Easy             |\n| 2270            | 2270. Number of Ways to Split Array  | [C++](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.cpp), [Java](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.java), [JavaScript](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.js), [Python](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.py), [Go](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Code/solution.go) | [Explanation](./Algorithms/src/2270.%20Number%20of%20Ways%20to%20Split%20Array/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 2381            | Shifting Letters II  | [C++](./Algorithms/src/2381.%20Shifting%20Letters%20II/Code/solution.cpp), [Java](./Algorithms/src/2381.%20Shifting%20Letters%20II/Code/solution.java), [JavaScript](./Algorithms/src/2381.%20Shifting%20Letters%20II/Code/solution.js), [Python](./Algorithms/src/2381.%20Shifting%20Letters%20II/Code/solution.py), [Go](./Algorithms/src/2381.%20Shifting%20Letters%20II/Code/solution.go) | [Explanation](./Algorithms/src/2381.%20Shifting%20Letters%20II/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 2425            | Bitwise XOR of All Pairings  | [C++](./Algorithms/src/2425.%20Bitwise%20XOR%20of%20All%20Pairings/Code/solution.cpp), [Java](./Algorithms/src/2425.%20Bitwise%20XOR%20of%20All%20Pairings/Code/solution.java), [JavaScript](./Algorithms/src/2425.%20Bitwise%20XOR%20of%20All%20Pairings/Code/solution.js), [Python](./Algorithms/src/2425.%20Bitwise%20XOR%20of%20All%20Pairings/Code/solution.py), [Go](./Algorithms/src/2425.%20Bitwise%20XOR%20of%20All%20Pairings/Code/solution.go) | [Explanation](./Algorithms/src/2425.%20Bitwise%20XOR%20of%20All%20Pairings/Explanation/explanation.md)   | Medium             |\n| 2429            | Minimize XOR  | [C++](./Algorithms/src/2429.%20Minimize%20XOR/Code/solution.cpp), [Java](./Algorithms/src/2429.%20Minimize%20XOR/Code/solution.java), [JavaScript](./Algorithms/src/2429.%20Minimize%20XOR/Code/solution.js), [Python](./Algorithms/src/2429.%20Minimize%20XOR/Code/solution.py), [Go](./Algorithms/src/2429.%20Minimize%20XOR/Code/solution.go) | [Explanation](./Algorithms/src/2429.%20Minimize%20XOR/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 2559            | 2559. Count Vowel Strings in Ranges  | [C++](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.cpp), [Java](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.java), [JavaScript](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.js), [Python](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.py), [Go](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Code/solution.go) | [Explanation](./Algorithms/src/2559.%20Count%20Vowel%20Strings%20in%20Ranges/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 2658            | Maximum Number of Fish in a Grid  | [C++](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.cpp), [Java](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.java), [JavaScript](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.js), [Python](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.py), [Go](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Code/solution.go) | [Explanation](./Algorithms/src/2658.%20Maximum%20Number%20of%20Fish%20in%20a%20Grid/Explanation/explanation.md)   | Medium             |\n| 2661            | First Completely Painted Row or Column  | [C++](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.cpp), [Java](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.java), [JavaScript](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.js), [Python](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.py), [Go](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Code/solution.go) | [Explanation](./Algorithms/src/2661.%20First%20Completely%20Painted%20Row%20or%20Column/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 2683            | Neighboring Bitwise XOR  | [C++](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.cpp), [Java](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.java), [JavaScript](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.js), [Python](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.py), [Go](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Code/solution.go) | [Explanation](./Algorithms/src/2683.%20Neighboring%20Bitwise%20XOR/Explanation/explanation.md)   | Medium             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 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             |\n| 3042            | Count Prefix and Suffix Pairs I  | [C++](./Algorithms/src/3042.%20Count%20Prefix%20and%20Suffix%20Pairs%20I/Code/solution.cpp), [Java](./Algorithms/src/3042.%20Count%20Prefix%20and%20Suffix%20Pairs%20I/Code/solution.java), [JavaScript](./Algorithms/src/3042.%20Count%20Prefix%20and%20Suffix%20Pairs%20I/Code/solution.js), [Python](./Algorithms/src/3042.%20Count%20Prefix%20and%20Suffix%20Pairs%20I/Code/solution.py), [Go](./Algorithms/src/3042.%20Count%20Prefix%20and%20Suffix%20Pairs%20I/Code/solution.go) | [Explanation](./Algorithms/src/3042.%20Count%20Prefix%20and%20Suffix%20Pairs%20I/Explanation/explanation.md)   | Easy             |\n| 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             |\n| 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             |\n| 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             |\n\n## Contributors\n\n\u003c!-- - John Doe [@johndoe](https://github.com/johndoe)\n- Jane Smith [@janesmith](https://github.com/janesmith) --\u003e\n\nCertainly! Here's the professional rewrite for the \"How to Contribute\" section:\n\n## How to Contribute\n\nWe welcome contributions to improve and expand our repository of LeetCode solutions. To contribute, follow these steps:\n\n1. **Fork** the repository on GitHub.\n2. **Create a new branch** from `main` (`git checkout -b feature/add-new-solution`).\n3. **Add** your solution for a new or existing problem in the designated format.\n4. **Commit** your changes (`git commit -am 'Add new solution for Problem X'`).\n5. **Push** your branch to your fork (`git push origin feature/add-new-solution`).\n6. **Submit** a Pull Request, providing a brief description of your changes.\n\nThank you for helping us make these solutions accessible and valuable to the community!\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwithaarzoo%2Fleetcode-solutions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwithaarzoo%2Fleetcode-solutions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwithaarzoo%2Fleetcode-solutions/lists"}