JCJay Choukseyinjayjava.hashnode.dev路Jul 22, 2024 路 3 min readIncreasing 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...00
JCJay Choukseyinjayjava.hashnode.dev路Jul 20, 2024 路 4 min readFirst 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 ...00
JCJay Choukseyinjayjava.hashnode.dev路Jul 15, 2024 路 4 min readMax 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...00
JCJay Choukseyinjayjava.hashnode.dev路Jul 15, 2024 路 3 min readFind 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...00
JCJay Choukseyinjayjava.hashnode.dev路Jul 14, 2024 路 3 min readContainer 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...00