andrewfinnell

Installation

Install SSHD

sudo apt install openssh-server

Configure SSH Server

andrewfinnell

import { BrowserModule } from '@angular/platform-browser';
import { NgModule } from '@angular/core';
//Angular Material Components
import {BrowserAnimationsModule} from '@angular/platform-browser/animations';
import {MatCheckboxModule} from '@angular/material/checkbox';
import {MatButtonModule} from '@angular/material/button';
import {MatInputModule} from '@angular/material/input';
import {MatAutocompleteModule} from '@angular/material/autocomplete';
import {MatDatepickerModule} from '@angular/material/datepicker';
import {MatFormFieldModule} from '@angular/material/form-field';

andrewfinnell

Install XRDP (Did I need it from the repo? I don't know because I did both) but vsock needs to be enabled.

sudo apt update
sudo apt dist-upgrade
sudo apt install xrdp
echo mate-session> ~/.xsession
sudo apt-get install mate-core
sudo ufw allow 3389/tcp

andrewfinnell

#!/bin/bash

kubectl delete -f https://raw.githubusercontent.com/kubernetes/dashboard/v2.0.0-beta8/aio/deploy/recommended.yaml

## OR

kubectl get deployments -A
kubectl delete service kubernetes-dashboard  --namespace=kubernetes-dashboard
kubectl delete service dashboard-metrics-scraper  --namespace=kubernetes-dashboard
kubectl delete sa kubernetes-dashboard --namespace=kubernetes-dashboard

andrewfinnell

I saw this interview question at https://www.youtube.com/watch?v=10WnvBk9sZc and wanted to see if I was able to solve it. The code is not pretty but it does work. No maps are needed. No state tracking is needed, except for storing the current largest subsequence. Once a larger one is found, the previous one is no longer needed.

The basic concept is to start with the smallest string first as the string which is the largest cannot possibly be completely found in the smaller string. i.e. ABCDE could not ever completely match ABCD. But ABCD can sub match ABCDE.

If this calculation was to be done by a human, we would start at the first letter in the string and then start searching the second string until we found a match. Once we found a match, we would go back to the first string and grab the next letter and then continue searching the second string again; skipping any non-matching letters along the way. We would need to make sure to pick up

andrewfinnell

(#[a-zA-Z][a-zA-Z0-9_]+-[1-9][0-9]*)([^.]|\.[^0-9]|\.$|$)

andrewfinnell

{
  "name": "testwebpack",
  "version": "1.0.0",
  "description": "",
  "main": "index.js",
  "scripts": {
    "test": "echo \"Error: no test specified\" && exit 1",
    "build": "webpack"
  },
  "author": "",

andrewfinnell

^(v?|r?|b?)([1-9][0-9]?)\.([0-9]+)?\.?([0-9]+)?\.?([\w\d]+)?(-[\w\d]+)?$

andrewfinnell

//
// ikvm-maven-plugin - generates C# DLL from Java code via IKVM
// http://github.com/samskivert/ikvm-maven-plugin/blob/master/LICENSE

package com.samskivert;

import java.io.File;
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;

andrewfinnell

• add kills

• add assists x [LostVikings=0.75, Abathur=0.8, other=1]

• add (timeSpentDead / gameLength) x 100 x [Murky=-1, Gall=-1, Cho=-0.85, other=-0.5]

• add 1 if player has top hero damage of his team

• add 1 if player has top hero damage of the match