LeetCode Daily Challenge-904. Fruit Into Baskets(Python, Med, O(n))
Sliding window+Hashmap, Optimal Python Solution | TC O(n) SC O(1)
Aug 4, 20254 min read7
Command Palette
Search for a command to run...
#leetcode-medium
Articles tagged with #leetcode-medium
LeetCode Daily Challenge-2044 Count Number of Maximum Bitwise-OR Subsets
Problem Description LeetCode 2044: Count Number of Maximum Bitwise-OR Subsets Given an integer array nums, we need to: Find the maximum possible bitwise OR of any subset of nums Return the count of different non-empty subsets that achieve this max...
Jul 28, 20258 min read1
LeetCode 1695-Maximum Erasure Value(Med, Java, O(n))
Problem Description 1695. Maximum Erasure Value This problem asks us to find the maximum sum of a contiguous subarray where all elements are unique (no duplicates). We need to identify the subarray with unique elements that has the largest sum and ...
Jul 22, 20253 min read1
LeetCode Daily Challenge-1233. Remove Sub-Folders from the Filesystem(Med, Java)
Two solutions: Sorting+Prefix Check vs Trie (Prefix Tree) TC: both O(n log n + n·m) SC: O(1) vs O(n·m)
Jul 19, 20253 min read1
LeetCode 560. Subarray Sum Equals K - From Intuitive O(n²) to Optimized O(n) solution using HashMap(Med, Java)
Problem Statement LeetCode 560. Subarray Sum Equals K Given an integer array nums and an integer k, return the total number of continuous subarrays whose sum is equal to k. Example: Input: nums = [1,1,1], k = 2 Output: 2 (subarrays [1,1] at indice...
Jul 17, 20253 min read2
LeetCode 3202. Find the Maximum Length of Valid Subsequence II - DP(Med, Java, O(kn))
Find subsequence where (nums[i] + nums[i+1]) % k is the same for all pairs
Jul 17, 20255 min read4