GitHub - AliPythonDev/366DaysofLeetcode: Embark on a 366-day journey mastering Data Structures and Algorithms with my LeetCode Challenge! Daily commits, progress tracking, and detailed explanations. Open to collaboration and learning together. Connect on LinkedIn for more! 🌐 Happy Coding! 🎯

DSA LeetCode 366-Day Streak Challenge 🚀

Welcome to my 366-day journey of conquering Data Structures and Algorithms on LeetCode! 👨‍💻

📖 What's This Challenge About?

For the next 366 days, I'm committed to daily sessions of diving into LeetCode problems, sharpening my problem-solving skills, and mastering various data structures and algorithms. 🏋️‍♂️

🚨 Why LeetCode?

LeetCode is not just a platform; it's my daily workout ground for coding muscles. It offers a vast collection of real-world coding challenges that help me enhance my problem-solving skills and algorithmic thinking.

📈 What to Expect?

Daily Commitment: Each day, I'll be pushing code related to a LeetCode problem.
Progress Tracking: I'll maintain a log of the problems solved and the concepts learned.
Learning Resources: Feel free to check out the resources I find helpful along the way.

🛠️ Tech Stack:

Language: C++
Version Control: Git
Documentation: Detailed explanations and thought process with each solution.

📚 Learning Together:

I'm open to collaboration and learning together! If you have suggestions, improvements, or just want to discuss a particular problem, feel free to open an issue or pull request.

🏆 Goal:

The ultimate goal is not just the completion of 100 days but the continuous improvement and understanding of efficient problem-solving approaches.

🎯 Let's Connect:

Connect with me on LinkedIn and let's learn and grow together! 🌐

Happy Coding! 🚀

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

📖 What's This Challenge About?

🚨 Why LeetCode?

📈 What to Expect?

🛠️ Tech Stack:

📚 Learning Together:

🏆 Goal:

🎯 Let's Connect:

