adryanf

//inefficient O(n^2)

// Improvement Ideas
// The binary numbers must be balanced - equal number of 0s and 1s - maybe there's an efficient way to find out these numbers
// 

function getNumberOfValidParenthesesCombinationsOfN(n){
	
	var i;

adryanf

from flask import Flask, request
from celery import Celer

celery = Celery('sample', backend='rpc://', broker='amqp://guest@localhost//')

app = Flask('sample_api')

upercase = celery.signature('sample.uppercaseme')
lowercase = celery.signature('sample.lowercaseme')