Tag Archives: Reverse

Given a 32-bit integer N. The task is to reverse N, if the reversed integer overflows, print -1 as the output. Examples Input: N =… Read More
Given a doubly-linked list containing n nodes. The problem is to reverse every group of k nodes in the list. Examples:  Input: List: 10<->8<->4<->2, K=2Output:… Read More
Given a linked list lis of length N, where N is even. The task is to maximize the sum of two equidistant nodes from the… Read More
Given an array arr[] of size N ana an integer P, the task is to find the original array from the array obtained by P… Read More
Given an array arr[] of size N and an integer P (P < N), the task is to find the original array from the array… Read More
Given a matrix arr[][] of size M*N, where M is the number of rows and N is the number of columns. The task is to… 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