Skip to content
#

backtracking

Here are 104 public repositories matching this topic...

An array is squareful if the sum of every pair of adjacent elements is a perfect square. Given an integer array nums, return the number of permutations of nums that are squareful. Two permutations perm1 and perm2 are different if there is some index i such that perm1[i] != perm2[i].

  • Updated Nov 1, 2025
  • C

Improve this page

Add a description, image, and links to the backtracking topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the backtracking topic, visit your repo's landing page and select "manage topics."

Learn more