Search for a command to run...
Articles tagged with #leetcode
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...
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...
TC O(n log n) SC O(n) using minHeap, maxHeap and DP
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...
Find subsequence where (nums[i] + nums[i+1]) % k is the same for all pairs
Find subsequence where (nums[i] + nums[i+1]) % 2 is the same for all pairs
