hamming-numbers – Tarik Billa

nᵗʰ ugly number

June 2, 2023 by Tarik

A simple fast solution in Java. Uses approach described by Anon.. Here TreeSet is just a container capable of returning smallest element in it. (No duplicates stored.) int n = 20; SortedSet<Long> next = new TreeSet<Long>(); next.add((long) 1); long cur = 0; for (int i = 0; i < n; ++i) { cur = next.first(); … Read more

Tricky Google interview question

October 26, 2022 by Tarik

Dijkstra derives an eloquent solution in “A Discipline of Programming”. He attributes the problem to Hamming. Here is my implementation of Dijkstra’s solution. int main() { const int n = 20; // Generate the first n numbers std::vector<int> v(n); v[0] = 1; int i2 = 0; // Index for 2 int i5 = 0; // … Read more