set

[Solved] Get Last element from unordered_set [closed]

by

In an unordered_set, the order of inserts does not necessarily correspond to the order that you will get when the set is iterated (hence the name “unordered”). Part of the reason why a bi-directional iterator is not supported(using a — operator) in this data structure is because being able to go backwards/forwards on an unordered_set … Read more

[Solved] Removing duplicates from arraylist using set

by

Find the intersection Find the union Subtract the intersection from the union Code: public static void main(String[] args) { Set<Integer> set1 = new HashSet<Integer>(Arrays.asList(1, 2, 3, 4, 5)); Set<Integer> set2 = new HashSet<Integer>(Arrays.asList(1, 3, 6, 7)); Set<Integer> intersection = new HashSet<Integer>(set1); intersection.retainAll(set2); // set1 is now the union of set1 and set2 set1.addAll(set2); // set1 … Read more

[Solved] Given a positive integer N as input, how do I find the product of the numbers in their subsets?

by

Well, there is a very easy and naive recursive solution to retrieving all subsets. You take away one element from your set, then find all subsets for this new, smaller set. Then you copy the result and add the element you previously removed to the copy. Add the results together and you’re done. For example: … Read more

[Solved] What would be the python function that returns a list of elements that only appear once in a list [duplicate]

by

Here is the function that you were looking for. The Iterable and the corresponding import is just to provide type hints and can be removed if you like. from collections import Counter from typing import Iterable d = [1,1,2,3,4,5,5,5,6] def retainSingles(it: Iterable): counts = Counter(it) return [c for c in counts if counts[c] == 1] … Read more

[Solved] Generating sets of array in perl

by

Loop over @nobreak? my $s=”MALWMRLLPLLALLALWGPDPAAAFVNQHLCGSHLVEALYLVCGERGFFYTPKTRREAEDLQVGQVELGGGPGAGSLQPLALEGSLQKRGIVEQCCTSICSLYQLENYCN”; print “Results of 1-Missed Cleavage:\n\n”; my @nobreak = (37,45,57,59); for my $nobreak (@nobreak) { substr($s, $nobreak-1, 1) = “\0”; my @a = split(/E(?!P)/, $s); substr($s, $nobreak-1, 1) = ‘E’; $_ =~ s/\0/E/g foreach (@a); $result = join (“E,”, @a); @final = split(/,/, $result); print “@final\n”; } solved Generating sets of … Read more