Ed Pelosi le-doude

## Dijkstra.java
import java.util.*;

/**
 * Created with IntelliJ IDEA.
 * Author: Edouard
 */
public class Dijkstra {

    public static class Vertex implements Comparable<Vertex> {
        private final String label;

## IntegerKnapsackSolver.java
package arrayexperiment;

import org.apache.commons.lang.ArrayUtils;

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

/**

## Solver.java
package org.rooksolver;

/**
 * Created by le-doude on 14/06/16.
 */
public class Solver {


    static final byte[][] moves = new byte[64][64];

## utility_functions.sql
CREATE OR REPLACE FUNCTION public.json_append(data JSON, insert_data JSON)
  RETURNS JSON
LANGUAGE SQL
AS $$
SELECT
  ('{' || string_agg(to_json(key) || ':' || value, ',') || '}') :: JSON
FROM (
       SELECT
         *
       FROM json_each(data)

## Solution.java
/**
 * Created by edouard on 14/06/18.
 */
class Solution {
    public int solution(int[] A) {
        int maxIndex = A.length - 1;
        int[] leftSum = new int[A.length];
        leftSum[0] = A[0];
        for (int i = 1; i < A.length; i++) {
            leftSum[i] = A[i] + leftSum[i - 1];

## Solution.java
class Solution {
    public int solution(int[] A) {
        int r = 0;
        for (int i = 1; i <= A.length + 1; i++) {
            r = r ^ i;
        }
        for (int i = 0; i < A.length; i++) {
            r = r ^ A[i];
        }
        return r;

## ManacherAlgorithm.java
import java.util.Arrays;

/**
 * Created by le-doude on 14/06/19.
 * <p/>
 * Did you know it is possible to find the longest palindrom in a char sequence in O(N) time.
 * Here is the solution: Manacher's algorithm.
 * http://en.wikipedia.org/wiki/Longest_palindromic_substring
 */
public class ManacherAlgorithm {

## Solution.java
package maxProductOfThree;

import java.util.Arrays;

import static java.lang.Math.*;

public class Solution {

    public int solution(int[] A) {
        if (A != null && A.length > 3) {

## MyClobType.java
import org.apache.commons.lang3.ObjectUtils;
import org.apache.commons.lang3.StringUtils;
import org.hibernate.HibernateException;
import org.hibernate.engine.spi.SessionImplementor;
import org.hibernate.usertype.UserType;

import java.io.Reader;
import java.io.Serializable;
import java.io.StringReader;
import java.sql.PreparedStatement;

## BytesFun.sc
val key = "201507252204"
val sample = """c409c8b91c7910f220ee4981b8df77c4 330dc24548f60c7e00cdcffd971d9ff6 62aab227bf0763900cb3d02a782a1fbb 121a181b6b7a36bb9113c48ed074a8d8 d9bbc89c25018ae1a274b0e660425eb0 fbd42e509a39e767191e6b3b690acaa1 07f8e1f3ae09416e8db60431d1267772 5e571af000d64fd4be6f16e97eab2b7a 3b023dbc640f9e39f0c69a268dcf29b1 ebc6895e8d9ec5e93e57f90efa236d12 e6090053978596e5b632795374df33a7 4f71c3077ceef9e39a3e6088ff2500c8 b73d0d3f17823d88d17e86bbca9b89da 60ff75ac2c022bc916b012bc5065e3c9 b3ca5dba8cbc44facf48999063375750 75d998d66f97f728d6aa8065feefe9dc 6174ae7a779df9ac090c73a7c9ca6581 8c94f5007c74d05ed216531da5b2384e d5d5ca57105b3ff4bceda29131e4ae61 32028e032cdec447fcbf6a9334c07400 483a79c0d62a0dfdca17ae2fd92b9a1a 7189f6aea57ffc4465b401a23bfe090b 5dd473722844c62e98d3087d4007bc20 896aa7dadf5b8c9767b93454feb32096 fbe111d30f80cd323bb9697bd087ea73 39dff0311ea3653d2b3ac900d88e2b81 2864adb1ae7e42de41485a6975c1c9d6 b2a2135b7b0281e302d23a30b1cecc4c 2273a3e7b5c8e95ae389522559b67288 7d5b30a0fc680f2f320401f6f5
	import java.util.*;

	/**
	* Created with IntelliJ IDEA.
	* Author: Edouard
	*/
	public class Dijkstra {

	public static class Vertex implements Comparable<Vertex> {
	private final String label;
	package arrayexperiment;

	import org.apache.commons.lang.ArrayUtils;

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

	/**
	package org.rooksolver;

	/**
	* Created by le-doude on 14/06/16.
	*/
	public class Solver {


	static final byte[][] moves = new byte[64][64];
	CREATE OR REPLACE FUNCTION public.json_append(data JSON, insert_data JSON)
	RETURNS JSON
	LANGUAGE SQL
	AS $$
	SELECT
	('{' \|\| string_agg(to_json(key) \|\| ':' \|\| value, ',') \|\| '}') :: JSON
	FROM (
	SELECT
	*
	FROM json_each(data)
	/**
	* Created by edouard on 14/06/18.
	*/
	class Solution {
	public int solution(int[] A) {
	int maxIndex = A.length - 1;
	int[] leftSum = new int[A.length];
	leftSum[0] = A[0];
	for (int i = 1; i < A.length; i++) {
	leftSum[i] = A[i] + leftSum[i - 1];
	class Solution {
	public int solution(int[] A) {
	int r = 0;
	for (int i = 1; i <= A.length + 1; i++) {
	r = r ^ i;
	}
	for (int i = 0; i < A.length; i++) {
	r = r ^ A[i];
	}
	return r;
	import java.util.Arrays;

	/**
	* Created by le-doude on 14/06/19.
	* <p/>
	* Did you know it is possible to find the longest palindrom in a char sequence in O(N) time.
	* Here is the solution: Manacher's algorithm.
	* http://en.wikipedia.org/wiki/Longest_palindromic_substring
	*/
	public class ManacherAlgorithm {
	package maxProductOfThree;

	import java.util.Arrays;

	import static java.lang.Math.*;

	public class Solution {

	public int solution(int[] A) {
	if (A != null && A.length > 3) {
	import org.apache.commons.lang3.ObjectUtils;
	import org.apache.commons.lang3.StringUtils;
	import org.hibernate.HibernateException;
	import org.hibernate.engine.spi.SessionImplementor;
	import org.hibernate.usertype.UserType;

	import java.io.Reader;
	import java.io.Serializable;
	import java.io.StringReader;
	import java.sql.PreparedStatement;