Skip to content

Instantly share code, notes, and snippets.

<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Tip Calculator</title>
<style>
#calculator {
border: 1px solid black;
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Mini Project 2</title>
</head>
<body>
@master-elodin
master-elodin / main.cpp
Last active September 12, 2019 10:28 — forked from tvandoren/main.cpp
#include <iostream>
#include <string>
#include <vector>
using namespace std;
static bool should_swap(string a, string b, int index)
{
int a_char = (int)tolower(a[index]);
/*
* #1
*/
let findLongestPrefix = (list) => {
let prefix = '';
let charIndex = 0;
let allMatch = true;
while(allMatch) {
let currentChar = list[0][charIndex];
for(let i = 1; i < list.length; i++) {
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
public class Sort {
private static final int MAX_NUMBERS = 25;
private static final int MAX_VALUE = 200;
public static void main(String[] args) throws FileNotFoundException {