Austin X. Duong

About: full-stack software engineer 📀

Apps i recently created:

This API connects to an interactive front-end built with React.js. When pasting a url link of a website, it renders a shortened link --- shareable across various social media websites posts

API: https://backend-microservice-urlshortener.onrender.com/

Simply copy/paste the url to your social media posts (inputted from the API), & Refresh the Data for your newly posted link

Tech: React.js 🪽 Node.js 🪽 JavaScript 🪽

Restful API🪽Mongoose🪽

JSON🪽HTML/CSS🪽

Express.js

Fullstack App: https://frontend-microservice-urlshortnener.onrender.com/

Creators:

Nick Day Tucker Hoog Austin Duong

Lead Teaching Assistant:

Casey Cameron

Project Sponsor:

Marcy Silverman

Principal Instructor:

Dan Minkevitch

CEO/Chief:

Marty Nelson

Co-Owner:

Ryan Mehta ~~not Meta~~ 😉

Fullstack App: ESRI ArcGIS API Analytics

Hack For A Sustainable Future: Local Impact Hackathon

Behind the Scenes: Original Wireframe/Prototype

Tech:React.js

🪽Node.js🪽

JavaScript🪽AWS🪽SQL🪽

Heroku🪽G-News API🪽

Express.js🪽Visual Studio

Creators:

Taylor Tokareff Christiane Merrit Zach Gaines Austin Duong

Enter name & date of birth, then select a card deck. Click on the (Past) 1st card (should have a yellow highlight), then click "Pick A Card"-- repeat for the (Present) second and (Future) third cards. A summary of your personalized reading is presented 🔮.

JavaScript App: Tarot Fortune Teller

Algorithms I've Written:

JavaScript algos 🌭🏖️🍹🏝️🪼

                                
function areaOfCountry(name, area) {

// earths landmass = 148,940,000

let countrysProportionToEarthLandMass = area / 148940000
let decimalTruncate = countrysProportionToEarthLandMass.toFixed(4)
let crops = Number.parseFloat(decimalTruncate) * 100

if (crops > 1) {
    return `${name} is ${crops}% of the total world's landmass`
} else if (crops < 1) {
    return `${name} is ${crops.toFixed(2)}% of the total world's landmass`
}
}
console.log(areaOfCountry("Ireland", 32595));
console.log(areaOfCountry("Switzerland", 41284));
console.log(areaOfCountry("Netherlands", 41850));
console.log(areaOfCountry("Greece", 131990));
console.log(areaOfCountry("Sweden", 204035));

// this algorithm lets you enter your cents and dollars, the total balance amount // and returns a true/false if a purchase is affordable


function accountsReceivableAndPayable(cents, amountDue) {
	const initialValue = 0;
    const twenty = 20.00 cents[0]
    const ten = 10.00 * cents[1]
    const dollar = 1.00 * cents[2]
	const quarter = .25 * cents[3]
	const dime = .10 * cents[4]
	const nickel = .05 * cents[5]
	const penny = .01 * cents[6]
	
	let cents = [twenty, ten, dollar, quarter, dime, nickel, penny]
	
	const loopAdd = cents.reduce((elementFir, elementSec) => elementFir + elementSec, initialValue);
	
	return loopAdd >= amountDue ? true : false
}

console.log("cent calc [8, 10, 50, 100], 5.00] = ", accountsReceivableAndPayable([8, 10, 50, 100], 5.00))
console.log("cent calc [8, 10, 50, 100], 55.00] = ", accountsReceivableAndPayable([8, 10, 50, 100], 55.00))

// this algorithm receives an array of objects (accounts/financial&data migration), // and renders the cummulative in dollars


function cummulativeBudgets(arr) {
let budgetCummulative = 0
arr.forEach(array => {
    for (let digit in array) {
        if (digit === "budget") {
            budgetCummulative += array[digit]
            return budgetCummulative
        }
    }
})
return budgetCummulative
}

// when adding credit/debit card information, previewing the ACH number on your online bank statements, or storing any sort of personal information etc. // this algorithm conceals these numbers with a '#' except the last 4 digits for confidentialality.


function maskify(str) {
	const strSplit = str.split('')
	const strSlice = strSplit.slice(-4)
	const strSliceJoin = strSlice.join('')
	const stor = []
	
	for (let i = 0; i < strSplit.length - 4; i++) {
	strSplit[i] = '#'
	stor.push(strSplit[i])
}
	const eleJoin = stor.concat(strSliceJoin)
	
  const strFilter = eleJoin.filter((element) => element !== ',')
	const stringify = strFilter.toString()
	const stringifyJoin = stringify.split('').join('')
	
	return stringifyJoin.replace(/,/g, "")
}

