integers-with-multiple-sum-of-two-cubes

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer <code>n</code>.

An integer <code>x</code> is considered good if there exist at least two distinct pairs <code>(a, b)</code> such that:

<ul>
	<li><code>a</code> and <code>b</code> are positive integers.</li>
	<li><code>a &lt;= b</code></li>
	<li><code>x = a3 + b3</code></li>
</ul>

Return an array containing all good integers less than or equal to <code>n</code>, sorted in ascending order.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 4104

Output: [1729,4104]

Explanation:

Among integers less than or equal to 4104, the good integers are:

<ul>
	<li>1729: <code>13 + 123 = 1729</code> and <code>93 + 103 = 1729</code>.</li>
	<li>4104: <code>23 + 163 = 4104</code> and <code>93 + 153 = 4104</code>.</li>
</ul>

Thus, the answer is <code>[1729, 4104]</code>.
</div>

Example 2:

<div class="example-block">
Input: n = 578

Output: []

Explanation:

There are no good integers less than or equal to 578, so the answer is an empty array.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 109</code></li>
</ul>