Given an array a[ ] of size n. For every window size that varies from 1 to n in array print or find maximum of minimum for every window size in a given array. Example Input : a[ ] = {10, 20, 30, 50, 10, 70, 30} Output : 70 30 20 …
In finding the only repetitive element between 1 to N-1 problem we have given an array of random integers within a range from 1 to n-1. There will be one number that is repeated. Your task is to find that number. Example Input [2,3,4,5,2,1]A Output 2 Explanation 2 is the …
What is Greatest Common Factor? GCD of two numbers is the largest number that divides both of them. Approach-1 Brute Force Finding all the prime factors of both the numbers, then finding the product of the intersection. Finding the largest number that divides both the numbers. What is it that …
Rotate array is a problem in which we have given an array of size N. We have to rotate the array in the right direction. Each element shift by one position right and last element of the array come to the first position. So, we have given a value K …
Quick Sort is a sorting algorithm. Given an unsorted array sort it using quick sort algorithm. Example Input: {8, 9, 5, 2, 3, 1, 4} Output: {1, 2, 3, 4, 5, 8, 9} Theory It’s a Divide and Conquer sorting Algorithm. It picks a pivot element in the array, splits …
Fibonacci numbers are the numbers that form the series called Fibonacci series and are represented as Fn. The first two Fibonacci numbers are 0 and 1 respectively i.e. F0=0 and F1=1. Starting from the third Fibonacci number each Fibonacci number is the sum of its previous two numbers in the …
Problem Statement The problem “reverse a linked list” states that we are given the head of the linked list. We have to reverse the linked list by changing the links between them and return the head of the reversed linked list. Example 10->20->30->40->NULL NULL<-10<-20<-30<-40 Explanation We have reversed the linked …
Heap sort is a comparison based sorting technique that is based on a Binary Heap data structure. HeapSort is similar to a selection sort where we find the maximum element and then place that element at the end. We repeat this same process for the remaining elements. Given an unsorted …
Problem Statement In the “Minimum Characters to be Added at Front to Make String Palindrome” problem we have given a string “s”. Write a program to find the minimum characters to be added at the front to make a string palindrome. Input Format The first and only one line containing …
Problem Statement In the “Longest Span with same Sum in two Binary Arrays II” problem, we have given two binary arrays “a” and “b” with the same size. Write a program to print the longest span with the same sum in two arrays. This can be clearly explained in the …