phyous

phyous

import java.util.ArrayList;
import java.util.List;

public class MinHopsNovel {

    public static List<Integer> minHops(List<Integer> input) {
        List<Integer> ret = new ArrayList<>();

        if (input.size() == 0) return ret;

phyous

package com.phyous.cib;

public class Cain {

    public static void main(String[] args) {
        B b = new B.Builder().
            parent(
                new A.Builder()
                    .m1(1)
                    .m2(2)

phyous

<?xml version="1.0" encoding="utf-8"?>

<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
    android:orientation="vertical"
    android:layout_width="match_parent"
    android:layout_height="match_parent"
    android:background="@color/orange_hn"
    >

    <TextView

phyous

import android.app.Activity;
import android.os.Bundle;
import android.util.Log;
import android.view.Menu;
import android.view.MenuItem;


public class MyActivity extends Activity {

    @Override

phyous

package com.other.rand;

import java.util.ArrayList;
import java.util.List;

/*
    Let's create a trie data structure and run some tests on it
    Documentation:
        - http://en.wikipedia.org/wiki/TrieTest
        - http://www.geeksforgeeks.org/trie-insert-and-search/

phyous

public static boolean oneEditAppart(String a, String b) {
    int edits = 0;
    if (a == null || b == null || Math.abs(a.length() - b.length()) > 1) { // Strings more than 1 in size difference
        return false;
    } else if (a.length() == b.length()) { // Strings same size, check for 0 or >1 replacements
        for (int i = 0; i < a.length(); i++) {
            if (a.charAt(i) != b.charAt(i)) {
                if (++edits > 1) return false;
            }
        }

phyous

/**
 * Trapping Water
 *
 * A one-dimensional container is specified by an array of
 * n nonnegative integers, specifying the eight of each
 * unit-width rectangle. Design an algorithm for computing
 * the capacity of the container.
 *
 * Ex: (X = Occupied, ▤ = Water)
 *

phyous

def pascalsTriangle(n)
  return [] if n < 0
  return [1] if n == 0

  ret = Array.new(n, []).map.each_with_index {|a, i| a = Array.new(i+1,1)}

  (1..n-1).each do |y|
    (0..y).each do |x|
      idy1 = y - 1
      idx1 = x - 1

phyous

#!/usr/bin/env ruby
########################
# The world's simplest twitter client
# 1- Get an API key form https://dev.twitter.com with read/write access, enter details below @'ENTER_HERE'
# 2- gem install twitter
# 3- ./post
# 4- Start posting
########################

require "rubygems"