My attempts to solve IBM's ponder this challenge.
- Found
BigUint
in rust to allow usage of numbers larger than$2^64 - 1$ - Computed first ~10 square-triangular numbers naively, using a "ping-pong" technique between
n
andm
- From these identified numbers, was able to recognize a pattern and compute beyond in a much more efficient manner using DP.