mycodeschool

#include<cmath>
#include<iostream>
#include<climits>
using namespace std;

int Maximum_Sum_Subarray(int arr[],int n)	//Overall Time Complexity O(n^2)
{
	int ans = INT_MIN;
	for(int start_index = 0;start_index < n; ++start_index)					//O(n)		
	{

mycodeschool

#include<cmath>
#include<iostream>
#include<climits>
using namespace std;

int Max_Subarray_Sum(int arr[],int n)	
{
	if(n==1)
	{
		return arr[0];

mycodeschool

#include<cmath>
#include<iostream>
#include<climits>
using namespace std;

int Maximum_Sum_Subarray(int arr[],int n)		//Overall Time Complexity O(n^3)
{
	int ans = INT_MIN;							// #include<climits>
	for(int sub_array_size = 1;sub_array_size <= n; ++sub_array_size)		//O(n)
	{

mycodeschool

#include<cmath>
#include<iostream>
#include<climits>
using namespace std;

int Maximum_Sum_Subarray(int arr[],int n)	//Overall Time Complexity O(n)
{
	int ans = A[0],sum = 0;
	for(int i = 1;i < n; ++i)	//Check if all are negative
		ans = max(ans,arr[i]);	

mycodeschool

/* Binary tree - Level Order Traversal */
#include<iostream>
#include<queue>
using namespace std;

struct Node {
	char data;
	Node *left;
	Node *right;
};

mycodeschool

/*Queue - Linked List implementation*/
#include<stdio.h>
#include<stdlib.h>
struct Node {
	int data;
	struct Node* next;
};
// Two glboal variables to store address of front and rear nodes. 
struct Node* front = NULL;
struct Node* rear = NULL;

mycodeschool

#include<iostream>
#include<cstdlib>
#include<set>
using namespace std;

struct Node {
    int data;
    struct Node *next;
};
int length(struct Node *head) {

mycodeschool

// Stack - Object oriented implementation using arrays
#include <iostream>
using namespace std;
#define MAX_SIZE 101 

class Stack
{
private:
  int A[MAX_SIZE];  // array to store the stack
	int top;   // variable to mark the top index of stack. 

mycodeschool

/*
  C++ Program to check for balanced parentheses in an expression using stack.
  Given an expression as string comprising of opening and closing characters
  of parentheses - (), curly braces - {} and square brackets - [], we need to 
  check whether symbols are balanced or not. 
*/
#include<iostream>
#include<stack>
#include<string>
using namespace std;

mycodeschool

// Stack - Array based implementation. 
// Creating a stack of integers. 
#include<stdio.h>

#define MAX_SIZE 101

int A[MAX_SIZE]; // integer array to store the stack 
int top = -1;  // variable to mark top of stack in array

// Push operation to insert an element on top of stack.