hoanbka

# (){}[]

def isBalancedParenthesis(str):
    stack = []

    for i in str:
        if i == '(' or i == '{' or i == '[':
            stack.append(i)
        elif i == ')' or i == '}' or i == ']':

hoanbka

import os


def listAllFiles(path):
    files = []
    try:
        for i in os.listdir(path):
            files.append(i)
    except FileNotFoundError:
        print('File not found')

hoanbka

/**
 * Created by Hoan Nguyen on 10/29/2017.
 */
const fsp = require('fs-promise');

(async () => {
	try {
		const txt = await fsp.readFile('./input.txt', 'utf8');
		console.log(txt);
	} catch (e) {

hoanbka

/**
 * Created by Hoan Nguyen on 10/28/2017.
 */
var isMomHappy = true;

// Promise
var willIGetNewPhone = new Promise(
	function(resolve, reject) {
		if (isMomHappy) {
			var phone = {

hoanbka

function findMaxOccurence(str) {
	var map = new Map();
	var max = 0;

	for (var i = 0; i < str.length; i++) {

		if (map.has(str.charAt(i))) {
			map.set(str.charAt(i), map.get(str.charAt(i)) + 1);
		} else {
			map.set(str.charAt(i), 1);

hoanbka

import time


def timing_function(some_function):
    """
    Outputs the time a function takes
    to execute.
    """

    def wrapper():

hoanbka

## Implement Queue in Python

class Queue():
    def __init__(self):
        self.arr = []

    def push(self, item):
        self.arr.insert(0, item)

    def pop(self):

hoanbka

class Stack():
    def __init__(self):
        self.arr = []

    def push(self, item):
        self.arr.append(item)

    def pop(self):
        if self.arr:
            self.arr.pop()

hoanbka

def isTangle(a, b, c):
    if a <= 0 or b <= 0 or c <= 0:
        return False
    else:
        if a + b >= c and a + c >= b and a <= b + c:
            return True


def showInfo():
    count = 5

hoanbka

def sumOfDigits(str):
    temp = ''
    sum = 0

    for i in range(len(str)):
        if str[i].isdigit():
            temp += str[i]
        else:
            if temp.isdigit():
                sum += int(temp)