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
Command Palette
Search for a command to run...
#sorting
Articles tagged with #sorting
LeetCode Problem 1356 Sort Integers by The Number of 1 Bits (Easy, Java, O(nlogn))
An example of boxing and unboxing
Jul 11, 20257 min read3
LeetCode Daily Challenge-1498. Number of Subsequences That Satisfy the Given Sum Condition(Med)
Mastering Two-Pointer Technique with Combinatorics: From O(2^n) to O(n log n)
Jul 3, 20253 min read1
LeetCode Daily Challenge-2099. Find Subsequence of Length K With the Largest Sum(Easy)
Mastering the Art of Greedy Selection While Preserving Order
Jul 3, 20254 min read6
LeetCode Daily Challenge-3085. Minimum Deletions to Make String K-Special
Greedy Algorithms Can Miss Global Optimums: Why Always Targeting the Maximum Isn't Always Optimal
Jun 22, 20255 min read9