Using For-Loop and If-statement, find all the numbers divisible by 3 in the 2D array "a2". Do not use any shortcut functions. The code should be able to work with any 2D array numbers of any size. a2-np.arange (1,21).reshape (4,5)

Help please. I keep on getting the error color_picker.js:58 Uncaught ReferenceError: colors is not defined at generateColors (color_picker.js:58:25)

Write a loop that sets newScores to oldScores shifted once left, with element 0 copied to the end. Ex: If oldScores = {10, 20, 30, 40}, then newScores = {20, 30, 40, 10}.Note: These activities may test code with different test values. This activity will perform two tests, both with a 4-element array (int oldScores[4]). See "How to Use zyBooks".Also note: If the submitted code tries to access an invalid array element, such as newScores[9] for a 4-element array, the test may generate strange results. Or the test may crash and report "Program end never reached", in which case the system doesn't print the test case that caused the reported message. import java.util.Scanner; public class StudentScores { public static void main (String [] args) { Scanner scnr = new Scanner(System.in); final int SCORES_SIZE = 4; int[] oldScores = new int[SCORES_SIZE]; int[] newScores = new int[SCORES_SIZE]; int i; for (i = 0; i < oldScores.length; ++i) { oldScores[i] = scnr.nextInt(); } for (i = 0; i...

There are 4 mistakes in the code. Can you please show me the mistakes?

Can you help me please: have the program know when numbers out of the array boundaries are received and mitigate those problems. The given code intentionally induces numbers out of bounds and the student’s portion must correct for this. As always use a header file and implementation file to do those calculations. Remember not to change the given code below in any way Design and implement the class myArray that solves the array index out of bounds problem and also allows the user to begin the array index starting at any integer, positive or negative. Every object of type myArray is an array of type int. During execution, when accessing an array component, if the index is out of bounds, the program must terminate with an appropriate error message. Consider the following statements:myArray list(5); //Line 1 myArraymyList(2, 13); //Line 2myArray yourList(-5, 9); //Line 3The statement in Line 1 declares list to be an...

Write a function that takes in an array of integers and returns the integers that are either palindromes or almost-palindromes. An almost-palindrome is any integer that can be rearranged to form a palindrome. For example, the numbers 677 and 338 are both almost-palindromes, since they can be rearranged to form 767 and 383, respectively. Examples palindromeSieve ([443, 12, 639, 121, 3232]) [443, 121, 3232] // Since 443 => 434; 121 is a palindrome; 3232 => 2332 or 3223 palindromeSieve([5, 55, 6655, 8787]) → [5, 55, 6655, 8787] // Single-digit numbers are automatically palindromes. palindromeSieve ([897, 89, 23, 54, 6197, 53342]) - []

An array is positive dominant if it contains strictly more unique positive values than unique negative values. Write a function that returns true if an array is positive dominant. Examples ispositiveDominant([1, 1, 1, 1, -3, -4]) // There is only 1 unique positive value (1). // There are 2 unique negative values (-3, -4). ispositiveDominant([5, 99, 832, -3, -4]) → true ispositiveDominant([5, 0]) → true ispositive Dominant([0, -4, -1]) → false

Q1. What is the suffix array of the string "abbaba$"? You are not required to include cyclic rotations in your answer. Q2. What is the longest common prefix array of the string "abbaba$"? Assume that the longest common prefix between the empty string and any other string is of length 0.