LeetCode 75 study plan

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

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.

The plan study is struturated in the next topics :

Arrays & Strings Two Pointers Sliding Window Prefix Sum HashMap/Set Stack Queue Linked List Binary Tree - DFS Binary Tree - BFS Binary Search Tree

Graphs - DFS Graphs - BFS Heap / Priority Queue Binary Search Backtracking DP - 1D DP - Multidimensional Bit Manipulation Trie Intervals Monotonic Stack

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.

Array / String

• 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

Two Pointers

• 10 Move Zeroes
• 11 Is Subsequence
• 12 Container With Most Water
• 13 Max Number of K-Sum Pairs

Sliding Window

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