You can do an algorithm like this:
Map<Integer, Integer> frequencies = new HashMap<>();
for (int n : array) {
frequencies.put(n, frequencies.getOrDefault(n, 0) + 1); // Java 8
}
if (!frequencies.isEmpty()) {
Integer bestMatch = null;
Integer lastCount = null;
for (Map.Entry<Integer,Integer
Ruby, 260
require'open-uri'
require'zlib'
i=b=0
d=''
until /"has_more":f/=~d
i+=1
d=Zlib::GzipReader.new(open("http://api.stackexchange.com/2.2/questions/featured?site=stackoverflow&page=#{i}&pagesize=100")).read
b+=d.scan(/"bounty_amount":(\d+)/).map{|x|x[0].to_i}.reduce :+
end
p b
Uses the S...
Count Langford pairings
A Langford pairing is a permutation of the numbers 1, 1, 2, 2, ..., n, n such that there is one number between the 1s, two numbers between the 2s, etc. E.g. (with the pairs marked)
+-----------+ +---------------+
| +-----+ | | +---------+ |
| | | | | | ...
This challenge is based on actual collision detection I had to write for a simple game recently.
Write a program or function which, given two objects, returns a truthy or falsy value depending on whether the two objects are in collision (i.e. intersect) or not.
You need to support three types o...
The Retro Rocket
code-golf kolmogorov-complexity
(inspired by this SO question)
You are given as input a single positive integer n.
In as few characters as possible, output a rocket in ASCII art with a head, a tail, and a body composed of n segments. There should be no trailing spaces or new...
Given three number values - being the Red, Green, and Blue elements of a colour (eight bits per channel, 0 to 255) - your program must output the name of the given colour.
For example;
Input: 255, 0, 0
Output: Red
or;
Input: 80, 0, 0
Output: Dark Red
This is a popularity contest, so w...
(This code golf task is related to Code-Golf: Lights Off!. The same puzzle is used, but the task is different.)
Introduction
"Lights Out" is a puzzle in which you should switch off all lights in a 5x5 grid. However, when you swap a light from on to off, or from off to on, the four adjacent li...