About

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 221 Commits
Achievement Unlocked Journeys		Achievement Unlocked Journeys
0001_P455_Assign_Cookies.cpp		0001_P455_Assign_Cookies.cpp
0002_P2610_Convert_an_Array_Into_a_2D_Array_With_Conditions.cpp		0002_P2610_Convert_an_Array_Into_a_2D_Array_With_Conditions.cpp
0003_P2125_Number_of_Laser_Beams_in_a_Bank.cpp		0003_P2125_Number_of_Laser_Beams_in_a_Bank.cpp
0004_P2870_Minimum_Number_of_Operations_to_Make_Array_Empty.cpp		0004_P2870_Minimum_Number_of_Operations_to_Make_Array_Empty.cpp
0005_P300_Longest_Increasing_Subsequence.cpp		0005_P300_Longest_Increasing_Subsequence.cpp
0006_P1235_Maximum_Profit_in_Job_Scheduling.cpp		0006_P1235_Maximum_Profit_in_Job_Scheduling.cpp
0007_P446_Arithmetic_Slices_II_Subsequence.cpp		0007_P446_Arithmetic_Slices_II_Subsequence.cpp
0008_P938_Range_Sum_of_BST.cpp		0008_P938_Range_Sum_of_BST.cpp
0009_P872_Leaf-Similar_Trees.cpp		0009_P872_Leaf-Similar_Trees.cpp
0010_P2385_Amount_of_Time_for_Binary_Tree_to_Be_Infected.cpp		0010_P2385_Amount_of_Time_for_Binary_Tree_to_Be_Infected.cpp
0011_P1026_Maximum_Difference_Between_Node_and_Ancestor.cpp		0011_P1026_Maximum_Difference_Between_Node_and_Ancestor.cpp
0012_P1704_Determine_if_String_Halves_Are_Alike.cpp		0012_P1704_Determine_if_String_Halves_Are_Alike.cpp
0013_P1347_Minimum_Number_of_Steps_to_Make_Two_Strings_Anagram.cpp		0013_P1347_Minimum_Number_of_Steps_to_Make_Two_Strings_Anagram.cpp
0014_P1657_Determine_if_Two_Strings_Are_Close.cpp		0014_P1657_Determine_if_Two_Strings_Are_Close.cpp
0015_P2225_Find_Players_With_Zero_or_One_Losses.cpp		0015_P2225_Find_Players_With_Zero_or_One_Losses.cpp
0016_P380_Insert_Delete_GetRandom_O(1).cpp		0016_P380_Insert_Delete_GetRandom_O(1).cpp
0017_P1207_Unique_Number_of_Occurrences.cpp		0017_P1207_Unique_Number_of_Occurrences.cpp
0018_P70_Climbing_Stairs.cpp		0018_P70_Climbing_Stairs.cpp
0019_P931_Minimum_Falling_Path_Sum.cpp		0019_P931_Minimum_Falling_Path_Sum.cpp
0020_P907_Sum_of_Subarray_Minimums.cpp		0020_P907_Sum_of_Subarray_Minimums.cpp
0021_P198_House_Robber.cpp		0021_P198_House_Robber.cpp
0022_P645_Set_Mismatch.cpp		0022_P645_Set_Mismatch.cpp
0023_P1239_Maximum_Length_of_a_Concatenated_String_with_Unique_Characters.cpp		0023_P1239_Maximum_Length_of_a_Concatenated_String_with_Unique_Characters.cpp
0024_P1457_Pseudo-Palindromic_Paths_in_a_Binary_Tree.cpp		0024_P1457_Pseudo-Palindromic_Paths_in_a_Binary_Tree.cpp
0025_P1143_Longest_Common_Subsequence.cpp		0025_P1143_Longest_Common_Subsequence.cpp
0026_P576_Out_of_Boundary_Paths.cpp		0026_P576_Out_of_Boundary_Paths.cpp
0027_P629_K_Inverse_Pairs_Array.cpp		0027_P629_K_Inverse_Pairs_Array.cpp
0028_P1074_Number_of_Submatrices_That_Sum_to_Target.cpp		0028_P1074_Number_of_Submatrices_That_Sum_to_Target.cpp
0029_P232_Implement_Queue_using_Stacks.cpp		0029_P232_Implement_Queue_using_Stacks.cpp
0030_P150_Evaluate_Reverse_Polish_Notation.cpp		0030_P150_Evaluate_Reverse_Polish_Notation.cpp
0031_P739_Daily_Temperatures.cpp		0031_P739_Daily_Temperatures.cpp
0032_P2966_Divide_Array_into_Arrays_with_Max_Difference.cpp		0032_P2966_Divide_Array_into_Arrays_with_Max_Difference.cpp
0033_P1291_Sequential_Digits.cpp		0033_P1291_Sequential_Digits.cpp
0034_P1043_Partition_Array_for_Maximum_Sum.cpp		0034_P1043_Partition_Array_for_Maximum_Sum.cpp
0035_P76_Minimum_Window_Substring.cpp		0035_P76_Minimum_Window_Substring.cpp
0036_P387_First_Unique_Character_in_a_String.cpp		0036_P387_First_Unique_Character_in_a_String.cpp
0037_P49_Group_Anagrams.cpp		0037_P49_Group_Anagrams.cpp
0038_P451_Sort_Characters_By_Frequency.cpp		0038_P451_Sort_Characters_By_Frequency.cpp
0039_P279_Perfect_Squares.cpp		0039_P279_Perfect_Squares.cpp
0040_P368_Largest_Divisible_Subset.cpp		0040_P368_Largest_Divisible_Subset.cpp
0041_P647_Palindromic_Substrings.cpp		0041_P647_Palindromic_Substrings.cpp
0042_P1463_Cherry_Pickup-II.cpp		0042_P1463_Cherry_Pickup-II.cpp
0043_P169_Majority_Element.cpp		0043_P169_Majority_Element.cpp
0044_P2108_Find_First_Palindromic_String_in_the_Array.cpp		0044_P2108_Find_First_Palindromic_String_in_the_Array.cpp
0045_P2149_Rearrange_Array_Elements_by_Sign.cpp		0045_P2149_Rearrange_Array_Elements_by_Sign.cpp
0046_P2971_Find_Polygon_With_the_Largest_Perimeter.cpp		0046_P2971_Find_Polygon_With_the_Largest_Perimeter.cpp
0047_P1481_Least_Number_of_Unique_Integers_after_K_Removals.cpp		0047_P1481_Least_Number_of_Unique_Integers_after_K_Removals.cpp
0048_P1642_Furthest_Building_You_Can_Reach.cpp		0048_P1642_Furthest_Building_You_Can_Reach.cpp
0049_P2402_Meeting_Rooms-III.cpp		0049_P2402_Meeting_Rooms-III.cpp
0050_P231_Power_of_Two.cpp		0050_P231_Power_of_Two.cpp
0051_P268_Missing_Number.cpp		0051_P268_Missing_Number.cpp
0052_P201_Bitwise_AND_of_Numbers_Range.cpp		0052_P201_Bitwise_AND_of_Numbers_Range.cpp
0053_P997_Find_the_Town_Judge.cpp		0053_P997_Find_the_Town_Judge.cpp
0054_P787_Cheapest_Flights_Within_K_Stops.cpp		0054_P787_Cheapest_Flights_Within_K_Stops.cpp
0055_P2092_Find_All_People_With_Secret.cpp		0055_P2092_Find_All_People_With_Secret.cpp
0056_P2709_Greatest_Common_Divisor_Traversal.cpp		0056_P2709_Greatest_Common_Divisor_Traversal.cpp
0057_P100_Same_Tree.cpp		0057_P100_Same_Tree.cpp
0058_P543_Diameter_of_Binary_Tree.cpp		0058_P543_Diameter_of_Binary_Tree.cpp
0059_P513_Find_Bottom_Left_Tree_Value.cpp		0059_P513_Find_Bottom_Left_Tree_Value.cpp
0060_P1609_Even_Odd_Tree.cpp		0060_P1609_Even_Odd_Tree.cpp
0061_P2864_Maximum_Odd_Binary_Number.cpp		0061_P2864_Maximum_Odd_Binary_Number.cpp
0062_P977_Squares_of_a_Sorted_Array.cpp		0062_P977_Squares_of_a_Sorted_Array.cpp
0063_P19_Remove_Nth_Node_From_End_of_List.cpp		0063_P19_Remove_Nth_Node_From_End_of_List.cpp
0064_P948_Bag_of_Tokens.cpp		0064_P948_Bag_of_Tokens.cpp
0065_P1750_Minimum_Length_of_String_After_Deleting_Similar_Ends.cpp		0065_P1750_Minimum_Length_of_String_After_Deleting_Similar_Ends.cpp
0066_P141_Linked_List_Cycle.cpp		0066_P141_Linked_List_Cycle.cpp
0067_P876_Middle_of_the_Linked_List.cpp		0067_P876_Middle_of_the_Linked_List.cpp
0068_P3005_Count_Elements_With_Maximum_Frequency.cpp		0068_P3005_Count_Elements_With_Maximum_Frequency.cpp
0069_P2540_Minimum_Common_Value.cpp		0069_P2540_Minimum_Common_Value.cpp
0070_P349_Intersection_of_Two_Arrays.cpp		0070_P349_Intersection_of_Two_Arrays.cpp
0071_P791_Custom_Sort_String.cpp		0071_P791_Custom_Sort_String.cpp
0072_P1171_Remove_Zero_Sum_Consecutive_Nodes_from_Linked_List.cpp		0072_P1171_Remove_Zero_Sum_Consecutive_Nodes_from_Linked_List.cpp
0073_P2485_Find_the_Pivot_Integer.cpp		0073_P2485_Find_the_Pivot_Integer.cpp
0074_P930_Binary_Subarrays_With_Sum.cpp		0074_P930_Binary_Subarrays_With_Sum.cpp
0075_P238_Product_of_Array_Except_Self.cpp		0075_P238_Product_of_Array_Except_Self.cpp
0076_P525_Contiguous_Array.cpp		0076_P525_Contiguous_Array.cpp
0077_P57_Insert_Interval.cpp		0077_P57_Insert_Interval.cpp
0078_P452_Minimum_Number_of_Arrows_to_Burst_Balloons.cpp		0078_P452_Minimum_Number_of_Arrows_to_Burst_Balloons.cpp
0079_P621_Task_Scheduler.cpp		0079_P621_Task_Scheduler.cpp
0080_P1669_Merge_In_Between_Linked_Lists.cpp		0080_P1669_Merge_In_Between_Linked_Lists.cpp
0081_P206_Reverse_Linked_List.cpp		0081_P206_Reverse_Linked_List.cpp
0082_P234_Palindrome_Linked_List.cpp		0082_P234_Palindrome_Linked_List.cpp
0083_P143_Reorder_List.cpp		0083_P143_Reorder_List.cpp
0084_P287_Find_the_Duplicate_Number.cpp		0084_P287_Find_the_Duplicate_Number.cpp
0085_P442_Find_All_Duplicates_in_an_Array.cpp		0085_P442_Find_All_Duplicates_in_an_Array.cpp
0086_P41_First_Missing_Positive.cpp		0086_P41_First_Missing_Positive.cpp
0087_P713_Subarray_Product_Less_Than_K.cpp		0087_P713_Subarray_Product_Less_Than_K.cpp
0088_P2958_Length_of_Longest_Subarray_With_at_Most_K_Frequency.cpp		0088_P2958_Length_of_Longest_Subarray_With_at_Most_K_Frequency.cpp
0089_P2962_Count_Subarrays_Where_Max_Element_Appears_at_Least_K_Times.cpp		0089_P2962_Count_Subarrays_Where_Max_Element_Appears_at_Least_K_Times.cpp
0090_P992_Subarrays_with_K_Different_Integers.cpp		0090_P992_Subarrays_with_K_Different_Integers.cpp
0091_P2444_Count_Subarrays_With_Fixed_Bounds.cpp		0091_P2444_Count_Subarrays_With_Fixed_Bounds.cpp
0092_P58_Length_of_Last_Word.cpp		0092_P58_Length_of_Last_Word.cpp
0093_P205_Isomorphic_Strings.cpp		0093_P205_Isomorphic_Strings.cpp
0094_P79_Word_Search.cpp		0094_P79_Word_Search.cpp
0095_P1614_Maximum_Nesting_Depth_of_the_Parentheses.cpp		0095_P1614_Maximum_Nesting_Depth_of_the_Parentheses.cpp
0096_P1544_Make_The_String_Great.cpp		0096_P1544_Make_The_String_Great.cpp
0097_P1249_Minimum_Remove_to_Make_Valid_Parentheses.cpp		0097_P1249_Minimum_Remove_to_Make_Valid_Parentheses.cpp
0098_P678_Valid_Parenthesis_String.cpp		0098_P678_Valid_Parenthesis_String.cpp
0099_P1700_Number_of_Students_Unable_to_Eat_Lunch.cpp		0099_P1700_Number_of_Students_Unable_to_Eat_Lunch.cpp

License

AliPythonDev/366DaysofLeetcode

Folders and files

Latest commit

History

Repository files navigation

📖 What's This Challenge About?

🚨 Why LeetCode?

📈 What to Expect?

🛠️ Tech Stack:

📚 Learning Together:

🏆 Goal:

🎯 Let's Connect:

About

Resources

License

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages