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...
#leetcodedaily
Articles tagged with #leetcodedaily
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 Daily Challenge-2210 Count Hills and Valleys in an Array(Easy, Two Pointers, O(n))
Problem Description LeetCode 2210 asks us to count the number of hills and valleys in an array. A hill is an element that is strictly greater than its neighbors, while a valley is an element that is strictly smaller than its neighbors. The key challe...
Jul 27, 20254 min read2
LeetCode Daily Challenge-LeetCode 1948 Delete Duplicate Folders in System-Two Solutions(Hard, Java)
Problem Understanding LeetCode 1948-Delete Duplicate Folders in System The goal is to delete all duplicate folder subtrees. Two folders are considered duplicates if they have the same structure and folder names in their subtrees. Solution 1: Standa...
Jul 20, 20256 min read5
LeetCode Daily Challenge-2163: Minimum Difference in Sums After Removal of Elements(Hard, Java, DP+priorityQueue+greedy)
TC O(n log n) SC O(n) using minHeap, maxHeap and DP
Jul 18, 20256 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