Java algos 🍕💸🎰🛎️🎲

// implementing both the LinkedHashMap & Map data structures // this algorithm receives an input of integers, and returns its ordinal counterpart // specifiying the entered integers order & rank

    

public class OrdinalNumber {
    public static String ordinalNumber(int integer) {

    LinkedHashMap linkedHashMap = new  LinkedHashMap();
    linkedHashMap.put("1", "ST");
    linkedHashMap.put("2", "ND");
    linkedHashMap.put("3", "RD");
    linkedHashMap.put("4", "TH");
    linkedHashMap.put("5", "TH");
    linkedHashMap.put("6", "TH");
    linkedHashMap.put("7", "TH");
    linkedHashMap.put("8", "TH");
    linkedHashMap.put("9", "TH");
    linkedHashMap.put("10", "TH");
    linkedHashMap.put("11", "TH");
    linkedHashMap.put("12","TH");
    linkedHashMap.put("13", "TH");
    linkedHashMap.put("14", "TH");
    linkedHashMap.put("15", "TH");
    linkedHashMap.put("16", "TH");
    linkedHashMap.put("17", "TH");
    linkedHashMap.put("18", "TH");
    linkedHashMap.put("19", "TH");
    
    String sInteger = String.valueOf(integer); // "221"
    String sIntegerD = String.valueOf(integer) + "-"; // "221-""
    String subStringInteger = "";
    String linkedSubStringInteger = "";
        
        
    for (int i = 0; i < sInteger.length(); i++) {
        if (sInteger.length() == 1) {
            subStringInteger = sInteger;
        } else if (sInteger.length() == 2 && sInteger.charAt(0) != 1) {
            subStringInteger = sInteger.substring(1);
        }
            else if (sInteger.charAt(1) == '1') {
            subStringInteger = sInteger.substring(sInteger.length() -2); // 521 // 18
        } else {
            subStringInteger = sInteger.substring(sInteger.length() -1); // 528 // 8
            }            
        }

    for (Map.Entry entry : linkedHashMap.entrySet()) {
        if (entry.getKey().equals(subStringInteger)) {
            linkedSubStringInteger = entry.getValue();
                }
    }
    return sIntegerD + linkedSubStringInteger; 
    
}

public static void main(String[] args) {
    int integer = 21; // 21-ST
    System.out.println(ordinalNumber(integer));
}
}

// 1 // 1-ST
// 3 // 3-RD
// 8 // 8-TH
// 21 // 21-ST
// 22 // 22-ND
// 23 // 23-RD
// 521 // "521-ST"
// 523 // "523-RD"
// 522 // "522-RD"
// 531 // "531-ST"

// when creating or entering a pin for a credit/debit card, or visiting an ATM // this algorithm validates whether the pin is only all numeric, with a minimum of 4 or a maximum of 6 digits.

    
public class AtmPinValidation {
    public static boolean ATMPin(String s) {
    Pattern pat = Pattern.compile("^[0-9]{4}$|^[0-9]{6}$");
    Matcher matcher = pat.matcher(s);

if (!matcher.find()) {
    return false;
}
return true;
}

public static void main(String[] args) {
    String s = "";
    System.out.println(ATMPin(s));
}
}

// ^$12345 // false
// 1234 // true
// ^^^^^ // false
// 123456 // true
// "" // false
// ^*%$# // false

// incorporating regex, this algorithm compiles a sequences of characters & a match // verifying that a users input is officially of the email syntax.

    
import java.util.regex.Pattern;
import java.util.regex.Matcher;

public class EmailRegex {
    public static String email(String emale) {
    Pattern pat = Pattern.compile("^(\\w+)((.))(\\w+)@(\\w+(.))(\\w+)$");
    // ^\\(\\w+\\)\\(?=@\\)\\(\\w+\\)\\(?=.\\)$
    Matcher matcher = pat.matcher(emale);

    if (matcher.find()) {
        return matcher.group();
    } else {
        return matcher.group();
    }
    } 

    public static void main(String[] args) {
    String emale = "gwhite.mail1818@hotmail.com";

    System.out.println(email(emale));
    }
}
🔥

hey, i'm aus

[0].

[1].

[2].

[3].

[4].

[5].

[6].

[7].