Homework Answers
Since you have not mentioned the language of your preference, i am providing the code in Java.
Please find the code below.
CODE
public List<Double> duplicates (List<Double> input) {
Map<Double, Integer> map = new HashMap<>();
for (Double inp : input) {
if (map.containsKey(inp)) {
map.put(inp, map.get(inp) + 1);
} else {
map.put(inp, 1);
}
}
List<Double> res = new ArrayList<>();
for (Map.Entry<Double, Integer> en : map.entrySet()) {
if (en.getValue() > 1) {
res.add(en.getKey());
}
}
return res;
}
Add Answer to:
Write a method List-Double> duplicates(List<Double> input) that returns a List of all duplicates in the input...
Write a method List duplicates(List-Doubles input) that returns a List af all duplicates in the i...
Write a method List duplicates(List-Doubles input) that returns a List af all duplicates in the input List. You may assume thai each elemert occurs either once or twicc. The expected runtime nust be Oo) whece n is the number a elements (even if the input is a Linkodl ist, the runtime should still he n) ino credit for slower runtimes, so you cancsot sort the input). (12 point) Examples: input 13, 4,4 retum [4 input 13.7, 4, 7,3] rctum 17,...
Need help to answer this method in java Write a method int indexFirstOne(int[ ] input) The...
Need help to answer this method in java Write a method int indexFirstOne(int[ ] input) The input array is sorted, and every element is 0 or 1. Return the index of the first 1. If there are no 1s in the array, return -1. The worst-case runtime must be O(logn)where n is the number of elements (no credits for slower runtimes) Example: a = [0,0,1,1,1] return 2 a = [ 0,0,0,1] return 3 a = [0,0,0] return -1 int indexFirstOne...
JAVA - Write a recursive function that takes a linked list as input and returns all...
JAVA - Write a recursive function that takes a linked list as input and returns all of the elements in the linked list. Input: 1, 2, 3, 4, 5 Output: (1+2+3+4+5)/5 = 3 What I have: public static int findMean (Node head, Node cur, int n){ int average = 0; if (head == null){ if(n == 0) return 0; } if (n > 0){ int sum = n + findMean(head, head.next, n -1); average = (sum)/n; } return average; }...
DO NOT CHANGE THE METHOD HEADER Write a method int indexFirstOne (int [] input) The input...
DO NOT CHANGE THE METHOD HEADER Write a method int indexFirstOne (int [] input) The input array is sorted and every element is 0 or 1. Return the index of the first 1. If there are no 1s in the array, return -1. The worst case runtime must be O(logn) where n is the number of elements. Example a = [0, 0, 1, 1, 1] return 2
Consider the following problem: Input: a list of n-1 integers and these integers are in the...
Consider the following problem: Input: a list of n-1 integers and these integers are in the range of 1 to n. There are no duplicates in list. One of the integers from 1 to n is missing in the list. Output: find the missing integer Let the input array be [2, 4, 1, 6, 3, 7, 8]. Elements in this list are in the range of 1 to 8. There are no duplicates, and 5 is missing. Your algorithm needs...
Problem 1 Given a linked list of integers, write a function getUnique that removes all duplicates elements in the linked list and returns the new linked list of unique elements (The order does not ma...
Problem 1 Given a linked list of integers, write a function getUnique that removes all duplicates elements in the linked list and returns the new linked list of unique elements (The order does not matter). Example: Input: 1-»2->3->1-2 Output: 1->2->3 public class Node f int iterm Node next; Node(int d) t item = d; next-null; ) import java.util.ArrayList; public class ExtraLab public static void main (String[] args)t PROBLEM 1 System.out.println("PROBLEM 1"); Node head new Node(1); head.next-new Node (2); head.next.next-new Node(3);...
java Create the following classes: DatabaseType: an interface that contains one method 1. Comparator getComparatorByTrait(String trait)...
java
Create the following classes: DatabaseType: an interface that contains one method 1. Comparator getComparatorByTrait(String trait) where Comparator is an interface in java.util. Database: a class that limits the types it can store to DatabaseTypes. The database will store the data in nodes, just like a linked list. The database will also let the user create an index for the database. An index is a sorted array (or in our case, a sorted ArrayList) of the data so that searches...
Write a method max() which take a generic singly linked list as an argument and returns...
Write a method max() which take a generic singly linked list as an argument and returns the maximum element reference in the list. If the list is empty, please throw an empty collection exception. The method prototype is defined as follows. Please write down your code in the method body enclosed in braces: public static <T extends Comparable<T>> T max(SingleLinkedList<T> list) throws EmptyCollectionException { } 2) What is the big O notation of the max method? a) O(N)...
Use the FDR to design and write a function, maxValTimes, that takes a list of integers...
Use the FDR to design and write a function, maxValTimes, that takes a list of integers and returns a set containing the value(s) that occur the same number of times as the maximum value in the list. If the list is empty, return an empty set. For example if the list was [2,1,1,2,3,3,1] the function would return {2,3} as the maximum value is 3 which occurs twice, and 2 also occurs twice (but 1 occurs 3 times). For full marks,...
please write in java 5.10. sameContents: this method takes one input parameters of type ThingSortedArrayBag. The...
please write in java
5.10. sameContents: this method takes one input parameters of type ThingSortedArrayBag. The method then returns true if the input bag includes the same elements as the current bag even if the count of each element may be different from one bag to the other. For example, the method should return true for the following two bags of integers. The method returns false otherwise. [1,1,2,2,3] and [1,2,3]
Write a method List duplicates(List-Doubles input) that returns a List af all duplicates in the input List. You may assume thai each elemert occurs either once or twicc. The expected runtime nust be Oo) whece n is the number a elements (even if the input is a Linkodl ist, the runtime should still he n) ino credit for slower runtimes, so you cancsot sort the input). (12 point) Examples: input 13, 4,4 retum [4 input 13.7, 4, 7,3] rctum 17,...
Problem 1 Given a linked list of integers, write a function getUnique that removes all duplicates elements in the linked list and returns the new linked list of unique elements (The order does not matter). Example: Input: 1-»2->3->1-2 Output: 1->2->3 public class Node f int iterm Node next; Node(int d) t item = d; next-null; ) import java.util.ArrayList; public class ExtraLab public static void main (String[] args)t PROBLEM 1 System.out.println("PROBLEM 1"); Node head new Node(1); head.next-new Node (2); head.next.next-new Node(3);...
java
Create the following classes: DatabaseType: an interface that contains one method 1. Comparator getComparatorByTrait(String trait) where Comparator is an interface in java.util. Database: a class that limits the types it can store to DatabaseTypes. The database will store the data in nodes, just like a linked list. The database will also let the user create an index for the database. An index is a sorted array (or in our case, a sorted ArrayList) of the data so that searches...
please write in java
5.10. sameContents: this method takes one input parameters of type ThingSortedArrayBag. The method then returns true if the input bag includes the same elements as the current bag even if the count of each element may be different from one bag to the other. For example, the method should return true for the following two bags of integers. The method returns false otherwise. [1,1,2,2,3] and [1,2,3]
Most questions answered within 3 hours.
-
Consider the reaction, C3 H8 + O2 --> CO2 + H2O. How many
moles of O2...
asked 49 minutes ago -
You and your opponent both roll a fair die. If you both roll the
same number,...
asked 1 hour ago -
In a study of the accuracy of fast food drive-through orders,
Restaurant A had 257 accurate...
asked 1 hour ago -
Identify and describe in detail the four categories of
institutions that could be included in a...
asked 1 hour ago -
In python
class Customer:
def __init__(self, customer_id, last_name, first_name, phone_number, address):
self._customer_id = int(customer_id)
self._last_name =...
asked 1 hour ago -
What is an example of a limitation in implementing a new
ERP system and how it...
asked 1 hour ago -
In a section of 9.7cm of an artery with a radius of 2.6mm there
is a...
asked 1 hour ago -
the two carboxylic acid groups of aspartic acid have different
acidities with pKa values of 2.1...
asked 1 hour ago -
Would CuCO3 aqueous salt combined with calcium chloride
form a solid precipitate? If so, what would...
asked 1 hour ago -
How do ECM Solutions assist in embedding a culture of continuous
improvement in an organization? (Project...
asked 1 hour ago -
Directions
These directions introduce the idea of Essential Questions.
Since this may be a new concept...
asked 1 hour ago -
1.b. Fiscal policy is said to suffer from ‘crowding out’.
Explain what this means and why...
asked 1 hour ago