--- title: "#leetcode-medium articles | Hashnode" description: "Explore 35 articles tagged #leetcode-medium on Hashnode. Tutorials, guides, and how-tos from the community." url: "https://hashnode.com/tag/leetcode-medium" --- Tag # #leetcode-medium 35 posts · 0 followers [himanshu](https://hashnode.com/@Himanshu-) · [Feb 28](https://hashnode.com/posts/search-in-rotated-sorted-array/69a27f77d4053a09f3782dd4) ### [Day 20 - Search in Rotated Sorted Array](https://blogs-himanshu.hashnode.dev/search-in-rotated-sorted-array?utm_source=hashnode&utm_medium=feed) Question You are given an array of length n which was originally sorted in ascending order. It has now been rotated between 1 and n times. For example, the array nums = \[1,2,3,4,5,6\] might become: \[3 3 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/search-in-rotated-sorted-array?utm_source=hashnode&utm_medium=feed) [himanshu](https://hashnode.com/@Himanshu-) · [Feb 20](https://hashnode.com/posts/dailytemperature/6997f5ea587b14d25b776e64) ### [Day 16 - Daily Temperatures](https://blogs-himanshu.hashnode.dev/dailytemperature?utm_source=hashnode&utm_medium=feed) Question You are given an array of integers temperatures where temperatures\[i\] represents the daily temperatures on the ith day. Return an array result where result\[i\] is the number of days after the 4 min read · [blogs-himanshu.hashnode.dev](https://blogs-himanshu.hashnode.dev/dailytemperature?utm_source=hashnode&utm_medium=feed) [PRANAY JAISWAL](https://hashnode.com/@pranay717) · [Sep 19, 2025](https://hashnode.com/posts/mastering-priority-system-design/68cd00703db91dea29c81d23) ### [Mastering Priority System Design](https://pranay180825.hashnode.dev/mastering-priority-system-design?utm_source=hashnode&utm_medium=feed) In the recent few days the daily leetcode questions were from the topic of Priority Queue where we were needed to arrange elements in a particular order it may time, rating or let's day price why not With decent practice of Priority Queue, I tried to... 2 min read · [pranay180825.hashnode.dev](https://pranay180825.hashnode.dev/mastering-priority-system-design?utm_source=hashnode&utm_medium=feed) [NITIN AHIRWAL](https://hashnode.com/@nitinahirwal) · [Sep 19, 2025](https://hashnode.com/posts/leetcode-challenge-day-4-design-spreadsheet-problem/68cd555bebc0d959d789d673) ### [🚀 LeetCode Challenge (Day 4): Design Spreadsheet Problem](https://nitinahirwal.hashnode.dev/leetcode-challenge-day-4-design-spreadsheet-problem?utm_source=hashnode&utm_medium=feed) Today’s LeetCode problem was quite unique — instead of the usual algorithms or data structures, I had to simulate a mini spreadsheet system, something like a simplified version of Excel or Google Sheets. At first glance, it looked simple. But as with... 2 min read · [nitinahirwal.hashnode.dev](https://nitinahirwal.hashnode.dev/leetcode-challenge-day-4-design-spreadsheet-problem?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Aug 4, 2025](https://hashnode.com/posts/leetcode-daily-challenge-904-fruit-into-baskets/689073f589600b92f0382571) ### [LeetCode Daily Challenge-904. Fruit Into Baskets(Python, Med, O(n))](https://huanganni.hashnode.dev/leetcode-daily-challenge-904-fruit-into-baskets?utm_source=hashnode&utm_medium=feed) Sliding window+Hashmap, Optimal Python Solution | TC O(n) SC O(1) 4 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-daily-challenge-904-fruit-into-baskets?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 28, 2025](https://hashnode.com/posts/leetcode-daily-challenge-2044-count-number-of-maximum-bitwise-or-subsets/6886cf3b8ffbd14c41441442) ### [LeetCode Daily Challenge-2044 Count Number of Maximum Bitwise-OR Subsets](https://huanganni.hashnode.dev/leetcode-daily-challenge-2044-count-number-of-maximum-bitwise-or-subsets?utm_source=hashnode&utm_medium=feed) 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... 8 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-daily-challenge-2044-count-number-of-maximum-bitwise-or-subsets?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 22, 2025](https://hashnode.com/posts/leetcode-1695-maximum-erasure-valuemed-java-on/687fa9dc179cdbbf6a7f3846) ### [LeetCode 1695-Maximum Erasure Value(Med, Java, O(n))](https://huanganni.hashnode.dev/leetcode-1695-maximum-erasure-valuemed-java-on?utm_source=hashnode&utm_medium=feed) 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 ... 3 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-1695-maximum-erasure-valuemed-java-on?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 19, 2025](https://hashnode.com/posts/leetcode-daily-challenge-1233-remove-sub-folders-from-the-filesystemmed-java/687b7db405fba4a367914d71) ### [LeetCode Daily Challenge-1233. Remove Sub-Folders from the Filesystem(Med, Java)](https://huanganni.hashnode.dev/leetcode-daily-challenge-1233-remove-sub-folders-from-the-filesystemmed-java?utm_source=hashnode&utm_medium=feed) Two solutions: Sorting+Prefix Check vs Trie (Prefix Tree) TC: both O(n log n + n·m) SC: O(1) vs O(n·m) 3 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-daily-challenge-1233-remove-sub-folders-from-the-filesystemmed-java?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 17, 2025](https://hashnode.com/posts/leetcode-560-subarray-sum-equals-k-from-intuitive-on-to-optimized-on-solution-using-hashmapmed-java/6878b66f08ff986353c9ac2d) ### [LeetCode 560. Subarray Sum Equals K - From Intuitive O(n²) to Optimized O(n) solution using HashMap(Med, Java)](https://huanganni.hashnode.dev/leetcode-560-subarray-sum-equals-k-from-intuitive-on-to-optimized-on-solution-using-hashmapmed-java?utm_source=hashnode&utm_medium=feed) 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... 3 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-560-subarray-sum-equals-k-from-intuitive-on-to-optimized-on-solution-using-hashmapmed-java?utm_source=hashnode&utm_medium=feed) [Anni Huang](https://hashnode.com/@HuangAnni) · [Jul 17, 2025](https://hashnode.com/posts/leetcode-3202-find-the-maximum-length-of-valid-subsequence-ii-dpmed-java-okn/687861c825a78af7b88a3571) ### [LeetCode 3202. Find the Maximum Length of Valid Subsequence II - DP(Med, Java, O(kn))](https://huanganni.hashnode.dev/leetcode-3202-find-the-maximum-length-of-valid-subsequence-ii-dpmed-java-okn?utm_source=hashnode&utm_medium=feed) Find subsequence where (nums\[i\] + nums\[i+1\]) % k is the same for all pairs 5 min read · [huanganni.hashnode.dev](https://huanganni.hashnode.dev/leetcode-3202-find-the-maximum-length-of-valid-subsequence-ii-dpmed-java-okn?utm_source=hashnode&utm_medium=feed)