Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
enotes the number of test cases. The first line of each test case or query contains the elements o e singly linked list separated by a single space. The second line contains the integer value 'N'. It enotes the data to be searched in the given singly linked list. Remember/Consider :While specifying e list elements for input, -1 indicates the end of the singly linked list and hence -1 would never be a st element. Output format :For each test case, return the index/position of 'N' in the singly linked st. Return -1, otherwise. Output for every test case will be printed in a separate line. Note: You do ot need to print anything; it has already been taken care of. Just implement the given function. onstraints :1 <= T <= 10^20 <= M <= 10^5 Where 'M' is the size of the singly linked list. Time Limit: 1 ecSample Input 1:23 452619-1510 20 30 40 50 60 70-16Sample Output 1 :2-1 Explanation for ample Output 1:In test case 1, 'N' = 5 appears at position 2 (0-based indexing) in the given linked st. In test case 2, we can see that 'N' = 6 is not present in the given linked list.Sample Input 2:21 23 452619-16Sample Output 2:-14 Explanation for Sample Output 2:In test case 1, we can see at 'N' = 2 is not present in the given linked list. In test case 2, 'N' = 6 appears at position 4 (0-based dexing) in the given linked st.Solutions:////// *********

enotes the number of test cases. The first line of each test case or query contains the elements o e singly linked list separated by a single space. The second line contains the integer value 'N'. It enotes the data to be searched in the given singly linked list. Remember/Consider :While specifying e list elements for input, -1 indicates the end of the singly linked list and hence -1 would never be a st element. Output format :For each test case, return the index/position of 'N' in the singly linked st. Return -1, otherwise. Output for every test case will be printed in a separate line. Note: You do ot need to print anything; it has already been taken care of. Just implement the given function. onstraints :1 <= T <= 10^20 <= M <= 10^5 Where 'M' is the size of the singly linked list. Time Limit: 1 ecSample Input 1:23 452619-1510 20 30 40 50 60 70-16Sample Output 1 :2-1 Explanation for ample Output 1:In test case 1, 'N' = 5 appears at position 2 (0-based indexing) in the given linked st. In test case 2, we can see that 'N' = 6 is not present in the given linked list.Sample Input 2:21 23 452619-16Sample Output 2:-14 Explanation for Sample Output 2:In test case 1, we can see at 'N' = 2 is not present in the given linked list. In test case 2, 'N' = 6 appears at position 4 (0-based dexing) in the given linked st.Solutions:////// *********

C++ Programming: From Problem Analysis to Program Design
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter17: Linked Lists
Section: Chapter Questions
Problem 8PE
See similar textbooks
icon
Related questions
Question
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 4 5 2 6 1 9-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 -12345 2 619-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> { T data; LinkedListNode<T>next; public LinkedListNode(T data) { this.data = data; } } ***********/ public class Solution { public static int findNode(Linked ListNode<Integer> head, int n) { LinkedListNode<Integer> node = head; int count=0; while (node!=null) { if (node.data==n) { return count; } else { node=node.next; count++; } }
Transcribed Image Text: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 4 5 2 6 1 9-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 -12345 2 619-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> { T data; LinkedListNode<T>next; public LinkedListNode(T data) { this.data = data; } } ***********/ public class Solution { public static int findNode(Linked ListNode<Integer> head, int n) { LinkedListNode<Integer> node = head; int count=0; while (node!=null) { if (node.data==n) { return count; } else { node=node.next; count++; } }
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Structure
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Np Ms Office 365/Excel 2016 I Ntermed
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:
9781337508841
Author:
Carey
Publisher:
Cengage
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
SEE MORE TEXTBOOKS