freeCodeCamp

2.5 KiB

Raw Blame History

title	id	challengeType	isHidden	forumTopicId
Hofstadter Q sequence	59637c4d89f6786115efd814	5	false	302287

Description

The Hofstadter Q sequence is defined as: $Q(1)=Q(2)=1, \\ Q(n)=Q\big(n-Q(n-1)\big)+Q\big(n-Q(n-2)), \quad n>2.$ It is defined like the Fibonacci sequence, but whereas the next term in the Fibonacci sequence is the sum of the previous two terms, in the Q sequence the previous two terms tell you how far to go back in the Q sequence to find the two numbers to sum to make the next term of the sequence.

Instructions

Implement the Hofstadter Q Sequence equation as a function. The function should accept number, n, and return an integer.

Tests

tests:
  - text: <code>hofstadterQ</code> should be a function.
    testString: assert(typeof hofstadterQ === 'function');
  - text: <code>hofstadterQ()</code> should return <code>integer</code>
    testString: assert(Number.isInteger(hofstadterQ(1000)));
  - text: <code>hofstadterQ(1000)</code> should return <code>502</code>
    testString: assert.equal(hofstadterQ(testCase[0]), res[0]);
  - text: <code>hofstadterQ(1500)</code> should return <code>755</code>
    testString: assert.equal(hofstadterQ(testCase[1]), res[1]);
  - text: <code>hofstadterQ(2000)</code> should return <code>1005</code>
    testString: assert.equal(hofstadterQ(testCase[2]), res[2]);
  - text: <code>hofstadterQ(2500)</code> should return <code>1261</code>
    testString: assert.equal(hofstadterQ(testCase[3]), res[3]);

Challenge Seed

function hofstadterQ(n) {
  // Good luck!
  return n;
}

After Test

const testCase = [1000, 1500, 2000, 2500];
const res = [502, 755, 1005, 1261];

Solution

function hofstadterQ (n) {
  const memo = [1, 1, 1];
  const Q = function (i) {
    let result = memo[i];
    if (typeof result !== 'number') {
      result = Q(i - Q(i - 1)) + Q(i - Q(i - 2));
      memo[i] = result;
    }
    return result;
  };
  return Q(n);
}

2.5 KiB Raw Blame History