# Tag Archives: Reverse

Given an array and split it from a specified position, and move the first part of array add to the end.   Examples:   Input : arr[]… Read More
Given an array and split it from a specified position, and move the first part of array add to the end.   Examples:   Input : arr[]… Read More
Given an array and split it from a specified position, and move the first part of array add to the end.   Examples:   Input : arr[]… Read More
Given an array and split it from a specified position, and move the first part of array add to the end.   Examples:   Input : arr[]… Read More
Given an array and split it from a specified position, and move the first part of array add to the end.   Examples:   Input : arr[]… Read More
Given a linked list A[] of N integers, the task is to reverse the order of all integers at an even position. Examples: Input: A[]… Read More
Given an integer N, the task is to print the first N terms of the Fibonacci series in reverse order using Recursion. Examples: Input: N… Read More
Given a linked list, write a function to reverse every alternate k nodes (where k is an input to the function) in an efficient way.… Read More
Given a linked list, write a function to reverse every alternate k nodes (where k is an input to the function) in an efficient way.… Read More
Given a linked list, write a function to reverse every alternate k nodes (where k is an input to the function) in an efficient way.… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function).  Example:  Input: 1->2->3->4->5->6->7->8->NULL, K =… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function).  Example:  Input: 1->2->3->4->5->6->7->8->NULL, K =… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function).  Example:  Input: 1->2->3->4->5->6->7->8->NULL, K =… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function).  Example:  Input: 1->2->3->4->5->6->7->8->NULL, K =… Read More
Given a linked list, write a function to reverse every k nodes (where k is an input to the function).  Example:  Input: 1->2->3->4->5->6->7->8->NULL, K =… Read More