have been given a singly linked list of integers. Write a function that returns the index/position of integer data denoted by 'N' (if it exists). Return -1 otherwise. Note :Assume that the Indexing for the singly linked list always starts from 0.Input format :The first line contains an Integer 'T' which denotes the number of test cases. The first line of each test case or query contains the elements of the singly linked list separated by a single space. The second line contains the integer value 'N'. It denotes the data to be searched in the given singly linked list. Remember/Consider :While specifying the list elements for input, -1 indicates the end of the singly linked list and hence -1 would never be a list element.Output format :For each test case, return the index/position of 'N' in the singly linked list. Return -1, otherwise. Output for every test case will be printed in a separate line. Note: You do not need to print anything; it has already been taken care of. Just implement the given function. Constraints :1 <= T <= 10^20 <= M <= 10^5 Where 'M' is the size of the singly linked list. Time Limit: 1 secSample Input 1:23 452 619-1510 20 30 40 50 60 70-16Sample Output 1 :2-1 Explanation for Sample Output 1:In test case 1, 'N' = 5 appears at position 2 (0-based indexing) in the given linked list. In test case 2, we can see that 'N' = 6 is not present in the given linked list.Sample Input 2:21 -123 452619-16Sample Output 2:-14 Explanation for Sample Output 2:In test case 1, we can see that 'N' = 2 is not present in the given linked list. In test case 2, 'N' = 6 appears at position 4 (0-based indexing) in the given linked list.Solutions:////////////////////////**************************************************************** Following is the class structure of the Node class: class LinkedListNode { T data; LinkedListNode next; public LinkedListNode(T data) { this.data = data; } } *****************************************************************/ public class Solution { public static int findNode(Linked ListNode head, int n) { LinkedListNode node = head; int count=0; while (node!=null) { if (node.data==n) { return count; } else { node=node.next; count++; } }

In R

How to write reporting function on this question This program implements the buying and selling of stocks. It starts by printing a welcome message Welcome to mystocks.com Then a main menu of choices for the user is output. Reporting, buying or selling? (0=quit, 1=report, 2=buy, 3=sell): The program ends with a goodbye message. Thank you for trading with mystocks.com Use doubly linked list of stock_t structures. stock_t structure looks like: #define MAX_TICKER_LENGTH 6 typedef struct stock_t {   char ticker[MAX_TICKER_LENGTH];   date_t date; // date bought   int numShares;   double pricePerShare; } stock_t; date_t structure looks like: typedef struct date_t {   int month, day, year; } date_t; Create the following files in a directory: date.h: contains the above date_t structure • stock.h and stock.c: contain the stock structure and any constants and stock function prototypes. Eg: a print stock function. • node.h, node.c: contain at least the node typdef and initNode function •…

JS Write a function named number_of_pairs whose parameter is an object/dictionary with strings as keys and integers as values. Your function should returns the number of key-value pairs in the parameter.

python exercise: Write a Python function called get_top_students that takes the list of dictionaries as input and returns a dictionary containing the name and GPA of the top two students in the list. Each dictionary has the following keys: "name", "age", "major", and "gpa".

1c) Average sentence length We will create a function ( avg_sentence_len ) to calculate the average sentence length across a piece of text. This function should take text as an input parameter. Within this function: 1. sentences : Use the split() string method to split the input text at every '.'. This will split the text into a list of sentences. Store this in the variable sentences . To keep things simple, we will consider every "." as a sentence separator. (This decision could lead to misleading answers. For example, "Hello Dr. Jacob." is actually a single sentence, but our function will consider this 2 separate sentences). 2. words : Use the split() method to split the input text into a list of separate words, storing this in words . Again, to limit complexity, we will assume that all words are separated by a single space (" "). (So, while "I am going.to see you later" actually has 7 words, since there is no space after the ".", so we will assume the this to contain 6 separate…

The function count_contains_og in python takes a list of strings and returns how many strings in the list contain 'og' / 'OG' / 'oG' / 'Og' (check for 'og', ignoring case). Hint: Use the sequence membership operator in to help you check for 'og' in the individual strings. Create a lower-cased version of the string (lower), then use the in operator. For example: Test Result str_list = ['cat', 'dog', 'FROG', 'monkey'] print(count_contains_og(str_list)) 2 strlist = ["X", "x"] print(count_contains_og(strlist)) 0 list_of_one_og = ["Doggie"] print(count_contains_og(list_of_one_og)) 1

Exercise 3 Use the function design recipe to develop a function named unique_list. The function takes a list of strings, which may be empty. The function returns a new list that includes the first occurrence of each value in a list and omits later repeats. The returned list should include the first occurrences of values in a list in their original order. For example, if a list contains the following animals ['cat', 'dog', 'cat', 'bug', 'dog', 'ant', 'dog', 'bug'], the unique_list function returns a unique list: ['cat', 'dog', 'bug', 'ant'].

Use the function design recipe to develop a function named count_odds. The function takes a list of integers, which may be empty. The function returns the number of odd integers in the list.

JS Write a function named sum_between_indices whose parameter is a list/array of decimal numbers. Your function must return the sum of the entries at index 4 through index 15. Make certain to include the entries at index 4 and at index 15 in your sum. You SHOULD assume the parameter will have more than 15 entries.