Increasing Triplet SubsequenceIntroduction Today, I tackled an interesting medium-level problem from LeetCode: Increasing Triplet Subsequence. This problem requires a good understanding of arrays and greedy algorithms. The goal is to determine if there exists a triplet in the arr...Jul 22, 2024 路 3 min readjayjava.hashnode.dev
First Missing PositiveIntroduction Today, I took on a challenging problem from LeetCode: First Missing Positive. This hard-level question tests your algorithmic skills, requiring an O(n) time complexity solution with O(1) auxiliary space. The goal is to find the smallest ...Jul 20, 2024 路 4 min readjayjava.hashnode.dev
Max Number of K-Sum PairsIntroduction Today, I tackled another intriguing problem from LeetCode 75: Max Number of K-Sum Pairs. This medium-level question requires an understanding of arrays and the two-pointer technique. The goal is to find the maximum number of operations y...Jul 15, 2024 路 4 min readjayjava.hashnode.dev
Find Pivot IndexIntroduction Today, I tackled another intriguing problem from LeetCode 75: Find Pivot Index. This easy-level question requires an understanding of prefix sums and arrays. The goal is to find the pivot index where the sum of the numbers to the left of...Jul 15, 2024 路 3 min readjayjava.hashnode.dev
Container With Most WaterIntroduction Today, I tackled an interesting problem from LeetCode 75: Container With Most Water. This medium-level question requires knowledge of two pointers and greedy algorithms. It involves finding the maximum amount of water a container can sto...Jul 14, 2024 路 3 min readjayjava.hashnode.dev