LeetCode Daily Challenge-3477. Fruits Into Baskets II(Easy, O(n²))
Unavoidable O(n²) - Optimal Solution in Python, Java, Golang, C, C#, C++
Aug 5, 20254 min read3
Command Palette
Search for a command to run...
#daily-leetcode-challenge
Articles tagged with #daily-leetcode-challenge
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-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-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 Daily Challenge-3304. Find the K-th Character in String Game I(Easy)
Binary Tree Structure Meets String Transformation
Jul 4, 20256 min read4
LeetCode Daily Challenge-3333: Find the Original Typed String II - Advanced Dynamic Programming Solution(Hard)
Combinatorics + Dynamic Programming: The "Total Minus Invalid" Approach
Jul 4, 20255 min read