I'm not entirely sure if I have complained about this yet, so here we go. Back in 2009 the blog system here at DreamInCode did not have a way to upload images (or if there was, it eluded me at the time). I then uploaded images I had made for a few of the first data structure blog posts to Photobucket. These images had been up since 2009ish....

Software is hard. When writing a Java program, you're already so far up the Jenga tower that is a modern computing system that when a lower brick causes you to question your sanity, it's something else.

It is possible for the file metadata to be updated before the file payload is updated accordingly. Let that sink in.

Consider a...

It is possible for the file metadata to be updated before the file payload is updated accordingly. Let that sink in.

Consider a...

Part I

Part II

It turns out I was incorrect at the end of part II. There is in fact a polynomial time algorithm for this problem:

Courtesy of ishkabible and this question.

The algorithm is as follows:

Part II

It turns out I was incorrect at the end of part II. There is in fact a polynomial time algorithm for this problem:

Courtesy of ishkabible and this question.

The algorithm is as follows:

...

Continuing from the previous post, we now look at optimizing the algorithm for determining max euclidean distance from the origin:

ishkabible...

ishkabible...

Another interesting problem that eventually got locked.

You are on a 2D graph starting at the origin (0,0). Given n vector movements (x,y), what is the max euclidean distance...

You are on a 2D graph starting at the origin (0,0). Given n vector movements (x,y), what is the max euclidean distance...

This thread (help vampiracy aside) had a very interesting problem:

Given N intervals [a,b] and a number k, find the maximum common range of any k intervals.

This sounds like a computer science problem!

Some solutions to this problem space involve Interval Trees...

Given N intervals [a,b] and a number k, find the maximum common range of any k intervals.

This sounds like a computer science problem!

Some solutions to this problem space involve Interval Trees...

I originally came up with this idea over four years ago and after writing the shortest path algorithm, it fell off my radar, I got bored, so on and so forth. I got a wild hair this afternoon and I now present a tech demo of this concept. I have taken a modern map of Europe and overlaid the cities as found in the Ticket To Ride Europe...

This post is for my sanity and posterity if anyone else runs across this issue in the future and does not have the good fortune to come across a mailing list archive from last February.

Apache Nifi...

Apache Nifi...

Two years, one month, and 1 week since the last one of these. This time I don’t have an excuse, I really need to do these more often.

Many moons ago, I wrote about suffix arrays...

**Tries**Many moons ago, I wrote about suffix arrays...

### ← April 2019 →

S | M | T | W | T | F | S |
---|---|---|---|---|---|---|

1 | 2 | 3 | 4 | 5 | 6 | |

7 | 8 | 9 | 10 | 11 | 12 | 13 |

14 | 15 | 16 | 17 |
18
| 19 | 20 |

21 | 22 | 23 | 24 | 25 | 26 | 27 |

28 | 29 | 30 |

### Tags

### My Blog Links

### Recent Entries

### Recent Comments

### Search My Blog

### 0 user(s) viewing

**0**Guests

**0**member(s)

**0**anonymous member(s)