Segregate Node Of Linkedlist Over Last Index.
1. Given a singly linklist, Segregate Node of LinkedList over lastindex and return pivot node of linkedlist.Input Format
2. pivot is always be last index of linkedlist.
3. After segregation pivot Element should have to be present at correct position as in sorted linkedlist.
1->5->2->9->5->14->11->1->10->10->1->3->nullOutput Format
3->5->9->5->14->11->10->10->nullQuestion Video
-10^6 <= size Of LinkedList <= 10^6Sample Input
12Sample Output
1 5 2 9 5 14 11 1 10 10 1 3
3 5 9 5 14 11 10 10
-
Asked in Companies
-
Related Topics
Video Solution
Code Solution
{ }
{ }
Run