Write the method filterBySize(). * * * Given an ArrayList of String, return a new list where only strings of the given length are retained. * * Examples: filterBySize(["a", "bb", "b", "ccc"], 1) returns| ["a", "b"] filterBySize(["a", "bb", "b", "ccc"], 3) returns ["ccc"] filterBySize(["a", "bb", "b", "ccc"], 4) returns [] * * * * @param list the list of Strings to process. @param n the size of words to retain. @return a new list of words with the indicated size retained. * * * */ // TODO - Write the filterBySize method here.

Write the method filterBySize(). * * * Given an ArrayList of String, return a new list where only strings of the given length are retained. * * Examples: filterBySize(["a", "bb", "b", "ccc"], 1) returns| ["a", "b"] filterBySize(["a", "bb", "b", "ccc"], 3) returns ["ccc"] filterBySize(["a", "bb", "b", "ccc"], 4) returns [] * * * * @param list the list of Strings to process. @param n the size of words to retain. @return a new list of words with the indicated size retained. * * * */ // TODO - Write the filterBySize method here.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

using arrays or Arraylist in Java language Write the method filterBySize().* * Given an ArrayList of String, return a new list where only * strings of the given length are retained.* * Examples:* filterBySize(["a", "bb", "b", "ccc"], 1) returns ["a", "b"]* filterBySize(["a", "bb", "b", "ccc"], 3) returns ["ccc"]* filterBySize(["a", "bb", "b", "ccc"], 4) returns []* * @param list the list of Strings to process.* @param n the size of words to retain.* @return a new list of words with the indicated size retained.
Implement unique method that takes an ArrayList as input and returns an ArrayList withexactly a single occurrence of each element from the input list. For example, if the input listcontains 5, 6, 7, 6, 3, 5, 5, 4 then the output list should have 5, 6, 7, 3, 4.Note: (1) You may assume that the ArrayList has a specific type of elements in it. In the class, we assumedit to have String type values. (2) You may only work with ArrayList(s).
Add a void instance method replaceAll(E oldE, E newE) in the MyLinkedList class to replace the occurrence of all oldE value with the specified newE value. Implement this method in O(n) time. import java.util.*; public class PExamCh24 { public static void main(String[] args) { new PExamCh24();}public PExamCh24() { // Create a list for strings MyLinkedList<String> list = new MyLinkedList<>(); // Add elements to the list list.add("America"); // Add America to the list System.out.println("(1) " + list); list.add(0, "Japan"); // Add Canada to the beginning of the list System.out.println("(2) " + list); list.add("Russia"); // Add Russia to the end of the list System.out.println("(3) " + list); list.addLast("Japan"); // Add France to the end of the list System.out.println("(4) " + list); list.add(2, "Japan"); // Add Germany to the list at index 2 System.out.println("(5) " + list); list.add(5, "Norway"); // Add Norway to the list…
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Implement a nested class DoubleNode for building doubly-linked lists, whereeach node contains a reference to the item preceding it and the item following it in thelist (null if there is no such item). Then implement static methods for the followingtasks: insert at the beginning, insert at the end, remove from the beginning, removefrom the end, insert before a given node, insert after a given node, and remove a givennode.
Java Implement 5 methods given below in MyStringArrayList class // Add a new element, e, at the beginning of this list public void addFront(String e){ } //search for element e, returns true if found, otherwise returns false. public boolean contains(String e){ } //return the element at position i, otherwise returns null public String getElement(int i){ } // remove the element at specified index, returns the element that is being removed. Returns null if specified index is invalid. public String removeElementAt(int i){ } //returns a String representation of this list. public String toString(){ }
Implement a nested class DoubleNode for creating doubly-linked lists, with each node containing a reference to the item before and following it in the list (empty if no such item exists). Then, for the following jobs, implement static methods: insert at the beginning, insert at the end, remove from the beginning, remove from the end, insert before a given node, insert after a given node, and remove a given node.
Using the picture, use Java to design and implement the class PascalTriangle that will generate a Pascal Triangle from a given number of rows. Represent each row in a triangle as a list and the entire triangle as a list of these lists, implement the class ArrayList for these lists.
Fix the following method printEvenIndex so that it will print out the Integers at even indices of the passed-in ArrayList list. import java.util.*; public class Test1 { public static void printEvenIndex(ArrayList<Integer> list) { for (int i) { if (i % 2 == 1) { System.out.print(list.get(i) + ", "); } } } public static void main(String[] args) { //instantiate ArrayList and fill with Integers ArrayList<Integer> values = new ArrayList<Integer>(); int[] nums = {1, 5, 7, 9, -2, 3, 2}; for (int i = 0; i < nums.length; i ++) { values.add(nums[i]); } System.out.println("Expected Result:\t 1, 7, -2, 2,"); System.out.print("Your Result:\t\t "); printEvenIndex(values); } }
Implement a lastIndex method for the LinkedIntList class you worked on for HW4. This method takes an int argument and returns the largest index such that the int argument appears at that index in the list. If the int argument does not appear in the list, then -1 is returned. For example if the list example contained the numbers [4, -1, 2, 7, -1, 3] in that order, then example.lastIndex(-1) should return 4 and example.lastIndex(5) should return -1. In the text area below, write the definition of the lastIndex method. (In other words, write the code that should replace the //TODO comment.) Your code cannot call any methods. public class LinkedIntList { private class Node { private int item; private Node next; public Node() {} public Node(int number, Node nextNode) { item = number; next = nextNode; } } private Node first; // first node of the list public LinkedIntList() { first = null;…
import java.util.ArrayList;import java.util.Arrays;public class PS{/*** Write the method named mesh.** Start with two ArrayLists of String, A and B, each with* its elements in alphabetical order and without any duplicates.* Return a new list containing the first N elements from the two* lists. The result list should be in alphabetical order and without* duplicates. A and B will both have a size which is N or more.* Your solution should make a single pass over A and B, taking* advantage of the fact that they are in alphabetical order,* copying elements directly to the new list.** Remember, to see if one String is "greater than" or "less than"* another, you need to use the compareTo() method, not the < or >* operators.** Examples:* mesh(["a","c","z"], ["b","f","z"], 3) returns ["a","b","c"]* mesh(["a","c","z"], ["c","f","z"], 3) returns ["a","c","f"]* mesh(["f","g","z"], ["c","f","g"], 3) returns ["c","f","g"]** @param a an ArrayList of String in alphabetical order.* @param b an…
Write a method markLength4 that takes an ArrayList of Strings as a parameter and that places a String of four asterisks ("****") in front of every String of length 4. For example, suppose that an ArrayList called "list" contains the following values: (this, is, lots, of, fun, for, every, Java, programmer) And you make the following call: markLength4(list); Then list should store the following values after the call: (****, this, is, ****, lots, of, fun, for, every, ****, Java, programmer) Notice that you leave the original Strings in the list (this, lots, Java) but include the four-asterisk String in front of each to mark it. You may assume that the ArrayList contains only String values, but it might be empty.