Javascript Problem: Find the next perfect square!!

Codewars Problem and solution with approach explained 

 
 

Objective: 

In this challenge, we will solve the “Find the next perfect square!” Codewars puzzle using javascript. 

Problem statement: 

You might know some pretty large perfect squares. But what about the NEXT one? 

Complete the findNextSquare method that finds the next integral perfect square after the one passed as a parameter. Recall that an integral perfect square is an integer n such that sqrt(n) is also an integer. 

If the parameter is itself not a perfect square then -1 should be returned. You may assume the parameter is positive. 

Examples: 

findNextSquare(121) --> returns 144  

findNextSquare(625) --> returns 676  

findNextSquare(114) --> returns -1 since 114 is not a perfect 

Solution Approach: 

Step 1: check if the perfect square root of the given number say “n” is available. 

Step 2: if yes, then simply get the square of the “n+1” number. 

Step 3: if no, return false. 

Keeping these  points in mind, let’s jump to the solution now: 

  

  

Solution  : 

function findNextSquare(sq) { 

  // Return the next square if sq is a perfect square, -1 otherwise 

  if (Number.isInteger(Math.sqrt(sq))) 

    return (Math.sqrt(sq)+1)*(Math.sqrt(sq)+1); 

  else 

    return -1; 

}