Code a method in java called diffArList that: Takes two array lists of Strings arL1 & arL2 as input Returns a new array list contains all the values of arL1 that cannot be found in arL2. Notes you must not use any of these built-in methods: contains, lastIndexOf indexOf. Your code should be efficient (i.e. exist loop if it meets a condition) and should use the appropriate loop pattern 2

Code a method in java called diffArList that: Takes two array lists of Strings arL1 & arL2 as input Returns a new array list contains all the values of arL1 that cannot be found in arL2. Notes you must not use any of these built-in methods: contains, lastIndexOf indexOf. Your code should be efficient (i.e. exist loop if it meets a condition) and should use the appropriate loop pattern 2

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

Nedd help in this. Must be in java. make the code unique and no plagerism. write a program that prints out the lists in main after the following methods are called. removeOddLength: Takes an ArrayList of strings as a parameter and removes all of the strings that have an odd length (number of characters), from the list. Return the ArrayList to main and print. swapPairs: Takes an ArrayList and switches the order of values of strings in a pairwise fashion. Your method should switch the order of the first two values, then the next two, then the next two and so on. If the number of values in the list is odd, the method should not move the final element. For example, if the list stores [“madam”, “I”, “am”, “your”, “adam”] your method should change this lists content to [“I”, “madam”, “your”, “am”, “adam”] Return the ArrayList to main and print. intersect: Accepts two sorted ArrayList of integers as parameters and returns one containing only the elements that are found in both. For…
The split method in the String class returns an array of strings consisting of the substrings split by the delimiters. However, the delimiters are not returned. Implement the following new method that returns an array of strings consisting of the substrings split by the matching delimiters, including the matching delimiters. public static String[] split(String s, String regex) For example, split("ab#12#453", "#") returns ab, #, 12, #, and 453 in an array of String and split("a?b?gf#e", "[?#]") returns a, ?, b, ?, gf, #, and e in an array of String.
Write a static method named "mostVowels" that accepts two arrays of strings str1 and str2 as parameters and returns a new array str3 such that each element of str3 at each index i stores whichever string has greater number of vowels when comparing the elements at that same index i in arrays str1 and str2. If there is a tie, take the element from str1. You may create additional helper methods if desired.For example, if a1 and a2 store the following elements: String[] str1 = {"star", "pie", "jelly bean", "car"}; String[] str2 = {"cookie", "fig", "banana", "soda"};Then your method should return the new array {"cookie", "pie", "jelly bean", "soda"}If the arrays str1 and str2 are not the same length, the result returned by your method should have as many elements as the smaller of the two arrays. For example, if str1 and str2 store the following elements: String[] str1 = {"Splinter", "Leo", "April", "Don", "Raph"}; String[] str2 = {"Krang", "Shredder",…
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.
Write a Program in Java programming: Support you have an ArrayList containing random integers. These integers can be any number, and each integer can appear more than once. For example, [2, 19, 21, 19, 21, 1, 3, 3, 6, 21, .....] Your job is to write a method called findEvenFrequentNumbers(ArrayList<Integer> list) that returns an ArrayList which has all the numbers appears in even frequency and in increasing order. e.g. list = [2, 19, 21, 19, 21, 1, 3, 3, 6, 21], should return [3, 19] list = [3, 3, 3, 1, 2, 2, 2, 2, 2], should return [] list = [1, 1, 1, 1, 1], should return [1] Note that you need to provide a class with the main function and also the imports.
(IN JAVA) Implement a mergeUniqueValues(arr1, arr2) method. When passed two arrays of strings, it will return an array containing the strings that appear in either or both arrays in sorted order. And the returned array should have no duplicates. For example, if you have two string arrays: arr1: {“Bear”, “Elephant”,”Fox”}arr2: {“Panda”, “Elephant”,”Eagle”} Calling mergeUniqueValues(arr1, arr2) should return a merged and sorted array like: Bear, Eagle, Elephant, Fox, Panda
Write a method manyStrings that takes an ArrayList of Strings and an integer n as parameters and that replaces every String in the original list with n of that String. For example, suppose that an ArrayList called "list" contains the following values: ("squid", "octopus") And you make the following call: manyStrings(list, 2); Then list should store the following values after the call: ("squid", "squid", "octopus", "octopus") As another example, suppose that list contains the following: ("a", "a", "b", "c") and you make the following call: manyStrings(list, 3); Then list should store the following values after the call: ("a", "a", "a", "a", "a", "a", "b", "b", "b", "c", "c", "c") You may assume that the ArrayList you are passed contains only Strings and that the integer n is greater than 0.
run the main() method of class Lab11D. Pls do the SWAPIN LAB 11D and below is the tester For example, A B C D E F should turn into D E F A B C. You should assume that the array list has an even number of elements (not necessarily 6). One solution is to keep removing the element at index 0 and adding it to the back. Each step would look like this: A B C D E F B C D E F A C D E F A B D E F A B C When you run the code, you will find that there is a lot of movement in the array list. Each call to remove(0) causes n - 1 elements to move, where n is the length of the array. If n is 100, then you move 99 elements 50 times, (almost 5000 move operations). That's an inefficient way of swapping the first and second halves. (Learn more about time complexity at the end of the lab). Come up with a better way in which you swap the elements directly. Hint: How do you swap the two elements A and D? A B C D E F D B C A E F D E C A B F D E F A B C Write pseudocode for this algorithm. Add…
Write a method that removes the duplicate elements froman array list of integers using the following header:public static void removeDuplicate(ArrayList<Integer> list)Write a test program that prompts the user to enter 10 integers to a list and displaysthe distinct integers in their input order and separated by exactly one space.Here is a sample run: Enter 10 integers: 34 5 3 5 6 4 33 2 2 4 ↵EnterThe distinct integers are 34 5 3 6 4 33 2
6. In Java Write a static method transpose() that receives as parameter, a 2D square array numArof integers, and swaps the row and column of each element. For example:6 7 8 0 6 3 1 23 2 4 5 → 7 2 5 01 5 8 2 8 4 8 92 0 9 3 0 5 2 3Hint: Once you find the largest-sum column, you will need to swap its entries with the first column,element-by-element.
Write a Java program using ArrayLists that repeatedly asks user to enternumbers. Your program should print the entered numbers and average of thesenumbers. If the user enters ”u”, your program should delete the last enterednumber from the ArrayList. If the user enteres ”r”, the program should removeall elements from the list. If the user enters ”q”, the program should terminate. Hint: You can convert Strings like ”1” to integers with the following code:String str = "1";int one = Integer.parseInt(str);
Write a Java program that uses ArrayList and Iterator. It should input from user the names and ages of your few friends in a loop and add into ArrayList. Finally, it should use an Iterator to display the data in a proper format. ( Sample run of the program:-) List of my Friends Enter name and age [friend# 0] Khalid Al-shamri 22.5 Do you want to add another friend (y/n)? y Enter name and age [friend# 1] Rahsed Al-anazi 21.1 Do you want to add another friend (y/n)? y Enter name and age [friend# 2] Salem Al-mutairi 23.7 Do you want to add another friend (y/n)? n Here is the data you entered: 0. Khalid Al-shamri, 22.5 1. Rahsed Al-anazi, 21.1 2. Salem Al-mutairi, 23.7