Sorts arrar a[0..n-1] using Cocktail sort

implement dequeue method by pushing all elements from stack 1 into stack 2, which reverses the order and then popping from stack 2

* Given an array of size N and you have to tell whether the array is perfect or not. An array is said to be perfect if it's reverse array matches the

Efficient Solution.

* Given an array of size N-1 such that it only contains distinct integers in the range of 1 to N. Find the missing element. */

* Given a list of integers, rearrange the list such that it consists of alternating minimum-maximum elements using only list operations. The first ele

Code is similar to Insertion Sort with some modifications

* Given two strings A and B. Find the characters that are not common in the two strings. */

Set operations: Union and Find

Function to return a list containing elements of left view of the binary tree.

Function to add two numbers represented by linked list.

Function to add edges to tree

* For a given 3 digit number, find whether it is armstrong number or not. An Armstrong number of three digits is an integer such that the sum of the c

arr: input array n: size of array Function to rearrange an array so that arr[i] becomes arr[arr[i]] with O(1) extra space.

* Given a sorted array of size N and an integer K, find the position at which K is present in the array using binary search. */

Function to determine Sum of months as days..

function for Bubble Sort

Function to Build Tree

Function to Build Tree

Function to Build Tree

Function to Build Tree

Function to Build Tree

------------------------Do not write above this line--------------------------------------------------------------------------------------------------

build the tree from array

Function to calculate the span of stock’s price for all n days.

Function to find if there is a celebrity in the party or not.

Function to find if there is a celebrity in the party or not.