LeetCode January Challenge 2025

This repository contains my solutions to the LeetCode January Challenge 2025. The goal is to solve one problem every day to improve problem-solving skills and enhance my understanding of data structures and algorithms.

---

Problems Solved

Day	Problem	Solution
1	Maximum Score After Splitting a String	Day1_MaximumScoreAfterSplittingString.cpp
2	Count Vowel Strings in Ranges	Day2_Count Vowel Strings in Ranges
3	Number of Ways to Split Array	Day3_Number of Ways to Split Array
4	Unique Length-3 Palindromic Subsequences	Day4_UniqueLength3PalindromicSubsequences
5	Shifting Letters II	Day5_ShiftingLettersII
6	Minimum Number Of Operations To Move All Balls To Eeach Box	Day6_MinimumNoOfOperationsToMoveAllballsToEachBox
7	String Matching In An Array	Day7_StringMatchinInAnArray.cpp
8	Count Prefix And Suffix PairsI	Day8_CountPrefixAndSuffixPairsI
9	Counting Words With A Given Prefix	Day9_CountingWordsWithAGivenPrefix
10	WordSubsets	Day10_WordSubsets
11	Construct K Palindrome Strings	Day11_ConstructKpalindromeStrings
13	Minimum Length of String After Operations	Day13_MinimumLengthofStringAfterOperations
14	Find the Prefix Common Array of Two Arrays	Day14_FindthePrefixCommonArrayofTwoArrays
15	Bitwise XOR of All Pairings	Day16_BitwiseXORofAllPairing
17	Neighboring Bitwise XOR
21	Count Servers That Communicate	Day23_CountServersThatCommunicate

---

How to Use

1. Navigate to the problem's file to view the solution.
2. Each file is named in the format DayX_ProblemName.ext.

---

Features

• Daily Solutions: Problems solved daily with clean and well-commented code.
• Consistent Naming: File names correspond to the problem and day of the challenge.
• Language Used: Most solutions are written in C++.

---

Feel free to fork and star this repository. Contributions are welcome!