SuryaPratapK

/* Following program is a C++ implementation of Rabin Karp 
Algorithm given in the CLRS book */
#include <bits/stdc++.h> 
using namespace std; 

// d is the number of characters in the input alphabet 
#define d 256 

/* pat -> pattern 
	txt -> text 

SuryaPratapK

// Program to find minimum number of platforms 
// required on a railway station 
#include<iostream> 
#include<algorithm> 

using namespace std; 

// Returns minimum number of platforms reqquired 
int findPlatform(int arr[], int dep[], int n) 
{ 

SuryaPratapK

#include <iostream> 
using namespace std; 

void findMajority(int arr[], int n) 
{ 
	// Number of bits in the integer 
	int len = sizeof(int) * 8; 

	// Variable to calculate majority element 
	int number = 0; 

SuryaPratapK

// C++ linear time solution for stock span problem 
#include <iostream> 
#include <stack> 
using namespace std; 

// A stack based efficient method to calculate 
// stock span values 
void calculateSpan(int price[], int n, int S[]) 
{ 
	// Create a stack and push index of first