Function to find largest rectangular area possible in a given histogram.

returns min element from stack*/

* Given a sorted array Arr of size N and a value X, find the number of array elements less than or equal to X and elements more than or equal to X. */

To find gap between elements

A recursive function to get the sum of values in given range of the array. The following are parameters for this function. si --> Index of current

Fills Z array for given string str[]

main function to do heap sort

Heap Sort Function

initialize stack

Insertion

Below is a recursive function that inserts an element at the bottom of a stack.

Function to sort an array using insertion sort

In Tim Sort First Run insertion sort and the merge these insertion sort together

insert in bst

* Given an array A of size n of integers in the range from 1 to n, we need to find the inverse permutation of that array. */

* Given two strings a and b consisting of lowercase characters. The task is to check whether two given strings are an anagram of each other or not. An

Complete the isBalanced function below.

* Given a non-empty sequence of characters str, return true if sequence is Binary, else return false */

* Given a number N.Find if the digit sum(or sum of digits) of N is a Palindrome number or not. */

Queue is full when size becomes equal to the capacity

* Check if a given number is a palindrome or not. */

* Given a Integer array A[] of n elements. Your task is to complete the function. Which will return 1 if all the elements of the Array are palindrome

* Given two arrays: a1[0..n-1] of size n and a2[0..m-1] of size m. Task is to check whether a2[] is a subset of a1[] or not. Both the arrays can be so

* Given a English alphabet c, Write a program to check whether a character is a vowel or not. */

arr : given array l : starting index of the array i.e 0 r : ending index of the array i.e size-1 k : find kth smallest element and return using this f

* Given a array of length N, at each step it is reduced by 1 element. In the first step the maximum element would be removed, while in the second step

Iterative function to print the left view of a given binary tree

Function to return the level order traversal of a tree.

function definition of bst