LeetCode Problem of the Day Solutions

A collection of daily LeetCode problems with solutions.

Index

January 2024

• [Jan 1] 1422. Maximum_Score_After_Splitting_a_String
• [Jan 2] 2559. Count Vowel Strings in Ranges
• [Jan 3] 2270. Number of Ways to Split Array
• [Jan 4] 1930. Unique Length-3 Palindromic Subsequences
• [Jan 5] 2381. Shifting Letters II
• [Jan 6] 1769. Minimum Number of Operations to Move All Balls to Each Box
• [Jan 7] 1408. String Matching in an Array
• [Jan 8] 3042. Count Prefix and Suffix Pairs I
• [Jan 9] 2185. Counting Words With a Given Prefix
• [Jan 10] 916. Word Subsets
• [Jan 11] 1400. Construct K Palindrome Strings
• [Jan 12] 2116. Check if a Parentheses String Can Be Valid
• [Jan 13] 3223. Minimum Length of String After Operations
• [Jan 14] 2657. Find the Prefix Common Array of Two Arrays
• [Jan 15] 2429. Minimize XOR
• [Jan 16] 2425. Bitwise XOR of All Pairings
• [Jan 17] 2683. Neighboring Bitwise XOR
• [Jan 18] 1368. Minimum Cost to Make at Least One Valid Path in a Grid

Structure

Each solution includes:

• Problem description
• Approach explanation
• Time and Space complexity
• Solution code

Language Used

• Primary: C++
• Alternative solutions in other languages are welcome

Resources

• LeetCode Profile

License

This repository is licensed under the MIT License - see the LICENSE file for details.