Hhimanshu·Feb 28Day 20 - Search in Rotated Sorted ArrayQuestion 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: [33 min read·blogs-himanshu.hashnode.dev
Hhimanshu·Feb 20Day 16 - Daily TemperaturesQuestion 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 the4 min read·blogs-himanshu.hashnode.dev
PPRANAY JAISWAL·Sep 19, 2025Mastering Priority System DesignIn 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
NNITIN AHIRWAL·Sep 19, 2025🚀 LeetCode Challenge (Day 4): Design Spreadsheet ProblemToday’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
AAnni Huang·Aug 4, 2025LeetCode Daily Challenge-904. Fruit Into Baskets(Python, Med, O(n))Sliding window+Hashmap, Optimal Python Solution | TC O(n) SC O(1)4 min read·huanganni.hashnode.dev
AAnni Huang·Jul 28, 2025LeetCode Daily Challenge-2044 Count Number of Maximum Bitwise-OR SubsetsProblem 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
AAnni Huang·Jul 22, 2025LeetCode 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 ...3 min read·huanganni.hashnode.dev
AAnni Huang·Jul 19, 2025LeetCode 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)3 min read·huanganni.hashnode.dev
AAnni Huang·Jul 17, 2025LeetCode 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...3 min read·huanganni.hashnode.dev
AAnni Huang·Jul 17, 2025LeetCode 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 pairs5 min read·huanganni.hashnode.dev
