scottashipp

package com.scottshipp.code;

import java.util.HashMap;
import java.util.Map;

public class AnagramChecker {

    public boolean isAnagram(String firstWord, String secondWord) {
        if(firstWord == null || secondWord == null || firstWord.length() != secondWord.length()) {
            return false;

scottashipp

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {

scottashipp

class FindMinComparing {

        public int findMin(int[] arr) {
            if(arr == null) {
                throw new IllegalArgumentException("Received null array");
            }
            if(arr.length < 1) {
                throw new IllegalArgumentException("Received zero-length array");
            }
            if(arr.length == 1) {

scottashipp

# from https://codeburst.io/how-i-hacked-my-terminal-so-a-happy-whale-would-spout-software-quotes-at-me-6791e6c74fc6

%
Simple things should be simple, complex things should be possible.
  The Wiki Way: Quick Collaboration on the Web, Bo Leuf, Ward
  Cunningham
%
Simplicity is the soul of efficiency.
  Austin Freeman
%

scottashipp

%
Simple things should be simple, complex things should be possible.
  The Wiki Way: Quick Collaboration on the Web, Bo Leuf, Ward
  Cunningham
%
Simplicity is the soul of efficiency.
  Austin Freeman
%
I have yet to see any problem, however complicated, which, when you
looked at it in the right way, did not become still more complicated.

scottashipp

find . -type f -exec sed -i -e 's/world/universe/g' {} \;

scottashipp

awk 'FNR==1{print "%"}{print}' quote* > softwareengineering

scottashipp

import java.util.ArrayList;
import java.util.Scanner;

public class PermutationGenerator1 {
    private static String inputWithoutC(String input, char c) {
        String inputWithoutC = "";
        char[] temp = input.toCharArray();
        for(char d : temp) {
            if(d !=c ) {
                inputWithoutC += d;

scottashipp

implicit class NullSafeOption[A,B](val a: Option[A]) extends AnyVal {
  def mapNullSafe(f: A => B): Option[B] = { a.flatMap(x => Option(x).map(f)) }
}

implicit class NullSafe[A,B](val a: A) extends AnyVal {
  def ?(f: A => B): B = { if(a == null) null.asInstanceOf[B] else f(a) }
}

//Examples with Option + Map
scala> val s: String = null

scottashipp

// from https://code.scottshipp.com/2016/07/28/does-scala-have-the-safe-navigation-null-conditional-operator/

implicit class NullSafe[A, B](val a: A) extends AnyVal {
  def ?(f: A => B): B = { if(a == null) null.asInstanceOf[B] else f(a) }
}

//example
val s = "Hello, World!"
s?(_.reverse)?(_.reverse)   //returns "Hello, World!"
val sNull: String = null