fabri1983

/**
 * Encoding a string into a long.
 * <br/>
 * Squeeze a String inside a long type, although we need to accept some limitations.
 * <br/>
 * The long type has 64 bits, so using a base 64 encoding (6 bits) we can store up to 10 characters inside.
 * <br/>
 * We assume that the target String has a maximum length of 10 characters and they are composed only 
 * of uppercase letters, numbers and a limited number of special characters.
 */

fabri1983

/**
 * Given the next set of week of days as strings in the given order: <code>Mon, Tue, Wed, Thu, Fri, Sat, Sun</code> <br/>
 * and given a positive integer <code>K</code> in the range <code>[0..500]</code>. <br/>
 * Find the week of day for a given day plus K days.<br/>
 * For example:<br/>
 * <code>Wed + 5 = Mon</code>
 * <code>Sun + 0 = Sun</code>
 * <code>Tue + 28 = Tue</code>
 * <br/><br/>
 * Max time for resolution: 15 minutes.

fabri1983

/**
 * Write a function that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A. <br/>
 * For example, given <code>A = [1, 3, 6, 4, 1, 2]</code>, the function should return 5. <br/>
 * Given <code>A = [1, 2, 3]</code>, the function should return 4. <br/>
 * Given <code>A = [-1, -3]</code>, the function should return 1. <br/>
 * <br/>
 * Write an efficient algorithm for the following assumptions: <br/>
 * N is an integer within the range <code>[1..100,000]</code>. <br/>
 * Each element of array A is an integer within the range <code>[-1,000,000..1,000,000]</code>. <br/>
 * <br/>

fabri1983

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

/**
 * Given a string S containing a sequence of positive integers, 
 * count how many valid IPv4 addresses it contains. <br/>
 * Example: <br/>
 * S="1234" contains: 1.2.3.4 so count=1 <br/>
 * S="5255255255" contains: 5.255.255.255 and 52.55.255.255 so count=2 <br/>

fabri1983

@echo off
setlocal enabledelayedexpansion

:: Usage:
:: This scripts change a docker machine's ip address created using Docker Tool Box.
:: NOTE: you need to run ifconfig on machine instance to know whether interface you want to modify: eth0 or eth1
:: Eg for default machine:
::   First you need to start the default docker machine
::     docker-machine start default
::   Secondly change IP address:

fabri1983

@ECHO OFF

IF "%1"=="" (
  GOTO NO_ARGS
)
IF "%2"=="" (
  GOTO NO_ARGS
)
IF NOT "%3"=="" (
  GOTO WRONG_ARGS

fabri1983

# OpenJDK 12 alpine jdk/jre uses alpine 3.10.
# Visit https://github.com/AdoptOpenJDK/openjdk-docker/tree/master/12

######################################################################################################
FROM adoptopenjdk/openjdk12:alpine AS STAGING-TOMCAT

############# INSTALL NATIVE TOMCAT #############
ENV CATALINA_HOME=/opt/tomcat \
    TOMCAT_MAJOR="8" \
    TOMCAT_VERSION="8.5.43"

fabri1983

# OpenJDK 12 alpine jdk/jre uses alpine 3.10.
# Visit https://github.com/AdoptOpenJDK/openjdk-docker/blob/master/12/jre/alpine/Dockerfile.hotspot.releases.full

######################################################################################################
FROM alpine:3.10 AS STAGING-TOMCAT

LABEL maintainer="fabri1983dockerid"

############# INSTALL NATIVE TOMCAT #############
ENV CATALINA_HOME=/opt/tomcat \

fabri1983

package org.fabri1983.eternity2.forkjoin_solver;

import java.util.concurrent.CountDownLatch;
import java.util.concurrent.ForkJoinPool;
import java.util.concurrent.RecursiveAction;

/**
 * This class intended for testing use of fork-join Actions in Graal native image generation.
 * Building steps:
 * <pre>

fabri1983

package org.fabri1983.maxdifference;

import java.util.Arrays;
import java.util.List;

/**
 * Given an array of integers, compute the maximum difference between any item 
 * and any lower indexed smaller item for all the possible pairs.
 * In other words, for the array arr, find the maximum value arr[j] - arr[i] 
 * for all i,j where 0 <= i < j < n and arr[i] < arr[j].