https://www.geeksforgeeks.org/subset-sum-problem-dp-25/
class Solution {
static boolean isSumK(int[] nums, int curin, int curSum) {
if(curSum==0) {
return true;
}
if(curin<0) {
return false;
}
return isSumK(nums, curin-1, curSum-nums[curin])
|| isSumK(nums, curin-1, curSum);
}
static Boolean isSubsetSum(int N, int arr[], int sum) {
// code here
return isSumK(arr, N-1, sum);
}
}
Group Anagrams https://leetcode.com/problems/group-anagrams/
class Solution {
public List<List<String>> groupAnagrams(String[] strs) {
HashMap<String, List<String>> hm = new HashMap<>();
for(int i=0;i<strs.length;i++) {
char[] s = strs[i].toCharArray();
Arrays.sort(s);
String k = new String(s);
if(hm.containsKey(k)) {
hm.get(k).add(strs[i]);
} else {
List<String> ls = new ArrayList<String>();
ls.add(strs[i]);
hm.put(k,ls);
}
}
List<List<String>> ans = new ArrayList<List<String>>();;
for (String p:hm.keySet()) {
ans.add(hm.get(p));
}
return ans;
}
}
