Mastering Priority System Design
Sep 19, 2025 · 2 min read · 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...
Join discussion🚀 LeetCode Challenge (Day 4): Design Spreadsheet Problem
Sep 19, 2025 · 2 min read · 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...
Join discussionLeetCode Daily Challenge-904. Fruit Into Baskets(Python, Med, O(n))
Aug 4, 2025 · 4 min read · Problem Statement 904. Fruit Into Baskets asks us to find the maximum number of consecutive fruits we can collect from a row of fruit trees, given that we can only use two baskets and each basket can hold only one type of fruit. The key constraints a...
Join discussion
LeetCode Daily Challenge-2044 Count Number of Maximum Bitwise-OR Subsets
Jul 28, 2025 · 8 min read · 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...
Join discussion
LeetCode 1695-Maximum Erasure Value(Med, Java, O(n))
Jul 22, 2025 · 3 min read · 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 ...
Join discussion
LeetCode Daily Challenge-1233. Remove Sub-Folders from the Filesystem(Med, Java)
Jul 19, 2025 · 3 min read · Problem Statement 1233. Remove Sub-Folders from the Filesystem Given an array of folder paths, remove all sub-folders from the filesystem and return the folders after removing all sub-folders in any order. A folder x is a sub-folder of folder y if ...
Join discussion
LeetCode 560. Subarray Sum Equals K - From Intuitive O(n²) to Optimized O(n) solution using HashMap(Med, Java)
Jul 17, 2025 · 3 min read · 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...
Join discussion
LeetCode 3202. Find the Maximum Length of Valid Subsequence II - DP(Med, Java, O(kn))
Jul 17, 2025 · 5 min read · Problem Statement 3202. Find the Maximum Length of Valid Subsequence II Given an integer array nums and a positive integer k, find the maximum length of a valid subsequence. A subsequence is valid if all consecutive pairs in the subsequence have th...
Join discussion