LeetCode 75 study plan

Welcome to my LeetCode 75 journey! In this post, I’ll be sharing my solutions and insights for 75 essential problems that are part of LeetCode 75 study plan.

The objective of this project is to improve my coding skills (analisys and solving problems). Then some solutions may not be the most efficient in terms of time or space complexity, however I try to find the best approach based on my current understanding. In the future, as I continue to learn and develop new skills, I hooe to improve the project with better algorithms and efficiency solutions.

You can visit the github page and the repository of this project.

Note: The project is not finished yet. I am going to add the problems according I code it.

All solutions are programmed in R, and I use Rmarkdown to manage the MD files to present the problems in a comprehensive way.

If you have any questions or suggestions, I’d be grateful to receive your message.

• 01 Merge Strings Alternately
• 02 Greatest Common Divisor of Strings
• 03 Kids With the Greatest Number of Candies
• 04 Can Place Flowers
• 05 Reverse Vowels of a String
• 06 Reverse Words in a String
• 07 Product of Array Except Self
• 08 Increasing Triplet Subsequence

• 09 String Compression

• 10 Move Zeroes
• 11 Is Subsequence
• 12 Container With Most Water

• 13 Max Number of K-Sum Pairs

• 14 Maximum Average Subarray I
• 15 Maximum Number of Vowels in a Substring of Given Length
• 16 Max Consecutive Ones III

• 17 Longest Subarray of 1’s After Deleting One Element

• 18 Find the Highest Altitude

• 19 Find Pivot Index

• 20 Find the Difference of Two Arrays
• 21 Unique Number of Occurrences