Data Structure & Algorithms
  • 🖌️Unlocking the Power of Algorithms with C#
  • Data Structure
    • Data Structure
    • Big O
    • Array
    • Linked Lists
    • Stacks
    • Queues
    • Hash Tables
    • Trees
    • Graphs
    • Heap Sort
    • ParkingLot Algorithm
    • LRU cache
    • Priority Queue
  • Algorithms
    • Algorithm
    • Recursion
    • Sorting
    • Searching
    • Dynamic Programming
  • Problems
    • Array
      • Two Sum
      • Two Sum II - Input Array Is Sorted
      • Contains Duplicate
      • Maximum Subarray
      • House Robber
      • Move Zeroes
      • Rotate Array
      • Plus One
      • Find number of subarrays with even length
      • Find number of subarrays with even sum
      • Find Missing Element
      • Reduce Array Size to The Half
      • Remove Duplicates
      • Merge Sorted Arrays
      • Arrays Intersection
      • 3Sum
      • Trapping Rain Water
      • Maximum sum of a subarray
      • Longest Subarray
      • Subarray Sum Equals K
      • Container With Most Water
      • Missing Number
      • Roman to Integer
      • First Missing Positive
      • Unique Integers That Sum Up To 0
      • Integer to Roman
      • Flatten
    • String
      • Check if two strings are permutation of each other
      • String Compression
      • Palindrome Permutation
      • Determine if a string has all Unique Characters
      • One Away
      • Longest Substring Without Repeating Characters
      • Valid Palindrome
      • Valid Palindrome II
      • Backspace String Compare
      • First Unique Character in a String
      • Is Subsequence
      • URLify a given string
      • String has same characters at same position
      • Number of Ways to Split a String
      • Check whether two Strings are anagram of each other
      • Print last `n` lines of a big file or big string.
      • Multiply Strings
    • Matrix
      • Search a 2D Matrix
      • Search a 2D Matrix II
      • Rotate Matrix
      • Spiral Matrix
      • Set Matrix Zeroes
    • Bit Manipulation
      • Sum of Two Integers
      • Reverse Number
      • Reverse Number II
      • Binary Bits Count
      • Binary Bits Count II
    • Stack
      • Valid Parentheses
      • Balance or not expression
      • Decode String
    • Tree
      • Binary Tree Inorder Traversal
      • Binary Tree Preorder Traversal
      • Binary Tree Postorder Traversal
      • Binary Tree Level Order Traversal
      • Binary Tree Return All Root-To-Leaf Paths
      • Binary Tree Height-Balanced
      • Valid Binary Search Tree
      • Binary Tree Sum of all left leaves.
    • Linked List
      • Linked List Delete Middle Node
      • Merge Sorted Linked List
      • Reverse Linked List
      • Remove Duplicates from Sorted List
      • Remove Duplicates from Unsorted List
      • Linked List Cycle
    • Graph
      • The Number Of Islands
      • Number of Closed Islands
      • Max Area of Island
      • Rotting Oranges
      • Number of Provinces
      • Course Schedule
      • Surrounded Regions
      • Snakes and Ladders
      • Widest Path Without Trees
      • Knight Probability in Chessboard
      • Possible moves of knight
      • Check Knight Tour Configuration
      • Steps by Knight
      • Network Delay Time
    • Greedy
      • Best Time to Buy and Sell Stock
      • Best Time to Buy and Sell Stock II
      • Smallest Subset Array
      • Jump Game
    • Backtracking
      • Towers of Hanoi
      • Subsets
      • Combination Sum
      • Sudoku Solver
      • Word Search
    • Heap
      • Kth Largest Element in an Array
      • Top K Frequent Elements
    • Sorting
      • Order Colors String
    • Recursion
      • Number To Text
      • Divide Number
Powered by GitBook
On this page
  1. Problems
  2. Greedy

Smallest Subset Array

The task is to find the subset of array elements such that their sum should be greater than the half sum of the rest of the elements of the array. Also, subset array elements in ascending order.

Example 1:

**Input** [1, 2, 5, 10, 20, 1]
**Half Sum** 19
**Result** [20]

Example 2:

**Input** [1, 2, 5, 10, 20, 3, 7]
**Half Sum** 24
**Result** [1, 3, 20]

Solutions

The problem is a variant of the subset sum problem, which is a well-known problem in computer science. The subset sum problem is NP-complete, which means that there is no known algorithm that can solve all instances of the problem in polynomial time (such as O(n)).

Approach – Greedy Technique

The approach is to take the largest elements from the array, in that way we can decrease the size of the subset that has sum greater than the sum of rest of the elements of the array, so we sort the array in descending order, then take the largest elements, until we get strictly more than half of total sum of the given array.

Steps

  1. First calculate sum of all elements of an array.

  2. Take sum half.

  3. Sort an array element.

  4. Run loop till when sum of array elements is greater than the half sum of an array elements. If found then create a new subset array and copy elements in ascending order and return it, else return original array.


    public int[] Subset(int[] nums)
    {

        long sum = 0;
        for (int i = 0; i < nums.Length; i++)
        {
            sum += nums[i];
        }

        long target = sum / 2;

        sum = 0;
        Array.Sort(nums);

        for (int i = nums.Length - 1; i >= 0; i--)
        {
            sum += nums[i];
            if (sum > target)
            {
                var result = new int[nums.Length - i];
                for (int j = nums.Length - 1; j >= i; j--)
                {
                    result[j - i] = nums[j];
                }
                return result;
            }

        }

        return nums;
    }

Complexity

  • Time complexity: O(n log n)

  • Space complexity: O(k)

Here, k is size of subset array.

PreviousBest Time to Buy and Sell Stock IINextJump Game

Last updated 1 year ago