Ha Anh Nguyen anhnguyen1618

## Change
public class Change {
    private char a;
    private char b;
    public Change(char a, char b){
        this.a=a;
        this.b=b;
    }
    public String change(String word){
        return word.replace(this.a, this.b);
    }

## Changer
public class Changer {
    private ArrayList<Change> changes;
    public Changer(){
        this.changes=new ArrayList<Change>();
    }
    public void addChange(Change change){
        this.changes.add(change);
    }
    public String change(String word){
        for (Change Change : changes) {

## gist:e4360efe39acd53e6b6de015e2d2d8e2
def oneLine(size):
  string=''
  for i in range(size):
    string+="*"
  string+='\n'
  return string
def manyLines(size):
  finalString=""
  for i in range(size):
    finalString+=oneLine(size)

## gist:4f93d3f6ddb2c116d46d0ee89fdf8d13
public class Person {
    private String name;
    private int age;

    public Person(String nameAtStart) {
        this.age = 0;
        this.name = nameAtStart;
    }

    public void printPerson() {

## gist:10007538a6a92809e9a39417d9f0dc64
public class Person {
    private String name;
    private int age;

    public Person(String nameAtStart) {
        this.age = 0;
        this.name = nameAtStart;
    }

    public void printPerson() {

## gist:493df2618378df2ac01e9f6d6753678f
using System;

namespace Programs
{
    //Modify this class Employee, add requested methods
    public class Employee{

        private String firstName;
        private String lastName;
        private double salary;

## jajva
static Node lca(Node root,int v1,int v2)
    {
        ArrayList<Node> list = new ArrayList<Node>();
        helper(root,v1,v2, list);
        return list.get(list.size()-1);
    }

static Node helper(Node node,int v1,int v2,ArrayList<Node> array){
    if(node.left == null && node.right == null){
        return null;

## gist:cffde447c70d7f3918429a1631267800
import numpy as np
def find_combination(choices, total):
    new_array = list(reversed(sorted(choices)))
    new = compare(new_array, total)[1]
    result=[]
    for number in choices:
        if number in new:
            new.pop(new.index(number))
            result.append(1)
        else:

## gist:346b610a57453d940e336f0759a724e5
<!DOCTYPE html>
<html>

<head>
    <title>Solinor Wage Calculator</title>
    <script src="https://ajax.googleapis.com/ajax/libs/jquery/3.1.1/jquery.min.js"></script>
    <link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0-alpha/css/bootstrap.min.css">
    <script src="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0-alpha/js/bootstrap.min.js"></script>
    <script type="text/javascript">
    $(document).ready(function() {

## go
failed
func ApplyMiddleware(rawHandler http.HandlerFunc, middleWares ...Adapter) http.Handler {
	// Convert rawHandler from type http.HandlerFunc to type http.Handler
	convertedHandler := http.HandlerFunc(rawHandler)

	for i := len(middleWares) - 1; i >= 0; i-- {
		convertedHandler = middleWares[i](convertedHandler)
	}
	return convertedHandler
}
	public class Change {
	private char a;
	private char b;
	public Change(char a, char b){
	this.a=a;
	this.b=b;
	}
	public String change(String word){
	return word.replace(this.a, this.b);
	}
	public class Changer {
	private ArrayList<Change> changes;
	public Changer(){
	this.changes=new ArrayList<Change>();
	}
	public void addChange(Change change){
	this.changes.add(change);
	}
	public String change(String word){
	for (Change Change : changes) {
	def oneLine(size):
	string=''
	for i in range(size):
	string+="*"
	string+='\n'
	return string
	def manyLines(size):
	finalString=""
	for i in range(size):
	finalString+=oneLine(size)
	public class Person {
	private String name;
	private int age;

	public Person(String nameAtStart) {
	this.age = 0;
	this.name = nameAtStart;
	}

	public void printPerson() {
	using System;

	namespace Programs
	{
	//Modify this class Employee, add requested methods
	public class Employee{

	private String firstName;
	private String lastName;
	private double salary;
	static Node lca(Node root,int v1,int v2)
	{
	ArrayList<Node> list = new ArrayList<Node>();
	helper(root,v1,v2, list);
	return list.get(list.size()-1);
	}

	static Node helper(Node node,int v1,int v2,ArrayList<Node> array){
	if(node.left == null && node.right == null){
	return null;
	import numpy as np
	def find_combination(choices, total):
	new_array = list(reversed(sorted(choices)))
	new = compare(new_array, total)[1]
	result=[]
	for number in choices:
	if number in new:
	new.pop(new.index(number))
	result.append(1)
	else:
	<!DOCTYPE html>
	<html>

	<head>
	<title>Solinor Wage Calculator</title>
	<script src="https://ajax.googleapis.com/ajax/libs/jquery/3.1.1/jquery.min.js"></script>
	<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0-alpha/css/bootstrap.min.css">
	<script src="https://maxcdn.bootstrapcdn.com/bootstrap/4.0.0-alpha/js/bootstrap.min.js"></script>
	<script type="text/javascript">
	$(document).ready(function() {
	failed
	func ApplyMiddleware(rawHandler http.HandlerFunc, middleWares ...Adapter) http.Handler {
	// Convert rawHandler from type http.HandlerFunc to type http.Handler
	convertedHandler := http.HandlerFunc(rawHandler)

	for i := len(middleWares) - 1; i >= 0; i-- {
	convertedHandler = middleWares[i](convertedHandler)
	}
	return convertedHandler
	}