Table of Contents
- 1 How do you find the common element in two linked lists?
- 2 Which sorting algorithm is best suited for finding the common elements in two given two sorted linked lists?
- 3 Which of these sorting algorithm is best for sorting a random linked list?
- 4 Which of the following sorting algorithm has best case time complexity of O N 2 )?
- 5 What is unsorted linked list?
- 6 How do you combine two linked lists?
How do you find the common element in two linked lists?
Given two linked list, the task is to find the number of common nodes in both singly linked list. Naive Approach: Compare every node of list A with every node of list B. If the node is a match then increment the count and return count after all the nodes get compared.
Which sorting algorithm is best suited for finding the common elements in two given two sorted linked lists?
Merge sort is often preferred for sorting a linked list. The slow random-access performance of a linked list makes some other algorithms (such as quicksort) perform poorly, and others (such as heapsort) completely impossible.
How can you find the intersection of 2 linked lists that contain references as their node content?
Have a visited flag with each node. Traverse the first linked list and keep marking visited nodes. Now traverse the second linked list, If you see a visited node again then there is an intersection point, return the intersecting node.
How do you sort two unsorted linked lists?
Below are the steps:
- Concatenate the two lists by traversing the first list until we reach it’s a tail node and then point the next of the tail node to the head node of the second list. Store this concatenated list in the first list.
- Sort the above-merged linked list. Here, we will use a bubble sort.
Which of these sorting algorithm is best for sorting a random linked list?
3 Answers. Merge Sort can be used for sorting Linked List and It will take O(nlogn).
Which of the following sorting algorithm has best case time complexity of O N 2 )?
Time Complexities of all Sorting Algorithms
| Algorithm | Time Complexity | |
|---|---|---|
| Best | Worst | |
| Selection Sort | Ω(n^2) | O(n^2) |
| Bubble Sort | Ω(n) | O(n^2) |
| Insertion Sort | Ω(n) | O(n^2) |
What is the intersection of two linked lists?
A simple solution is to consider each node of the first list and check if it can be reached from the second list. The first node in the first list that is reachable from the second list is the intersection point.
How would you traverse a linked list in O n1 2?
Algorithm
- STEP 1: SET PTR = HEAD.
- STEP 2: IF PTR = NULL.
- STEP 4: REPEAT STEP 5 AND 6 UNTIL PTR != NULL.
- STEP 5: PRINT PTR→ DATA.
- STEP 6: PTR = PTR → NEXT.
- STEP 7: EXIT.
What is unsorted linked list?
The unsorted linked list program adds values to the end of the list as long as the value is not found in the list. If the value is found in the list, the node containing the value is removed.
How do you combine two linked lists?
Write a SortedMerge() function that takes two lists, each of which is sorted in increasing order, and merges the two together into one list which is in increasing order. SortedMerge() should return the new list. The new list should be made by splicing together the nodes of the first two lists.
Which of the following sorting methods use Linked List?
Explanation: Both Merge sort and Insertion sort can be used for linked lists.
What is the best possible worst case time complexity of sorting a singly Linked List?
Complexity is O(n log m) where n is the number of items and m is the number of runs. Best case is O(n) (if the data is already sorted) and worst case is O(n log n) as expected.