diff --git a/README.md b/README.md index 371753e0..33de8e83 100644 --- a/README.md +++ b/README.md @@ -63,6 +63,7 @@ My accepted leetcode solutions to some of the common interview problems. - [Meeting Scheduler](problems/src/array/MeetingScheduler.java) (Medium) - [Minimum Swaps to Group All 1's Together](problems/src/array/MinimumSwapsToGroupAll1Together.java) (Medium) - [Array Nesting](problems/src/array/ArrayNesting.java) (Medium) +- [Group the People Given the Group Size They Belong To](problems/src/array/PeopleGroupBySize.java) (Medium) #### [Backtracking](problems/src/backtracking) diff --git a/problems/src/array/PeopleGroupBySize.java b/problems/src/array/PeopleGroupBySize.java new file mode 100644 index 00000000..45edee40 --- /dev/null +++ b/problems/src/array/PeopleGroupBySize.java @@ -0,0 +1,73 @@ +/* +Submitted by: Akash Vartak https://github.com/akash-vartak +Problem: https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/ +Difficulty: Medium +*/ + +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.ArrayList; +import java.util.List; + +public class PeopleGroupBySize +{ + public static void main(String args[]) throws IOException + { + BufferedReader obj = new BufferedReader(new InputStreamReader(System.in)); + + int a[] = {2,1,3,3,3,2}; + + List> ret = groupThePeople(a); + + for(int i=0;i list = ret.get(i); + for(int j=0;j> groupThePeople(int[] groupSizes) + { + List> combined = new ArrayList>(); + + boolean done[] = new boolean[groupSizes.length]; + for(int i=0;i list1 = new ArrayList(); + for(int i=0;i(); + } + } + + return combined; + } +}