icedog

I'm not saying it's exactly the knapsack problem, but it's quite related. Ordering from largest to smallest does not yield the optimal solution - period.

You must not be familiar with the knapsack problem.

Besides the arrow keys, you can move forwards or backwards by clicking on the left or right edges of a slide.

Fastmail was once owned by Opera but bought itself to be independent again. I reckon they wouldn't be interested in being owned by another corporation, especially Yahoo.

Took me 4.5 minutes, 103 requests, 13.1 MB transferred data.

Going to "Online Store" was also ~4MB more and 25 seconds...

I'll take an extra branch over concatenation and dealing with new line chars any day.

I disagree that it maps most directly to the problem statement. You're performing a common factor computation in your mind, which may be more difficult given numbers other than 3 and 5. In my opinion, pattern matching offers the most direct solution and comes with an abundance of compiler optimizations. Here's an example in Rust...

        for i in range(1i, 101) {  
            match (i % 3, i % 5) {  
                (0, 0) => println!("Fizzbuzz"),  
                (0, _) => println!("Fizz"),  
                (_, 0) => println!("Buzz"),  
                _ => println!("{}", i),  
            }  
        }

I'm an F# developer, but still decided to not use F# to build an android app. Dealing with the UI libraries like support.v4 was just too painful from a functional perspective. If you don't need any object oriented dependencies, then it's smooth sailing.

Ahhh, that explains it. Thanks for the detective work.

Interesting that one of those presenters is named Howard Payne. Along with Payne being an elevator company, Howard Payne is the name of the antagonist in 'Speed', who hacks an elevator...

Your phone version is in the lowest 12%-tile. No offense to you, but as an Android developer, I'm content making my minimum required version Ice Cream Sandwich if it means avoiding any complexities.