Binary Linked List To Integer
Posted: 22 Sep, 2021
You are given a singly linked list containing ‘n’ nodes, where every node in the linked list contains a pointer “next” which points to the next node in the list and having values either 0 or 1. Your task is to return the decimal representation of the given number in the linked list.
n = 4, list: 1 -> 0 -> 1 -> 0.
Now in this example, the value in the linked list is 1010, which is 10 in Decimal. Hence the answer is 10.
Input Format :
The first line contains a single integer ‘T’ denoting the number of test cases. Then each test case follows: The first line of each test case contains an integer, ‘n’, denoting the number of nodes in the linked list. The next ‘M’ lines of the test case contain two space-separated integers, ‘x’ and ‘y’, denoting a track between ‘x’ and ‘y’. The last line of the test case contains ‘n + 1’ space-separated integers which are the nodes of the linked list and each line ends with -1 to indicate that the sublist is over. Thus, -1 will never be a linked list element.
Output Format :
For each test case, print the Decimal representation of the number. Output for each test case will be printed in a separate line.
You are not required to print anything; it has already been taken care of. Just implement the function and return the answer.
1 <= T <= 100 1 <= N <= 3000 Time Limit: 1sec
The approach is simple, you have to take an integer to store the final answer, and iterate through the list and add the current element to “ans” and multiply ans by 2.
The steps are as follows:
- Take an integer “num” and initialize it with zero.
- Iterate through the list till we reach the last element:
- Multiply “num” by 2.
- Update “num = “head” -> data.
- Jump to the next node i.e. “head” = “head” -> next.
- Return “num”.
Zero Consecutive Sum Nodes
Posted: 19 Mar, 2021
Replace The Linked List
Posted: 1 Apr, 2021
Implement a Queue
Posted: 27 Jul, 2021
Vertical Sum in BST
Posted: 27 Jul, 2021
Remove Duplicates From Sorted List
Posted: 21 Sep, 2021