hholst80

Largest submatrix problem

A problem found on Linkedin.

Find the submatrix with the largest sum.

Example given:

A =

hholst80

K = 100;
A = zeros(K);
B = zeros(K);
for x = 2:K
  for y = 2:K
    A(x,y) = x + y;
    B(x,y) = x * y;
  end
end

hholst80

import time
import concurrent.futures


def worker(n):
    time.sleep(n)
    return 42


with concurrent.futures.ThreadPoolExecutor() as extor:

hholst80

Python

pip install a github repository

pip install git+https://github.com/hholst80/gym-air

It is also possible to pip install from a private repository using deploy keys, see:

hholst80

#!/bin/bash

# trap "{ echo killing $$ > $HOME/test.log; }" SIGHUP

CID=$(docker run -tid alpine:latest /bin/sh -c "/bin/sleep 3600")
trap "{ docker stop $CID && docker rm $CID; }" SIGHUP
docker attach $CID

hholst80

Notes on Centos 7

Initial setup

1. Install https://fedoraproject.org/wiki/EPEL

sudo yum install epel-release
sudo yum update

hholst80

# Basic dumb abstraction. 

class Base(object):
  def name(self):
    return self._name
  # ....

# MegaBase: an abstraction that we can work with. 
# Classic OO and derived from Base.

hholst80

/* strtab.c */
#include <stdlib.h>
#include <stdio.h>

char *base = "";

#define STRING_ADDRESS(id) (base+id)
#define STRING_ID(address) (signed short)((address)-base)

signed short foo(void)