IN JAVA SCRIPT Programming Given a grid of numbers, return a grid of the Spotlight Sum of each number. The spotlight sum can be defined as the total of all numbers immediately surrounding the number on the grid, including the number in the total. Examples spotlightMap([ [1, 2, 3], [4, 5, 6], [7, 8, 9] ]) → [ [12, 21, 16], [27, 45, 33], [24, 39, 28] ]

44 // create a loop that reads in the next int from the scanner to the intList 45 46 47 // call the ReverseArray function 48 49 50 System.out.print("Your output is: "); 51 // print the output from ReverseArray 52 ww 53 54 55 }

In Python, given the following tuple, tu1 = (9, 3, 0, -4, 8, 7, 10, -1, 5), create your own count and indexfunctions where count counts the elements passed as argument and index returns the first indexof the parameter passed. Your algorithm should work for any tuple irrespective of its size

A grid needs a system for numbering the tiles in order to allow random-access lookup.For instance, the rows and columns of a square grid provide a natural numbering for the tiles. Create plans for hexagonal and triangular grids. Create a rule for identifying the neighbourhood (i.e., nearby tiles) of a certain tile in the grid using the numbering scheme. For instance, the neighbourhood of tile I j in a four-connected square grid with indices of I for rows and j for columns may be described as neighbourhood(i, j) = I 1, j, I j 1.

Java - Given a list (44, 80, 96, 33, 15, 42, 73, 99, 91, 77) and a gap array of (5, 4, 1):

A fibonacci series is defined as a series where the number at the current index, is the value of the summation of the index preceding it (index -1) and (index-2). Essentially, for a list fibonacci_numbers which is the fibonacci numbers series, fibonacci_numbers[i] = fibonacci_numbers[i-1] + fibonacci_numbers[i-2] The fibonacci series always begins with 0, and then a 1 follows. So an example for fibonacci series up to the first 7 values would be - 0, 1, 1, 2, 3, 5, 8, 13 Complete the fibonacci(n) function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: fibonacci(7) is 13 Important Note Use recursion and DO NOT use any loops. Review the Week 9 class recording to see a variation of this solution. def fibonacci(n):    if (n < 0 ):        return -1    else:        return n        fibonacci_numbers = (fibonacci[n - 1] + fibonacci[n - 2])    return fibonacci_numbers(n)   # TODO: Write…

Given a 2D list of characters and a list of tuples containing replacement pairs, write Pythoncode to replace each character in the list with its replacement. The tuples are of the form (current_char,replacement_char). Print out your list with each row on a new line. For example, given the following listand its replacement pairs: data = [['a','p','p','l','e'],             ['b','a','n','a','n','a'],             ['c','h','e','r','r','y']] replacements = [('a', 'X'),('b', 'Y'),('c', 'Z')] The output after replacement is: Xpple YXnXnX Zherry

WRITE A PROGRAM IN JAVA Define a 2 dimensional arrays of doubles (3 rows by 3 columns) and read values from the user. • Print the numbers entered by the user in row major order • Print the numbers entered by the user in column major order

A map is a container that stores a collection of ordered pairs, each pair consists of a key and a value, <key, value>. Keys must be unique. Values need not be unique, so several keys can map to the same values. The pairs in the map are sorted based on keys. Group of answer choices True False

JavaScript Given a singly linked list of integers, determine whether or not it's a palindrome. // Singly-linked lists are already defined with this interface: // function ListNode(x) { // this.value = x; // this.next = null; // } // function isListPalindrome(head) { }   Note: in examples below and tests preview linked lists are presented as arrays just for simplicity of visualization: in real data you will be given a head node l of the linked list Example For l = [0, 1, 0], the output should beisListPalindrome(l) = true; For l = [1, 2, 2, 3], the output should beisListPalindrome(l) = false.