Stuck in an InfiniteloopStuck in an Infiniteloop SyndicationSat, 05 May 2018 15:34:52 +0000admin@dreamincode.net (Dream.In.Code)IP.Blog60<![CDATA[Yes it's Free, But Still...]]>
http://www.dreamincode.net/forums/blog/324/entry-5127-yes-its-free-but-still/
Sat, 05 May 2018 14:58:00 +0000http://www.dreamincode.net/forums/blog/324/entry-5127-yes-its-free-but-still/Apache commons-io and filesystems
http://www.dreamincode.net/forums/blog/324/entry-5126-apache-commons-io-and-filesystems/
It is possible for the file metadata to be updated before the file payload is updated accordingly. Let that sink in.

Consider a...]]>Fri, 20 Apr 2018 01:31:00 +0000http://www.dreamincode.net/forums/blog/324/entry-5126-apache-commons-io-and-filesystems/Max Euclidean Distance Part III: Bearing Angle
http://www.dreamincode.net/forums/blog/324/entry-5110-max-euclidean-distance-part-iii-bearing-angle/
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:

]]>Sun, 07 Jan 2018 21:37:00 +0000http://www.dreamincode.net/forums/blog/324/entry-5110-max-euclidean-distance-part-iii-bearing-angle/Max Euclidean Distance Part II: Subsets
http://www.dreamincode.net/forums/blog/324/entry-5100-max-euclidean-distance-part-ii-subsets/
previous post, we now look at optimizing the algorithm for determining max euclidean distance from the origin:

ishkabible...]]>Thu, 30 Nov 2017 00:59:00 +0000http://www.dreamincode.net/forums/blog/324/entry-5100-max-euclidean-distance-part-ii-subsets/Max Euclidean Distance Part I: Brute Force
http://www.dreamincode.net/forums/blog/324/entry-5098-max-euclidean-distance-part-i-brute-force/
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...]]>Sat, 18 Nov 2017 21:25:00 +0000http://www.dreamincode.net/forums/blog/324/entry-5098-max-euclidean-distance-part-i-brute-force/Maximum Common Range of k Intervals Given N Intervals
http://www.dreamincode.net/forums/blog/324/entry-5097-maximum-common-range-of-k-intervals-given-n-intervals/
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...]]>Fri, 10 Nov 2017 22:39:00 +0000http://www.dreamincode.net/forums/blog/324/entry-5097-maximum-common-range-of-k-intervals-given-n-intervals/Ticket To Ride Helper App: Tech Demo
http://www.dreamincode.net/forums/blog/324/entry-5095-ticket-to-ride-helper-app-tech-demo/
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...]]>Mon, 06 Nov 2017 01:34:00 +0000http://www.dreamincode.net/forums/blog/324/entry-5095-ticket-to-ride-helper-app-tech-demo/Apache Nifi Sensitive Value Encryption
http://www.dreamincode.net/forums/blog/324/entry-5080-apache-nifi-sensitive-value-encryption/

Apache Nifi...]]>Fri, 12 May 2017 22:58:00 +0000http://www.dreamincode.net/forums/blog/324/entry-5080-apache-nifi-sensitive-value-encryption/An In-Depth Look At Radix Trees
http://www.dreamincode.net/forums/blog/324/entry-5074-an-in-depth-look-at-radix-trees/
Radix Trees

Continuing in the same solution space as the Trie, we now look at Radix Trees...]]>Sat, 01 Apr 2017 16:00:00 +0000http://www.dreamincode.net/forums/blog/324/entry-5074-an-in-depth-look-at-radix-trees/An In-Depth Look At Tries
http://www.dreamincode.net/forums/blog/324/entry-5070-an-in-depth-look-at-tries/
these. This time I don’t have an excuse, I really need to do these more often.

Tries

Many moons ago, I wrote about suffix arrays...]]>Sat, 18 Feb 2017 23:16:00 +0000http://www.dreamincode.net/forums/blog/324/entry-5070-an-in-depth-look-at-tries/